We allow you to build your notifications in pure HTML (of course, we will not allow some tags like <form>
, but besides those, you can do anything with them.)
If you’re reading it, we’ll assume that you already know how to push simple notifications. This article will help you understand how to spice up your notifications so that they don’t look so 1990s.
-
Login to your account and click on the icon on any profile. We’ll notify our users to follow us on Twitter in this demo. We’ll embed the Follow button right inside the notification.
-
In the “Simple” tab, click on the “Advanced” to expand it. In the HTML section, click inside textarea and then click the Toggle HTML button to reveal the raw HTML area.
-
Paste the HTML between the lines in there.

You’re our most active user last month. I thought, may be you’d like to stay connected with us on Twitter.

- Mohit (CEO, Horntell)

Tip: You can change the part in red color with your own Twitter handle.
- Hit Send. Did you get the notification? Isn’t it awesome?


---
title: ACT Branch
permalink: "/branch/act/"
layout: default
dark-theme: true
---
{% include navbar.html %}
{% include components/main-heading.html
text="ACT Branch"
font-size="h0"
font-weight="bold"
line="true" %}
ACT Branch page
Details TBA.
{% include footer.html %}


☰
Home
Career Path
Blog
Internship
Category
Career Jumpstart
Professional Skills
Resume Templates
Management
About
Contact
Search
Login


Technical Resources
CAD Designs
Featuring all of 2852's released CAD drawings, fully available for use by any other teams.
Feel free to reach out to us via email if you have any questions.
Open source code
Featuring all of 2852's robot code, and scouting apps fully available for use by any other
teams. Feel free to reach out to us via email if you have any questions.


Pfizer warns men over fake Viagra pills that could kill you
Some pills could contain road paint
by Katie Timms, Christopher HarperA company has issued a stark warning over fake Viagra pills which could be lethal.
Pfizer, the company behind the product, state there are many websites that sell the pill but most of them are counterfeit.
The pills could be toxic, unsanitary or even deadly, reports PlymouthLive.
David Massie, registered pharmacist at Dr Andrews Online Pharmacy, said that the ingredients in counterfeit tablets is "dangerous" and "staggering".
Ingredients found in counterfeit Viagra include, drywall, road paint, detergent, anti-fungal medication, cleaning products, talcum powder and amphetamines.
Mr Massie said: "The number of dangerous things found in fake Viagra is staggering. The individuals behind the propagation of these counterfeit pills do not consider your health when producing them, only their profits.
“When a doctor or pharmacist prescribes you Viagra, they consider all the other medications you might taking. Unlicensed sites are concerned only with their financial gain and not with drug interactions – mixing inappropriate medications together can often result in death.
"At Dr Andrews, we encourage you to be vigilant in ensuring what you are taking is real, approved and regulated Viagra from a registered source.”
Here are some ways to ensure what you have is the real deal:
- It has smooth edges. Fake Viagra will have rough edges.
- Viagra only comes in packs of four. Any more than four pills to a pack are counterfeit.
- There should be no variations in colour. Viagra will always be solid blue.
- The f in Pfizer should not narrow until the top. In fake Viagra the ‘f’ narrows just past the letter ‘i’.
- A package without an expiration date or a poorly printed expiration date is a fake.
- Pfizer always have a hologram on the boxes. No hologram – not genuine.
If you feel something is not right with the Viagra you received, then do not take it.
f you have already ingested what you believe to be counterfeit Viagra, contact your doctor immediately.


Posted by Articul8 on February 22, 2019
Posted by Articul8 on February 20, 2019
Posted by Articul8 on February 19, 2019
Posted by Articul8 on February 15, 2019
Posted by Articul8 on January 20, 2019
Posted by Articul8 on January 19, 2019


[viewBag] title = "Vision & Mission" url = "/vision-mission" layout = "static-with-sidebar" is_hidden = 0 navigation_hidden = 0 ==
To build a vibrant multicultural learning environment founded on value based academic principles, wherein all involved shall contribute effectively, efficiently and responsibly to the national and global community.


{%extends 'registration/base.html'%} {% load bootstrap4 %} {% load crispy_forms_tags %} {% block content %}
Password or Username is incorrect
Don't have an account?


