Lingering over pain au chocolat in a sidewalk café, relaxing after a day of strolling along the Seine and marveling at icons like the Eiffel Tower and the Arc de Triomphe… the perfect Paris experience combines leisure and liveliness with enough time to savor both an exquisite meal and exhibits at the Louvre. Awaken your spirit at Notre Dame, bargain hunt at the Marché aux Puces de Montreuil or for goodies at the Marché Biologique Raspail, then cap it all off with a risqué show at the Moulin Rouge.
View TripI went solo to a wine, cheese, and charcuterie lunch and absolutely loved it. The wines were very nice, and Neil, our sommelier was so knowledgeable and fun. It was a terrific small group of 5, and we were in a great wine library at the back. If I could transport this room to my home, I'd be thrilled. Highly recommended.
View TripThe summer "beach" with sand and children's entertainments was as amazing transformation of the street along the bank of the Seine! What a wonderful idea for sunny, warm days of July. I had never seen pictures of it, nor heard that it was done by the city of Paris for the people.
View TripMy wife and I spent a half-day at the Louvre during a 3-day Paris visit. Of course it's a "must" destination and the collection of art and history is incomparable. My only suggestions and observations to first-time visitors are that Paris was unseasonably warm during our May visit, and the Louvre was at times hot and stuffy. But maybe (maybe!) we're simply spoiled Americans, used to our air conditioning.
View TripWho could ask for a better honeymoon destination than Paris, "The City of Love?" We happen to agree with Audrey Hepburn when she said, "Paris is always a good idea." Its iconic monuments like the Eiffel Tower, museums like the Louvre and landmarks like the Notre Dame Cathedral are certain to dazzle visitors. However, even more spectacular than the sights is Paris' rich culture found in its charming boulevards, cozy cafes and bustling bistros. This grand city boasts an indescribable "je ne sais quoi" that is sure to inspire an incredibly romantic honeymoon.
View Trip


João Vitor Rafael Chrisóstomo
Electrical Engineering student at UFRN
Home
GitHub
Sub-sections:
Digital image processing - Some university assignments
Evaluating mpv's upscaling algorithms - A study of performance and quality
Keyframe encoding comparison - Numerically evaluating different popular video encoders on anime content


Achieve object-in-hand
CRAMAchieve
Goal Context:
(achieve (object-in-hand ?obj))
Children:
n-times 3
WithFailureHandling
Children:
n-times 3
WithFailureHandling
Children:
Achieve perceive-object a
n-times 3
WithFailureHandling
Children:
Achieve perceive-object a
CRAMAchieve
Goal Context:
(achieve (object-in-hand ?obj))
Children:
Achieve perceive-object all
Achieve perceive-object all
CRAMAchieve
Goal Context:
(perceive-object ?obj)
Children:
n-times 3
WithFailureHandling
Children:
Children:
n-times 3
WithFailureHandling
Children:
Achieve object-picked
CRAMAchieve
Goal Context:
(achieve (object-picked ?obj))
Children:
n-times 1
WithFailureHandling
Children:
Achieve perceive-object currently visible
n-times 2
WithFailureHandling
Children:
n-times 10
WithFailureHandling
Children:
Achieve looking-at
CRAMAchieve
Goal Context:
(achieve (looking-at ?obj))
Children:
Achieve object-put
CRAMAchieve
Goal Context:
(achieve (object-put ?obj ?loc))
Children:
n-times 5
WithFailureHandling
Children:
Achieve object-placed-at
CRAMAchieve
Goal Context:
(achieve (object-placed-at ?obj ?loc))
Children:
n-times 3
WithFailureHandling
Children:
n-times 3
WithFailureHandling
Children:
Children:
Perform Action Designator
PerformActionDesignator
Properties:
knowrob:designator = <Performed action designator instance>
Changes Class based on designator content:
- (to grasp) = PickingUpAnObject
- (to lift) = LiftingAnObject
- (to carry) = CarryingAnObject
- (to perceive) = PerceivingObjects
- (to put-down) = PuttingDownAnObject
- (to park) = ParkingArms
- (to navigate) = Navigate
Children:
PerformOnProcessModule
PerformOnProcessModule
Children for (to perceive):
UIMAPerceive
UIMAPerceive
Properties:
- knowrob:requestDesignator = One request object designator
- knowrob:responseDesignator = Multiple response object designators
Achieve perceive-object currently visible
CRAMAchieve
Goal Context:
(achieve (perceive-object ?obj))
Children:


Column one
Column two
Column three
Column one
Column two
Column three
Column one
Column two
Column three


StanwoodAnalytics
open class StanwoodAnalytics
The base class for Analytics
-
Keys for user parameters.
Declaration
Swift
public struct Keys
-
The event types used for tracking.
Declaration
Swift
public enum TrackingEvent : String
-
Init method using the Builder pattern.
Declaration
Swift
public init(builder: Builder)
Parameters
builder
The builder pattern is used here to configure the analytics instance.
-
The Builder for this class.
Declaration
Swift
open static func builder() -> Builder
-
Track data using TrackingParameters struct. It iterates over all the trackers and calls track on each.
The parameters that are tracked depends on how each tracker is configured.
Declaration
Swift
open func track(trackingParameters: TrackingParameters)
Parameters
trackingParameters
TrackingParameters struct
-
Tracking Enabled. This is the value used for the next application start.
Declaration
Swift
open static func trackingEnabled() -> Bool
Return Value
Bool value that is stored in UserDefaults.
-
Set this value to false to stop the tracking, and on the next start it will be fully disabled. It is on by default.
If tracking is off, enabling it will call start in all the trackers.
This functionality is intended to be compatible with the EU directive on GDPR, and allows users to disable tracking in all frameworks.
As tracking is not disabled immediately an alert (localised in English and German) is displayed informing the user of this. To display the alert the framework assumes that the root view controller is either a UIViewController or a UINavigationController. If this is not the case the alert will fail to show. An optional parameter is provided to support injecting a view controller so that the present method can be called on it and display the alert that way.
Declaration
Swift
open func setTracking(enabled: Bool, on viewController: UIViewController? = nil)
Parameters
enabled
Bool. Will display an alert when disabled.
viewController
UIViewController. An optional parameter for a viewController to display the alert controller when disabling tracking.
-
Track custom keys. The implementation depends on the mapping in the custom trackers.
Declaration
Swift
open func track(trackerKeys: TrackerKeys)
Parameters
trackerKeys
TrackerKeys struct
-
Track NSError. Each tracker has a custom implementation for this method.
Declaration
Swift
open func track(error: NSError)
Parameters
error
NSError
-
Track Screen: Helper function to track the screen name along with the class name.
Declaration
Swift
open func trackScreen(name: String, className: String? = nil)
Parameters
name
String
className
String
-
The builder for this class.
See moreDeclaration
Swift
open class Builder


#include <tcp_socket.hpp>
|
| enum | type { CLIENT,
SERVER,
UNKNOWN
} |
| |
tacopie::tcp_socket is the class providing low-level TCP socket features. The tcp_socket provides a simple but convenient abstraction to unix and windows sockets. It also provides a socket type checker to ensure that server-only operations are only processable on server sockets, and client-only operations are only processable on client sockets.
◆ type
possible types of a TCP socket, either a client or a server type is used to prevent the used of client specific operations on a server socket (and vice-versa)
UNKNOWN is used when socket type could not be determined for now
◆ tcp_socket()
| tacopie::tcp_socket::tcp_socket |
( |
fd_t |
fd, |
|
|
const std::string & |
host, |
|
|
std::uint32_t |
port, |
|
|
type |
t |
|
) |
| |
custom ctor build socket from existing file descriptor
- Parameters
-
| fd | fd of the raw socket that will be used to init the tcp_socket object |
| host | host associated to the socket |
| port | port associated to the socket |
| t | type of the socket (client or server) |
◆ accept()
Accept a new incoming connection. The socket must be of type server to process this operation. If the type of the socket is unknown, the socket type will be set to server.
- Returns
- Return the tcp_socket associated to the newly accepted connection.
◆ bind()
| void tacopie::tcp_socket::bind |
( |
const std::string & |
host, |
|
|
std::uint32_t |
port |
|
) |
| |
Binds the socket to the given host and port. The socket must be of type server to process this operation. If the type of the socket is unknown, the socket type will be set to server.
- Parameters
-
| host | Hostname to be bind to |
| port | Port to be bind to |
◆ close()
| void tacopie::tcp_socket::close |
( |
void |
| ) |
|
Close the underlying socket.
◆ connect()
| void tacopie::tcp_socket::connect |
( |
const std::string & |
host, |
|
|
std::uint32_t |
port, |
|
|
std::uint32_t |
timeout_msecs = 0 |
|
) |
| |
Connect the socket to the remote server. The socket must be of type client to process this operation. If the type of the socket is unknown, the socket type will be set to client.
- Parameters
-
| host | Hostname of the target server |
| port | Port of the target server |
| timeout_msecs | maximum time to connect (will block until connect succeed or timeout expire). 0 will block undefinitely. If timeout expires, connection fails |
◆ get_fd()
| fd_t tacopie::tcp_socket::get_fd |
( |
void |
| ) |
const |
direct access to the underlying fd
- Returns
- underlying socket fd
◆ get_host()
| const std::string& tacopie::tcp_socket::get_host |
( |
void |
| ) |
const |
- Returns
- the hostname associated with the underlying socket.
◆ get_port()
| std::uint32_t tacopie::tcp_socket::get_port |
( |
void |
| ) |
const |
- Returns
- the port associated with the underlying socket.
◆ get_type()
| type tacopie::tcp_socket::get_type |
( |
void |
| ) |
const |
- Returns
- the type associated with the underlying socket.
◆ is_ipv6()
| bool tacopie::tcp_socket::is_ipv6 |
( |
void |
| ) |
const |
- Returns
- whether the host is IPV6
◆ listen()
| void tacopie::tcp_socket::listen |
( |
std::size_t |
max_connection_queue | ) |
|
Make the socket listen for incoming connections. Socket must be of type server to process this operation. If the type of the socket is unknown, the socket type will be set to server.
- Parameters
-
| max_connection_queue | Size of the queue for incoming connections to be processed by the server |
◆ operator!=()
| bool tacopie::tcp_socket::operator!= |
( |
const tcp_socket & |
rhs | ) |
const |
comparison operator
- Returns
- true when the underlying sockets are different (different file descriptor or socket type).
◆ operator==()
| bool tacopie::tcp_socket::operator== |
( |
const tcp_socket & |
rhs | ) |
const |
comparison operator
- Returns
- true when the underlying sockets are the same (same file descriptor and socket type).
◆ recv()
| std::vector<char> tacopie::tcp_socket::recv |
( |
std::size_t |
size_to_read | ) |
|
Read data synchronously from the underlying socket. The socket must be of type client to process this operation. If the type of the socket is unknown, the socket type will be set to client.
- Parameters
-
| size_to_read | Number of bytes to read (might read less than requested) |
- Returns
- Returns the read bytes
◆ send()
| std::size_t tacopie::tcp_socket::send |
( |
const std::vector< char > & |
data, |
|
|
std::size_t |
size_to_write |
|
) |
| |
Send data synchronously to the underlying socket. The socket must be of type client to process this operation. If the type of the socket is unknown, the socket type will be set to client.
- Parameters
-
| data | Buffer containing bytes to be written |
| size_to_write | Number of bytes to send |
- Returns
- Returns the number of bytes that were effectively sent.
◆ set_type()
| void tacopie::tcp_socket::set_type |
( |
type |
t | ) |
|
set type, should be used if some operations determining socket type have been done on the behalf of the tcp_socket instance
- Parameters
-
The documentation for this class was generated from the following file:


Steven Gerrard on his retirement: The interview in full
After announcing his retirement from professional football on Thursday morning, Steven Gerrard sat down with Gary Lineker to explain the reasoning behind his decision in an interview with BT Sport. The 36-year-old called time on his playing career almost 18 years to the day he made his senior debut for Liverpool as a substitute against Blackburn Rovers at Anfield.
Steven, may I be the first to congratulate you on a truly marvellous career.  There are a few reasons, really. Obviously you are aware of the time coming towards the end and the body starts talking to you – the pains and the aches get more regular. The way you feel out there on the pitch changes. Over the last couple of years I’ve felt myself slowing down a little bit and I basically can’t deliver what I used to be able to deliver, and that becomes a little bit frustrating as time goes on. And also, you know, I’ve listened to people over the years, important people in the game who I trust and have a lot of respect for, have said to me always go when you have a tiny bit left – never overstay your welcome and play on too long where it becomes embarrassing. I can feel that’s not too far away, so now is the right time. Was there a moment? Not one moment, I think it was more a period. I think in my last three or four months with LA Galaxy, I was getting too many injuries and I didn’t really feel as sharp as I used to. The games were becoming more challenging, especially with the altitude and heat, the humidity and the travel was affecting me, so it was more a period of time rather than one particular moment. In saying that, I’ve had a few moments in the last six months where I’ve thought ‘I didn’t play well today’ or ‘That guy got the better of me’. And I don’t like saying that to myself, so now is the right time. Will you miss it? 100 per cent. I’m the type of person who loves playing football, I love the game. I love training on a daily basis, I love competing and I’ve absolutely loved the journey through the highs and lows over the years – I’ve loved every minute of it, so I’m going to miss it immensely.
Describe your emotions about having to retire because it comes to us all in football, so describe how it feels to you… I think [it feels] very mixed at the moment. I’m a tad sad because I’m not going to be out there on the pitch and I’m not going to be in the dressing room with the boys and all the banter and not going out to compete any more. I’m not going to play in front of those huge crowds and have them incredible moments – the highs that are beautiful as a footballer. So a bit mixed, but at the same time I’m proud and I’m happy. I’ve achieved many, many things that I never thought I would get near. I keep telling myself I’m a young boy from a council estate who had dreams of playing for my hometown club. I keep going back to there and I’m very grateful how it has gone.
You mentioned your highs, great moments – what was the best of those moments for you? Obviously the Champions League in Istanbul in 2005. Getting that fifth Champions League for Liverpool – the trophy that we keep forever. Given the nature of the game as well, it was an extraordinary final… Of course. It was a dream just to be involved in the ride and the journey – and to actually get the cup at the end of it. And the game, probably the best Champions League final ever, was a miracle really. For you personally, you kind of dragged them [the team] back in it, didn’t you? Almost single-handedly… The nice thing for me was that I contributed during the game. Being the captain, there’s a lot of pressure that I had to deliver in that game. Looking back on it now, I was really pleased how it went. But at the same time along the way, there has been some really brutal lows that have took a lot out of me as well. The worst? Obviously the Chelsea game. That’s one that will haunt me for a long time. The complete opposite to the feelings of the Champions League where you are on this incredible high, and then when you go back to the Chelsea game and it being a pivotal moment, it felt like a disaster happened in my life – that’s how bad it was. You’re one of the few players, of course, to have played over 100 games for your country – the highs for England? Every time you put the shirt on representing [your country]. You are asked many times by a lot of children ‘What’s it like to play for England?’ Until you actually put that shirt on for the first time and then do it on a regular basis, it’s difficult to describe. Representing your country and millions and millions of people, that was another dream that I achieved and to do it over 100 times was incredible for me. Looking back over my England career, it’s mixed like most people’s are. You have your 5-1 v Germany result, which you feel really great about, and then you have the [penalty] shootout heartaches when you have missed a penalty, and when under Steve McClaren we didn’t qualify. You have those brutal lows as well, but it’s part and parcel of being a footballer and having that long career – it’s always going to be full of highs and lows.


---
layout: post
title: Candid Frame Plug
tags:
- Podcast
- Site News
status: publish
type: post
published: true
meta:
_edit_lock: "1243737334"
_edit_last: "2"
dsq_thread_id: "370595093"
---
As I have mentioned before I am a podcast-a-holic, most of the once I listen to have nothing to do with photography. I was catching up on my podcasts the other day and one of my favoites asked to do him a favor by trying to spread the word about his little corner of the podcast world. Now that was like three episodes ago but hey better late than never.
 As I mentioned before, the gentleman that runs the show is a fantastic interviewer that really gets a lot out of his guests and his guests are the rockstars and who's who of photography over the last few decades.
Do yourself a favor and check it out. If you are really into photography or even if you are not they are interesting, entertaining, and you will learn a whole lot more than listening to the 7413th person prattle on about shutter speeds, how to make your photos look like cartoons in Photoshop, or HDR.
I promise.
RB
Ps. If you missed my rants about the state of affairs in podcasts last year you can see it here podcast rant.


My favorite Ziobrando quotes
Every once in a while Alberto Brandolini - also known as “Ziobrando” - generates brilliant quotes.
These are some of my personal favorites:
#4 Darth Vader doesn’t apologise in public.
When you are a true leader, you feel comfortable about admitting that you are wrong. When you are an “old-style boss” you are supposed to have all the answers, and can never be wrong.
If you happen to work for people who lead by terror, you might find some comfort in this quote.
#3 Technical debt is not like debt with the bank. It’s debt with the mob.