assets/js/fuelux/fuelux.spinner.js
$('#my-spinner').ace_spinner({ min: 0, max: 100, step: 1, icon_up: 'fa-plus', icon_down: 'fa-minus', btn_up_class: 'btn-success', btn_down_class: 'btn-danger', on_sides: true });
icon_up
the icon to be used for "up" buttonicon_down
the icon to be used for "down" buttonbtn_up_class
the button class for "up" buttonbtn_down_class
the button class for "down" buttonon_sides
up and down buttons will be on different sides of inputtouch_spinner
bigger buttons will be used$('#my-spinner').ace_spinner('disable'); $('#my-spinner').ace_spinner('enable'); $('#my-spinner').ace_spinner('value', 3);
.ace-spinner
wrapper element:
$('#my-spinner').closest('.ace-spinner').spinbox('disable');Same is true for events.
$('#my-spinner').closest('.ace-spinner').on('changed.fu.spinbox', function () { //do something })
.input-sm
to text input element for a smaller and .input-lg
for a larger spinner:
assets/js/fuelux/fuelux.wizard.js
ul.wizard-steps
to ul.steps
ul.steps
and div.step-content
are wrapped inside a parent for example div#my-wizard
and ace_wizard or FuelUX's wizard function is applied to div#my-wizard
ul.steps > li
and .step-pane
should have a data-step
attribute which specifies step number
e.preventDefault()
now
It's a
- 1 Step1
- 2 Step2
ul.steps
wrapped inside an element which also contains
our step panes.
Steps panes container is a .step-content
which contains
several .step-pane
elements each with a data-step
attribute.
.wizard-actions
element containing
.btn-prev
and .btn-next
buttons should be a sibling are wizard:
.btn-next
should have a data-last
attribute
which is "finish" button's text at final step.
buttons
attribute when using ace_wizard
function which allows specifying a custom set of action buttons elsewhere.
$('#my-wizard') .ace_wizard({ //step: 2 //optional argument. wizard will jump to step "2" at first //buttons: '.my-action-buttons' //which is possibly located somewhere else and is not a sibling of wizard }) .on('actionclicked.fu.wizard' , function(e, info) { //info.step //info.direction //use e.preventDefault to cancel }) .on('changed.fu.wizard', function() { //after step has changed }) .on('finished.fu.wizard', function(e) { //do something when finish button is clicked }).on('stepclick.fu.wizard', function(e) { //e.preventDefault();//this will prevent clicking and selecting steps });
var wizard = $('#my-wizard').data('fu.wizard'); //move to step 3 wizard.currentStep = 3; wizard.setState(); //determine selected step wizard.selectedItem().step
assets/js/fuelux/fuelux.treeview.js
open-icon
The icon for an open tree nodeclose-icon
The icon for a closed tree nodeselectable
Whether items are selectable or notselected-icon
Icon for a selected tree nodeunselected-icon
Icon for a non-selected tree node$('#tree1').ace_tree({ dataSource : treeDataSource , multiSelect : true, loadingHTML : '

', 'open-icon' : 'ace-icon tree-minus', 'close-icon' : 'ace-icon tree-plus', 'selectable' : true, 'selected-icon' : 'ace-icon fa fa-check', 'unselected-icon' : 'ace-icon fa fa-times' });
.tree-minus
and .tree-plus
ul
elementname
is now deprecated and text
should be used.
$('#tree1').on('opened.fu.tree', function () { //do something })
$('#tree1').ace_tree({ dataSource : treeDataSource // ... other options });
var treeDataSource = function(options , callback) { //options has extra info such as "type" "text" "additionalParameteres", etc //which you can use to specify requested set of data var myData = [ ... ];//set of data callback({ data: myData }); }Please see treeview example page for more info
mustache/app/views/assets/scripts/treeview.js
examples/treeview.html
additionalParameters
parameter to include optional data,
for example setting item-selected:true
will mark the item as selected upon
insertion into tree.
additionalParameters
is id
, title
, etc ...
var mySource = function(options , callback) { //retrieve data according to "options" parameters //and when data is loaded, call "callback" } $('#treeview').ace_tree({ dataSource: mySource //other options });
var items = $('#treeview').tree('selectedItems'); //for example convert "items" to a custom string for(var i in items) if (items.hasOwnProperty(i)) { var item = items[i]; output += item.additionalParameters['id'] + ":"+ item.text+"\n"; } //send output to server
folderSelect
option of FuelUX tree because it has
a problem with Ace's styling of treeview element.


| Ticker | Type | Shares | Date of Trade | Initial Price |
|---|---|---|---|---|
| Ticker | Type | Shares | Date of Trade | Initial Price |
| MSFT | Buy | 1000 | 12/4/2017 | $45.55 |
| F | Short Sell | 500 | 12/1/2017 | $12.60 |
| Date | Action | Ticker | Shares | Price Per Share | Price |
|---|---|---|---|---|---|
| Date | Action | Ticker | Shares | Price Per Share | Price |
| 12/4/2017 | Buy | MSFT | 1000 | $81.77 | $81,770 |
| 12/1/2017 | Buy | KO | 300 | $45.55 | $13,665 |
| 12/4/2017 | Sell | KO | 300 | $46.25 | $13,875 |
| 12/1/2017 | Short Sell | F | 500 | $12.60 | $6,300 |


Scientists help soldiers figure out what robots know
| Source: | U.S. Army Research Laboratory |
| Summary: | A research team developed new algorithms and filled in knowledge gaps about how robots contribute to teams and what robots know about their environment and teammates. |
An Army-led research team developed new algorithms and filled in knowledge gaps about how robots contribute to teams and what robots know about their environment and teammates.
Dr. Kristin Schaefer-Lay, an engineer with the U.S. Army Combat Capabilities Development Command's Army Research Laboratory, is part of a multidisciplinary team of reseachers from the Army, Carnegie Mellon University, University of Minnesota and the University of Central Florida — amongst others, who developed specific algorithms and novel artificial intelligence approaches to support the development of a shared context between team members through effective bidirectional communication.
"The idea of integrating context to AI development is a difficult process," Schaefer-Lay said. "Researchers tend to have very different ideas about what is meant by context and the best practices for integrating context into AI development."
A number of researchers and institutions have looked a smaller pieces of this problem set, but this team looked at a more holistic approach for how to develop and integrate different types of context related to environmental context, mission context and social context to advance human-autonomy teaming through advanced bidirectional communication capabilities.
This has directly advanced science in robotics and AI processes in the areas of natural language communication, world model development, multi-modal communication and human-autonomy teaming, Schaefer-Lay said.
The collaborative team seeks to identify critical scientific advances made by the Army's Robotics Collaborative Technology Alliance, or RCTA, on techniques for developing and advancing context-driven artificial intelligence to support future human-autonomy teams.
Strategic investments in Army-led foundational research as part of the RCTA resulted in advanced science in four critical areas of ground combat robotics that effect the way U.S. Warfighters see, think, move and team. This research supports the Army Modernization Priority for the Next Generation Combat Vehicle by advancing science for integrating context-driven artificial intelligence within human-autonomy teams.
"Government investment in ground combat robotics is critical to ensuring U.S. maneuver forces maintain a marked combat advantage," Schaefer-Lay said.
The researchers published their findings in the Sept. 30, 2019, edition of the AI Magazine as part of an invited issue on AI and Context: "Integrating Context into Artificial Intelligence: Research from the Robotics Collaborative Technology Alliance."
Integration of context-driven AI is important for future robotic capabilities to support the development of situation awareness, calibrate appropriate trust, and improve team performance in collaborative human-robot teams.
This article highlights advances in context-driven AI for human-robot teaming.
Avenues of research discussed include how context enables robots to fill in the gaps to make effective decisions more quickly, supports more robust behaviors, and augments robot communications to suit the needs of the team under a variety of environments and team organizations and across missions.
The article''s findings will be used to support the laboratory's continued research in the Human-Autonomy Teaming Essential Research Program. In particular, this research will help to develop effective bidirectional communication methods and interventions for calibrating appropriate team trust and shared situation awareness in high risk, complex operations.
It is not enough to just develop new algorithms and approaches, Schaefer-Lay said, "but it is important to understand the impact these have on effective teaming across operations."
The advancement of this research line will extend to include larger teams and crew station technologies that support the Next Generation Combat Vehicle, she said.
make a difference: sponsored opportunity
Story Source:
Materials provided by U.S. Army Research Laboratory.
Note: Content may be edited for style and length.
Journal Reference:
- Kristin E. Schaefer, Jean Oh, Derya Aksaray, Daniel Barber. Integrating Context into Artificial Intelligence: Research from the Robotics Collaborative Technology Alliance. AI Magazine, 2019; 40 (3): 28 DOI: 10.1609/aimag.v40i3.2865
Cite This Page:
| MLA | U.S. Army Research Laboratory. "Scientists help soldiers figure out what robots know." ScienceDaily. ScienceDaily, 21 November 2019. <www.sciencedaily.com/releases/2019/11/191121163328.htm>. |
| APA | U.S. Army Research Laboratory. (2019, November 21). Scientists help soldiers figure out what robots know. ScienceDaily. Retrieved November 21, 2019 from www.sciencedaily.com/releases/2019/11/191121163328.htm |
| Chicago | U.S. Army Research Laboratory. "Scientists help soldiers figure out what robots know." ScienceDaily. www.sciencedaily.com/releases/2019/11/191121163328.htm (accessed November 21, 2019). |


|
NumCpp
2.11.0
A Templatized Header Only C++ Implementation of the Python NumPy Library
|
holds the information for a centroid More...
#include <Centroid.hpp>
Public Types | |
| using | accumulator_t = typename std::conditional< std::is_integral< dtype >::value, int64, double >::type |
Public Member Functions | |
| Centroid ()=default | |
| Centroid (const Cluster< dtype > &inCluster) | |
| double | a () const noexcept |
| double | b () const noexcept |
| double | col () const noexcept |
| double | eccentricity () const noexcept |
| double | eod () const noexcept |
| accumulator_t | intensity () const noexcept |
| bool | operator!= (const Centroid< dtype > &rhs) const noexcept |
| bool | operator< (const Centroid< dtype > &rhs) const noexcept |
| bool | operator== (const Centroid< dtype > &rhs) const noexcept |
| double | orientation () const noexcept |
| void | print () const |
| double | row () const noexcept |
| std::string | str () const |
Friends | |
| std::ostream & | operator<< (std::ostream &inStream, const Centroid< dtype > &inCentriod) |
holds the information for a centroid
| using nc::imageProcessing::Centroid< dtype >::accumulator_t = typename std::conditional<std::is_integral<dtype>::value, int64, double>::type |
|
default |
defualt constructor needed by containers
|
inlineexplicit |
constructor
| inCluster |
|
inlinenoexcept |
returns the ellipse semi-major axis a
|
inlinenoexcept |
returns the ellipse semi-minor axis b
|
inlinenoexcept |
gets the centroid col
|
inlinenoexcept |
returns the ellipse eccentricity
|
inlinenoexcept |
returns the estimated eod of the centroid
|
inlinenoexcept |
gets the centroid intensity
|
inlinenoexcept |
not equality operator
| rhs |
|
inlinenoexcept |
less than operator for std::sort algorithm; NOTE: std::sort sorts in ascending order. Since I want to sort the centroids in descensing order, I am purposefully defining this operator backwards!
| rhs |
|
inlinenoexcept |
equality operator
| rhs |
|
inlinenoexcept |
returns the ellipse semi-minor axis orientation
|
inline |
Method Description: prints the Centroid object to the console
|
inlinenoexcept |
gets the centroid row
|
inline |
returns the centroid as a string representation
|
friend |
ostream operator
| inStream | |
| inCentriod |


Shorty is a URL Shortening Service built to shorten all your long URLs on the go.
Create a custom or random short link as well as QR code for the same.
Contributors - gallery
Ashutosh Krishna
A Backend Web Developer, Python Lover and Flutter Enthusiast.


Not following: (error message here)
Reasons include: file not found, no permissions, not included on the command line, not allowing shellcheck
to follow files with -x
, etc.
source somefile
In case you have access to the file, e.g. if it is included in your source code repository:
# shellcheck source=somefile
source somefile
In case you do not have access to the file:
# shellcheck source=/dev/null
source somefile
ShellCheck, for whichever reason, is not able to access the source file.
This could be because you did not include it on the command line, did not use shellcheck -x
to allow following other files, don't have permissions or a variety of other problems.
Feel free to ignore the error with a [[directive]].
ShellCheck is unable to follow dynamic paths, such as source "$somedir/file"
. For these cases, see [[SC1090: Can't follow non-constant source. Use a directive to specify location|SC1090]] instead. You may be seeing SC1091 because ShellCheck tried to be helpful and strip a leading dynamic path element as described on that page.
If you're fine with it, ignore the message with a [[directive]].


Vanilla command
jQuery command
Events
- When the HTML document has been loaded and you can manipulate it with JavaScript
- When an HTML item has been clicked
- When an HTML item has been double clicked
- Press a key on the keyboard
- When the user moves the mouse cursor
- Text input, value
- When an image is loaded
- When an image fails to load
- When a form is submitted
- Select: Option change
- When you position the mouse over an element
- Checkbox: checked or unchecked
- When a ul list item is clicked, show the item that was clicked
Selectors
- Create an HTML element with any text value
- Remove an HTML element with any text value
- Append an HTML element with any text value to a parent element
- Prepend an HTML element with any text value to a parent element
- Create and add an HTML after another element
- Create and add an HTML before another element
- Clone an HTML element within other element
- Add a class
- Remove a class
- Toggle a class
- Add and remove a disabled attribute
- Set and Remove a data-src attribute
- Hide (display: none) and Show (display: block)
- Fade in an HTML element using jQuery
- Iterate a collection of elements
- Get the parent element
- Get the collection of children
- Get all the elements that have a certain class and change their font weight
- Get an item by id and change its font weight
- Get all the elements that have a certain class and the display property of none and change their font color
- Get the options of a select element that are selected (attribute selected)
- Change the href attribute of the first <a> element
- Show an alert with the value of the first <input> of the page
- Remove all items from a specific selector
- Animate an item after 2 seconds from the initial page load


Bernard Cornwell, OBE is an English author of historical novels. Two of his historical novel series have been adapted for television; the Sharpe series by ITV and The Last Kingdom by BBC. In 2014 he published a nonfiction book, Waterloo: The History of Four Days, Three Armies and Three Battles.
Where did your interest in history and particularly military history come from? Did you have an inspiring history teacher at school?
I had an inspiring English teacher at school, but the only history teacher I can recall was rather dour. I suspect my interest in history was inherited! When I was in my 50’s I met my birth mother for the first time and found her flat crammed with historical novels… so make of that what you will. I don’t remember a time when I wasn’t obsessed by history, from a child it was my favourite reading and I cycled miles to visit old churches, ruins, whatever. As for military history, I was adopted into a family of fundamentalist puritans, belonging to a sect called The Peculiar People (really!) and among the many things of which they disapproved was anything to do with the military so, naturally, I became fascinated by all things military.
Where did the character of Uhtred come from?
He has some basis in history – there was a family that frequently used the name Uhtred in the 8th, 9th and 10th centuries, and they were the owners of Bebbanburg, now Bamburgh Castle. My Uhtred is fictional, but I discovered the family by meeting my natural father, again when I was in my 50’s, and discovered that he was a direct descendant of that family. The surname had changed over the years to Oughtred, but his family tree (and mine) went all the way back to the Anglo-Saxon period. My curiosity was aroused by their holding onto Bebbanburg – a Saxon and Christian enclave in a Danish and pagan kingdom of Northumbria. I suspect they collaborated, but we don’t really know. Whatever, Uhtred is one of my ancestors!
When you write are you a planner or do you get ideas of where to take the story as you write it?
I don’t have an outline. Some writers plot very carefully, and their books are great, but others, like me, leave it to instinct.
Do you get much time for leisure reading or is it all research?
I read a lot, and a lot that has nothing to do with history, though I suppose about half my reading is somehow connected to whatever period I’m writing about. I do like a well-written thriller – I’m a great fan of John Sandford – but mostly I read non-fiction. I’ve just finished Our Man in Charleston by Christopher Dickey, a splendid book about the British consul in Charleston, South Carolina, during the American Civil War, which I read mainly because he lived a few houses away from mine in that city. And I’ve just started The Incredible Unlikeliness of Being by Alice Roberts, and am loving it so far!
Is there anything you can share about your latest project?
The latest one, finished yesterday, is the 10th novel about Uhtred and, at last, he makes a proper attempt to recapture Bebbanburg. But will he succeed? I ain’t saying.
Given a time machine and the ability to go backwards or forwards what date would you set the clock for and why? (assuming you could get back..)
It would be nice to meet Nell Gwynne? And if you did, why come back? But I suppose if I was forced to make a choice I think I’d want to be in the Globe for the first performance of, well, almost anything! I’ll choose The Tempest.


{% extends 'layout.html' %} {% block pageTitle %} New job role - NHS.UK prototype kit {% endblock %} {% block beforeContent %} {{ breadcrumb({ items: [ { href: "/dashboard", text: "Dashboard" }, { href: "/job-roles/", text: "Job roles" }, { href: "/job-roles/new", text: "New" }] }) }} {% endblock %} {% block content %}
| 1. Name of job role | {{ name }} | Change |
|---|---|---|
| 2. National job profile - professional group | {{ profileName and 'Nursing and midwifery' or 'None' }} | Change |
| 3. National job profile - profile title | {{ profileName or 'None' }} | Change |
| 4. Description of job role | {{ description | truncate(100) }} | Change |
| 5. Required competencies | {% for competency in competencyNames %} {{ competency }} {% endfor %} | Change |


Danilo Kim
About
Portfolio
Contact
Portfolio
Work
Hangman
RPG Game
Trivia Game
Rutgets Info Widget
Rock Paper Scissors
Connect with me


The most basic response from a Laravel route is a string:
Route::get('/', function()
{
return 'Hello World';
});
However, for most routes and controller actions, you will be returning a full Illuminate\Http\Response
instance or a view. Returning a full Response
instance allows you to customize the response's HTTP status code and headers. A Response
instance inherits from the Symfony\Component\HttpFoundation\Response
class, providing a variety of methods for building HTTP responses:
use Illuminate\Http\Response;
return (new Response($content, $status))
->header('Content-Type', $value);
For convenience, you may also use the response
helper:
return response($content, $status)
->header('Content-Type', $value);
Note: For a full list of available
Response
methods, check out its API documentation and the Symfony API documentation.
If you need access to the Response
class methods, but want to return a view as the response content, you may use the view
method for convenience:
return response()->view('hello')->header('Content-Type', $type);
return response($content)->withCookie(cookie('name', 'value'));
Keep in mind that most Response
methods are chainable, allowing for the fluent building of responses:
return response()->view('hello')->header('Content-Type', $type)
->withCookie(cookie('name', 'value'));
Redirect responses are typically instances of the Illuminate\Http\RedirectResponse
class, and contain the proper headers needed to redirect the user to another URL.
There are several ways to generate a RedirectResponse
instance. The simplest method is to use the redirect
helper method. When testing, it is not common to mock the creation of a redirect response, so using the helper method is almost always acceptable:
return redirect('user/login');
Redirecting to a new URL and flashing data to the session are typically done at the same time. So, for convenience, you may create a RedirectResponse
instance and flash data to the session in a single method chain:
return redirect('user/login')->with('message', 'Login Failed');
You may wish to redirect the user to their previous location, for example, after a form submission. You can do so by using the back
method:
return redirect()->back();
return redirect()->back()->withInput();
When you call the redirect
helper with no parameters, an instance of Illuminate\Routing\Redirector
is returned, allowing you to call any method on the Redirector
instance. For example, to generate a RedirectResponse
to a named route, you may use the route
method:
return redirect()->route('login');
If your route has parameters, you may pass them as the second argument to the route
method.
// For a route with the following URI: profile/{id}
return redirect()->route('profile', [1]);
If you are redirecting to a route with an "ID" parameter that is being populated from an Eloquent model, you may simply pass the model itself. The ID will be extracted automatically:
return redirect()->route('profile', [$user]);
// For a route with the following URI: profile/{user}
return redirect()->route('profile', ['user' => 1]);
Similarly to generating RedirectResponse
instances to named routes, you may also generate redirects to controller actions:
return redirect()->action('App\Http\Controllers\HomeController@index');
Note: You do not need to specify the full namespace to the controller if you have registered a root controller namespace via
URL::setRootControllerNamespace
.
return redirect()->action('App\Http\Controllers\UserController@profile', [1]);
return redirect()->action('App\Http\Controllers\UserController@profile', ['user' => 1]);
The response
helper may be used to conveniently generate other types of response instances. When the response
helper is called without arguments, an implementation of the Illuminate\Contracts\Routing\ResponseFactory
contract is returned. This contract provides several helpful methods for generating responses.
The json
method will automatically set the Content-Type
header to application/json
:
return response()->json(['name' => 'Abigail', 'state' => 'CA']);
return response()->json(['name' => 'Abigail', 'state' => 'CA'])
->setCallback($request->input('callback'));
return response()->download($pathToFile);
return response()->download($pathToFile, $name, $headers);
return response()->download($pathToFile)->deleteFileAfterSend(true);
Note: Symfony HttpFoundation, which manages file downloads, requires the file being downloaded to have an ASCII file name.
If you would like to define a custom response that you can re-use in a variety of your routes and controllers, you may use the macro
method on an implementation of Illuminate\Contracts\Routing\ResponseFactory
.
For example, from a service provider's boot
method:
<?php namespace App\Providers;
use Response;
use Illuminate\Support\ServiceProvider;
class ResponseMacroServiceProvider extends ServiceProvider {
/**
* Perform post-registration booting of services.
*
* @return void
*/
public function boot()
{
Response::macro('caps', function($value)
{
return Response::make(strtoupper($value));
});
}
}
The macro
function accepts a name as its first argument, and a Closure as its second. The macro's Closure will be executed when calling the macro name from a ResponseFactory
implementation or the response
helper:
return response()->caps('foo');


Documentation
LightBox.js
A jQuery lightbox plugin for images! Click the image to view it in a lightbox.


System Reliability
Reliability Issues
Real-time systems are particularly error-prone because of their inherent complexity; as complexity increases the probability of errors also increases.
This problem is compounded by the requirement for embedded systems to operate without intervention, possibly in the presence of errors.
Systems may be classified as fault-tolerant or fault-intolerant. Fault-tolerant systems are characterized by anticipating that all errors cannot be removed before run-time, and mechanisms are provided to detect and handle faults when they do occur. Complex, real-time systems, usually, cannot be tested adequately to guarantee that no faults occur. Fault intolerant systems, on the other hand, assume that the system is sufficiently tested, no faults occur, and no fault-handling is provided.
The kernel is fault-tolerant. By implementing fault management, the kernel achieves the objectives of increased system availability and assures algorithm correctness.
Reliability by Design
The kernel allows reliability to be designed into a system.
One method of fault management that is implemented in the system design is software layering. A layered system allows it to be viewed in smaller, logically related, and less complex segments. This makes the design more manageable and, by extension, more reliable. Layering is also a facility for the isolation of faults. If a fault can be isolated to a layer, then only that layer needs to be recovered, and system availability is increased.
The kernel, itself, may be considered a single layer. However, because it is the most dependent layer faults detected in the kernel usually require complete system recovery. The kernel may not need to be recovered if faults are detected in an application layer.
The kernel supports reliable system design by its built-in fault management policies and by providing mechanisms for applications to interface to the fault management system. These policies and mechanisms are described in the sections, below.
Fault Management
Fault management has three aspects; 1) fault detection, 2) fault handling and reporting, and 3) fault recovery.
The kernel uses its fault analysis area for fault management. These data are described in detail in a separate section.
FAULT DETECTION
By active fault detection, the kernel can reduce fault propagation. This is the primary mechanism that supports fault-tolerant objectives. The following fault detection methods are used by the kernel.
Memory Audits
The kernel partitions and classifies memory for fault management. If the type of memory is known, the kernel can verify that the data is consistent with the memory type. While this method does not guarantee fault detection, common types of memory corruption are detectable.
System and task stacks, kernel data structures and kernel structures in the application memory area, such as queues, are continuously audited.
Guarded Primitive Access
Whenever a primitive is called, the kernel test that is a valid primitive, that the parameters are consistent and within kernel defined limits, and that resources are available.
Software Watchdog
The hardware watchdog (COP) is used to detect tasks and interrupt service routines that keep control of the processor for longer than the watchdog period. This is an indication of faulty algorithm execution.
The above fault detection methods are used at run-time. To reduce development time by detecting errors early in the process, system build tools are part of kernel fault management. This supports the notion that faults detected early in the development cycle are less expensive to correct.
Fault detection before run-time has the added benefit of freeing the kernel from some fault detection at run-time, resulting in a more efficient kernel.
The following fault detection methods are used during implementation.
Primitive Declaration
The macro declaration of the primitive interface allows most assemblers and compilers to detect reference and parameter errors in the primitive call.
System Build Utility
This is the primary tool for fault management before run-time that relates directly to the kernel. The system build utility, described in detail in a separate section, tests for overall resource availability and data consistency.
High-Level Language Interface
The high-level language interface allows applications to be implemented with the probability of fewer errors.
FAULT HANDLING AND RECOVERY
Once faults are detected they must be handled to achieve fault tolerance. A completely handled fault includes determination of fault severity, reporting and logging the fault, and initiating recovery action. Recovery action depends on the type and severity of the fault.
Kernel Fault Handling
Kernel-detected faults are only acted on if they are determined to be critical to system operation. Otherwise, the fault is only reported and logged.
Fault classification, either critical or acceptable, depends on the kernel state and the scope of the data if it is a data-related fault. Acceptable faults, from the kernel's point of view, are those that are limited to a single task. Such faults occur in the TASK state or in a task's stack or dynamic data. Faults in any other kernel state are classified as critical.
For acceptable faults, the kernel simply deletes the affected task, so the fault is not repeated or propagated. The fault is reported to the fault handling task if one is defined. It is left to the application to determine the impact of the deleted task and take appropriate recovery action.
For critical faults, the kernel determines that system integrity cannot be guaranteed. The kernel, therefore, reports the fault, then initiates a kernel restart. The restart causes all tasks to be restarted. The cause of the restart is available in the fault analysis area.
Application Fault Handling
Application-detected faults are independent of the kernel. Their classification and recovery action depend on the application. Applications use kernel primitives to report the fault and initiate recovery.
The LOG_WARN primitive is used to report non-critical faults. This is useful for noteworthy faults that do not affect system operation and is useful for check- pointing during debugging. The fault is only reported and logged; no recovery is initiated by the kernel.
The LOG_FATAL primitive is used to report faults the application determines adversely affect system operation. The kernel reports the fault and initiates recovery by restarting the kernel, which also restarts the tasks.
Both LOG_WARN and LOG_FATAL cause fault-related information to be logged in the kernel's fault analysis area. This information is available at run-time to report the fault and is useful during debugging to determine the cause of the fault.
Optionally, the fault may be reported to a fault handling task. The task name must first be defined in the configuration file. This allows the application to take application-dependent recovery action.
For primitive access, the kernel detects some classes of errors before a fault occurs. An example is primitive parameter errors. The kernel reports these faults in the status returned by the primitive. The kernel always returns a status to a primitive call. It is the responsibility of the application to check the return value and take the appropriate action.


Weather update: Cyclone Maha intensifies
by Times News ServiceMuscat: Tropical cyclone Maha has intensified to category two cyclone, according to Public Authority for Civil Aviation (PACA).
In its latest update PACA said: “The tropical cyclone (Maha) evolved during the past hours into a second-degree tropical cyclone with 85-95 knots estimated surface wind speed around the center and it is currently 730 km away from the nearest point of the Sultanate coast (Ras Mudrakah) as it continues to move west/northwest."


SCOOP - Object Oriented Programming
SCOOP implements a simple OOP system. Single inheritance only. Allows creation of classes and objects. Does not dispatch based on type of arguments; simply on method name. STACK illustrates another way to do “OOP” programming. SCOOP is (likely) better for structuring larger programs. STACK is far better for performance. STACK creates a family of routines, with no overhead for dispatch.
SCOOP is deliberately simple. It is designed to provide a very thin object layer to allow better variable control, and allow the elimination of some labels. It is designed to allow for trivial “monkey patching”. Indeed, that is the normal way to add methods. Methods may also be added to objects directly!
THIS refers to the receiver of a message (sometimes known as self). SELF() dispatches messages from a method to the same receiver. SUPER() does the same, but begins the dispatch search with the superclass of the receiver.
| IVARS(THIS)<'VARIABLE NAME'>
accesses instance variable VARIABLE NAME in the receiver. We OPSYN unary operator | to simplify this. |'var' or |.var refers to instance variable var and can be used on either the left or right side of an assignment.
^ is usable as a unary operator in CSNOBOL4. SPITBOL.EXE does not support this. To accomodate, | is now used as the instance variable access operator. This works on both systems. Change the OPSYN() statement as appropriate if you want another operator.
SEND(OBJECT,MESSAGE,ARGS) dispatches a message to the receiver, with up to eight arguments.
SCOOP is very useful in “hiding” variables. SNOBOL4 does not have any concept of scope. Bundling variables together into an object is one way of controlling this complexity. Thus the given name SCOOP which evokes OOP, scope and ice-cream scoops. Or “SNOBOL4 Crummy Object Oriented Programming”.
ADD_METHOD can add either a name of a function to dispatch, or CODE(). The code compiled is run in the context of SEND(). Arguments A1 through A8 are available, and three temporaries T1 through T3. The method result should be assigned to the variable SEND. THIS is assigned to the receiver object.
CLASS_OF() is primarily for development. It returns the name of the class the object is in. It does so without using SEND(), but is aware of object structure. CLASS(OBJECT) evaluates to the class of an object. CLASS(CLASS(OBJECT)) is the superclass (base class). Every object has a class, including classes! The only exception is the CLASS class, which has a NULL class.
IS_A succeeds if the object is in the class given, or in a subclass. If not, it fails.
After initialize, only a single class exists: CLASS. CLASS has methods NEW_CLASS, NEW, ADD_METHOD, INIT, IS_A and DOES_NOT_UNDERSTAND pre-defined.
Objects are created with NEW. After the object is created, it should be initialized, so NEW dispatches the message INIT to the newly created object. The CLASS class implements an empty INIT method, ensuring that this will not cause problems if not implemented in sub-classes.
The SEND() function can be used outside or inside of a method. SELF() and SUPER() can only be used inside a method. IVAR(), CVAR() (and the ^ operator) are restricted to within a method only. CLASS_OF() can be used wherever SEND() can be used.
If a selector (method) is not matched, the search is done again, dispatching selector 'DOES_NOT_UNDERSTAND' to the object. If a class contains an implementation for this message, the exception can be handled (say, by loading the method implementation, dispatching it again, and returning the result). The CLASS class implementation for DOES_NOT_UNDERSTAND displays an error and terminates the program.
We don't expect the class tree to be very deep. SCOOP is designed as a light OOP tool to aid in variable management. Some subclassing is expected, but very deep class trees are not well (effiently) supported. There is no method caching, so every method dispatch will do a tree search.
String comparisions in SNOBOL4 are inexpensive. A string compare is a pointer compare. This means that representing messages by strings is a reasonable choice.
See Also
STACK
«INCLUDES»≡ -INCLUDE 'TIMER.INC' -INCLUDE 'VDIFFER.INC' @
«SCOOP»≡ -PUBLIC OBJECT() * DATA('OBJECT(CLASS,IVARS,METHODS)') * -PUBLIC SEND(), SUPER(), SELF(), IVAR(), CVAR(), CLASS_OF(), |1 DEFINE('SEND(THIS,METHOD,A1,A2,A3,A4,A5,A6,A7,A8)' + 'C,M,M_CLASS,T1,T2,T3') DEFINE('SUPER(METHOD,A1,A2,A3,A4,A5,A6,A7,A8)T1,T2,T3') DEFINE('SELF(METHOD,A1,A2,A3,A4,A5,A6,A7,A8)T1,T2,T3') DEFINE('FIND_METHOD(OBJ,METHOD)') DEFINE('IVAR(NAME)') DEFINE('CVAR(NAME)') DEFINE('CLASS_OF(OBJ)') OPSYN('|', 'IVAR', 1) * * INITIALIZE OOP SYSTEM, CREATE ROOT CLASS. MAKE SURE ROOT CLASS CAN * ANSWER NEW_CLASS, NEW, INIT, DOES_NOT_UNDERSTAND AND ADD_METHOD * MESSAGES. ALSO, ANSWER THE IS_A MESSAGE. * -PUBLIC CLASS:CLASS CLASS = OBJECT(, TABLE(), TABLE()) IVARS(CLASS)<'CLASS'> = 'CLASS' -PUBLIC CLASS:'ADD_METHOD' METHODS(CLASS)<'ADD_METHOD'> = + CODE( + ' METHODS(THIS) = IDENT(METHODS(THIS)) TABLE();' + ' THAW(METHODS(THIS));' + ' METHODS(THIS)<A1> = A2;' + ' FREEZE(METHODS(THIS)) :(RETURN)') * -PUBLIC CLASS:'NEW_CLASS' SEND(CLASS, 'ADD_METHOD', 'NEW_CLASS', + CODE( + ' THIS = OBJECT(THIS);' + ' IVAR("CLASS") = A1;' + ' SEND = THIS :(RETURN)')) -PUBLIC CLASS:'INIT' SEND(CLASS, 'ADD_METHOD', 'INIT', + CODE(' :(RETURN)')) -PUBLIC CLASS:'NEW' SEND(CLASS, 'ADD_METHOD', 'NEW', + CODE( + ' THIS = OBJECT(THIS);' + ' SELF("INIT", A1, A2, A3, A4, A5, A6, A7, A8);' + ' SEND = THIS :(RETURN)')) -PUBLIC CLASS:'DOES_NOT_UNDERSTAND' SEND(CLASS, 'ADD_METHOD', 'DOES_NOT_UNDERSTAND', + CODE( + " TERMINAL = 'SCOOP: DOES NOT UNDERSTAND ' METHOD :(END)")) DEFINE('IS_A(ACLASS)') -PUBLIC CLASS:'IS_A' SEND(CLASS, 'ADD_METHOD', 'IS_A', 'IS_A') :(OOP_END) * * IS_A - IS OBJECT IN CLASS? ACLASS CAN BE A STRING WITH A CLASS NAME * OR A CLASS OBJECT * IS_A T1 = THIS IS_A_2 T1 = CLASS(T1) IDENT(T1) :S(FRETURN) IDENT(T1, ACLASS) :S(RETURN) IDENT(IVARS(T1)<'CLASS'>, ACLASS) :S(RETURN)F(IS_A_2) * * ACCESS INSTANCE VARIABLE. CREATE THE INSTANCE VARIABLES IF THEY DO * NOT YET EXIST. * IVAR IVARS(THIS) = IDENT(IVARS(THIS)) TABLE() IVAR = .(IVARS(THIS)<NAME>) :(NRETURN) * * ACCESS CLASS VARIABLE * CVAR IVARS(CLASS(THIS)) = IDENT(IVARS(CLASS(THIS))) TABLE() CVAR = .(IVARS(CLASS(THIS))<NAME>) :(NRETURN) * * CLASS_OF RETURNS THE NAME OF THE CLASS OF THE PASSED OBJECT. THE * CLASS NAMES SHOULD BE UNIQUE WITHIN A PROGRAM. THE ROOT CLASS HAS * NAME 'CLASS' (ROOT'S SUPERCLASS IS NULL) * CLASS_OF CLASS_OF = IVARS(CLASS(OBJ))<'CLASS'> :(RETURN) * * FIND METHOD BEGINNING AT OBJ SEARCHING UP TO THE ROOT CLASS * FIND_METHOD M_CLASS = IDENT(OBJ) :S(FRETURN) C = OBJ FIND_METHOD2 FIND_METHOD = VDIFFER(METHODS(C))<METHOD> DIFFER(FIND_METHOD) :F(FIND_METHOD3) M_CLASS = C :(RETURN) FIND_METHOD3 IDENT(C = CLASS(C)) :S(FRETURN)F(FIND_METHOD2) * * DISPATCH TO THE PARENT CLASS. THAT, IN TURN, MAY DISPATCH TO ITS * PARENT. THIS IS USED WITH 'INIT' (FOR EXAMPLE). * * TO IMPLEMENT SUPER, WE WANT TO START SEARCHING WITH THE CLASS OF THE * CLASS WE FOUND THE METHOD IN. THIS IS IN LOCAL SEND() VARIABLE * M_CLASS WHICH IS SET IN FIND_METHOD. * SUPER SUPER = THIS IDENT(M_CLASS) :S(RETURN) M = FIND_METHOD(CLASS(M_CLASS), METHOD) :F(RETURN)S(SEND_3) * * DISPATCH METHOD FROM WITHIN A METHOD * SELF SELF = THIS :(SEND_2) * * DISPATCH METHOD TO OBJECT.  * %IF(SAFE) IDENT(THIS) :S(FRETURN) IDENT(DATATYPE(THIS), 'OBJECT') :S(SEND_2) TERMINAL = 'SCOOP: SEND NEEDS OBJECT AS RECEIVER' :(END) %ENDIF * SEND_2 M = FIND_METHOD(THIS, METHOD) :S(SEND_3) M = FIND_METHOD(THIS, 'DOES_NOT_UNDERSTAND') :S(SEND_3) * * THIS ERROR SHOULD NOT HAPPEN! (THE ROOT CLASS SHOULD ALWAYS ANSWER * DOES_NOT_UNDERSTAND). * TERMINAL = + 'SCOOP: ROOT CLASS MISSING DOES_NOT_UNDERSTAND' :(END) * * WE HAVE THE METHOD, DISPATCH IT.  * * IF THE METHOD IS CODE, EXECUTE IT. OTHERWISE, APPLY M TO THE PASSED * ARGUMENTS. * SEND_3 IDENT(DATATYPE(M), 'CODE') :S<M> SEND = APPLY(M, A1, A2, A3, A4, A5, A6, A7, A8) + :S(RETURN)F(FRETURN) * OOP_END @
«unit_test»≡ #!/usr/bin/bash exec "snobol4" "-b" "$0" "$@" -INCLUDE 'SCOOP.INC' -INCLUDE 'TIMER.INC' &CODE = 1 SHAPE_CLASS = SEND(CLASS, 'NEW_CLASS', 'SHAPE') SQUARE_CLASS = SEND(SHAPE_CLASS, 'NEW_CLASS', 'SQUARE') CIRCLE_CLASS = SEND(SHAPE_CLASS, 'NEW_CLASS', 'CIRCLE') * M = CODE(' EQ(A1, 5) :F(END)S(RETURN)') SEND(SHAPE_CLASS, 'ADD_METHOD', 'AMETHOD', M) * SQUARE = SEND(SQUARE_CLASS, 'NEW') SEND(SQUARE, 'AMETHOD', 5) * IDENT(CLASS_OF(SQUARE), 'SQUARE') :F(END) IDENT(CLASS_OF(CLASS(SQUARE)), 'SHAPE') :F(END) IDENT(CLASS_OF(CLASS(CLASS(SQUARE))), 'CLASS') :F(END) * SEND(SQUARE, 'IS_A', SQUARE_CLASS) :F(END) SEND(SQUARE_CLASS, 'IS_A', 'SHAPE') :F(END) SEND(SQUARE, 'IS_A', 'CIRCLE') :S(END) * * TIME METHOD DISPATCH WHERE THE METHOD IS IN A SUPERCLASS * TIMER(" SEND(SQUARE, 'AMETHOD', 5) ") * * TIME METHOD DISPATCH WHERE THE METHOD IS IN THE CLASS * SEND(SQUARE_CLASS, 'ADD_METHOD', 'AMETHOD', M) TIMER(" SEND(SQUARE, 'AMETHOD', 5) ") * * TIME METHOD DISPATCH WHERE THE METHOD IS IN THE OBJECT * SEND(SQUARE, 'ADD_METHOD', 'AMETHOD', M) TIMER(" SEND(SQUARE, 'AMETHOD', 5) ") * &CODE = 0 END @
«»≡ -MODULE SCOOP «INCLUDES» -IN72 -EJECT -STITL SCOOP -EJECT * ************************************************************************ * * * ##### ##### ####### ####### ###### * * # # # # # # # # # # * * # # # # # # # # * * ##### # # # # # ###### * * # # # # # # # * * # # # # # # # # # * * ##### ##### ####### ####### # * * * * SCOOP OBJECT ORIENTED PROGRAMMING * * * ************************************************************************ * * SCOOP.lss * * THE SAFETY FLAG. IF 0, SOME CHECKS ARE NOT COMPILED IN. I RECOMMEND * THAT IT ALWAYS BE ENABLED. * %SET(SAFE,1) «SCOOP» * * CE: .F.MSNOBOL4; @


Disney reveals launch date for streaming service in UK and Ireland
Disney will roll out its online streaming service in the UK and Ireland next year.
The competitor to the likes of Netflix and Amazon will expand into Europe in March 2020.
Disney + will host classic content from the animating giant, with a possible back catalogue of The Avengers and the recent Star Wars films.
The company announced online that the streaming service would launch in the UK, Ireland, Germany, France, Italy and Spain from March 31.
Upcoming Disney production The Mandalorian is also set to feature on the service.
A Star Wars instalment, The Mandalorian, takes place after the fall of the Empire in 1983’s The Return Of The Jedi.
More Disney originals are expected to populate the streaming service.


Team Head Back-end developer, UI Designer and Model architect. Deep learning and Machine learning enthusiast.
Team Lead Model architect, content writer and UI Designer. Deep learning enthusiast. A sophomore pursuing B.Tech CSE from VIT University, Vellore
Co Team Lead Front-end developer | Master’s in Data Science | University of Alabama at Birmingham, United States
Back-end developer| Machine Learning Engineer| B.tech CH from Dr. A.P.J. Abdul kalam Technical University.
Full stack developer | Graduating 2020 | B.tech CSE from Dr. Abdul kalam Technical University Uttar Pradesh
Front-end developer,Data Analyst,Machine Learning Engineer| A Junior pursuing B.Eng CHG from University of Lagos,Nigeria.\
Front-end developer,Data Analyst,Machine Learning Engineer,ACM-ICPC Regionalist '20| 4th year B.tech CSE from IARE.


Variables in Ruby, as in any other programming language, are a frequent and integral part of the language. Variables are used to assigned and reassigned values that will then be reused through out your program. This is beneficial because it cuts down you having to type out the same long string or block of code multiple times and when you have to manipulate or alter that variable, you only have to do it in one place rather than search through your code and find every instance of it's occurrence. Not all variables are the same, however. In ruby there are five different types of variables for you to use.
1. Local Variables
The most frequently used variable is the local variable. These must start with either an underscore or a lower case letter and can be initialized like so:
x = 0
greeting = "Hello World"
too_many_greetings = 10.times { puts greeting }
As the name would suggest, local variables can only be used within the immediate segment of code in which it was defined, be it a loop, code block, a class, a method, or so on. To test this, let's start out with some dull iron and see if we can turn it into a more lustrous metal.
base_metal = "Iron"
def alchemy!
noble_metal = ["Platinum", "Gold", "Silver"].sample
base_metal = noble_metal
end
alchemy!
puts base_metal
# ==> Iron
This looks like a promising method and a surefire way to get rich quick. Sadly though, we are only transmuting our local variable base_metal within the method and so our "Iron" remains as unimpressive as ever.
2. Global Variables
Global variables always start with the dollar sign ($) and can not only be accessed from anywhere within your code but they can also be changed from anywhere as well. For this reason they are commonly discouraged as they can lead to very difficult bug tracking. At the moment, however, they may help us with our alchemy problem! Let's try initializing our variable with global scope this time and see what we get:
$base_metal = "Iron"
def alchemy!
noble_metal = ["Platinum", "Gold", "Silver"].sample
$base_metal = noble_metal
end
alchemy!
puts $base_metal
# ==> either Platinum, Gold, or Silver
3. Class Variables
Class variables are kind of like global variables that can only be referenced within it's class and it's classes descendants. If one instance of a class variable is changed, every other instance of that variable will be changed as well. These are initialized with a double @ symbol (@@). Let's take a look:
class Metals
def initialize(metal)
@@metal = metal
end
def show_metal
@@metal
end
end
class Base_Metals < Metals
end
class Noble_Metals < Base_Metals
end
metal = Metals.new("Copper")
base_metal = Base_Metals.new("Iron")
noble_metal = Nobel_Metals.new("Gold")
puts noble_metal.show_metal # ==> Gold
puts base_metal.show_metal # ==> Gold
puts metal.show_metal # ==> Gold
Even though we created three different instances of three different classes and initialized them with different metals when we printed them out they all returned Gold. This is because ever time a new class was created our class variable, @@metal, was over written.
If we wanted to avoid this result, we can use instance variables!
4. Instance Variables
Instance variables are initialized with a single @ sign. They are to class variables as local variables are to global variables. These variables can exist within multiple objects but when a change is made to an instance variable, that change is only effects the instances of the variable within the object in which the change was made. If we look at our previous example but swap in an instance variable we will see that we now receive three different results.
class Metals
def initialize(metal)
@metal = metal
end
def show_metal
@metal
end
end
class Base_Metals < Metals
end
class Noble_Metals < Base_Metals
end
metal = Metals.new("Copper")
base_metal = Base_Metals.new("Iron")
noble_metal = Nobel_Metals.new("Gold")
puts noble_metal.show_metal # ==> Gold
puts base_metal.show_metal # ==> Iron
puts metal.show_metal # ==> Copper
5. Constant Variables
Constant variables are variables that, once set, though they can be changed, are not intended to be and will throw a warning when the program is run. They are defined in ALLCAPS and when defined inside of a class or module are accessible from within that same class or module and when defined outside of either, are accessible globally.
CONSTANT = "You better not try and change me!"


We're sorry but runde-mobile doesn't work properly without JavaScript enabled. Please enable it to continue.


{% extends "solution.html" %}
{% block puzzle-author %}
Galactic Trendsetters
{% endblock %}
{% block solution-body %}
The pictures clue STOP and TIME. With the title, the rebus clues the lyric "Stop! Hammertime". The answer is HAMMER.
{% endblock %}


n ancient manuscripts, another means to divide sentences into paragraphs was a line break (newline) followed by an initial
at the beginning of the next paragraph. An initial is an oversized capital letter, sometimes outdented beyond the
margin of the text. This style can be seen, for example, in the original Old English manuscript of Beowulf. Outdenting
is still used in English typography, though not commonly. [2] Modern English typography usually indicates a new
paragraph by indenting the first line.


Cutout Pro
|
Example
|
Manual
|
"This site requires Javascript enabled"
Watch the 'funky' tutorial on YouTube!
From Date:
Start Hour:
End Hour:
Want more?
Links
|
Pxl


About
Yet another web interface to database of packages and files from official Slackware releases. Database is loaded with packages from Slackware 8.1 and newever.
As have been already said, this is just another "package browser"
in regards to deceased site http://packages.slackware.it
which we do (did) miss so much.
This site has its origins in http://packages.slackverse.org
as I've been around its birth and somewhat "assisted", if one could
call it like that. Since I wanted to take different approach
to the problem and I've missed some features, this is the result.
Why? Because it has been a challange - brain teaser - and I like these :)
I do plan to publish code and scripts, but my beloved "licensing" takes time. For now, the whole application consists of bunch of Bash and Perl scripts; web part is done by CGI (and I'd love to try mod_perl or FastCGI) and database backend is supported by PostgreSQL and SQLite.
I think enough said.
Enjoy,
Zdenek Styblik
Thanks
I'd like to say thanks to ax for providing me with subdomain in slackware.eu
More info
Some things that might be of your interest.
Mirrors
Mirrors are synchronized every two days. Removed mirrors from main site are removed [here] after 7 resp. 8 days.
Search
Currently, the searched string is matched as %needle%.
This means the string is matched wherever that might be. However, this
is likely (and hopefully) to change in the future.
You can choose categories to narrow down the search. These are
matched as: CONDITIONS AND (cat OR cat ... OR cat)
Search CLI
SearchCLI can be called "feature". It's supposed to allow you query
database from terminal, if you are in need to find package or which
package contains file you're looking for. Look-up can be achieved via
this script, however you can
write your very own if you want.
Syntax is as follows:
% sh slacksearch.sh <file|package> <needle> [slackware version];
I must note % slackpkg can search for files too.
Slackware - new release
Check for new release is done twice a day (= every 12 hours [still not done])
Slackware synchronization
Is done every 30 minutes
Would it be possible to scan other repositories?
Yes, pretty much anything that has MANIFEST file. However, I haven't considered this one yet, and there are other sites that do this job.


Merry Christmas
Home
(current)
About Us
Events
Pages
Blog
Blog Details
Login
Register
Contact Us
Login
Register
Email address
Password
Password
I accept
terms and conditions
.
Register
Already have account? Sign in Here.
You are at best bootstrap HTML tempaltes.
Only at
www.bootstraptemplatedesign.com
×
Sign in
Email address
Password
Remember me
Forgot Password?
Sign in
Don't have account? Register Here.
You are at best bootstrap HTML tempaltes.
Only at
www.bootstraptemplatedesign.com


Title: {{ object.filename }}
Transfer Institution: {{ object.transferInstitution.name }}
Transferee Institution: {{ object.transfereeInstitution.name }}
Size: {{ object.filesize }}
Type: {{ object.mimetype }}
Institutional Program Relations
Transfer Program
Transferee Program
{% for relation in relations %}
{% endfor %}


#include <math_ops.h>
Computes the product along segments of a tensor.
Read the section on segmentation for an explanation of segments.
This operator is similar to the unsorted segment sum operator found (here). Instead of computing the sum over segments, it computes the product of all entries belonging to a segment such that:
\(output_i = {j...} data[j...]\) where the product is over tuples j...
such that segment_ids[j...] == i
.
If there is no entry for a given segment ID i
, it outputs 1.
If the given segment ID i
is negative, then the corresponding value is dropped, and will not be included in the result.
Arguments:
data.shape
.Returns:
Output
: Has same shape as data, except for the first segment_ids.rank
dimensions, which are replaced with a single dimension which has size num_segments
.
Constructors and Destructors |
|
|---|---|
UnsortedSegmentProd(const ::tensorflow::Scope & scope, ::tensorflow::Input data, ::tensorflow::Input segment_ids, ::tensorflow::Input num_segments)
|
Public attributes |
|
|---|---|
operation
|
|
output
|
Public functions |
|
|---|---|
node() const
|
::tensorflow::Node *
|
operator::tensorflow::Input() const
|
|
operator::tensorflow::Output() const
|
|
Operation operation
::tensorflow::Output output
UnsortedSegmentProd( const ::tensorflow::Scope & scope, ::tensorflow::Input data, ::tensorflow::Input segment_ids, ::tensorflow::Input num_segments )
::tensorflow::Node * node() const
operator::tensorflow::Input() const
operator::tensorflow::Output() const


A Program Synthesis Primer
Aws Albarghouthi
My colleague Somesh Jha recently asked me to give a lecture on program synthesis to his class. As I prepared my notes, I realized that a single lecture is long enough to formally define the problem and code up some cool examples that demonstrate the process. This post contains the notes and code I used in class. I go through two simple examples in this post; the full code is on GitHub.
What is program synthesis anyways?
In the fields of programming languages and verification, the traditional problem of program synthesis involves constructing a program from a high-level mathematical specification. For example, suppose you want to write a program that computes the factorial of a number $n \gt 1$. You start with the mathematical definition of factorial, $ n! $, and you gradually massage it—rewrite it using your knowledge of the properties of factorial and mathematics—until you get to an executable program.
While lofty in its goals and rich in its tradition, this synthesis approach—called deductive synthesis—has had limited success. Simply, mathematical specifications are hard to write, and turning a specification to a program is very hard to automate.
Combinatorial synthesis
Recently, researchers have been looking at forms
of synthesis that are simpler to automate.
The style of synthesis I will focus on here is
the one pioneered in the Sketch project.
The idea is that we start with a reference implementation p_naive
.
Think of this as the naive solution of a problem
that you’re sure works correctly, but that you won’t put into production, perhaps because it’s pretty inefficient.
Your goal is to find a program p_smart
that is equivalent to p_naive
,
but that is more efficient and hard to get right.1
For illustration, let’s look at an extremely simple example.
The naive program is the following,
where for simplicity we assume all ints
are bitvectors with an 8-bit width.
int p_naive(int x):
y = x * 2
return y
You, as a smart (but not very smart) programmer, think
that you can do better by writing a program of the following
form, but you’re not sure what to place in the ??
int p_smart(int x):
y = x << ?? // the operator << is shift left
return y
In a sense, p_smart
represents a family
of programs—all possible instantiations of the hole ??
.
Of course, the right completion here is replacing
the hole with 1
.
Automating synthesis
So how do we automatically find the value of ??
that makes p_smart
equivalent to p_naive
.
Easy! There are $ 2^8 $ different instantiations
of ??
, so we enumerate
them until we find the right one.
In general this incurs a combinatorial explosion.
We cannot avoid the combinatorial problem,
but it turns out we can neatly characterize the
search space as a formula that we can give to an efficient
off-the-shelf solver—as we will see in a bit.
First, let’s try to gradually formalize the problem.
We will use the variable h
to denote the hole ??
.
Definition 1
Find a value* for h
such that for all values of x
,
p_naive(x) == p_smart(x)
.
Definition 2
We can think of h
as
an input to p_smart
.
So, our goal is really to
find a value for h
such that for all values of x
,
p_naive(x) == p_smart(x,h)
.
Definition 3
Now, we can view a program, say, p_naive
,
as a logical relation $ \varphi_n(x,y) $
over its input and output variables, $ x $ and $ y $.
The idea is that the relation is true if and only
if p_naive(x) == y
.
So, our goal is really to find find a value for $ h $ such that for all values of $ x $ and $y$, we have $ \varphi_n(x,y) \iff \varphi_s(x,h,y) $ is true.
Final definition
Finally, we are ready to state the problem logically. Find a satisfying assignment of the following formula \(\forall x,y \ldotp \varphi_n(x,y) \iff \varphi_s(x,h,y)\) Notice that the variable $ h $ is free. Therefore, any satisfying assignment of this formula is only over $ h $.
At this point, we have completely reduced the synthesis problem to solving a logical formula. We can do this with an SMT solver like Z3.
A detailed example
We can now apply the above
process to encode p_smart
and p_naive
as formulas.
We will encode them in the first-order theory of bitvectors,
which has all the standard operations we care about.
We will now encode those in Z3 using its Python API as follows.
First, we define all the variables as 8-bitvectors.
The code for this example is available on GitHub
x = BitVec('x',8)
y = BitVec('y',8)
h = BitVec('h',8)
Next, we encode $ \varphi_n $ and $ \varphi_s $:
phi_n = y == x * 2
phi_s = y == x << h
Finally, we are ready to invoke Z3:
# first, encode the universally quantified formula
# (the == symbol is if and only if)
encoding = ForAll([x,y], phi_n == phi_s)
# second, call Z3 and check if there is a model
s = Solver()
s.add(encoding)
s.check()
# print the model (i.e., the value of h)
print s.model()
If you run this code, you will get the output [h = 1]
,
just as expected!
Test-driven synthesis
The approach presented above works over two programs: it tries to find a program that is equivalent to some reference implementation. Instead of writing a full-blown reference implementation, we will now just write some test cases, and find a program that passes all of them. You could think of this as test-driven development on steroids!
Say we want to write a function that, given
bitvector x
, returns a bitvector y
that is 1 in the
position of the first 0 from the right occuring in x
, and 0 everywhere else.2
For example,
# test 1
x = 00000000
y = 00000001
# test 2
x = 00000011
y = 00000100
# test 3
x = 00000010
y = 00000001
Suppose you have the following hunch on how to write such a program efficiently:
y = (~(x + ??)) & (x + ??)
Here ~
is bitwise not and &
is bitwise and.
Our goal is to find solutions to the two holes
that result in our desired program.
Just as before, we encode the program as a logical relation:
\[\varphi_s \equiv y = (\sim(x + h_1))\ \&\ (x + h_2)\]Note how we encoded the two holes as two variables.
Similarly, we can encode the test cases as a relation:
\[\varphi_t \equiv t_1 \lor t_2 \lor t_3\]where
\[t_1 \equiv x = 0 \land y = 1\\ t_2 \equiv x = 3 \land y = 4\\ t_3 \equiv x = 2 \land y = 1\]Finally, we solve the following formula:
\(\forall x, y \ldotp \varphi_t \Rightarrow \varphi_s\)
Observe that we have an implication and not an equivalence
between the two relations.
Intuitively, the relation defined by the test cases
is small and does not define the behavior other than for
the 3 test cases we’ve supplied.
So what we’re looking for is a program p_smart
where all
test cases appear in (or are a subset of) its relation.
Let’s encode this in Z3. The process is similar to what we saw above:
The code for this example is available on GitHub
phi_s = y == (~(x + h1)) & (x + h2)
t1 = And(x == 0, y == 1)
t2 = And(x == 1, y == 2)
t3 = And(x == 2, y == 1)
phi_t = Or(t1,t2,t3)
encoding = ForAll([x,y], Implies(phi_t, phi_s))
Solving the formula encoding
,
we get [h2 = 1, h1 = 0]
, which results in a correct program.
Since we are dealing with test cases,
the test cases we supply may be insufficient to force the SMT
solver to find the right program; in such case,
you can supply more tests.
For example, if I just give Z3 test 3, on my machine I get
[h2 = 15, h1 = 14]
, which is incorrect (check it).
Conclusion
We looked at a combinatorial form of program synthesis, where we define the search space as a program with holes. You might wonder how to encode control-flow, and not only holes that are replaced with consants. A great paper to read is Synthesis of Loop-free Programs.
The idea of searching the space of programs has recently been explored in a wide array of settings. It turns out that handing the problem to the SMT solver is not always the right way to go; sometimes a custom enumeration algorithm outperforms SMT solvers. SMT solvers, however, are very good at finding magic constants, which simple enumeration may never get to. So, in bit-twiddling problems, symbolic encodings like the one shown here are the way to go.
-
“But this is what an optimizing compiler does!” you protest. Yes! But here we are taking a combinatorial approach: a compiler applies a fixed set of tricks to get to an efficient program; here we will manually define a space of programs, and search it exhaustively until we find the right one. In some sense, we are doing superoptimization. ↩
-
Example borrowed from Sketch project and found through Loris D’Antoni’s notes. ↩


Let's build the bond from scratch.
Behind every great event, there is a creative story. The story is always born out of a desire to create a truly memorable event by focusing on valuable clients. The business was founded years back following our dream to have a successful small, bespoke yet passionate and experienced team to provide value for services. We have picked a group because of their obsession with the industry and their extensive years of experience and dedication for the event management industry. At SIPA Events, we go the extra mile to deliver ultimate satisfaction and perfection in every event we manage. We offer several services to help plan everything smoothly from start to finish and take your all stress away. This is exactly what we do every day and our expertise, combined years of experience, and knowledge in event management and audio visual production allow us to serve the customers personally and professionally.
We at SIPA Events, offer 360 degree panorama services for corporate events, weddings, government events, sports, cultural, award ceremonies, etc. Over the years we have emerged as an eminent name in the field of corporate and personal event management. We specialize in executing exclusive events, thereby distinguishing ourselves as an organization of repute. Our proficient and hospitable team makes sure that our clients have hassle free events that are worth cherishing. Our experts gauge clients’ needs and give a personalized solution to fulfill the same. On the back of our extensive experience, we analyze the requirements and vision of clients and provide them customized services. Our years of experience and innovative approach help us interpret the requirements and enable us to execute a successful event that not just meets but exceeds the anticipations.
As one of the creative and leading event management company in Central India, We always try new creations For our customers.
SIPA Events endeavors to be the most leading energetic and vibrant globally acclaimed Event Management Company fueled by imagination, innovative ideas and passion of bestowing our esteemed clients with unforgettable memories. BY 2020, we aim to become the leading Event management company creating world class events and infusing newer talents, thereby, contributing to the glamour industry in a substantial way.
Our work philosophy is a bit different. Unlike others, we want to win with our customers. We want to develop a true, long-term, and trusted relationship that our customers enjoy, respect, and know that we always take responsibility. Our mission is to make our clients' events better and better continuously.
We like the variation because it helps us to be an expert and professional event planner company. That’s something that makes us different from others— we are open for challenges, and always ready to serve the best and exceed the expectations.
Lorem ipsum dolor, sit amet consectetur adipisicing elit. Natus veritatis ipsam neque dolorem modi nesciunt?


The REST API allow access to models, proposals and feature data hosted on InfraWorks 360 cloud.
To use the API it's required to, first, create a model using InfraWorks 360 desktop and then sync to Autodesk Cloud, then the model will be available for sharing through the REST API.
Find out more about InfraWorks 360.
Using the web standard REST protocol, you can read InfraWorks 360 model data, starting with models, each proposal and all the features.
Here a general overview of the API: it access the model information hosted/synched on Autodesk 360 Cloud just like the deskop or the table (iPad) version.
To play with the Autodesk InfraWorks 360 REST API you'll need a model. If you already have one, go ahead and login with your Autodesk Account (the same credential you use to created/edit models). If you don't have one, try with the demo account: iw360demo (login & password).
Show nearby venues: InfraWorks 360 + Four Square + Google Maps (source code)
Show buildings in "3D": InfraWorks 360 + Google Maps (source code)
To create your app, please send a message to Augusto Goncalves to request your key & secret pair. Meanwhile, check out useful information from the below links:
InfraWorks 360 REST API documentation
Autodesk InfraWorks 360 General Forum


Get Logo Dtop Background. 233,000+ vectors, stock photos & psd files. The dtop logo design and the artwork you are about to download is the intellectual property of the copyright and/or trademark holder and is offered to you as a convenience for lawful use with proper.
Use our free logo maker to create a logo and build your brand. Customize a logo for get a free logo for your website, business cards or correspondence. We recommend having a designer customize your free.
Find & download free graphic resources for logo.
Create your logo design online for your business or project. Customize a logo for get a free logo for your website, business cards or correspondence. Create your logo design online for your business or project. Download dtop logo only if you agree:


public class LXmDNSDiscoverer
extends java.lang.Object
implements java.lang.Runnable
LXUPnPDelegate
| Modifier and Type | Field and Description |
|---|---|
LXmDNSDelegate |
delegate
A delegate to receive the foundURLBase() call when a device description
matching the target string is located and read.
|
static int |
LXMDNS_PRINT_ALL |
static int |
LXMDNS_PRINT_ERRORS |
static int |
LXMDNS_PRINT_SILENT |
static byte[] |
MDNS_MULTICAST_ADDRESS |
static int |
MDNS_MULTICAST_PORT |
| Constructor and Description |
|---|
LXmDNSDiscoverer(java.lang.String target,
int type) |
| Modifier and Type | Method and Description |
|---|---|
void |
close()
stops the search and closes the multisocket if it exists
|
static LXmDNSDiscoverer |
createLXmDNSDiscoverer(java.lang.String networkInterface,
java.lang.String networkAddress,
java.lang.String target,
int type,
int printing)
Factory method to create an LXmDNSDiscoverer
|
static void |
printError(int level,
java.lang.String estr) |
void |
printError(java.lang.String estr) |
void |
printMessage(java.lang.String mstr) |
int |
readPacket()
Attempt to read an mDNS packet from multisocket
|
LXDNSReplyRecord |
readReplyRecordFromPacket(byte[] bpacket,
int start,
boolean isQuery) |
LXDNSReplyRecord |
readReplyRecordFromPacket(byte[] bpacket,
int start,
boolean isQuery,
boolean labelsOnly) |
void |
run()
run is used to execute search/discovery on a thread
|
void |
sendSearch()
sends a question record asking for A type, IN class records matching targetName
|
void |
setDelegate(LXmDNSDelegate d) |
void |
setPrintLevel(int v) |
void |
setSearchMode(boolean sm) |
static void |
startDiscovery(java.lang.String networkInterface,
java.lang.String networkAddress,
java.lang.String target,
int type,
LXmDNSDelegate d,
int printing) |
public static byte[] MDNS_MULTICAST_ADDRESS
public static int MDNS_MULTICAST_PORT
public LXmDNSDelegate delegate
public static int LXMDNS_PRINT_SILENT
public static int LXMDNS_PRINT_ERRORS
public static int LXMDNS_PRINT_ALL
public LXmDNSDiscoverer(java.lang.String target, int type)
target
- string to look for in fully qualified domain name stringtype
- is the type of record desiredpublic void setDelegate(LXmDNSDelegate d)
d
- LXmDNSDelegate to receive notification of records and queries receivedpublic void setPrintLevel(int v)
v
- level of messages printed, LXMDNS_PRINT_SILENT, LXMDNS_PRINT_ERRORS, or LXMDNS_PRINT_ALLpublic void setSearchMode(boolean sm)
sm
- sets search modepublic void printError(java.lang.String estr)
estr
- is printed unless silentpublic static void printError(int level, java.lang.String estr)
level
- to check if not silentestr
- is printed unless silentpublic void printMessage(java.lang.String mstr)
mstr
- is printed unless silentpublic void run()
run
in interface java.lang.Runnable
public LXDNSReplyRecord readReplyRecordFromPacket(byte[] bpacket, int start, boolean isQuery)
public LXDNSReplyRecord readReplyRecordFromPacket(byte[] bpacket, int start, boolean isQuery, boolean labelsOnly)
public int readPacket()
public void sendSearch()
public void close()
public static LXmDNSDiscoverer createLXmDNSDiscoverer(java.lang.String networkInterface, java.lang.String networkAddress, java.lang.String target, int type, int printing)
networkInterface
- if not null, searches for an InetAddress associated with the named interface (eg "en0")networkAddress
- specific IP address to use for binding socket. Can be null if networkInterface is specifiedtarget
- is the desired name passed to the LXmDNSDiscoverer constructortype
- is passed to the LXmDNSDiscoverer constructorprinting
- indicated what level of messages should be printedpublic static void startDiscovery(java.lang.String networkInterface, java.lang.String networkAddress, java.lang.String target, int type, LXmDNSDelegate d, int printing)


vignettes/configuration.Rmd
configuration.Rmd
vcr
configuration
Use vcr_configuration()
to get the current configuration.
You can also get the default configuration variables via vcr_config_defaults()
These defaults are set when you load vcr
- you can override any of them as described below.
Use vcr_configure()
to set configuration variables.
For example, set a single variable:
Or many at once:
The record mode
One of: ‘all’, ‘none’, ‘new_episodes’, ‘once’. See ?recording
for info on the options
Allow HTTP connections when no cassette
Default is TRUE
, and thus does not error when http interactions are unused. You can set to FALSE
in which case vcr errors when a cassette is ejected and not all http interactions have been used.
Specify particular hosts to ignore. By ignore, we mean that real HTTP requests to the ignored host will be allowed to occur, while all others will not.
Which uri parser to use
By default we use crul::url_parse
, but you can use a different one. Remember to pass in the function quoted, and namespaced.
Some HTTP servers are not well-behaved and respond with invalid data. Set preserve_exact_body_bytes
to TRUE
to base64 encode the result body in order to preserve the bytes exactly as-is. vcr
does not do this by default, since base64-encoding the string removes the human readability of the cassette.
A named list of values to replace. Sometimes your package or script is working with sensitive tokens/keys, which you do not want to accidentally share with the world.
Before recording (writing to a cassette) we do the replacement and then when reading from the cassette we do the reverse replacement to get back to the real data.
Before recording to disk, the env var MY_API_KEY
is retrieved from your machine, and we find instances of it, and replace with <some_api_key>
. When replaying to create the HTTP response object we put the real value of the env var back in place.
Check out the http testing book for a lot more documentation on vcr
, webmockr
, and crul


microformat-node
Type or copy and paste the HTML you want to parse into the box below.
HTML  Glenn Jones
BaseURL
Filters
Experimental ‐ Block overlapping properties from different microformat versions
Experimental ‐ Set implied properties by microformat version
Experimental ‐ Parse h-geo writen as 30.26;-97.73 into latitude and longitude
whitespacetrimmed normalised Experimental ‐ Text Formatting
auto microformat2 w3c html5 rfc3339 Experimental ‐ ISO date profile


| Identify Chart | Professional | Personal |
|---|---|---|
| Identity | Bernina Gray | User handles/Alias |
| Channels | LinkedIn, Twitter | Facebook, IG, Twitter | Content | Work History, Skills | Family photos, Artwork, Memes |
The photo on the left represents my feelings towards previous positions I've held at work. I was at the beach, or at my job,
making money and although I'm ok and am enjoying myself, I'm still feeling like there's something better for me. Therefore, I'm the
person looking outward toward the water instead of working on the sandcastle.
The second image is me after bootcamp, I see myself leading others and helping them at their current jobs, making their workflwo easier
and manageable, whether it be with the current software or websites they're using or new ones that we're creating and implementing.


Kevin Beswick
Nushrat Khan
Bret Davidson
| Lecture | 30 mins |
| Technical Orientation | 10 mins |
| Hands-on exercise part 1 | 45 mins |
| Break | 10 mins |
| Lecture | 15 mins |
| Hands-on exercise part 2 | 60 mins |
| Q/A | 10 mins |
There are 2 different ways of combining DataFrames in Pandas:
Join 2 tables by taking only rows where "foreign key" exists in both tables
Join 2 tables by taking all rows from left table, and leaving all row values in right table where "foreign key" doesn't exist as null
Data cleaning is an important step before we can manipulate our data. We will show some examples of how to get rid of duplicate values, remove null values, special characters etc.
Sorting makes it easier to read or locate any specific data. We can also group by particular variables to apply other functions to them.
Pandas has functions to transform data formats, such as changing date format, converting data to a different unit. We can also define functions to perform a specific transformations over a row or column.
After manipulating data, visualization is the final step that helps us communicate the meaning of the data with our audience. We will show examples of the following basic plot functions:


curl [options] [URL...]
Reference: link1 Reference: link2
To create a content node (for some reason default "primaryType" is "sling:OrderedFolder"):
curl -u admin:admin -F"sling:resourceType=foo/bar" -F"title=some title" http://localhost:8080/content/mynode
The resulting node
curl http://localhost:8080/content/mynode.json
or
curl http://localhost:8080/content/mynode.html
But without the specified html-renderer html kind of request shows nothing.
To render the html version - store the script:
Create the directory first:
curl -X MKCOL -u admin:admin http://localhost:8080/apps/foo
curl -X MKCOL -u admin:admin http://localhost:8080/apps/foo/bar
Then upload the prepared script:
curl -u admin:admin -T html.esp http://localhost:8080/apps/foo/bar/html.esp
Example of a script

<%= currentNode.title %>

TODO: "additional examples" section will be added later...


Yes! I was absolutely furious with a colleague, so much so I almost avoided going to the team meeting, in order to avoid the colleague. But, few minutes into the meeting [it was one of those meetings that required a break half way through], I decided get a cup of coffee. On the way back, I passed my colleague, and decided to make a peace offering, by offering a cup of coffee to the same colleague. It somehow felt good to get rid of my 'Darth Vader' thoughts and use the force for good. It just took a cup of coffee to feel the force!
A new colleague had to go away to another town for the funeral of a family member. When he came back, I had a chance to ask him how he was. I thought it was appropriate despite not knowing him well. I asked with kindness. He was surprised but seemed happy to be asked. I then asked him about the family member who passed away. We sat down in the lunch room and talked about his uncle for about 20 mins or so. I got to meet the new staff member and found out about his uncle too. It wasn't easy to get started but he appreciated the time and attention. I think I would too.
"Kindness is a sustainable source of happiness" Tan, 144
Metta Bhavana -
I like the loving kindness meditation but whether I'll be practising it properly is another matter. I think it's really hard to 'love' someone and show kindness to that person who has caused you so much strife! But, tryin to see things from their perspective is a good starting point.
"If you understand people and you understand the interactions between them, you will understand the whole organization."
The political awareness exercise goes here
The Five Dysfunctions of a Team
Establishing trust


@* * Copyright 2021 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import includes.ptaHeader @import uk.gov.hmrc.tai.viewModels.taxCodeChange.YourTaxFreeAmountViewModel @import includes.taxFreeAmountSummaryComparison @import uk.gov.hmrc.urls.Link @(currentTaxFreeAmount: YourTaxFreeAmountViewModel)(implicit request: Request[_], user: controllers.auth.AuthedUser, messages: Messages, templateRenderer: uk.gov.hmrc.renderer.TemplateRenderer, partialRetriever: uk.gov.hmrc.play.partials.FormPartialRetriever) @gaEventActionString = @{"Your tax-free amount"} @header = @{ ptaHeader( formForErrorSummary = None, displayBackLink = true, backLinkGaEventAction = Some(gaEventActionString), mainHeadingText = Messages("taxCode.change.yourTaxFreeAmount.title"), preHeadingText = Messages("taxCode.change.journey.preHeading")) } @main( title = Messages("taxCode.change.yourTaxFreeAmount.title"), articleClasses = Some("full-width"), pageHeader = Some(header), authedUser = Some(user), gaCustomTitle = None ) {
@Messages("taxCode.change.yourTaxFreeAmount.desc")


Calea Zacatechichi Smoked/Tea
I was a bit skeptical of this plant at first, as I'd read a number of mixed reports.
After testing myself for allergic reaction with two leaves under the tongue (a tip thanks to another Erowid contributor), I prepared a sizable amount of Calea Zacatechichi in a clean pipe, and settled down to smoke it while I simmered a generous amount of leaves and stems into a tea. Fifteen minutes later, I managed to get the tea down without too much trouble. The reports of the disagreeable flavor were quite true. Sugar seemed to make it worse.
The first effect I noticed was that I felt a little stoned, as though I'd just smoked a small amount of cannabis. Unlike cannabis, though, I felt exceptionally fluidic and clear-minded. Very relaxed. After noting this, I recommended some to my girlfriend, whom I then joined in bed for the night's sleep.
Ironically, I felt the Dream Herb held me with a bit of insomnia. After an inordinate amount of time tossing and turning, finally I fell asleep.
I had expected (rather, hoped) to find myself lucid in a dreamworld filled with an extraordinarily rich tapestry of symbols and meaning, but was not so fortunate. Even so, I had the most peculiar, memorable dreams indeed. More commonly I'm unable to recall dreams in the least.
The first dream sequence I remember involved the home I grew up in. I was visiting there for the sake of nostalgia, the current owners more than happy to show me around. This home was nothing like the real home had been. The door was round, and opened by rolling to one side, creating this wonderfully authentic stone-grinding sound. The ceiling had been vaulted, and the interior was beautifully decorated like some sort of elvish workshop. It was warm, and there were candles and lit fireplaces everywhere. The air smelled of sweet spices and cocoa. The owners of the house were a group of eccentric musicians, calling me to come to the basement with them to view their equipment.
Equipment, they had a lot. The basement of this place was brightly lit with flouroescent light, a drop ceiling with small tufts of stringy cotton in the center of each tile. This seemed important. Everywhere was musical equipment. Keyboards of all kinds, drums, hand drums, woodwinds, stringed instruments, even a harpsichord. It seemed crucial somehow that there was no brass to be seen.
There were other dreams, all of the same unusual theme. Consistently, the dreamscape was extremely vivid, and I found this to be very rewarding. Perhaps most importantly were the 'moments' that occured during the dreams, moments that seemed to buzz with urgency, as though I was being directed to take note of certain details. Those times are the brightest in my memory, but I've been so far unable to assemble any meaning of them.
The Dream Herb, to me, lived up to it's name very well.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Email Verified
All set! You can now log in to your account.
Email Sent
We’ve sent a link to verify your email to {login}. Please check your email and click that link to continue.Expired or invalid link.
This link expired for your security. Enter your email address, and we’ll send you a new link to verify it.


For expensive operations, caching the results in a lookup table speeds future queries.
The lookup table can be built in advance by iterating over all values in the domain of the function and recording the results.
Or, more lazily, can be build as the individual values are passed in.
Modify the code in this directory to build a lookup table so that it can finish running in under a minute.
There’s no test file for this. It’s counting to 50,000, so if it finishes before you give up, then you’re golden.


Home / Vanilla JavaScript
The Vanilla JavaScript template uses only JavaScript and HTML DOM API and WebSockets.
The WebSocket will disconnect after 15 seconds of inactivity. The server time updates every 3 seconds.
The Vanilla JavaScript template uses only JavaScript and HTML DOM API and WebSockets.
The WebSocket will disconnect after 15 seconds of inactivity. The server time updates every 3 seconds.


I am a Systems Design Engineering student at the University of Waterloo
with a planned minor in philosophy. I would sum up my entire personality
into a venn diagram of four main categories:
Engineering
a
Acting
a
Frisbee
a
Philosophy
a
Howdy.
I have spent the past few years learning about circuitry and
hardware from the ground up. Beginning with simple LEDs blinking
with entirelly analog components, to Arduino, to custom PCBs
with selected microprocessors: it's all covered in the Design
Engineering Report. Some of my favourite projects include:
Flexible PCB: Snake Programmed in assembly (p. 115)
This project
Bluetooth Photoframe (p. )
We lit
Four bit Programmable Computer (p. 61/109)
This project is outlined in much more detail in it's own dedicated
page since it is my most challenging completed project to date.
Basically, the goal was to create a computer from scratch with
all essential pieces: an ALU, RAM, program counter, program & control
ROM, etc. It took three months to build a breadboard prototype, then
another three months to create a full PCB with an LED matrix output,
an extended program counter, and a separate board to program the device.
The final product was hand soldered and encased in a custom 3D print
with an acryllic cover.
My Projects
This is an overview of all the projects I have done
Andro
An independent, application specific processor for 1 bit quantized neural networks.
This thing is wildin.
CHUMP
Daniel ⚡
dan . raymond


Freecell Solver version 2.20.0 is now available for download from the download page. The big news is that executables for Microsoft Windows (x86) are now available for it, for the first time since the early 2.8.x releases. And this time, they come in the form of an interactive "Next→Next→Finish" installer based on the Nullsoft Scriptable Install System (NSIS).
Also in this release are a fix to a crash when using the range solver with the "-opt" flag (and other similar scenarios), a more comprehensive NEWS file and some other fixes.


Programming Assignment 1
CS 356: Computer Security
Version 1.1
Due Date - 11:59PM Sunday, February 12th
Programming Assignment 1
The purpose of this assignment is to familiarize the students with the concept of block ciphers and stream cipher. Block ciphers work on blocks of n bits at a time. Stream ciphers work on streams one bit at a time. Your program will read in an input file and apply the algorithms described below. It will then generate an output file.
Requirements
- This program should be written in C or C++.
- Your submittal should include a Makefile.
-
Your program will take 5 arguments in the order defined below.
Your program should ensure there are
5 arguments, and that each argument is error-checked appropriately.
- The first argument is either a 'B' or a 'S'.
- B means you will use your block cipher function
- S means you will use your stream cipher function.
- Your program should terminate if other than a 'B' or an 'S' is entered with an appropriate error message.
- The second argument is the input file name.
- Your program should terminate with an appropriate error message if the file does not exist.
- The third argument is the output file name.
- The first argument is either a 'B' or a 'S'.
- The fourth argument is the keyfile
- The keyfile contains the symmetric key in ASCII format ("ABCDEFGH"). The keysize for Block Encryption Mode would be 64 bits (8 bytes) and can be of any length for Stream Encryption Mode. Your program will read in the contents of the keyfile and use it to encrypt the plaintext provided in the input file. The keyfile will not contain a terminating "\n"(newline) character.
- The fifth argument is the 'mode of operation' which can be either 'E' for encryption or 'D' for decryption.
- Altough the same 'E' or 'D' module can be used for Stream Ciphers, the same does not apply for Block Ciphers as will be explained below in the 'Description of the algorithms' section. In the 'E' mode you would encrypt a plaintext using a key and produce a ciphertext. We can then evaluate your encrypted output against the output produced by our own program with the same key. Similarly, in the 'D' mode your program is expected to decrypt an already encrypted text, with the same symmetric key, and produce expected plaintext results.
- Your program will read in the input file.
- End of line characters are data just like any other character.
- You may assume the file is in multiples of 8 bits.
-
Your file will write the output file based on the arguments.
- Your file should be in 64-bit blocks in block mode.
- This means you must pad blocks that are not 64 bits in length.
- Each padding byte should be 0X80. Because the input file will be a multiple of 8 bits or 1 byte, padding (if required) can also be done in multiples of 8 bits or 1 byte. For the purpose of this project you will be using the byte value 0X80 in hex or 128 in decimal. Becasue, the input file is in ASCII and the padding value (0X80) falls outside the ASCII (0-127) range, it allows us distinguish padding bytes from plaintext bytes.
- Your file should be in 64-bit blocks in block mode.
Description of the algorithms
Block cipher
- The encryption would be a three step process : pad (if required) -> encrypt (using XOR) -> swap
- Your block size will be 64 bits. As mentioned earlier, if a block is found to be less than 64 bits, it should be padded with as many (0X80) bytes so as to make 64 bits or 8 bytes.
- Your algorithm will XOR the 64 bit data block with the 64 bit key in a bitwise manner, i.e. each bit of the key starting from the left most bit will be XORed with each bit of a 64 bit data block, starting from the left hand side.
- Your algorithm will then swap bytes of the XORed output using the following algorithm.
- Let 'start' and 'end' be pointers which point to the start and end of the XORed output string.
- For each byte of the key, starting from the left most byte or 0th byte, you calculate the following : (ASCII value of the byte or character)mod2. This would give you either 0 or 1.
- If the value is 0 you do not swap anything and move to the next byte of the plaintext by incrementing the 'start' pointer. Otherwise, you swap the byte pointed by the 'start' pointer with that pointed by the 'end' pointer. Then increment the 'start' pointer so that it points to the next higher byte and decrement the 'end' pointer so that it points to the next lower byte. If the keysize is exhausted, you restart from the first byte of the key. This process is carried on until the 'start' and the 'end' pointers collide. The swap process stops and produces the required encrypted output.
- The decryption process is also of three steps but proceeds in the reverse order as the encryption process : swap -> decrypt (using XOR) -> remove padding (if required). The decrypted ouput should be written to the output file. Because, the decryption process occurs in the reverse direction of the encryption process, you cannot use the same module to perform both, altough the underlying logic will be the same.
Stream cipher
- You will XOR your input stream with the following data
- The key is (in Hex) "0123456789ABCDEF"
- Bit 0 from the input file will be XORed with Bit 0 from the key
- Bit 1 from the input file will be XORed with Bit 1 from the key
- ...
- Bit n-1 from the input file will be XORed with Bit n-1 from the key
- If you reach the end of the key, start over from the beginning.
- Note on the number of the bits. Since this is a stream, bit 0 is the first bit to arrive, bit 1 is the second bit and so forth. That means the leftmost bit of the first byte is bit 0. Same with the key.
- Encryption and decryption will performed with the same module that you design for the Stream Cipher. In other words, you do not have have to design separate modules for encryption and decryption in the Stream Encryption Mode.
What to turn in
You should submit your makefile, your C or C++ programs, and a README to the assignment in Canvas. Remember: It is your responsibility to test your on the state capital machines - that is where the TA will grade it.
Copyright © 2014: Colorado State University for CS 356. All rights reserved.


{% extends "layout.html" %} {% block title %}You Died!{% endblock %} {% block content %}
Looks like you bit the dust.
Play Again


This post is coming after a very long time, as my vacations were coming to an end. I was preparing for college, so the last few weeks was shopping, shopping and more of shopping. I felt like I was like the girl from "Confessions of a Shop-a-holic". I wanted whatever I saw, and one more reason being the Summer Surprises was on in Abu Dhabi/Dubai. At Summer Surprises, nearly every shop has sale ranging from 25% to anywhere till 75%. One reason being this, and the other I was LAZY.
Well, my travel date was 17th of July, boarding from Dubai, at 22:30 (local time). It was like just like any other flight. Window seats interest me a lot. The look as you slowly take off, leaving the glittering city of Dubai is beautiful. And then it was all Dark! I could not make out anything
Well, my travel date was 17th of July, boarding from Dubai, at 22:30 (local time). It was like just like any other flight. Window seats interest me a lot. The look as you slowly take off, leaving the glittering city of Dubai is beautiful. And then it was all Dark! I could not make out anything


Dwarf Explorer Droph:
Did you feel it too? Something has happened in this Giant's Cave!
I spent a long time exploring this place without success.
Finally I discovered its secret...
"What is it?"


Grup Yorum
Menu
Home
Register
Events
Registration Successful!
Rules,timing and coordinator list of all competitions are available in the
events
page