Whenever people tell you refactoring is optional, give them this quote.
#2 Software is a learning process, working code is a side-effect.
People tend to think they can create a big design/model up front that will cope with all situations and exceptions. Unless you’ve been handling the same model for years, you are usually wrong.
This comes from one of his talks about Domain Driven Design.
“I need one design/framework to rule them all” => unlikely to succeed, especially on the first try.
#1 The B.A.P./Bullshit Assymetry Principle
This is one of his most famous quotes, and I can see why:
The amount of energy necessary to refute bullshit is an order of magnitude bigger than to produce it.
In business, people come up with ideas that are pretty bad, but they turn into a valid concept due to politics or bad judgement. (Somewhat related to #4.)
Proving that the idea is wrong and getting people to understand that usually takes way more effort than introducing it.
Moral of the story: carefully consider ideas before you commit to them.
Want more?
Yes, I am a Ziobrando fanyboy. Read more at his blog or follow him on twitter.


Gateway
BOT
12-Jul-18 12:38 AM
[dscrdeql] <MySoulisNotForSale> oooooo la la oooo lala
[dscrdeql] <x2maano> morning
[dscrdeql] <donaldmathers>
[dscrdeql] <DaylightHours> Good morning
[dscrdeql] <DaylightHours> What new
[dscrdeql] <cellulitis> not much
[dscrdeql] <cellulitis> just chilling at starbucks waiting for my client
[dscrdeql] <jellysmash> Morning there @DaylightHours
[dscrdeql] <jellysmash> have two of these
[dscrdeql] <jellysmash> I'm at work
[dscrdeql] <jellysmash> Boohoo
[dscrdeql] <NWhiskeyTango> But don't freak out the client on a caffeine buzz
[dscrdeql] <jellysmash> Lucky to have work though
[dscrdeql] <cellulitis> soooooooooooorin!!!
[dscrdeql] <sorin90> hey cell
[dscrdeql] <cellulitis> sup
[dscrdeql] <sorin90> nothing much. just killing some time
[dscrdeql] <cellulitis> you gotta goto #tipsy-begin
[dscrdeql] <sorin90> thx cell. I just started
[dscrdeql] <cellulitis> sweet
[dscrdeql] <cellulitis> let's get you to LVL 2
[dscrdeql] <sorin90> seems that it gave me a role as well
[dscrdeql] <cellulitis> ya
[dscrdeql] <sorin90> most of the people in here seem to be sleeping
[dscrdeql] <cellulitis> they go by european royalty
[dscrdeql] <cellulitis> sorry not royalty
[dscrdeql] <cellulitis> newbieness
[dscrdeql] <sorin90> I saw that now.
[dscrdeql] <sorin90> and those that appear to be online online are people that didn't accept tipsy?
[dscrdeql] <cellulitis> i think so
[dscrdeql] <cellulitis> not sure why they joined
[dscrdeql] <sorin90> the project seems to be rather new
[dscrdeql] <cellulitis> it's a nice project
[dscrdeql] <cellulitis> they hope to use crypto to build homes for less forunate
[dscrdeql] <cellulitis> especially families that cannot qualify for mortgage
[dscrdeql] <sorin90> and it seems that you like jiggling
[dscrdeql] <cellulitis>
[dscrdeql] <cellulitis> you see nothing!
[dscrdeql] <sorin90> that's a good cause
[dscrdeql] <sorin90> I see a lot. but I never tell
[dscrdeql] <sorin90>
[dscrdeql] <cellulitis> damn my client is late...WTF
[dscrdeql] <cellulitis> i want to go home and look at cryto
[dscrdeql] <sorin90> didn't he give you a call to tell you that?
[dscrdeql] <cellulitis> she did
[dscrdeql] <cellulitis> literally one minute after
[dscrdeql] <sorin90> ooo it's a she. that explains it
[dscrdeql] <cellulitis> doesn't she know how important crypto is
[dscrdeql] <MySoulisNotForSale> a he she? yuk
[dscrdeql] <sorin90> lol. not a he she. just a she
[dscrdeql] <cellulitis> @MySoulisNotForSale bro you haven't known me long enough...wait till i pull out the ladyboy pics
[dscrdeql] <cellulitis> this ain't nothing
[dscrdeql] <MySoulisNotForSale> yikes
[dscrdeql] <MySoulisNotForSale> just keep your vapenis in your pants
[dscrdeql] <sorin90>
[dscrdeql] <cellulitis> uhoh
[dscrdeql] <cellulitis> don't mention sorin's secret word
[dscrdeql] <cellulitis> don't get him started
[dscrdeql] <sorin90>
[dscrdeql] <sorin90> ain't playing trivia here
[dscrdeql] <cellulitis> ok
[dscrdeql] <cellulitis> phew!
[dscrdeql] <MySoulisNotForSale> vagenis


Question
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [−2,1,−3,4,−1,2,1,−5,4]
,
the contiguous subarray [4,−1,2,1]
has the largest sum = 6
.
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Stats
| Frequency | 3 |
| Difficulty | 3 |
| Adjusted Difficulty | 4 |
| Time to use | -------- |
Ratings/Color = 1(white) 2(lime) 3(yellow) 4/5(red)
Analysis
This problem can be solved using DP or Divide and Conquer.
DP solution is very easy. I will only post the code.
Divide and Conquer approach is difficult. Not only the idea of solution is hard to come up with, the coding part is even more challenging, especially when the input array contains all negative numbers!
Solution
First 2 code posted below are DP solutions.
2nd code is from this article (Algorithm 3). The idea is to divide the list by half, and find the max of this 3 values:
- max subarray to the left of mid-point (exclusive)
- max subarray to the right of mid-point (exclusive)
- max subarray from left of mid-point to the right of mid-point (inclusive)
For 1 and 2 are easy, for 3 is not. It needs to read left until the end, and right until the end (which means basically read n times). The total time complexity is O(nlgn).
3rd code is from this blog. It’s exactly same method, just coding a bit different.
Note there can be negative number! We can not initiate sum to 0. Instead I should do Integer.MIN_VALUE. Meanwhile, the sum should be initiated to 0, and cannot be Integer.MIN_VALUE.
My code
public class Solution {
public int maxSubArray(int[] A) {
if (A == null || A.length == 0) {
return 0;
}
int pre = 0;
int max = Integer.MIN_VALUE;
for (int i = 0; i < A.length; i++) {
max = Math.max(max, pre + A[i]);
pre = Math.max(0, pre + A[i]);
}
return max;
}
}
2nd code
public int maxSubArray(int[] A) {
return recmax(A, 0, A.length - 1);
}
private int recmax(int[] A, int l, int u) {
if (l > u) /* zero elements */
return 0;
if (l == u) /* one element */
return Math.max(Integer.MIN_VALUE, A[l]);
int m = (l + u) / 2;
/* find max crossing to left */
int lmax = Integer.MIN_VALUE;
int sum = 0;
for (int i = m; i >= l; i--) {
sum += A[i];
lmax = Math.max(lmax, sum);
}
int rmax = Integer.MIN_VALUE;
sum = 0;
/* find max crossing to right */
for (int i = m + 1; i <= u; i++) {
sum += A[i];
rmax = Math.max(rmax, sum);
}
return Math.max(Math.max(recmax(A, l, m), recmax(A, m + 1, u)), lmax
+ rmax);
}
3rd code
public int maxSubArray(int[] A) {
return maxArray(A, 0, A.length - 1, Integer.MIN_VALUE);
}
private int maxArray(int A[], int left, int right, int maxV) {
if (left > right) return Integer.MIN_VALUE;
int mid = (left + right) / 2;
int lmax = maxArray(A, left, mid - 1, maxV);
int rmax = maxArray(A, mid + 1, right, maxV);
maxV = Math.max(Math.max(maxV, lmax), rmax);
int sum = 0, mlmax = 0;
for (int i = mid - 1; i >= left; i--) {
sum += A[i];
if (sum > mlmax) mlmax = sum;
}
sum = 0;
int mrmax = 0;
for (int i = mid + 1; i <= right; i++) {
sum += A[i];
if (sum > mrmax) mrmax = sum;
}
maxV = Math.max(maxV, mlmax + mrmax + A[mid]);
return maxV;
}


Developer with a strong passion for mobile. Minimalist who loves elegant and simple apps. Born in Ghent, Belgium. Currently working at In The Pocket.
- Node.js
- PHP
- Laravel
- Swift
- Objective-C
- HTML
- JavaScript
- Backend development
Developer with a strong passion for mobile. Minimalist who loves elegant and simple apps. Born in Ghent, Belgium. Currently working at In The Pocket.


A visualization of the HIV/AIDs Needs Assessment in Hawaii.
A dashboard displaying energy consumption of the University of Hawaii at Manoa campus.
An open source project that assembles people into groups for easy user management.
An open source project that allows for easier web-based teamwork.


{% load static %}
Historically, gold had been used as a form of currency in various parts of the world. In present
times, precious metals like gold are held with central banks of all countries to guarantee re-payment of
foreign debts, and also to control inflation which results in reflecting the financial strength of the country.
Recently, emerging world economies, such as China, Russia, and India have been big buyers of gold,
whereas USA, South Africa, and Australia are among the big seller of gold.
Forecasting rise and fall in the daily gold rates, can help investors to decide when to buy (or sell) the
commodity. But Gold prices are dependent on many factors such as prices of other precious metals, prices
of crude oil, stock exchange performance, Bonds prices, currency exchange rates etc.
We in this project would forecast gold rates using the most comprehensive set of features and would apply machine learning algorithm for forecasting Gold rates.
No topics yet.
{% endif %}


{% extends "base.html" %} {% block title %}COR. ONE{% endblock %} {% block content %} div class="container pt-5 pb-4">
We aim to lend a helping hand to the people with extreme difficulties in the Covid-19 crisis. Hopefully, this One in all webpage will be useful for the needs for people with disabilities.
This include people with extreme difficulty like the helpless, the people with some disorders such as Alzhiemer's, Bipolar etc.
COR. ONE was formed in order to find a solution to solve one issue that were not widely surfaced and discussed : the troubles of some that were unspoken and unknown. They are not able to speak, communicate and express themselves on this unsettling situation, and we will address by being one voice that will speak for them. Let the journey begin.
Read on to know more self-help information and ways to manage.


MICHAEL A film review by Laura & Robin Clifford Copyright 1997 Laura & Robin Clifford
(This review is an excerpt from Reeling, a movie review show hosted by Laura and Robin Clifford, running on Boston Cable TV. Note that the film descriptions vary in completeness due to the fact that they're actually intros for running film clips.)
MICHAEL -------
Nora Ephron, who showed mixed talents in "Mixed Nuts" and "Sleepless in Seattle," takes advantage of the rejuvenated career of John Travolta in "Michael" the story of the earthly visit by the archangel and his 'discovery' by the tabloid press.
Also starring William Hurt, Andie MacDowell and Robert Pastorelli as the reporters for the Weekly World News-like Daily Mirror, "Michael" is a not-so-heavenly story of the journey by the four principals from the Milk Bottle Motel in Stubbs, Iowa, to the glass and glitter of Chicago.
Along the way, Michael performs miracles, both minor and major.
ROBIN:
As you can tell from her filmography, Nora Ephron has proven herself to be a hit-or-miss director. Fortunately, mainly on the strength of Travolta's on-screen charm and humor, "Michael" is a good-natured, rambling little film that has its heart in the right place, even though its point is muddled.
Travolta, who must have jumped at the chance to do a film where he, mainly, gets to smoke buts and grin a lot, brings such a relaxed quality to the screen that you can't help but like him.
Andie MacDowell gives her second best performance, yet - her best being "Unstrung Heroes" - and shows no small talent as a county & western singer.
William Hurt is adequate.
Robert Pastorelli does yeoman's work as a second-banana character, lending some light humor to the light screenplay.
Speaking of screenplay, aside from the not-so-original concept of an angel come to earth, the story is a cliched road/buddy film, with a cute dog who is the focus of some cheap sentimentality.
I'm still not a Nora Ephron fan, but had a pleasant little meandering visit with "Michael" and give it a C+.
LAURA:
Yet another unoriginal piece of product from Nora Ephron and the Hollywood machine, "Michael" still manages to charm due to Travolta's star wattage as an angel who drinks, smokes, has sex, likes a rumble and piles obscene amounts of sugar and salt on everything he eats (which strangely does not seem to include meat - maybe a non-vegetarian angel was just pushing things too far :-).
Of the supporting cast, Robert Pastorelli ("Murphy Brown's" Eldon) is the most appealing as a tabloid journalist who manages to keep his job because his boss (Bob Hoskins) loves Pastorelli's dog Sparky.
William Hurt and Andie MacDowell are both serviceable as the bruised characters gently nudged to try love again by Michael. In fact, MacDowell has one of her most appealing roles in "Michael" (although she shone brightest in "Unstrung Heroes"), and even trots out quite a lovely singing voice.
Jean Stapleton is whimsical as the Iowa motel owner who harbors the angel. Bob Hoskins is gruffly clueless as the editor of the Daily Mirror. And there's a delightful turn by an actress whom I am unable to name from the information given in the press kit as a pie-serving waitress who gives in to Michael's charms. Terri Garr also makes a surprise appearance as a judge whose verdict is swayed by Michael in a most unusual way.
There is some clever dialogue to bolster the stale story line, particularly Michael's witticisms.
However, we get to see yet another dog saved (is this becoming a trend or what?) and I'm afraid Ephron's just another safe Hollywood hitmaker.
B-
Visit "Reeling" at http://www.neponset.com/reeling.
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


Section 2.6 Spell Check
Skills Addressed in this Lesson:
Access the spelling checker from within Keyword or Keymail.
Check a document for misspelled words.
Look up a word to determine how it is spelled.
Check a word to see if it is spelled correctly.
Determine if there are misspelled words in a paragraph or a section.
Check for spelling errors from the cursor to the end of a document.
Subsection 2.6.1 Tasks
Request that the student enter the Homework or other folder and then open or create a journal file.
Your student may go to the end of the document by using a space with dots4 5 6.
Write the date followed by two enters for two new lines.
Make a journal entry. Do not allow your student to make corrections as they occur so that practice with the spelling checker can be gained.
In the document, your student may locate a word that is not spelled correctly. If all words appear to be correct, change and misspell some of the words for your student.
Your student should now place the cursor on a misspelled word. Use dots1 and 6 with space to enter the spelling checker.
Space or use the advance thumb-key to get to the word check option. Press enter.
-
If a word cannot be found or you need to fix a word, use the spell checker to do so. The following options are available when trying to fix a misspelled word:
Use i to ignore all occurrences of the word.
Space with dot5 will fix only the occurrence of the word that your student is currently working with.
The letter a will add the word to the spelling dictionary.
The letter c will help correct the word.
To look up a word, press l.
For suggestions, press s.
Practice checking words at this time until you and your student adjust to using the word check option.
If your student is unsure of the correct spelling of a word or unsure of the correct Braille sign, use the "lookup word" option in the spelling checker. Press dots1 and 6 to enter the spelling checker. Press space to get to the "lookup word" option. Press enter.

If the word that is found is the one your student wants, he or she should press enter to insert it into the document. To move up and down the list of word suggestions, use backspace or space. You may also use the back and advance thumb-keys. Press enter on a word if you choose to insert it into a document. When finished, press e with space to exit the spelling checker.
Practice using the other spelling checker options with your student. Using the BrailleNote is the best way to get to know it, so practice and explore as time allows. Spelling checker options include document check, look up word, word check, paragraph or section check, and check document from the cursor to the end.
Remember; use space with h to get help when you need it.
Subsection 2.6.2 Quiz
Write two or three paragraphs for your student. Misspell many words. Instruct your student to use the spelling checker to fix the paragraph.
Multiple Choice:
-
Which of the following is not an option in the spelling checker?
document check
word check
paragraph or section check
sentence or line check
-
Which dots are used with the space to enter the spelling checker?
dots1 and 4
dots1 and 6
dots3 and 4
dots2 and 6
-
In the spelling checker, what will space with dot5 do?
get suggestions
change the current occurrence of the word
add the word to the dictionary
change all occurrences of the word
-
To get help from anywhere when using the BrailleNote, what should you do?
use backspace with h
use enter with h
use space with dots2 3 5
use space with h
-
What operation will space with a full cell complete?
return to the internet
return to the Main Menu
reset the BrailleNote
both b and c
-
Which thumb-key is the first thumb-key on the left?
previous
back
advance
next
-
Backspace with dots1 and 4 in a keyword document will delete what?
the current sentence
the previous sentence
to the end of a sentence
the next sentence
-
In an e-mail message list, pressing space with dots5 and 6 will complete which action?
move to next field
move to the previous field
move to the next e-mail message
move to the create a file option
-
In menu options, which key will move to the next menu item?
space
advance
enter
both a and b
-
To turn the speech on or off, use which command?
next thumb-key with space
advance thumb-key with space
back thumb-key with space
previous thumb-key with space


File generated from /home/antongml/offline_projects/potato_game/_build/test/lib/potatoserver/ebin/../src/pop_chain.erl by COVER 2018-10-27 at 23:14:36 **************************************************************************** | -module(pop_chain). | | -export([ | new/1, | add_block_in_order/3, | add_transaction/2, | generate_new_block/2, | | find_block_by_id/2, | get_genisys_block/1, | get_head_block/1, | | get_verfier_next_block_time/2, | resolve_fork/3, | | compute_block_hash/1, | compute_transaction_hash/1, | | apply_block_signature/2, | apply_transaction_signature/2 | ]). | | -include_lib("eunit/include/eunit.hrl"). | -include_lib("stdlib/include/assert.hrl"). | | -include("potato_records.hrl"). | | map_key_match_assert(Map, KeyList) -> 202..| K1 = lists:sort(maps:keys(Map)), 202..| K2 = lists:sort(KeyList), 202..| ?assertEqual(K1, K2, {"key mismatch", K1, K2}), 202..| ok. | | transaction_map_structure_assert(T) when is_map(T) -> 5..| map_key_match_assert(T, ?transaction), | 5..| CD = maps:get(consensus_data, T), 5..| map_key_match_assert(CD, ?consensus_transaction_data), | 5..| ok. | | check_block_map_structure(B) when is_map(B) -> 96..| map_key_match_assert(B, ?block), | 96..| CD = maps:get(consensus_data, B), 96..| map_key_match_assert(CD, ?consensus_block_data), | 96..| TL = maps:get(transactions, B), 96..| lists:map(fun transaction_map_structure_assert/1, TL), | 96..| ok. | | %% get entry in block's consensus data 82..| get_block_cd(Entry, Block) -> maps:get(Entry, maps:get(consensus_data, Block)). | | %% @doc Computes hash of the block. | compute_block_hash(Block) when is_map(Block) -> 118..| #{consensus_data := CD} = Block, 118..| CleanBlock = Block#{ | this_id := undefined, | consensus_data := CD#{signature := undefined} | }, 118..| my_crypto:hash( my_serializer:serialize_object(CleanBlock) ). | | %% @doc Computes hash of the transaction. | compute_transaction_hash(Transaction) when is_map(Transaction) -> 5..| CD = maps:get(consensus_data, Transaction), 5..| CleanTransaction = Transaction#{ | consensus_data := CD#{signature := undefined} | }, 5..| my_crypto:hash( my_serializer:serialize_object(CleanTransaction) ). | | %% @doc Inserts signature into the block. | %% | %% Checks that block's this_id is correct and that signature is correct. | | apply_block_signature(Signature, Block) | when is_map(Block) -> 29..| Hash = maps:get(this_id, Block), 29..| PubKey = get_block_cd(verifier_pub_key, Block), | 29..| ?assertEqual(Hash, compute_block_hash(Block)), | 29..| ?assert(true == my_crypto:verify(Hash, Signature, PubKey)), | 29..| CD = maps:get(consensus_data, Block), | 29..| Block#{consensus_data := CD#{signature := Signature}}. | | | %% @doc Inserts signature into the transaction. | %% | %% Checks that the signature is correct. | | apply_transaction_signature(Signature, T) | when is_map(T) -> 2..| Hash = compute_transaction_hash(T), 2..| PubKey = maps:get(player_id, T), | 2..| ?assert(true == my_crypto:verify(Hash, Signature, PubKey)), | 2..| CD = maps:get(consensus_data, T), | 2..| T#{consensus_data := CD#{signature := Signature}}. | | check_transaction_correctness(Transaction, ChainId) when is_map(Transaction) -> 3..| transaction_map_structure_assert(Transaction), | | #{ | consensus_data := CD, | player_id := PlrKey 3..| } = Transaction, | | #{ | signature := PlrSgn, | chain_id := TrChainId 3..| } = CD, | 3..| Hash = compute_transaction_hash(Transaction), | | %% verify signature's correctness 3..| ?assert(my_crypto:verify(Hash, PlrSgn, PlrKey), "transaction signature failed verification"), | | %% compare ChainId 3..| ?assertEqual(TrChainId, ChainId, "bad transaction ChainId"), | 3..| ok. | | %% @doc Adds block to blocktree. | %% | %% The block should new and right after already existing block. | %% Block's structure is checked and error is generated if it is incorrect. | | add_block_in_order(Block, CurrentTime, ProtocolData) | when | is_record(ProtocolData, pop_chain), | is_map(Block) | -> | | %% checks maps for block and transactions inside 63..| check_block_map_structure(Block), | | #pop_chain{ | pop_config_data = #pop_config_data{ | verifiers_arr = VerifiersArr, | time_between_blocks = TimeBetween, | time_desync_margin = TimeDesyncMargin, | chain_id = MainChainId | }, | tree_data = TD0 63..| } = ProtocolData, | | | | #{ | previous_id := PrevId, | this_id := ThisId, | transactions := BlockTransactionsList, | consensus_data := #{ | signature := VerSgn, | verifier_pub_key := VerKey, | verifier_index := VerIndex, | timestamp := Tmp | } 63..| } = Block, | | | %% check that signer is one of the verifiers | #verifier_public_info{ | index = VerIndexChk, | public_key = PubKeyChk 63..| } = array:get(VerIndex, VerifiersArr), | 63..| ?assertEqual(VerIndex, VerIndexChk, "indices don't match"), 63..| ?assertEqual(VerKey, PubKeyChk, "keys don't match"), | | | %% check that the time is correct for this verifier | %% (also check that it is not too far into the future) | %% should be larger, and have the correct remainder | 63..| PreviousBlock = blocktree:get_block_by_id(PrevId, TD0), 61..| PreviousBlockTimestamp = maps:get(timestamp, maps:get(consensus_data, PreviousBlock)), | 61..| ?assert(PreviousBlockTimestamp < Tmp, "time should be larger than previous"), 61..| ?assert(Tmp - TimeDesyncMargin < CurrentTime, "block cannot be in the future"), | 61..| VerNum = array:size(VerifiersArr), 61..| ?assertEqual(Tmp rem (TimeBetween * VerNum), TimeBetween * VerIndex, "bad time for that verifier"), | | %% check ThisId hash correctness 60..| Hash = ThisId, 60..| ?assertEqual(Hash, compute_block_hash(Block), "incorrect hash"), | | %% check signature's correctness 60..| ?assert(my_crypto:verify(Hash, VerSgn, VerKey), "signature failed verification"), | | %% (OPTIONAL) check sequence of different verifiers | | %% Verify transactions 60..| lists:map(fun(T) -> check_transaction_correctness(T, MainChainId) end, BlockTransactionsList), | | %% add this block to tree_data | %% this can trigger errors if the block if poorly formed | %% also fails if block is orphan or already exists 60..| TD1 = blocktree:add_block_in_order(Block, TD0), | | %% current last block keeps track of the last block in the chain | %% update it, if new block is the last one | | 57..| CurrentHeadBlock = ProtocolData#pop_chain.head_block, 57..| HeadBlock = resolve_fork(Block, CurrentHeadBlock, TD1), | | %% ?debugVal(CurrentHeadBlock), | %% ?debugVal(Block), | %% ?debugVal(HeadBlock), | 57..| NewProtocolData = ProtocolData#pop_chain{tree_data = TD1, head_block = HeadBlock}, | 57..| NewProtocolData. | | %% @doc Initialize protocol data. | %% | %% Creates a tree with genesis block with a fixed timestamp. | %% Genesis block's id is <b>genesis</b>, it is the only block with non SHA hash id. | new(PopConfigData) | when is_record(PopConfigData, pop_config_data) -> | 4..| CurrentTime = PopConfigData#pop_config_data.init_time, | 4..| ?assert(CurrentTime >= 0), | 4..| TD0 = blocktree:new(), 4..| B0 = blocktree:generate_new_block(undefined, TD0), 4..| B1 = B0#{ | this_id := genesis, | consensus_data := #{ | timestamp => CurrentTime, | signature => undefined, | verifier_pub_key => undefined, | verifier_index => undefined | } | }, 4..| check_block_map_structure(B1), 4..| TD1 = blocktree:add_block_in_order(B1, TD0), | 4..| PC = #pop_chain{ | pop_config_data = PopConfigData, | tree_data = TD1, | head_block = B1, | genisys_block = B1 | }, 4..| PC. | | %% @doc Resolves a fork between two branches. | %% | %% Block with larger height wins. | %% If heights are the same, then branches are traced to the first branching point, | %% and then block at branching point with earlier timestamp wins. | %% If those timestamps are equal, block with smaller hash wins. | | resolve_fork(B1, B2, TreeData) | when | is_map(B1), | is_map(B2), | is_record(TreeData, tree_data) -> | 60..| H1 = maps:get(height, B1), 60..| H2 = maps:get(height, B2), | 60..| if | H1 > H2 -> 43..| B1; | | H2 > H1 -> 8..| B2; | | H2 == H1 -> 9..| Branch = resolve_fork_select_branch(B1, B2, TreeData), 9..| if | Branch == first -> 4..| B1; | Branch == second -> 5..| B2 | end | end. | | resolve_fork_select_branch(B1, B2, TreeData) -> 18..| Id1 = maps:get(previous_id, B1), 18..| Id2 = maps:get(previous_id, B2), | 18..| if | Id1 == Id2 -> 9..| resolve_fork_same_parent(B1, B2); | Id1 /= Id2 -> 9..| BB1 = blocktree:get_block_by_id(Id1, TreeData), 9..| BB2 = blocktree:get_block_by_id(Id2, TreeData), 9..| resolve_fork_select_branch(BB1, BB2, TreeData) | end. | | resolve_fork_same_parent(B1, B2) -> 9..| T1 = get_block_cd(timestamp, B1), 9..| T2 = get_block_cd(timestamp, B2), | 9..| if | T1 < T2 -> 3..| first; | T2 < T1 -> 4..| second; | T1 == T2 -> 2..| Id1 = maps:get(this_id, B1), 2..| Id2 = maps:get(this_id, B2), 2..| if | Id1 < Id2 -> 1..| first; | Id2 < Id1 -> 1..| second | end | | end. | | %% @doc Get the next appropriate time for a verifier to make a block. | | get_verfier_next_block_time(VerifierIndex, PC) | when is_record(PC, pop_chain) -> | | #pop_chain{ | pop_config_data = #pop_config_data{ | verifiers_arr = VerifierArr, | time_between_blocks = TimeBetweenBlocks | }, | head_block = HeadBlock 35..| } = PC, | 35..| VerNum = array:size(VerifierArr), | 35..| LastTime = get_block_cd(timestamp, HeadBlock), 35..| LastZeroTime = LastTime - (LastTime rem (VerNum * TimeBetweenBlocks)), 35..| NextTime = LastZeroTime + VerifierIndex * TimeBetweenBlocks, | 35..| if | NextTime =< LastTime -> 14..| NextTime + VerNum * TimeBetweenBlocks; | NextTime > LastTime -> 21..| NextTime | end. | | %% @doc Creates next block in the chain for a given verifier. | %% | %% Created block is unsigned. | %% (Pending transactions are put into the block by blocktree.) | | generate_new_block(VerifierIndex, PC) | when is_record(PC, pop_chain) -> | 29..| Time = get_verfier_next_block_time(VerifierIndex, PC), | 29..| TD = PC#pop_chain.tree_data, | 29..| VerData = array:get(VerifierIndex, PC#pop_chain.pop_config_data#pop_config_data.verifiers_arr), 29..| VerPub = VerData#verifier_public_info.public_key, | 29..| LastId = maps:get(this_id, PC#pop_chain.head_block), | 29..| B0 = blocktree:generate_new_block(LastId, TD), | 29..| B1 = B0#{ | consensus_data := #{ | timestamp => Time, | signature => undefined, | verifier_pub_key => VerPub, | verifier_index => VerifierIndex | } | }, | 29..| Hash = compute_block_hash(B1), | 29..| B2 = B1#{this_id := Hash}, | 29..| check_block_map_structure(B2), | 29..| B2. | | %% @doc Finds block by id. | %% | %% Only looks among non-orphan blocks. | %% Returns {ok, Block} or error. | | find_block_by_id(Id, PC) | when is_record(PC, pop_chain) -> 99..| maps:find(Id, PC#pop_chain.tree_data#tree_data.block_map). | | %% @doc Gets first block. 1..| get_genisys_block(PC) -> PC#pop_chain.genisys_block. | | %% @doc Gets last block. 5..| get_head_block(PC) -> PC#pop_chain.head_block. | | %% @doc Adds transaction to the structure. | %% | %% Checks transaction correctness first. | %% Returns {Status, Container} where Status is | %% ignored_duplicate, updated_old, added_new | add_transaction(T, PC) | when is_record(PC, pop_chain), | is_map(T) -> | 1..| check_transaction_correctness(T, PC#pop_chain.pop_config_data#pop_config_data.chain_id), | 1..| TD = PC#pop_chain.tree_data, 1..| {Status, TD1} = blocktree:add_new_transaction(T, TD), | 1..| {Status, PC#pop_chain{tree_data = TD1} }.


Owner : 🧛🏻♂ - Mr. Sup3rN0va | 08-April-2021
Tags : #i0S (📲), #android (📱), #pentesting (👨🏼💻), #tools (⚒), #cheatsheet (📜)
Ubuntu Server
as there is no GUI and then we can do SSH
to do pentestingUbuntu Server
, you will have option to install openssh-server
at the time of OS installationSSH
directly after installing Ubuntu
and then, we can copy-paste the commands 🤩🥳👍Windows
Windows Terminal
Windows Terminal
to achieve it's full potential but these are only required if you are using Windows
scp
to transfer data
Linux
Alacritty
or Konsole
or Gnome
Konsole
on KDE and Gnome
on GNOMEX11
and SCP
, so on that part we are coveredTerminus
aboveVM
like oh-my-zsh
and tmux
Now on freshly installed VM (Ubuntu, I presume), we need to customize the shell
Before that will install some necessary kits
Create a file called ".zsh_profile" and add these enteries to it
# =================================================================
# Aliases
# =================================================================
alias ll='ls -alh --color=always'
alias cls='tput clear reset'
# =================================================================
# Custom Functions
# =================================================================
apt-update()
{
sudo apt clean -y;
sudo apt autoclean -y;
sudo apt remove -y;
sudo apt autoremove -y;
sudo apt update;
sudo apt upgrade -y;
sudo apt dist-upgrade -y;
sudo apt install build-essential linux-headers-`uname -r` -y
}
Once this is being created run : source ~/.zsh_profile
Now update your installation by typing : apt-update
Now let's install some important packages
sudo apt install -y net-tools iputils-ping wget curl python3-pip python3-venv screenfetch zsh tmux git gdebi openssh-server openjdk-14-jdk openjdk-14-jre aapt zipalign unzip bat
Recently I had some issues installing openjdk
packages on Ubuntu Server
, not sure why but there were several mismatch hashes.
To get through, I had to install java from linuxuprising
. Use this only if you are not able to install openjdk-14-jdk
and openjdk-14-jre
from above command
To install Java on Ubuntu Server
sudo add-apt-repository ppa:linuxuprising/java
apt-update # This will only work if you have set above .zsh_profile
sudo apt install oracle-java15-installer
java --version # Once Java is installed
This will install all the required pre-requisite packages
If you are using Ubuntu Server
, then this step is not needed because SSH
is by-default enabled, but just in case if you are setting this up on any other VM Guest then, just enable SSH
on VM by typing : sudo systemctl start ssh
and you need to enable it at boot so : sudo systemctl enable ssh
You can check SSH
status as : sudo systemctl status ssh
oh-my-zsh 😍🥰
Installation is pretty simple
$ sh -c "$(curl -fsSL https://raw.github.com/ohmyzsh/ohmyzsh/master/tools/install.sh)"
OR
sh -c "$(wget -O- https://raw.githubusercontent.com/ohmyzsh/ohmyzsh/master/tools/install.sh)"
ZSH_THEME_RANDOM_CANDIDATES=( "xiong-chiamiov" "mortalscumbag" "dst" "trapd00r" "funky" "clean" "fino-time" "bureau" "dpoggi" "mikeh" "geoffgarside" "crcandy" "simonoff" "rkj-repos" "agnoster" "darkblood" "frisk" "nicoulaj" "duellj" "rkj" )
~/.zshrc
and search for ZSH_THEME_RANDOM_CANDIDATES
and replace that line with above line. Also, ZSH_THEME
is set to robbyrussell
by default, change that to random
and you will have a new shell everytime you hit the .zshrc
fileREFERENCE : "Oh-My-ZSH"
zsh-autosuggestions 😍🥰
Installation is simple. Once you have 'oh-my-zsh' installed, do
git clone https://github.com/zsh-users/zsh-autosuggestions ${ZSH_CUSTOM:-~/.oh-my-zsh/custom}/plugins/zsh-autosuggestions
Open ~/.zshrc
file and find plugins and add as plugins=(zsh-autosuggestions)
If you have any other plugins installed like I had git
, then the final will look like : plugins=(git zsh-autosuggestions)
REFERENCE : "zsh-autosuggestions"
zsh-syntax-highlightning 😍🥰
Installation is simple. Once you have 'oh-my-zsh' installed, do
git clone https://github.com/zsh-users/zsh-syntax-highlighting.git ${ZSH_CUSTOM:-~/.oh-my-zsh/custom}/plugins/zsh-syntax-highlighting
Open ~/.zshrc
file and find plugins and add as plugins=(zsh-syntax-highlighting)
If you have any other plugins installed like I had git
, then the final will look like : plugins=(git zsh-autosuggestions zsh-syntax-highlighting)
REFERENCE : "zsh-syntax-highlightings"
Installing Rust based programs for awesome output
Steps:
# Installing program alternate to ls
# Download EXA from : https://github.com/ogham/exa/releases
unzip exa-linux-x86_64-0.8.0.zip
mkdir ~/.local/bin
mv exa-linux-x86_64 ~/.local/bin/exa
sudo ln -s ~/.local/bin/exa /usr/bin/exa
# Installing program alternate to cat
# Docs : https://github.com/sharkdp/bat
sudo apt install bat -y
# Installing program alternate to ps
# Docs : https://github.com/dalance/procs
sudo snap install procs
TMUX
is a terminal multiplexer which enhances your productivity by splitting up the terminal pane and even provide tabs from a single SSH
session so that you don't have to create or do SSH
if you wanted to test on one window and get the output on other
As from above pre-requisite installation tmux
is already installed and you can run it directly by typing tmux
on terminal but we need to customize it to look good, so let's theme it 😻😻
First create a new folder as : ~/.tmux
cd ~/.tmux
and download tmux themes and plugins
"Nord Theme"
git clone https://github.com/arcticicestudio/nord-tmux.git
"TMUX-Power Theme"
git clone https://github.com/wfxr/tmux-power.git
"Tmux-Net-Speed"
It's a plugin for "TMUX-Power Theme" which shows the upload and download speed
git clone https://github.com/tmux-plugins/tmux-net-speed.git
All these should be in ~/.tmux
folder
Create a new file called tmux.conf
and add these
-> % cat .tmux/tmux.conf
# ============================================================================
# Prefix = <Cntrl+c>
#
# Command Mode : Prefix + :
# ------ Rename Current Window : :rename-window __name__
# OR
# ------ Rename : Prefix + ,
#
# Copy Mode : Prefix + [
# ------ Quit : q and rest all commands are like vim
# ------ Start Selection : Spacebar
# ------ Clear Selection : Esc
# ------ Copy Selection : Enter
# ------ Paste Selection : Prefix + ]
# ------ Search Forward and Backward : / and ?
# ------ Next Occurance Forward/Backward : n/N
#
# Panes :
# ------ Split Screen : Horizontal : (Prefix h) and Vertical : (Prefix v)
# ------ Move between Split Panes : Prefix Up, Down, Left, Right
# ------ Swap Split Panes : Prefix Shift+{, Shift+}
# ------ Zoom : Prefix + z
# ------ Resize Split Panes : Prefix + Cntrl(Hold) + Arrow_Keys
#
# Windows :
# ------ Create New Window : Prefix n
# ------ Move between windows : Shift+Left,Right
# ------ Swap Windows : Control+Left,Right
#
# ============================================================================
# TMUX - Configurations
# ============================================================================
# ============================================================================
# Change prefix
# ============================================================================
unbind C-b
set-option -g prefix C-c
bind-key C-c send-prefix
# ============================================================================
# Don't allow tmux to rename windows
# ============================================================================
set-option -g allow-rename on
# ============================================================================
# Use 256 colors
# ============================================================================
set-option -g default-terminal "screen-256color"
set-option -ga terminal-overrides ",xterm-256color:Tc"
# ============================================================================
# Use vi keys for copy mode
# ============================================================================
set-option -g mode-keys vi
# ============================================================================
# Enable status bar
# ============================================================================
set-option -g status on
# ============================================================================
# Window configuration
# ============================================================================
# Create New Window
bind-key n new-window
# Switch between Windows
bind -n S-Left previous-window
bind -n S-Right next-window
bind -n C-Left { swap-window -t -1; previous-window }
bind -n C-Right { swap-window -t +1; next-window }
# ============================================================================
# Panes configuration
# ============================================================================
# Splitting to Panes
bind-key v split-window -h
bind-key h split-window -v
# Activating Panes
bind-key Left select-pane -L
bind-key Right select-pane -R
bind-key Up select-pane -U
bind-key Down select-pane -D
# ============================================================================
# Mouse Mode (Optional)
# ============================================================================
setw -g mouse off
# ============================================================================
# Keybinding for reloading tmux config file
# ============================================================================
bind r source-file ~/.tmux/tmux.conf \; display " Config File Reloaded!"
# ============================================================================
# TMUX Themes
# ============================================================================
# Settings for TMUX-POWER Theme
set -g @tmux_power_theme 'sky'
set -g @tmux_power_date_icon '📆'
set -g @tmux_power_time_icon '🕘'
set -g @tmux_power_user_icon '😈'
set -g @tmux_power_session_icon '🥇'
set -g @tmux_power_upload_speed_icon '🚀'
set -g @tmux_power_download_speed_icon '📥'
set -g @tmux_power_left_arrow_icon '<'
set -g @tmux_power_right_arrow_icon '>'
set -g @tmux_power_show_upload_speed true
set -g @tmux_power_show_download_speed true
run-shell "$HOME/.tmux/tmux-power/tmux-power.tmux"
run-shell "$HOME/.tmux/tmux-net-speed/net-speed.tmux"
# Settings for Nord Theme
#run-shell "$HOME/.tmux/nord-tmux/nord.tmux"
I have added "help" at the top of the config file
I have 2 themes already added in the config file : "Tmux-Power" and "Nord Theme"
Depending on what you are using, comment the other one, like currently I am using "Tmux-Power" theme as per the config
Also, the images are emoji which you can change as per your wish. Make sure that your terminal supports emoji - "Terminus Does" 🥳🥳🥳👍
Update the file : .zsh_profile
previously created as
-> % cat .zsh_profile
# =================================================================
# Startup Commands
# =================================================================
screenfetch
export DISPLAY="x.x.x.x:0.0"
export PATH="$PATH:$HOME/.local/bin"
# =================================================================
# Aliases
# =================================================================
alias ls='exa --color=always --color-scale -l'
alias ll='exa --color=always --color-scale -al'
alias cls='tput clear reset'
alias tmux='tmux -f $HOME/.tmux/tmux.conf'
alias cat='batcat'
alias pslist='procs'
# =================================================================
# Custom Functions
# =================================================================
apt-update()
{
sudo apt clean -y;
sudo apt autoclean -y;
sudo apt remove -y;
sudo apt autoremove -y;
sudo apt update;
sudo apt upgrade -y;
sudo apt dist-upgrade -y;
sudo apt install build-essential linux-headers-`uname -r` -y
}
Replace the value of x.x.x.x
from your IP Address, either Ethernet
or WiFi
Then final step is to source this in .zshrc
as : echo 'source ~/.zsh_profile' >> .zshrc
This will setup everything. Logout and login back and see the effects 😍🥰
Type : tmux
and check whether you have the theme enabled
Final Output
|| Pre-Requisites || Mobile Pentesting Tools Installation || SiAAA - AutoInstall Scripts ||


Creating a library geode is a simple step beyond creating a normal application. Libraries can have their own process threads or not; most libraries do not, though some will. To create a library geode, you have to do four things:
Defining a Library-the sound.gp File shows an example of the three changes you must make to the geode's parameters file to make it a library.
Code Display 7-1 Defining a Library--the sound.gp File
# The Sound Library has the following three lines in its geode parameters file # (sound.gp) different from how they might appear in an application.
# # The permanent name of the geode might normally be sound.app if it is an # application. A library typically has "lib" as its name extension. # name sound.lib
# # Declare the type of the geode to be a library. Applications typically have a # "process" aspect; many libraries do not. Libraries must also be declared to # have a "library" aspect. (Note that the Sound Library is exceptional in that # it has both a driver aspect and a library aspect.) # type driver, library, single
# # Export the geode's entry point routine so the kernel may call it when the # library is loaded. This routine must be defined somewhere in the geode's code. # Note that it is exported with the "entry" line rather than the standard # "export" line; this is to distinguish the exported routine as the entry # point rather than a typical routine. # entry SoundEntry


regexp@work
I love regular expressions!
This post is part 4 in a 4 part series. Read the other posts:
Part 1 - Try regexp | Part 2 - O(r) | Part 3 - regexp.js | Part 4
So I've started my first job at Ziploop, I'm doing full-stack JavaScript, primarily on the backend and much to my delight, I will be and have been working on topics that are heavily involved with Regular Expressions, so this series will continue.
I've written a bunch of RegExp gems I wanted to share here, at this point somewhat uncategorized, simply that they've come about because of this new job. Enjoy!
Parse Email
This first function looks through a full email address, i.e.
'"Christopher Salam"<EMAIL_ADDRESS>-> to ->
<EMAIL_ADDRESS>Here it is in it's full glory:
function parseEmail(emailFull) {
if (!/</.test(emailFull)) { return emailFull; }
var name = emailFull.match(/<(\w+(?=\+|@))/)[1];
var domainName = emailFull.match(/@(\w+)./)[1];
var tld = emailFull.match(/\.(\w+)>/)[1];
var email = name + '@' + domainName + '.' + tld;
return email;
}
There's a lot of information, so let's 'parse' through it. Here's a link to regexr.
The major topics to discuss prior to seeing this thing work is understanding capture groups, i.e. /(stuff)/, lookarounds (to remove "+relics"), and truly understanding what qualifies for \w+, which is the special grouping for word-like-characters in RegExp. It does include numbers, which is somewhat misleading from the 'w', and it specifically excludes spaces, @, +, "", '', slashes, dashes, and other letters that may trip us up.
The first most natural guess is to use a regexp that equates to<EMAIL_ADDRESS>and of course, this looks good, right? Then we throw in the capture group, because the capture group will help us remove the <> around the email.
Here is how capture groups work, shown from the console. The capture group gives us back an array like object that shows us the whole object that was matched in the 0th index, and in the 1st index we have the captured match within a match: i.e.
In production, I've found numerous aliases and other information can obscure the email address. Additionally, emails will still be received if you add additional information in the email (we send emails like<EMAIL_ADDRESS>which will still travel to gmail emails, but will lead to an independent account in our app, which let's us make new profiles and test things and receive the test emails in once place.
This however fails went accounting for information sent in the name with plus signs or other terms prior to the @. A picture is worth a thousand words:
From this example, we see we need a capture group that is more detailed, and just capture the word "chris" and not "chris+relics".
We are going to need something extra special here to just get chris. Here comes a lookaround. Using the <stuff(?=unwantedstuff) template, we start with a "<", and goes until it sees a "+" or a "@".
Domains names and top level domains are simpler to match, here are ways to grab both of those.
So this breaks out regular expressions into several terms, to get chris, chrissalam, and com as three different terms, captures them, then adds them together.
Hyphenated domains names are another frustrating thing, but this works:
There are other concerns not addressed in this function: Periods in the name of the email (i.e<EMAIL_ADDRESS>and<EMAIL_ADDRESS>go to the same inbox).
Ultimately, you don't want "Chris Salam"<EMAIL_ADDRESS>and "Christopher Salam"<EMAIL_ADDRESS>to make separate accounts, so this function below uses regex to grab what I really want from this string: -><EMAIL_ADDRESS>CID images
CID images
CID images are images tags with embedded url info where base 64 information sits waiting to be parsed back into images and they are found in emails. Part of the work we are doing at Ziploop involves reading through emails using the Gmail API, and one tool has us grab the images with a CID attribute. This particular match was particularly gnarly. Here it is:
/<img[^>]*src\s*=\s*"cid[^"]*"[^>]*>/
"" Let's skip that part.
[^>]* is a crazy beautiful regexp term that means zero or more of characters that are not '>'. Make sense, right? We are interested in anything else! src is the beginning of an area of interest, helping use find a source attribute within an img tag. /s is whitespace, and /s* means zero or more whitespaces, these are optional. After hitting an equal sign, and eventually, a "cid" tag, we are finding what we need. The information inside the cid tag is huge, it can be many many characters. We can capture this information with parantheses for conversion if we wanted, it would be very similar.
/<img[^>]*src\s*=\s*"cid([^"]*)"[^>]*>/
Here's what it looks like in action. Very cool!
Regular Expressions are like a mini-puzzle within the greater puzzle, it's a great opportunity to learn something new and think again about patterns. We could also argue that software engineering is basically pattern recognition, recognizing something that people need that is repetitive and building a system around capturing that pattern. Hope this was helpful!


Today we welcome Paul Greenwood to the team! Paul has joined Bristow Drone Services as
a trainee drone pilot who is looking to improve his flying skills. Paul is from an IT
background so will also be assisting with video editing and website design.
We have added a Contact page to the website where you will see our postal address, contact phone number,
email address as well as a form where you can post a message directly. We will do our best to reply to
you as quickly as possible.
Exciting times as today marks the launch of the
Bristow Drone Services website! Over the next few weeks and months the team will be
improving and adding content to the site!


Defining Component
Component is a container image encapsulated any DevOps task, and the ContainerOps platform is resposible for it's all lifecycle.
Sharing, acquisition and collaboration at Opshub.
Drawing Orchestration
ContainerOps has a WYSIWYG orchestration editor and a flexible, efficient and visual event data stream mechanism.
Any complex DevOps work can be easily completed in minutes.
Running With Container For Cloud Native
Running the DevOps orchestration and component with container orchestration engine like Kubernetes.
Designed for massive Cloud Native development and operation scenarios.
Integrated With CI/CD Service
Orchestration the DevOps tasks with container components and the third services like Jenkins, Travis CI and so on.
Providing open APIs to integrated with customize CI/CD pipeline, compatible with existing solutions.
Getting Start In 5 Minutes!


ABOUT
TECHNICAL GUIDANCE
CONTRIBUTE DATA
GUATEMALA, APRIL 2021; HHI
SUMMARY
REPORT
TABLE
DOWNLOAD
TOTAL RESPONSES
AGGREGATED RESPONSES
REGION 1
REGION 2
REGION 3
REGION 4
REGION 5
REGION 6
REGION 7


Athletics: Jepkosgei, Kamworor seal Kenyan double at New York marathon
NEW YORK: Geoffrey Kamworor and Joyciline Jepkosgei sealed a double victory for Kenya at the New York Marathon on Sunday (Nov 3), storming to convincing wins in the men's and women's races at the annual showpiece.
Kamworor, the 2017 New York champion, pulled clear in the closing stages to take the tape in Central Park 2hr 8min 13sec.
Jepkosgei, making her debut over the distance, had earlier beaten compatriot and defending champion Mary Keitany with a time of 2:22:38, the second fastest time in New York history.
Keitany, who had been chasing a remarkable fifth New York title, finished in second place after a thrilling battle with the less experienced Jepkosgei.
The two women had been part of a three-pronged breakaway that led from around the 12-mile mark alongside Ethiopia's Ruti Aga.
That trio remained out in front as they advanced into Manhattan at mile 16, although Keitany gave the first clue she was struggling after appearing to vomit.
Keitany and Jepkosgei started edging away from Aga by mile 20 and soon the Ethiopian had been dropped from contention.
Jepkosgei then made her move in mile 23, rapidly putting daylight between herself and Keitany and opening up a 16-second lead heading down the stretch.
Heading into the final mile Jepkosgei grimaced as she dug in for victory, glancing over her shoulder to check the presence of Keitany.
Keitany looked comfortable but by that stage had left herself too much work to do and Jepkosgei closed out a superb win, just missing out on Margaret Okayo's 2003 course record of 2hr 22min 31sec.
"I knew Mary had more experience in marathon, so I was trying to push," a delighted Jepkosgei said after the win.
The men's race had followed a similar pattern, with Kamworor judging his moment to perfection to pull away from Albert Korir over the closing stages and take first in 2:08:13.
Kamworor, Korir and Ethiopia's Tamirat Tola had broken away from the field at the 21-mile mark.
Tola, who had looked comfortable throughout, quickly fell away however, leaving Kamworor and Korir to battle it out.
Kamworor's finishing speed was too much for Korir however and when the 26-year-old made his move at around the 24-mile mark, Korir was unable to respond.
Korir eventually finished second in 2:08:36 ahead of Ethiopia's Girma Bekele Gebre, who took third place in 2:08:38.
"I was feeling okay, very comfortable and I was ready for everything," Kamworor said afterwards.
"The last few miles the race was so fast. But I was able to go and was feeling strong and that's when I decided to go away," he added.
But there was disappointment for Ethiopia's defending champion Lelisa Desisa, who was making an improbable attempt to win back-to-back titles just 29 days after winning marathon gold at the World Championships in Doha last month.
Desisa hit the front early on but looked to be clearly struggling, eventually withdrawing after seven miles.


]]>
The wrapper of your entire layout
#layout
The ID and local reference of your sidenav
sidenavTitle?: string
The title of your sidenav
logo?: string
The path to your sidenav logo
]]>
The menu items wrapper
]]>
Loops over the routes from your Class
]]>
The SVG or font icon
]]>
Builds the top toolbar and content area
toolbarTitle?: string
The title of your toolbar
logo?: string
The path to your toolbar logo
]]>
Builds the card and content area
cardTitle?: string
The card title
cardSubtitle?: string
The card subtitle
cardWidth?: number
The card width percentage (default 70)
]]>
Loads html for each route (view)
]]>
Optional footer


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object ScreenManager
public class ScreenManager
This class holds all the Screens to be displayed in the game and also switches to/from them when necessary. When creating a new screen it sets it's ScreenController to the same as this one, so to change anything in ScreenManager just call the methods in the ScreenController and it should work.
| Field Summary | |
|---|---|
static java.awt.Point |
mouse
position of mouse on the screen |
| Constructor Summary | |
|---|---|
ScreenManager(FileOpener opener)
creates a new ScreenManager with a ScreenController with a FileOpener as specified |
| Method Summary | |
|---|---|
boolean |
didThink()
corrects syncronization with drawing and thinking |
void |
draw(java.awt.Graphics g)
draws the menu Screen and game GameScreen |
void |
key(java.awt.event.KeyEvent event,
boolean pressed)
called when a key is pressed |
void |
keyPressed(java.awt.event.KeyEvent event)
|
void |
keyReleased(java.awt.event.KeyEvent event)
|
void |
keyTyped(java.awt.event.KeyEvent event)
|
void |
levelEditor(int marioColor)
starts level editor mode (new file) |
void |
levelEditor(int marioColor,
java.io.File f)
starts level editor mode (open file) |
void |
mouse(java.awt.event.MouseEvent event,
boolean pressed)
called when a mouse button is pressed |
void |
mouseClicked(java.awt.event.MouseEvent event)
|
void |
mouseDragged(java.awt.event.MouseEvent event)
|
void |
mouseEntered(java.awt.event.MouseEvent event)
|
void |
mouseExited(java.awt.event.MouseEvent event)
|
void |
mouseMoved(java.awt.event.MouseEvent event)
|
void |
mousePressed(java.awt.event.MouseEvent event)
|
void |
mouseReleased(java.awt.event.MouseEvent event)
|
void |
pause(boolean pause)
pauses/unpauses the game, if one is in session |
void |
renew()
refreshes everything to where it's like you just opened the program |
boolean |
saveGame(java.io.File f)
saves the level, if any to file |
void |
singlePlayer(int marioColor,
java.io.File f)
starts single player mode |
void |
think()
called every frame, updates think in the GameScreen and menu Screen. |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public static java.awt.Point mouse
| Constructor Detail |
|---|
public ScreenManager(FileOpener opener)
opener
- the FileOpener that will be put inside the created ScreenController| Method Detail |
|---|
public void renew()
public boolean didThink()
public void draw(java.awt.Graphics g)
g
- the Graphics to be drawn topublic void levelEditor(int marioColor)
marioColor
- the color the Hero should bepublic void levelEditor(int marioColor, java.io.File f)
marioColor
- the color the Hero should bef
- the file to be opened which contains the level datapublic boolean saveGame(java.io.File f)
f
- the file to be written to
public void singlePlayer(int marioColor, java.io.File f)
marioColor
- the color the Hero should bef
- the file to be opened and readpublic void think()
public void pause(boolean pause)
pause
- if true, the game pauses. if false, it unpausespublic void key(java.awt.event.KeyEvent event, boolean pressed)
event
- the KeyEvent from keyPressed/keyReleasedpressed
- is true if the key was pressed down, is false if notpublic void mouse(java.awt.event.MouseEvent event, boolean pressed)
event
- the MouseEvent from mousePressed/mouseReleasedpressed
- is true if the mouse was pressed down, is false if notpublic void keyPressed(java.awt.event.KeyEvent event)
keyPressed
in interface java.awt.event.KeyListener
public void keyReleased(java.awt.event.KeyEvent event)
keyReleased
in interface java.awt.event.KeyListener
public void keyTyped(java.awt.event.KeyEvent event)
keyTyped
in interface java.awt.event.KeyListener
public void mouseClicked(java.awt.event.MouseEvent event)
mouseClicked
in interface java.awt.event.MouseListener
public void mousePressed(java.awt.event.MouseEvent event)
mousePressed
in interface java.awt.event.MouseListener
public void mouseReleased(java.awt.event.MouseEvent event)
mouseReleased
in interface java.awt.event.MouseListener
public void mouseExited(java.awt.event.MouseEvent event)
mouseExited
in interface java.awt.event.MouseListener
public void mouseEntered(java.awt.event.MouseEvent event)
mouseEntered
in interface java.awt.event.MouseListener
public void mouseMoved(java.awt.event.MouseEvent event)
mouseMoved
in interface java.awt.event.MouseMotionListener
public void mouseDragged(java.awt.event.MouseEvent event)
mouseDragged
in interface java.awt.event.MouseMotionListener
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Congratulations! Your sample website is working!!
You have successfully deployed this sample website using AWS CodeDeploy and CodePipeline :)
You can read the AWS CodePipeline and AWS CodeDeploy Documentation to learn more.


---
layout: post
authors: ["Anelda van der Walt"]
title: "October 27 - November 10, 2015: Maneesha Sane, Retreat Activities, Instructor Training,
Code Review Revisited, and a WiSE Workshop."
date: 2015-11-10
time: "11:30:00"
tags: ["Community"]
---
Highlights
-
Meet Maneesha Sane,
the Software Carpentry (and now Data Carpentry) course coordinator.
-
Our instructor/helper/community retreat
is planned for 14 November with participating sites around the world.
Line-ups include roundtable discussions, open house sessions, Worldwide Library Hour, and more.
Join us virtually or live for the whole day or only the sessions of interest.
Conversations
-
Do you have any experience with code review?
David Pèrez-Suárez described his experience over ten years and asks some interesting questions.
Events
Details
-
Ben Marwick wrote a thought provoking piece on
How
computers broke science – and what we can do to fix it.
-
Another great post about
the impact of Software Carpentry was written by Sean Barberie.
He is currently enrolled for instructor training, already attended a Data Carpentry hackathon,
and has ideas about organising his first workshop.
-
Instructor debriefing
round 19 provides a great solution to live stream the terminal to a webpage and introduces the concept
of a buddy system that was rated highly by participants.
-
Useful tips from
instructor debriefing
round 20 includes suggestions for improving attendance when running workshops in new areas. The topic of
text editors is still on the table.
-
How can instructors help participants
follow along during a lesson given the diverse skill levels of any given class?
Peter Steinbach and Cam Macdonell summarised a rich discussion by Software Carpentry instructors.
Advertisement, pre-course surveys, buddy pairing, and multiple choice questions are a few of the
aids discussed in this post.
-
Daniel Chen followed up on the post by Peter and Cam by pitching the experience at his
most recent workshop as a case study. He provides suggestions for
working with a group with very
diverse skill levels.
Both posts are must-reads before your next Software Carpentry workshop.
-
A question for data visualisation experts: How can we
visualise repository activity?
-
Software Carpentry was mentioned in an article by Jon Ison et al -
Tools and Data
Services Registry: a Community Effort to Document Bioinformatics Resources
published in Nucleic Acid Research this week.
-
A book review is now out for the Software Carpentry inspired
Effective Computation in Physics
by Anthony Scopatz and Katy Huff.
-
The R Foundation have instituted
a code of conduct requirement policy
for all conferences supported by them.
-
The first African Data Carpentry workshop was held in Kenya in September.
Matt Collins reflected on their experiences with logistics
while Deb Paul described the
workshop and outcomes
in her post.
-
The National Socio-Environmental Synthesis Center (SESYNC) is advertising a full-time position for a
Data Science Instructor
who can teach according to the Software/Data Carpentry style. Applications close 1 December.
-
15 workshops were run over the past two weeks.
For full details on previous workshops please visit
our website.
-
Several workshops have been confirmed for the next few months.
Upcoming workshops can be viewed on our website.
Newly added workshops are indicated with "*".
-
November:
University College London*,
Northwestern University,
NYU Medical Center,
CoDiMa - University of Manchester,
Iowa State University,
Colegio Universitario Hotel Escuela de Los Andes Venezolanos*,
European Institute for Theoretical Neuroscience,
University of Miami,
University of Toronto*,
University of California San Francisco - R,
University of California San Francisco - Python,
Climate Change Research Centre, UNSW Australia,
University of Helsinki,
University of Edinburgh,
NeSI - Lincoln Region Workshop
| Project | Issues | Pull Requests |
| Opened | Closed | Comments | Opened | Closed | Comments |
| shell-novice | | | | | | |
| git-novice | | | | 1 | | |
| hg-novice | | | | | | |
| sql-novice-survey | | | | | | |
| python-novice-inflammation | 1 | 1 | 3 | | | |
| r-novice-inflammation | | | | | | |
| matlab-novice-inflammation | | | | | | |
| slideshows | | | | | | |
| instructor-training | | | | | | |
| amy | 3 | 4 | 12 | 1 | 7 | |
| site | 1 | | 27 | 12 | 15 | 13 |


Gray & White - Skewed Slider with Scrolling
Start of your story
Please scroll down or press the down arrow on your keyboard
Please scroll down or press the down arrow on your keyboard
Please continue scrolling
Feel free to follow me on Twitter and check of my other works


Day 2 in Philadelphia, and a visit to Reading Terminal Market was in order. To the uninitiated, Reading Terminal Market is best described as a farmer’s market with an awesome hotchpotch of options. True to its style, and enclosed in a just-right closed space within Center City Philadelphia — 12th and Arch to be precise — Reading Terminal offers a wide variety of foods, from baked goods to flowers, meats & seafood to produce and a number of eateries.
Due to my intense desire to fill as many attractions as I could in my short stay, we hit RTM (sorry, I can’t be expected to type out the entire name each time, and copy-paste stops my smooth flow of typing, but I digress) rather early in the morning, but the place was quite bustling for 8.30 a.m. on a weekday. Since it’s right of Philly’s Market East station, it’s got a perfect location for a quick breakfast, a drop by for lunch during a busy day, or a stopover for supplies to take home at the end of the day. They also offer student discounts on Sundays & Tuesdays, so if you are one, or know one, that’d be the day to go.
The market is a delight to the retina, and ??I’ve tried to capture as many of the colors as I could.
We stocked up on some basic supplies comprising organic vegetables, and attempted a place called the Basic Vegetarian Snack Bar for a quick bite. Our reason for picking them — they had every conceivable dish you could think of, from the chili burger to the traditional Philadelphia Cheesestake — but made with organic vegetarian ingredients. The best description on their menu was for the Soy Chicken Salad (paraphrased) — if we didn’t tell you it was soy, you would never know. We have a confession to make — they were 100% right. It was so good, we took a pound of it back home for a later snack. I’ll drop another confession: along with the garlic and olive bread we picked up, this quantity did not last beyond lunchtime.


By phone: +01 080 8625 2384
By email
Home
Accommodations
See our activities
See what else we have to offer
Find out how to get here


chdir/1
chdir/1 – changes the current directory to the specified directory
FORMS
chdir(DirName)
DESCRIPTION
DirName can be a symbol, a UIA, or a list of ASCII characters describing a valid
directory. The current directory is changed to the specified directory. If the
current directory cannot be changed to the given directory for any reason, this
predicate fails.
EXAMPLES
?- chdir(’../foobar’).
yes.


WITNESS LIST
Transportation
December 18, 2012 9:00 AM
Natural Gas Fueling Infrastructure Interim Charge
FOR:
Haass, Chip Market Development (Chesapeake Energy Corp.), San Antonio, TX
ON:
Doggett, Trip President and CEO (ERCOT), Austin, TX
Esparza, John President (TMTA), Austin, TX
Keene, Russ President (Plug In Texas), Austin, TX
Noll, Reagan Regional Manager (Clean Energy Fuels), Dallas, TX
Walton, Joe Manager (TCEQ), Austin, TX
Registering, but not testifying:
ON:
Hagle, Steve Deputy Director (TCEQ), Austin, TX
Oversize and Overweight Vehicles Interim Charge
ON:
Allison, Jim General Counsel (County Judges and Commissioners Association of Texas),
Austin, TX
Barton, John Deputy Executive Director/Chief Engineer (Texas Department of
Transportation), Austin, TX
Esparza, John President (TMTA), Austin, TX
Harrison, Robert Economist (University of Texas at Austin), Austin, TX
Price, Linda Safety Director (Texas Forestry Association and Texas Logging Council),
Linden, TX
Registering, but not testifying:
ON:
Murphy, Michael R. Research Engineer (University of Texas - Center for Transportation
Research), Austin, TX
Panama Canal Interim Charge
ON:
Kearns, Dennis General Counsel (Texas Railroad Association), Austin, TX
Riley, Robin Chairman (Houston Ship Channel Security District), Houston, TX
Turnbull, Katherine Executive Associate Director (Texas A&M Transportation Institute),
College Station, TX
Waterworth, Leonard Executive Director (Port of Houston Authority), Houston, TX
Wilson, Phil Executive Director (Texas Department of Transportation), Austin, TX
Proposition 12 Funding Interim Charge
ON:
Bass, James CFO (TxDOT), Austin, TX
Sunset Advisory Commission Recommendations Interim Charge
ON:
Wilson, Phil Executive Director (Texas Department of Transportation), Austin, TX
Toll Collection and Enforcement Interim Charge
FOR:
Barr, Kenneth Chairman (North Texas Tollway Authority), Fort Worth, TX
WITNESS LIST
Transportation
December 18, 2012 9:00 AM
ON:
Cassidy, Brian Partner, Locke Lord LLP (Regional Mobility Authorities), Austin, TX
Harris, James Partner (Linebarger, Goggan, Blair & Simpson / Harris County Toll Road
Authority), Houston, TX
Hernandez, James Attorney (Harris County Toll Road Authority), Houston, TX
Wilson, Phil Executive Director (Texas Department of Transportation), Austin, TX
Woodall, Doug Director, Toll Operation (TxDOT - Toll Operations Division), Austin, TX
Registering, but not testifying:
ON:
Carrigan, Gerald Executive Director (NTTA), Plan, TX


--- layout: page title: "SPNEGO-based Kerberos and NTLM HTTP Authentication in Microsoft Windows" description: "This document describes how the Microsoft Internet Explorer (MSIE) and Internet Information Services (IIS) incorporated in Microsoft Windows 2000 use Kerberos for security enhancements of web transactions. The Hypertext Transport Protocol (HTTP) auth-scheme of \"negotiate\" is defined here; when the negotiation results in the selection of Kerberos, the security services of authentication and, optionally, impersonation (the IIS server assumes the windows identity of the principal that has been authenticated) are performed. This document explains how HTTP authentication utilizes the Simple and Protected GSS-API Negotiation mechanism. Details of Simple And Protected Negotiate (SPNEGO) implementation are not provided in this document." ---
| Document Name: | RFC 4559 |
|---|---|
| Document URI: |
urn:ietf:rfc:4559
|
| Online Version: |
https://datatracker.ietf.org/doc/html/rfc4559
|
| Organization: | Internet Engineering Task Force (IETF) |
| Series: | Request for Comments (RFC) |
| Abstract: | This document describes how the Microsoft Internet Explorer (MSIE) and Internet Information Services (IIS) incorporated in Microsoft Windows 2000 use Kerberos for security enhancements of web transactions. The Hypertext Transport Protocol (HTTP) auth-scheme of "negotiate" is defined here; when the negotiation results in the selection of Kerberos, the security services of authentication and, optionally, impersonation (the IIS server assumes the windows identity of the principal that has been authenticated) are performed. This document explains how HTTP authentication utilizes the Simple and Protected GSS-API Negotiation mechanism. Details of Simple And Protected Negotiate (SPNEGO) implementation are not provided in this document. |
Negotiate
Return to ( Series | Organization | all Specifications )


{% extends 'registry/base.html' %} {% block title %}Download the Registry{% endblock %} {% block head %} {% endblock %} {% block content %}
CSV downloading is temporarily unavailable. Sorry for the inconvenience.
The XML file is not as easy for people to read, but some programmers prefer data in this format.
The JSON file is difficult for people to read, but it is a popular format among computer programmers. This is a good option if you want to import the data into your own system and have worked with JSON before.


MalariaVis
Play
Map Display
Mortality Rate
Incidence Rate
Country Filters
Mortality Rate (per 100,000 population)
Incidence Rate (per 1,000 at risk)
Percentage of Country Deaths (%)
Clear Filters
Submit Filters
Action Controls
Undo
Redo
Export Controls
Export Map
Export Graph
Export CSV
Mortality:
Incidence:
Percentage:
%
Year:


ARMv6-M Assembler Words
zeptoforth includes an ARMv6-M assembler, which can be used on all platforms, whether ARMv6-M or ARMv7-M. It supports all ARMv6-M instructions except for BL, as it is expected that the user will drop out of the assembler to call Forth words, which will be compiled to BL. It does not make use of labels as many assemblers do, but rather uses “marks”, which are double-cells on the data stack, for forward and backward references.
armv6m
The following words are in the armv6m
module:
code[
( – )
Begin a block of assembled code, making the assembler wordlist available within and forcing any deferred literal to be compiled in place.
]code
( – )
End a block of assembled code, removing the assembler wordlist from the wordlist order.
x-out-of-range-3reg
( – )
Out of range 3-bit register exception.
x-out-of-range-4reg
( – )
Out of range 4-bit register exception.
x-out-of-range-imm
( – )
Out of range immediate exception.
x-unaligned-imm
( – )
Unaligned immediate exception.
x-out-of-range-pc-rel
( – )
Out of range PC-relative address exception.
x-incorrect-mark-type
( – )
Incorrect marker type exception.
x-invalid-cond
( – )
Invalid condition exception.
x-out-of-range-special
( – )
Out of range special register exception.
Assembler words
The following words are accessible between code[
and ]code
:
Registers
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r10
r11
r12
r13
r14
r15
tos
dp
sp
lr
pc
Condition codes
eq
ne
cs
hs
cc
lo
mi
pl
vs
vc
hi
ls
ge
lt
gt
le
al
adcs_,_
( rm rdn – )
Assemble an ADCS instruction.
adds_,_,#_
( imm3 rn rd – )
Assemble a two-register ADDS immediate instruction.
adds_,#_
( imm8 rdn – )
Assemble a one-register ADDS immediate instruction.
adds_,_,_
( rm rn rd – )
Assemble a three-register ADDS register instruction.
add4_,4_
( rm4 rdn4 – )
Assemble a two-4-bit register ADDS register instruction.
add_,sp,#_
( imm8 rd – )
Assemble an ADD (SP plus immediate) instruction.
addsp,sp,#_
( imm7 – )
Assemble an ADD (SP plus immediate to SP) instruction.
add4_,sp
( rdm4 – )
Assemble an ADD (SP plus register) instruction.
addsp,sp,4_
( rm4 – )
Assemble an ADD (SP plus register to SP) instruction.
adr_
( rd – mark-addr mark )
Mark an ADR instruction.
ands_,_
( rm rdn – )
Assemble an ANDS (register) instruction.
asrs_,_,#_
( imm5 rm rd – )
Assemble an ASRS (immediate) instruction.
asrs_,_
( rm rdn – )
Assemble an ASRS (register) instruction.
b<
( mark-addr mark – )
Assemble an unconditional branch to a marker.
bc<
( mark-addr mark cond – )
Assemble a conditional branch to a marker.
b>
( – mark-addr mark )
Mark an unconditional branch.
bc>
( cond – mark-addr mark )
Mark a conditional branch.
bics_,_
( rm rdn – )
Assemble an BICS (register) instruction.
bkpt#_
( imm8 – )
Assemble a BKPT instruction.
blx_
( rm – )
Assemble a BLX (register) instruction.
bx_
( rm – )
Assemble a BX instruction.
cmn_,_
( rm rn – )
Assemble an CMN (register) instruction.
cmp_,#_
( imm8 rn – )
Assemble a CMP (immediate) instruction.
cmp_,_
( rm rn – )
Assemble an CMP (register) instruction.
cmp4_,4_
( rm4 rdn4 – )
Assemble an CMP (register) instruction.
cpsie
( – )
Assemble a CPSIE instruction.
cpsid
( – )
Assemble a CPSID instruction.
dmb
( – )
Assemble a DMB instruction.
dsb
( – )
Assemble a DSB instruction.
eors_,_
( rm rdn – )
Assemble an EORS (register) instruction.
isb
( – )
Assemble an ISB instruction.
ldm
( rx … r0 count rn – )
Assemble an LDM instruction.
ldr_,[_,#_]
( imm5 rn rt – )
Assemble an LDR (immediate) instruction.
ldr_,[sp,#_]
( imm8 rt – )
Assemble an LDR (immediate) instruction.
ldr_,[pc]
( rd – mark-addr mark )
Mark an LDR (literal) instruction.
ldr_,[_,_]
( rm rn rt – )
Assemble an LDR (register) instruction.
ldrb_,[_,#_]
( imm5 rn rt – )
Assemble an LDRB (immediate) instruction.
ldrb_,[_,_]
( rm rn rt – )
Assemble an LDRB (register) instruction.
ldrh_,[_,#_]
( imm5 rn rt – )
Assemble an LDRH (immediate) instruction.
ldrh_,[_,_]
( rm rn rt – )
Assemble an LDRH (register) instruction.
ldrsb_,[_,_]
( rm rn rt – )
Assemble an LDRSB (register) instruction.
ldrsh_,[_,_]
( rm rn rt – )
Assemble an LDRSH (register) instruction.
lsls_,_,#_
( imm5 rm rd – )
Assemble an LSLS (immediate) instruction.
lsls_,_
( rm rdn – )
Assemble an LSLS (register) instruction.
lsrs_,_,#_
( imm5 rm rd – )
Assemble an LSRS (immediate) instruction.
lsrs_,_
( rm rdn – )
Assemble an LSRS (register) instruction.
movs_,#_
( imm8 rdn – )
Assemble a MOVS (immediate) instruction.
mov4_,4_
( rm4 rdn4 – )
Assemble a MOV (register) instruction.
movs_,_
( rm rd – )
Assemble a MOVS (register) instruction.
mrs_,_
( sysm rd – )
Assemble an MRS instruction.
msr_,_
( rn sysm – )
Assemble an MSR (register) instruction.
muls_,_
( rn rdm – )
Assemble an MULS (register) instruction.
mvns_,_
( rm rd – )
Assemble an MVNS (register) instruction.
nop
( – )
Assemble a NOP instruction.
orrs_,_
( rm rdn – )
Assemble an ORRS (register) instruction.
pop
( rx … r0 count – )
Assemble a POP instruction.
push
( rx … r0 count – )
Assemble a PUSH instruction.
rev_,_
( rm rd – )
Assemble an REV (register) instruction.
rev16_,_
( rm rd – )
Assemble an REV16 (register) instruction.
revsh_,_
( rm rd – )
Assemble an REVSH (register) instruction.
rors_,_
( rm rdn – )
Assemble an RORS (register) instruction.
rsbs_,_,#0
( rn rd – )
Assemble an RSBS (immediate) instruction.
sbcs_,_
( rm rdn – )
Assemble an SBC (register) instruction.
sev
( – )
Assemble an SEV instruction.
stm
( rx … r0 count rn – )
Assemble an STM instruction.
str_,[_,#_]
( imm5 rn rt – )
Assemble an STR (immediate) instruction.
str_,[sp,#_]
( imm8 rt – )
Assemble an STR (immediate) instruction.
str_,[_,_]
( rm rn rt – )
Assemble an STR (register) instruction.
strb_,[_,#_]
( imm5 rn rt – )
Assemble an STRB (immediate) instruction.
strb_,[_,_]
( rm rn rt – )
Assemble an STRB (register) instruction.
strh_,[_,#_]
( imm5 rn rt – )
Assemble an STRH (immediate) instruction.
strh_,[_,_]
( rm rn rt – )
Assemble an STRH (register) instruction.
subs_,_,#_
( imm3 rn rd – )
Assemble a two-register SUBS immediate instruction.
subs_,#_
( imm8 rdn – )
Assemble a one-register SUBS immediate instruction.
subs_,_,_
( rm rn rd – )
Assemble a three-register SUBS register instruction.
subsp,sp,#_
( imm7 – )
Assemble an SUB (SP plus immediate to SP) instruction.
svc#_
( imm8 – )
Assemble an SVC instruction.
sxtb_,_
( rm rd – )
Assemble an SXTB instruction.
sxth_,_
( rm rd – )
Assemble an SXTH instruction.
tst_,_
( rm rn – )
Assemble an tST (register) instruction.
udf#_
( imm8 – )
Assemble a UDF instruction.
udf.w#_
( imm16 – )
Assemble a 32-bit UDF instruction.
uxtb_,_
( rm rd – )
Assemble an UXTB instruction.
uxth_,_
( rm rd – )
Assemble an UXTH instruction.
wfe
( – )
Assemble a WFE instruction.
wfi
( – )
Assemble a WFI instruction.
yield
( – )
Assemble a YIELD instruction.
mark>
( – mark-addr mark )
Mark a backward destination.
>mark
( mark-addr mark – )
Mark a forward destination.


Foreign Affairs
Louth TD: Lisa Smith wants to return to Dundalk
Foreign Affairs
by David LynchLouth TD Peter Fitzpatrick has said that Dundalk woman Lisa Smith wants to return to the town.
Speaking on LMFM today, the Independent Deputy said he had been talking to Lisa Smith's family and that she wants to come home to clear her name.
Deputy Fitzpatrick said: "In 2019 she was captured and detained by US forces. She has denied being a member of ISIS. She says she's not guilty."
He added: "She said she never owned a gun and she wants to come home to her country and come home to Dundalk and she is willing to testify and talk to anyone to clear her name."


Introduction
Hi! My name is Amanda Lin and this is my personal website. I am currently attending Dev Bootcamp in Chicago with the goal of refocusing my career to Software Development. I hope you enjoy my little site as I continue this journey!
The content on this site isn't great and doesn't make a lotta sense but mostly just there for me to be able to play around with different things.
The content on this site isn't great and doesn't make a lotta sense but mostly just there for me to be able to play around with different things.
Dev Bootcamp
Dev Bootcamp is a 19 week intensive training program for aspiring web developers, specializing in Ruby, Rails, HTML5, CSS, Test Driven Development, Object Oriented Javascript (AJAX, jQuery), Git and Source Control, Heroku, and Agile Development.