This time I try to access my webservice (MyService.svc).
HTTP Error 404.3 - Not Found
The page you are requesting cannot be served because of the extension of the configuration. If the page is a script, add a handler. If the file should be downloaded, add a MIME map.
The IIS handlers window shows no handler for *.svc.Solution:
Open a command window as administrator
Go to C:\windows\Microsoft.Net\Framework\v3.0\Windows Communication Foundation
Type ServiceModelReg –i
No need to restart, it just works.
UPDATE .Net 4
Open a command window as administrator
Go to %windir%\Microsoft.NET\Framework\v4.0.30319
Type ServiceModelReg –i -c:httpnamespace


Having a rich culture and history. The British Isles began around 6000 BCE when they separated from mainland Europe due to sea level rises. A few dozen centuries later and the ever famous Stonehenge was built. In 600 BCE the Celtics arrived and began establishing settlements. Going into the AD centuries the isles suffered from multiple Roman invasions, most famously starting with Julius Cesar in 55 BCE. Then into the Medieval era Britain was invaded by even more civilizations including the Saxons, Vikings, and the French led by the famous William the Conqueror. As if to get revenge on the world, Britain would spend the next several centuries conquering other nations and developing the world's largest empire for which the sun only just set on that empire a little over a half century ago.
Learn More


#include "common_afx.h"
Go to the source code of this file.
Defines | |
| #define | TEMP_MEM_SIZE 1048576 |
| libraries. | |
| #define | TINY_BLOCK_COPY 64 |
| fast memory copy | |
| #define | IN_CACHE_COPY 64 * 1024 |
| #define | UNCACHED_COPY 197 * 1024 |
| #define | BLOCK_PREFETCH_COPY infinity |
| no limit for movq/movntq w/block prefetch | |
| #define | CACHEBLOCK 80h |
Functions | |
| void | VSPrintF (tstring &out, const char *fmt, va_list marker) |
| exceptions disabled! | |
| void | SPrintF (tstring &out, const char *fmt,...) |
| size_t | StrLenUTF8 (const char *str) |
| UTF8 functions. | |
| const char * | NextCharUTF8 (const char *str) |
| unsigned int | GetCharLenUTF8 (const char *chr) |
| returns NULL if the terminating char was hit. | |
| unsigned int | HashMem32 (const void *mem, unsigned int size, unsigned int hashStart) |
| hash functions. | |
| unsigned __int64 | HashMem64 (const void *mem, unsigned int size, unsigned __int64 hashStart) |
| void * | AlignedAlloc (unsigned int alignmentPow2, unsigned int size) |
| aligned memory allocation | |
| void | AlignedFree (void *alignedMemory) |
| void * | TempAlloc (unsigned int size) |
| temporary memory allocation | |
| void | TempFree (void *mem) |
| void | MemCopy (void *dest, const void *src, unsigned int n) |
| void | StrTokenize (TokenContainer &tokens, const char *str) |
| tstring & | StrToLower (tstring &str) |
Variables | |
| int(* | PrintF )(const char *txt,...) = PrintF_Default |
| debug output/console output function. | |
| void(* | HandleError )(const char *fmt,...) = HandleError_Default |
| #define BLOCK_PREFETCH_COPY infinity |
| #define CACHEBLOCK 80h |
# of 64-byte blocks (cache lines) for block prefetch For the largest size blocks, a special technique called Block Prefetch can be used to accelerate the read operations. Block Prefetch reads one address per cache line, for a series of cache lines, in a short loop. This is faster than using software prefetch. The technique is great for getting maximum read bandwidth, especially in DDR memory systems.
Definition at line 395 of file common_afx.cpp.
| #define IN_CACHE_COPY 64 * 1024 |
upper limit for movq/movq copy w/SW prefetch Next is a copy that uses the MMX registers to copy 8 bytes at a time, also using the "unrolled loop" optimization. This code uses the software prefetch instruction to get the data into the cache.
Definition at line 376 of file common_afx.cpp.
| #define TEMP_MEM_SIZE 1048576 |
| #define TINY_BLOCK_COPY 64 |
fast memory copy
upper limit for movsd type copy The smallest copy uses the X86 "movsd" instruction, in an optimized form which is an "unrolled loop".
Definition at line 370 of file common_afx.cpp.
| #define UNCACHED_COPY 197 * 1024 |
upper limit for movq/movntq w/SW prefetch For larger blocks, which will spill beyond the cache, it's faster to use the Streaming Store instruction MOVNTQ. This write instruction bypasses the cache and writes straight to main memory. This code also uses the software prefetch instruction to pre-read the data. USE 64 * 1024 FOR THIS VALUE IF YOU'RE ALWAYS FILLING A "CLEAN CACHE"
Definition at line 384 of file common_afx.cpp.
| void* AlignedAlloc | ( | unsigned int | alignmentPow2, | |
| unsigned int | size | |||
| ) |
aligned memory allocation
allocates memory aligned to certain boundaries.
allocate the memory.
first, align the memory.
reserve some space to store the original pointer and add the alignment.
now return the aligned memory.
Definition at line 297 of file common_afx.cpp.
| void AlignedFree | ( | void * | alignedMemory | ) |
| unsigned int GetCharLenUTF8 | ( | const char * | chr | ) |
returns NULL if the terminating char was hit.
null terminator?
return the character len.
must be a single byte character. If not, this wasn't a pointer to a valid UTF-8 character. Either way, we'll return 1.
Definition at line 136 of file common_afx.cpp.
| unsigned int HashMem32 | ( | const void * | mem, | |
| unsigned int | size, | |||
| unsigned int | hashStart | |||
| ) |
hash functions.
hash the string.
hash the current character.
return the new hash.
Definition at line 160 of file common_afx.cpp.
hash the string.
hash the current character.
return the new hash.
Definition at line 179 of file common_afx.cpp.
| void MemCopy | ( | void * | dest, | |
| const void * | src, | |||
| unsigned int | n | |||
| ) |
Definition at line 398 of file common_afx.cpp.
| const char* NextCharUTF8 | ( | const char * | str | ) |
null terminator?
advance to the next character.
return the next character or NULL if the character is the null character.
Definition at line 111 of file common_afx.cpp.
| void SPrintF | ( | tstring & | out, | |
| const char * | fmt, | |||
| ... | ||||
| ) |
Definition at line 93 of file common_afx.cpp.
| size_t StrLenUTF8 | ( | const char * | str | ) |
| void StrTokenize | ( | TokenContainer & | tokens, | |
| const char * | str | |||
| ) |
create a copy of the string to tokenize.
tokenize it.
free the local copy.
Definition at line 603 of file common_afx.cpp.
Definition at line 626 of file common_afx.cpp.
| void* TempAlloc | ( | unsigned int | size | ) |
temporary memory allocation
allocates memory from a temporary pool if possible. If the pool is already in use, this function returns memory allocated on the heap. The memory returned by this function is guaranteed to be aligned to a 16-byte boundary.
could we gain ownership over the temporary memory? If so, simply return it.
Definition at line 344 of file common_afx.cpp.
| void TempFree | ( | void * | mem | ) |
Definition at line 355 of file common_afx.cpp.
| void VSPrintF | ( | tstring & | out, | |
| const char * | fmt, | |||
| va_list | marker | |||
| ) |
exceptions disabled!
utility functions.
global functions
mingw and glibc<2.1 return -1 when the string doesn't fit so we have to try again with a bigger buffer
c99/glibc>=2.1 return the actual size of the final string whether it fits or not, so we can just use that directly
otherwise, string fit so we are done
Definition at line 39 of file common_afx.cpp.
| void( * HandleError)(const char *fmt,...) = HandleError_Default |
| int( * PrintF)(const char *txt,...) = PrintF_Default |
debug output/console output function.


Welcome to the Agile Course
-
Adaptive planning
-
Evolutionary development
-
Early delivery
-
Continuous improvement
-
Rapid and flexible response to change
Tenets of Agile
Individuals and interactions over processes and tools
We value people and their contributions, and face-to-face conversations.
Working software over comprehensive documentationfocus is on incrementally delivering working software rather than comprehensive design which may change or not be used.
collaboration over contract negotiation involving customers early in the process helps create more accurate prioritized deliverables.
to change over following a plan ability to react to changing customer or business priorities (within reason), or industry standards helps create more value for the customer.


Dash UI Library
Home Page Theme
Search
Home
Browse Data
Help
My Datasets
An easy-to-use data preservation and publication service
Get Started
“hypotheses come and and go, but
data remain
”
Santiago Ramón y Cajal, 1897
Search XXX datasets
Search
Browse most recent


12 Apr 2015
Cyclades, part II
Santorini
We reached our hostel in Fira, the biggest city on the island, after dark and checked in. Afterwards we went for a short walk around the city centre. Despite it being pre-season, the main roads were already teeming with tourists. Most of them from China, it seemed, and mostly congregating in front of the numerous Chinese restaurants. As we eventually found out from a Albanian hostel clerk, groups of Chinese tourists travel to Santorini during the more affordable pre- and post-season and annoy the locals through extreme stinginess.
After a quick bite to eat we headed back to the hostel. Upon closer inspection, the rooms and especially the bathrooms turned out to be very…rustic. Wait, no: rusty. And somewhat grimy, too.
Kamari Beach and Ancient Thera
The next morning we got up and headed for the bus station to take a bus to Kamari beach in the southeast of the island. After a short ride through scenic, if sleepy parts of the island we arrived in Kamari and wandered towards the beach.
Include file ‘image.html img=”pics/IMG_20150407_101603_scaled.jpg” title=”Image” caption=”” url=”http://www.escapingsloth.com/pics/fullsize/IMG_20150407_101603.jpg”’ contains invalid characters or sequences The beach - in case you hadn’t guessed.
When we tried to find breakfast however, we found almost nothing: It really felt like the town was only just about waking from hibernation. Wherever we looked, shop owners were slowly beginning to polish signs, paint walls and posts and prune trees and bushes. There were plenty of cafes and bars of course, but none of them were open for business yet. Instead, we grabbed some pies from a bakery and had a relaxed lunch on the beach.
As we sat there, looking at the waves, I couldn’t help but steal a glance or two at the people getting to work around us: They began working, but there was no rush whatsoever. They had coffee and tee, they chatted. There was a lot of yawning and lazy stretching going on. The whole atmosphere was not one of having to do stuff, but rather one of another day taking its course, the work unfolding on its own. I enjoyed watching this kind of effortlessness taking place, which stands in such a stark contrast, to say, the German attitude towards work.
After wrapping up these profound sociological musings, we headed towards the mountains fencing in Kamari in the southwest.
Include file ‘image.html img=”pics/IMG_20150407_122013_scaled.jpg” title=”Image” caption=”” url=”http://www.escapingsloth.com/pics/fullsize/IMG_20150407_122013.jpg”’ contains invalid characters or sequences What is it with you and cliffs, Holger?!
We had initially thought we’d just hike the way up to the ancient ruins on top. And we started doing just that, in the mid-day heat and without a complaint. But then Holger spied a car about to pass us. We decided that, while of course we were hardcore, we weren’t donkeys, so we’d take the ride offered to us, thank you very much!
Up at the top we goofed around on the cliffs for a spell, before climbing up to the ruins of Ancient Thera
Include file ‘image.html img=”pics/IMG_20150407_130153_scaled.jpg” title=”Image” caption=”” url=”http://www.escapingsloth.com/pics/fullsize/IMG_20150407_130153.jpg”’ contains invalid characters or sequences
Include file ‘image.html img=”pics/IMG_20150407_134019_scaled.jpg” title=”Image” caption=”” url=”http://www.escapingsloth.com/pics/fullsize/IMG_20150407_134019.jpg”’ contains invalid characters or sequences
Include file ‘image.html img=”pics/IMG_20150407_135538_scaled.jpg” title=”Image” caption=”” url=”http://www.escapingsloth.com/pics/fullsize/IMG_20150407_135538.jpg”’ contains invalid characters or sequences
Having taken the easy way out on the ascent, we figured that we could easily do the descent on our own. But then Holger spied a car…well, you can see where this is going.
Down at the beach we went for a quick swim, observed by an audience of Chinese tourists. That clear, blue water looked so warm and inviting! While it wasn’t exactly warm, the hot sand and sunshine took the edge off the experience.
Back in town we grabbed a quick dinner before picking up a few beers and heading back for the beach.
Include file ‘image.html img=”pics/IMG_20150407_162900_scaled.jpg” title=”Image” caption=”” url=”http://www.escapingsloth.com/pics/fullsize/IMG_20150407_162900.jpg”’ contains invalid characters or sequences
Include file ‘image.html img=”pics/IMG_20150407_165155_scaled.jpg” title=”Image” caption=”” url=”http://www.escapingsloth.com/pics/fullsize/IMG_20150407_165155.jpg”’ contains invalid characters or sequences Relaxing after a hard day’s work. And yes, those rocks were all warmed up by the sun. I felt like a lizard. A lizard with a beer and a smartphone.
Afterwards we took a bus back to Fira, had a pretty unspectacular dinner and a few more beers with said Albanian hostel clerk.
Oia (pronounced [ˈi.a])
The next day we decided to take a bus to Oia, the scenic town in Santorini’s northeast. If you get a postcard from the island, this is the town that’s going to be on there. It perches on the cliff overlooking the horseshoe-shape of the island and the vulcano in its middle. The town looks strangely organic as the white houses are built into the rock at random levels and seem to flow into one another. Narrow stairwells and footpaths connect the buildings. Everything is either white, or a light shade of blue. In bright sunlight the town would be blinding. Just as well: It was rainy and overcast as we got there. We walked around the buildings, most of which were either hotels, restaurants, art galleries or jewellery stores. Where the locals live (or if there are any locals to begin with) I couldn’t say. Deserted as it was, the town seemed like a nice destination, but I’d hate to be caught there in the middle of tourist season. I’d imagine the crowds there to be suffocating.
We managed to take a few interesting pictures before the rain forced us inside, into a cafe. Spoiler: I would come back here a few days later, in bright sunshine. I’ll post the pictures in a later article. You’ll be jelly, trust me.
At Fira I moved my stuff to another, less grimy hostel where I would stay for the next days. Holger and I lounged around the lobby for an hour or two, before he took a bus which would take him to the airport, from which he’d fly back to Athens.
Until next time,
Arne


Username
Password
Don't have an account?
Sign Up
Login Failed
Invalid login or password.
Please try again.
Ok
Welcome!
We are coyotes tracker
Full Name
Username
Email
Location
Password
Password Confirmation
Sign Up
Log In
COYOTES
Choose Coyotes
Add New Coyotes
Choose Coyotes
Or
Add New Coyotes
Name
Breed
Select breed
Western Coyotes
Central U.S. Coyotes
Eastern Coyotes
Central American Coyotes
Mexican Coyote
Salvador Coyote
Belize Coyote
Honduras Coyote
Southeastern Coyote
Years
Years
0
1
COYO
2
3
4
5
6
7
8
9
Months
Months
1
2
3
4
5
6
7
8
9
10
11
Color
Gender
Select Gender
Female
Male
Description
Add
Name
Breed
Select breed
Western Coyotes
Central U.S. Coyotes
Eastern Coyotes
Central American Coyotes
Mexican Coyote
Salvador Coyote
Belize Coyote
Honduras Coyote
Southeastern Coyote
Years
Years
0
1
2
3
4
5
6
7
8
9
Months
Months
1
2
3
4
5
6
7
8
9
10
11
Color
Gender
Select Gender
Female
Male
Description
Add
Continue
Description
Image
Save
Upload Image
Save
Upload Your Image
Save
Profile
Locations
PROFILE
Update Profile
Log out
Save
Cancel


Reed Dudley is an Auburn University student majoring in Anthropology. Reed worked with Pierce to develop the user experience, as well as the interface for Verses. Reed's design portfolio is available online at http://www.reeddudley.com.
Clay Miller is a senior studying Software Engineering and Spanish at Auburn University. Most of his time is spent building the Internet. Other hobbies include hammocking, pulling shots of espresso, jamming to indie folk and occasionally jogging.
Pierce is currently a junior at Auburn University studying Software Engineering. Pierce developed Verses in his spare time over the course of a year. Pierce leads Auburn Mobile, a group for Auburn students and faculty focusing on mobile development. Pierce's interests include theology, software, and entrepreneurship. Pierce blogs about mobile development and other topics at http://www.pierceboggan.com, and can be found on Twitter @pierceboggan.


May 11th. Noon to Midnight. Free Admission.
15 bands, 3 stages, DJ face-off and more.
Small Joys
Buzz Pub Stage
12:00-12:45
Listen...
Reign The Arcade
Buzz Pub Stage
1:15-2:15
Listen...
The Good Mad
Buzz Pub Stage
3:00-4:00
Listen...
YamaYama
Buzz Pub Stage
4:30-5:30
Listen...
The Great Hiatum
EMU Ampitheatre Stage
1:00-1:45
Listen...
Maca Rey
EMU Ampitheatre Stage
2:30-3:15
Listen...
Sono Vero
EMU Ampitheatre Stage
4:00-4:45
Listen...
AlienShipRex
EMU Ampitheatre Stage
5:15-6:00
Listen...
Water Tower
University Street Stage
12:00-1:00
Listen...
Free event! Cash is suggested for food vendor purchase, ATMs available in the EMU.
Parking will be limited. There will be three other events on-campus: Relay For Life, ASUO Street Faire, Pow Wow
Family friendly environment
Bathrooms located in the Erb Memorial Union (EMU)
Parking is limited
Bicycles are a great alternative
LTD/EmX are also alternatives. Please check route schedule. (http://www.ltd.org/)
Patio will be open from 2pm – 9pm
Falling Sky and Oakshire brews on tap, Ninkasi in bottles
Free Pool in The Break
Lockers available for rent in The Break. $2 a day.
OK:
Not OK:
12-12:45
SMALL JOYS
12-1
WATER TOWER
1-1:45
THE GREAT HIATUM
1:15-2:15
REIGN THE ARCADE
1:45-2:45
LOST LANDER
2:30-3:15
MACA REY
3-4
THE GOOD MAD
3:30-4:30
SHOOK TWINS
4-4:45
SONO VERO
4:30-5:30
YAMAYAMA
4:45-5:15 Landon Wordswell w/ Tim Hoke
5:15-6:00
ALIENSHIPREX
5:30-7:30
CAMPUS DJ COMPETITION
7:45-8:15
PARTY MARTY
8:30-9:15
SLAP & TICKLE
9:30-10:15
CAMPUS DJ WINNER
10:30-12
3LAU
Presented by
Monster Energy Outbreak College Tour
Presented by UO Cultural Forum
Powered by EMU Marketing and Design


add
Ask Jugaad
Test 1
Test 2
Disabled Tab
Title your requirement
Add most appropriate title. It will help us to understand your requirement better.
Description
Quantity
Add tags to requirement
+


{{project-version}} — {{work.description.full}}
{{content}}{{ project-name }}
{{ project-description }}
--- layout: compress --- {% include metadata %} {% include head.html %}
{% include header.html %}{{project-version}} — {{work.description.full}}
{{content}}


The POW Print Control
When Print button is selected, POW will create a preview image of the entire
POW main image screen. There are several button choices available on the top
the preview window:
Print: Brings up the print dialog window (see Print Dialog)
Fit to Page (or Original Size): Zoom the image to fit the desire paper size or
unzoom the image back to original fize
Page Setup: Bring up the output page setup window (see Page Setup)
Print Dialog
Select the destination of output
Printer
Printer Command: specify the command to send the image to printer. In Windows, this field is been
updated with WinPrint.exe package that came with the installation.
File
File Name: specify the output file name of the saved image. The extension of the file will change
via the selection from the pull down menu next to the word format:
format: specify the format of the file of the saved image. The extension in the file name will change
via the selection from pull down menu
Directory: specify the destination directory for the image file to be saved. User can type in the
directory or use Browse button to bring up a directory nagivation window to choose the destination directory.
Print/Save Range: specify the range of pages to be saved or print. Choices are All pages, Current Page, or Page No.
Note: if selection is File and there are more than one page to be saved, the files will be saved in manner of
<File Name>_0.<format extension>,
<File Name>_1.<format extension>,
<File Name>_2.<format extension>, etc.
Page Setup
Select the paper type as well as orientation of the image on the paper.
Paper Size: Select from the pull down menu of available paper size to output.
Orientation Size: Select either Portrait or LandScape orientation of image on the output.
Placement: determine way of output. Choices are
- Fit on one page: Fit every image/plot into one page.
- Best Fit on multiple pages: Allow system to determine the best way to fit images/plots onto muliple pages. This is a good choice if the user is concerning about saving paper.
- One graph per page: Just output one image/plot per pages.


"De Jong is going to establish an era of his own at Barcelona"
Josep María Bartomeu highlighted the quality of the Dutch midfielder
by sport.esBarcelona president Josep Maria Bartomeu has told The Press Association that the club are already renewing the squad with an eye on the future. They are doing so by signing young players with huge potential.
Despite the fact Bartomeu's put huge faith in French forward Antoine Griezmann this season, as well as the emergence of teenage star Ansu Fati, the Barça chief wanted to highlight the quality of the young Dutch midfielder Frenkie de Jong.
"De Jong is going to establish an era of his own at Barcelona," Bartomeu said of the former Ajax man, who is already a fans' favourite at Camp Nou.
Bartomeu feels that De Jong is set to be one of the world's greatest midfielders and that his style fits in perfectly with what is required at the Catalan club.


--- layout: page weight: 0 title: Unique Arguments navigation: show: true ---
The SMTP API JSON string allows you to attach an unlimited number of unique arguments to your email. The arguments are used only for tracking. They can be retrieved through the Event API or the Email Activity page.
These arguments can be added using a JSON string like this:
{% codeblock lang:json %}{ "unique_args": { "customerAccountNumber": "55555", "activationAttempt": "1" } } {% endcodeblock %}These arguments can then be seen in posts from the SendGrid Event Webhook. The contents of one of these POST would look something like this:
{% codeblock lang:json %} { "sg_message_id": "145cea24eb8.1c420.57425.filter-132.3382.5368192A3.0", "New Argument 1": "New Value 1", "event": "processed", "New Argument 4": "New Value 4", "email"<EMAIL_ADDRESS>"smtp-id"<EMAIL_ADDRESS>"timestamp":<PHONE_NUMBER>, "New Argument 2": "New Value 2", "New Argument 3": "New Value 3" } {% endcodeblock %}Unique Arguments will also be shown in the Email Activity tab of your account.
To apply different unique arguments to individual emails, you may use substitution tags. An example of this would look like:
{% codeblock lang:json %} { "sub" : { "-account_number-" : [ "314159", "271828" ] }, "unique_args" : { "customerAccountNumber" : "-account_number-" } } {% endcodeblock %}


Preparation time
overnight
Cooking time
1 to 2 hours
Serves
Serves 4
This dish is a fine example of Yottam Ottolenghi's keen eye for unexpected but dazzlingly good flavour combinations.
Place the chicken in a large bowl. Stir together the miso paste, ginger, mirin and four tablespoons of the vinegar and pour the mixture over the chicken. Mix until well combined. Cover with clingfilm and leave in the fridge to marinate for at least three hours. Overnight would be ideal.
Put the shallots in a small saucepan and cover with water. Bring to the boil and cook for five minutes. Strain and cut the shallots in half lengthways.
Preheat the grill to a high setting. Place the chicken pieces on a baking tray, skin-side up, with all the marinade and grill for 10 minutes. As soon as the chicken goes under the grill, heat the sunflower oil in a pan large enough to fit all the chicken. Add the shallots and fry on a medium heat for four minutes, or until browned. Add the remaining vinegar, reduce for a few seconds then pour in the wine, water, ½ teaspoon of salt and some white pepper and continue to cook for about six minutes.
Remove the chicken from the grill and add it to the pan along with the cooking juices. Stir gently and bring everything to a low simmer. Cover the pan and cook for 3-4 minutes, or until the chicken is just cooked through.
Remove the chicken from the pan and set it aside in a warm place. Add the walnuts, butter, maple syrup and grapes to the pan and continue cooking, stirring until the butter emulsifies, for 2-3 minutes.
Serve the chicken with the sauce spooned on top and scatter over the tarragon.


public class EventQueue extends Object
EventQueue
is a platform-independent class
that queues events, both from the underlying peer classes
and from trusted application classes.
It encapsulates asynchronous event dispatch machinery which
extracts events from the queue and dispatches them by calling
dispatchEvent(AWTEvent)
method
on this EventQueue
with the event to be dispatched
as an argument. The particular behavior of this machinery is
implementation-dependent. The only requirements are that events
which were actually enqueued to this queue (note that events
being posted to the EventQueue
can be coalesced)
are dispatched:
AWTEvent
A is enqueued
to the EventQueue
before
AWTEvent
B then event B will not be
dispatched before event A.
Some browsers partition applets in different code bases into
separate contexts, and establish walls between these contexts.
In such a scenario, there will be one EventQueue
per context. Other browsers place all applets into the same
context, implying that there will be only a single, global
EventQueue
for all applets. This behavior is
implementation-dependent. Consult your browser's documentation
for more information.
For information on the threading issues of the event dispatch machinery, see AWT Threading Issues.
| Constructor and Description |
|---|
EventQueue() |
| Modifier and Type | Method and Description |
|---|---|
SecondaryLoop |
createSecondaryLoop()
Creates a new
secondary loop associated with this
event queue. |
protected void |
dispatchEvent(AWTEvent event)
Dispatches an event.
|
static AWTEvent |
getCurrentEvent()
Returns the the event currently being dispatched by the
EventQueue associated with the calling thread. |
static long |
getMostRecentEventTime()
Returns the timestamp of the most recent event that had a timestamp, and
that was dispatched from the
EventQueue associated with the
calling thread. |
AWTEvent |
getNextEvent()
Removes an event from the
EventQueue and
returns it. |
static void |
invokeAndWait(Runnable runnable)
|
static void |
invokeLater(Runnable runnable)
|
static boolean |
isDispatchThread()
Returns true if the calling thread is
the current AWT EventQueue 's
dispatch thread. |
AWTEvent |
peekEvent()
Returns the first event on the
EventQueue
without removing it. |
AWTEvent |
peekEvent(int id)
Returns the first event with the specified id, if any.
|
protected void |
pop()
Stops dispatching events using this
EventQueue . |
void |
postEvent(AWTEvent theEvent)
Posts a 1.1-style event to the
EventQueue . |
void |
push(EventQueue newEventQueue)
Replaces the existing
EventQueue with the specified one. |
public void postEvent(AWTEvent theEvent)
EventQueue
.
If there is an existing event on the queue with the same ID
and event source, the source Component
's
coalesceEvents
method will be called.theEvent
- an instance of java.awt.AWTEvent
,
or a subclass of itNullPointerException
- if theEvent
is null
public AWTEvent getNextEvent() throws InterruptedException
EventQueue
and
returns it. This method will block until an event has
been posted by another thread.AWTEvent
InterruptedException
- if any thread has interrupted this threadpublic AWTEvent peekEvent()
EventQueue
without removing it.public AWTEvent peekEvent(int id)
id
- the id of the type of event desirednull
if there is no such eventprotected void dispatchEvent(AWTEvent event)
| Event Type | Source Type | Dispatched To |
|---|---|---|
| ActiveEvent | Any | event.dispatch() |
| Other | Component | source.dispatchEvent(AWTEvent) |
| Other | MenuComponent | source.dispatchEvent(AWTEvent) |
| Other | Other | No action (ignored) |
event
- an instance of java.awt.AWTEvent
,
or a subclass of itNullPointerException
- if event
is null
public static long getMostRecentEventTime()
EventQueue
associated with the
calling thread. If an event with a timestamp is currently being
dispatched, its timestamp will be returned. If no events have yet
been dispatched, the EventQueue's initialization time will be
returned instead.In the current version of
the JDK, only InputEvent
s,
ActionEvent
s, and InvocationEvent
s have
timestamps; however, future versions of the JDK may add timestamps to
additional event types. Note that this method should only be invoked
from an application's event dispatching thread
.
If this method is
invoked from another thread, the current system time (as reported by
System.currentTimeMillis()
) will be returned instead.InputEvent
,
ActionEvent
, or InvocationEvent
to be
dispatched, or System.currentTimeMillis()
if this
method is invoked on a thread other than an event dispatching
threadInputEvent.getWhen()
,
ActionEvent.getWhen()
,
InvocationEvent.getWhen()
,
isDispatchThread()
public static AWTEvent getCurrentEvent()
EventQueue
associated with the calling thread. This is
useful if a method needs access to the event, but was not designed to
receive a reference to it as an argument. Note that this method should
only be invoked from an application's event dispatching thread. If this
method is invoked from another thread, null will be returned.public void push(EventQueue newEventQueue)
EventQueue
with the specified one.
Any pending events are transferred to the new EventQueue
for processing by it.newEventQueue
- an EventQueue
(or subclass thereof) instance to be useNullPointerException
- if newEventQueue
is null
pop()
protected void pop() throws EmptyStackException
EventQueue
.
Any pending events are transferred to the previous
EventQueue
for processing.
Warning: To avoid deadlock, do not declare this method synchronized in a subclass.
EmptyStackException
- if no previous push was made
on this EventQueue
push(java.awt.EventQueue)
public SecondaryLoop createSecondaryLoop()
secondary loop
associated with this
event queue. Use the SecondaryLoop.enter()
and
SecondaryLoop.exit()
methods to start and stop the
event loop and dispatch the events from this queue.SecondaryLoop.enter()
,
SecondaryLoop.exit()
public static boolean isDispatchThread()
the current AWT EventQueue
's
dispatch thread. Use this method to ensure that a particular
task is being executed (or not being) there.
Note: use the invokeLater(java.lang.Runnable)
or invokeAndWait(java.lang.Runnable)
methods to execute a task in
the current AWT EventQueue
's
dispatch thread.
the current AWT EventQueue
's
dispatch threadinvokeLater(java.lang.Runnable)
,
invokeAndWait(java.lang.Runnable)
,
Toolkit.getSystemEventQueue()
public static void invokeLater(Runnable runnable)
runnable
to have its run
method called in the dispatch thread
of
the system EventQueue
.
This will happen after all pending events are processed.runnable
- the Runnable
whose run
method should be executed
asynchronously in the
event dispatch thread
of the system EventQueue
invokeAndWait(java.lang.Runnable)
,
Toolkit.getSystemEventQueue()
,
isDispatchThread()
public static void invokeAndWait(Runnable runnable) throws InterruptedException, InvocationTargetException
runnable
to have its run
method called in the dispatch thread
of
the system EventQueue
.
This will happen after all pending events are processed.
The call blocks until this has happened. This method
will throw an Error if called from the
event dispatcher thread
.runnable
- the Runnable
whose run
method should be executed
synchronously in the
event dispatch thread
of the system EventQueue
InterruptedException
- if any thread has
interrupted this threadInvocationTargetException
- if an throwable is thrown
when running runnable
invokeLater(java.lang.Runnable)
,
Toolkit.getSystemEventQueue()
,
isDispatchThread()
Dracula Javadoc Sample, Made with Allan Im.


This script to display list of projects that were built more than 1 day ago.
import hudson.model.* import hudson.node_monitors.* import hudson.slaves.* import java.util.concurrent.* jenkins = Hudson.instance // Define hour to compare (hour=24 will find builds that were built more than 1 day ago) hour=24; minute=60; second=60; oneDayInSecond=hour*minute*second; now=Calendar.instance; list=[]; println("The build is run at ${now.time}"); for (item in jenkins.items){ println("\t ${item.name}"); // Ignore project that contains freeze or patch case insensitive if (item.name ==~ /(?i)(freeze|patch).*/){ println("\t Ignored as it is a freeze or patch build"); }else if (!item.disabled&&item.getLastBuild()!=null){ build_time=item.getLastBuild().getTimestamp(); if (now.time.time/1000-build_time.time.time/1000>oneDayInSecond){ println("\t\tLast build was built in more than ${hour} hours ago"); println("\t\tLast built was at ${build_time.time}"); list<< item; } }else if (item.disabled){ println("\t\tProject is disabled"); } } if (list.size()>0){ println("Please take a look at following projects:"); for (item in list){ println("\t ${item.name}"); } return 1; }


This section features the different membership categories, premium payment, data amendment and other procedures that each type of member must know. We have custom-fit the information to ensure that we address the specific concerns of each of our member types.
Considered the newest addition to our menu of electronic services, this section features the different access points that our stakeholders can tap to transact with us online. It includes registration, premium payment and reporting and even locating our offices nationwide.
This section features a variety of comprehensive health care services -from basic primary care to catastrophic packages to provide members and their families with the information they need on benefits and benefits availment. It includes eligibility requirements, coverage, general guidelines for specific diseases and selections criteria among others.
We forge partnerships with only the best in the industry to fulfill our mandate of providing all Filipinos with accessible, available, acceptable and affordable health care services that will lead to better health outcomes and improved quality of life
The PhilHealth Logo, Photographs and information on this Web Site may not be reproduced, copied, or downloaded in any form or by any means -- graphic, electronic, or mechanical, including recording, taping, photocopying, or information storage and retrieval systems -- for use in illegal, damaging or pornographic material.
But PhilHealth information may be used for educational or informative purposes and may be reproduced, copied, or downloaded without the written permission from PhilHealth.


string tempnam ( string $dir , string $prefix )
Creates a file with a unique filename, with access permission set to 0600, in the specified directory. If the directory does not exist, tempnam() may generate a file in the system's temporary directory, and return the name of that.
Returns the new temporary filename, or FALSE on failure.


Exerpts from “Real World Haskell”.
An expression that obeys language type rules is “well typed”, an expression that disobeys is “ill typed” and will cause a “type error”.
Haskell’s strong typing will not automatically coerce values from one type to another.
(Strong type means to have more typing rules. An example is coercsion tends to imply weak typing)
Type is know at compile time.
This is in contrast to duck typing. However, Haskell’s typeclasses provides the benefit of dynamic typing in a safe and convenient form.
Compiler can deduce type of almost all expressions. Type need not be explicitly declared.
This means that there is a distinction between an if expression and if statement. Expressions have to evaluate to a value, hence all if statements in haskell needs an else clause.
take, drop, head, tail, fst
Once variables are bound to a particular expression, its value does not change. We can always use variable instead of writing out the expression.
Strict evaluation: arguments to a function evaluated before the function is applied
Haskell uses non-strict evaluation.
Non-strict evaluation means that a thunk (something like a promise) is created. Only when the value is needed then the value is evaluated.
side effect: introduces a dependency between the global state of the system and behaviour of a funciton.
In haskell code, we should separate pure functions from impure functions.
Construct new data types using data keyword.
Currying is partial function application that takes only one argument.
data DataType = Book Int String [String]
deriving (Show)
algebraic data types can have more than 1 value constructor.
data Bool = False | True
Total functions are functions that return valid results over their entire input domains.
Case is used when there are multiple code paths and every code path is guided by the structure of the value. (i.e. Pattern matching)
Guards make decisions based on the value.
https://stackoverflow.com/questions/9345589/guards-vs-if-then-else-vs-cases-in-haskell


| Path: | lib/commandline/optionparser.rb |
| Last Update: | Mon Jun 13 17:13:03 CDT 2005 |
$Id: optionparser_rb.html,v <IP_ADDRESS> 2005/09/08 15:51:38 jdf Exp $ $Source: /Users/jdf/projects/CVSROOT/devel/ruby/commandline/doc/files/lib/commandline/optionparser_rb.html,v $ Author: Jim Freeze Copyright (c) 2005 Jim Freeze
A very flexible commandline parser
Jim.Freeze 04/01/2005 Birthday
LICENSE
This release is licensed under the RLL - Ruby Lovers License. If you don’t love Ruby, then you don’t have permission to even think about using/reading/ opening any file in this project.
If you a lover of Ruby, then you may use this freely and pay for your use by giving feedback to the author, Jim Freeze.
ABOUT
CommandLine::OptionParser is part of the CommandLine suite of tools and is used for command line parsing. The parser integrates with CommandLine::Option, CommandLine::OptionData and CommandLine::Application. The parser supports POSIX, Gnu and XTools style parsing options. It also gives you flexibility to provide non standard options. For example:
POSIX
OptionParser.new Option.new(:names => "-f")
Gnu
OptionParser.new Option.new(:names => %w[--file -f])
XTools
OptionParser.new Option.new(:names => "-file")
User
OptionParser.new(Option.new( :names => %w(--file -file --files -files -f), :arg_arity => [1,-1], :arg_description => "file1 [file2, ...]"))
This option parser with a single option prints:
OPTIONS --file,-file,--files,-files,-f file1 [file2, ...] There is document describing the various usage scenarios at its homepage. After poking around in a few corporations, it was evident that option parsing was not understood. Nevertheless, many tools were built that did not conform to any of the POSIX, Gnu or XTools option styles. CommandLine::OptionParser was developed so that new application could be written that conformed to accepted standards, but non-standard option configurations could be handled as well to support legacy interfaces. More information on OptionParser can be found on its homepage: http://optionparser.rubyforge.org
Major Features - 06/07/2005
Thanks for all the feedback!
Download & Installation
Homepage: http://optionparser.rubyforge.org Download: http://rubyforge.org/frs/?group_id=296 Dependencies: * None There are many ways to install optionparser. Choose the one you like best: Via RubyGems $ gem install optionparser not in RPA yet Via RPA $ rpa install optionparser this either The do-it-yourself way $ ruby setup.rb config $ ruby setup.rb setup $ ruby setup.rb install nor this The simplified do-it-yourself way $ rake install
Integration with Application
class MyApp << CommandLine::Application end


Reports the usages of filter and headOption and replaces them with find.
filter
headOption
find
Example:
var x: Seq[Int] x.filter(p).headOption
After the quick-fix is applied:
var x: Seq[Int] x.find(p)


Tags #28mm Parametric Ork Missiles in OpenScad (updated) March 12, 2019 Ursus Claw 28mm January 8, 2019 #8mm 3d-printed scarabeus pattern warlord upgrade kit January 25, 2021 Laser-cut 8mm Zebulon-pattern Dropship September 3, 2020 Sinister Warhound Replacement Head May 19, 2020 Laser-cut 8mm Super-Heavy Tank April 13, 2020 Laser-cut 8mm Buildings March 21, 2020 8mm Ursus Claw April 18, 2019 Proteus Pattern Warhound Marches to War April 1, 2019 Proteus Pattern Warhound Titan Available March 20, 2019 Proteus Pattern Warhound: Printed March 18, 2019 Proteus Pattern Warhound: Alpha Design March 8, 2019 Proteus Pattern Warhound Titan in OpenScad March 7, 2019 #blog Laser-cut 8mm Zebulon-pattern Dropship September 3, 2020 Sinister Warhound Replacement Head May 19, 2020 Laser-cut 8mm Super-Heavy Tank April 13, 2020 Laser-cut 8mm Buildings March 21, 2020 Ignition! November 15, 2018 #laser cut Laser-cut 8mm Zebulon-pattern Dropship September 3, 2020 Laser-cut 8mm Super-Heavy Tank April 13, 2020 Laser-cut 8mm Buildings March 21, 2020 #openScad Sinister Warhound Replacement Head May 19, 2020 Proteus Pattern Warhound Titan Available March 20, 2019 Proteus Pattern Warhound: Printed March 18, 2019 Parametric Ork Missiles in OpenScad (updated) March 12, 2019 Proteus Pattern Warhound: Alpha Design March 8, 2019 Proteus Pattern Warhound Titan in OpenScad March 7, 2019 #ork Parametric Ork Missiles in OpenScad (updated) March 12, 2019 #painted 8mm Ursus Claw April 18, 2019 Proteus Pattern Warhound Marches to War April 1, 2019 #research Ursus Claw 28mm January 8, 2019 #scarabeus 3d-printed scarabeus pattern warlord upgrade kit January 25, 2021 #ship Laser-cut 8mm Zebulon-pattern Dropship September 3, 2020 #sinister Sinister Warhound Replacement Head May 19, 2020 #store Laser-cut 8mm Buildings March 21, 2020 Proteus Pattern Warhound Titan Available March 20, 2019 #super heavy Laser-cut 8mm Super-Heavy Tank April 13, 2020 #tank Laser-cut 8mm Super-Heavy Tank April 13, 2020 #terrain Laser-cut 8mm Zebulon-pattern Dropship September 3, 2020 Laser-cut 8mm Buildings March 21, 2020 #titan 3d-printed scarabeus pattern warlord upgrade kit January 25, 2021 #ursus claw 8mm Ursus Claw April 18, 2019 #warhound Sinister Warhound Replacement Head May 19, 2020 8mm Ursus Claw April 18, 2019 Proteus Pattern Warhound Marches to War April 1, 2019 Proteus Pattern Warhound Titan Available March 20, 2019 Proteus Pattern Warhound: Printed March 18, 2019 Proteus Pattern Warhound: Alpha Design March 8, 2019 Proteus Pattern Warhound Titan in OpenScad March 7, 2019 Ursus Claw 28mm January 8, 2019 #warlord 3d-printed scarabeus pattern warlord upgrade kit January 25, 2021 #wip Proteus Pattern Warhound: Printed March 18, 2019 Proteus Pattern Warhound: Alpha Design March 8, 2019 Proteus Pattern Warhound Titan in OpenScad March 7, 2019


Recent Blogs
GirlScript Chennai
India's fastest growing tech community at the heart of Chennai
MORE INFORMATION
OTHERS


Somebody has RSVP'd to your wedding!
You've got a new RSVP:
Terra Gallo
cannot attend.
Terra Gallo
can attend, and will be having the fish for dinner.


class FormatterManager
Class FormatterManager
Methods
| $this |
add(AbstractFormatter $formatter)
|
|
| $this |
delete($name $name)
|
|
|
get($name)
|
||
| array[AbstractFormatter] |
getAll()
|
|
| array |
getNames()
|
|
| array |
getExtensions($withDot = false)
|
|
|
getExtensionsByTypes($types, $withDot = false)
|
||
| bool|AbstractFormatter |
getFormatterByExtension($extension $extension)
|
|
|
getFormattersByTypes($types)
|
||
|
getMimeTypesByTypes($types)
|
Details
at line 30
public $this
add(AbstractFormatter $formatter)
at line 44
public $this
delete($name $name)
at line 55
public
get($name)
at line 67
public array[AbstractFormatter]
getAll()
at line 75
public array
getNames()
at line 108
public array
getExtensions($withDot = false)
at line 122
public
getExtensionsByTypes($types, $withDot = false)
at line 140
public bool|AbstractFormatter
getFormatterByExtension($extension $extension)
at line 158
public
getFormattersByTypes($types)
at line 178
public
getMimeTypesByTypes($types)


Installation¶
XID+ requires a Python (2 or 3) installation. I recommend the Anaconda distribution.
Once you have a working Python installation, you can download the code either directly from github or by cloning the git repository:
git clone https://github.com/H-E-L-P/XID_plus.git
cd XID_plus
Requirements¶
Anaconda Python¶
If using an Anaconda distribution, then it is best to install some prerequisites with conda with the following command:
conda config --add channels conda-forge && conda install healpy
while read requirement; do conda install --yes $requirement; done < req.txt
Custom Python¶
If you are using your own Python setup, install the requirements via the command
pip install -r req.txt
Finally¶
Then, install the package by running the following command:
pip install -e './'
Docker¶
As an alternative to having to install XID plus, along with all the Python dependencies, we provide a docker image of XID plus.
Docker is an open source tool that allows developers to package up an application with all of the parts it needs, such as libraries and dependencies.
The resulting Docker image can then be run on ANY machine, be it Windows, Linux, Mac or in the cloud without having to worry about installing numerous dependencies.
For Docker installation instructions, see the Docker main page.
Once Docker is installed, running a docker image on a Linux or Mac OS is very simple. Just open a new terminal and use the command:
docker run -it --rm -v $(pwd):/home -p 8888:8888 pdh21/xidplus:latest
Note
The “docker run” command should automatically download the xidplus image from the cloud. Alternatively, one can download the image with out running, using the command “docker pull pdh21/xidplus:latest”,
Once the docker image is downloaded, open the shown URL link in your browser and you are good to go. The URL will look something like: http://localhost:8888/?token=0312c1ef3b61d7a44ff5346d3d150c23249a548850e13868
Our Docker image has been created to run Jupyter notebook at startup.
The different flags do the following:
The -it flag tells docker that it should open an interactive container instance.
The –rm flag tells docker that the container should automatically be removed after we close docker.
The -p flag specifies which port we want to make available for docker.
The -v flag tells docker which folders should be mount to make them accesible inside the container.
Here: $(pwd) is your local directory you are running the Docker image from. The second part of the -v flag (here: /home) specifies under which path the mounted folders can be found inside the container.
Alternatively, rather than starting with the default Jupyter notebook, you can also access the Docker container directly with bash using the following command:
docker run -it --rm -v $(pwd):/home -p 8888:8888 pdh21/xidplus:latest /bin/bash


Steiner's Muse is under the MIT License, full description available here. Feel free to use and modify our code to start generating your own music!
music21 is a Python library which makes MIDI file processing easy. MIDI files consist of sequences of notes with the following basic properties:
music21 also represents notes within the same key as chords, as it reads MIDI files. The following is an excerpt of a MIDI file as seen by music21:
In our search for a way to describe MIDI files to the model, we have come across a few interesting techniques.
MIDI to Image
YouTuber carykh had converted the music scores into images. Convolutional neural networks (a form of network which excels at image recognition) were then used to learn an agent to generate music.
Character-based embedding
By viewing each note and chord as a character, the types of possible outputs are restricted to characters the network has seen before. This involves forming a dictionary of note combinations that work. To represent each character in the network, one-hot encoding is used.
Due to the complexity of music, it is not feasible to formulate a generative algorithm. Hence, we have decided to use neural networks, which are inspired by the structure of brains.
|
Network
|
Neurons
|
|---|---|
|
|
|
Neural networks consists of an Input Layer, Hidden Layers, and an Output Layer. Each layer consists of nodes; each node simulates a neuron cell. Descriptions of the dataset are fed through the Input Layer. Each node then processes the inputs and outputs a signal for nodes in the next layer. Signals propagate through the Hidden Layers, and finally accumulate at the Output Layer, which represents the predictions made by the network.
To train a network using supervised learning, targets are provided for each input provided. The goal is for the network’s output to match the targets. Through iterations of training sessions, the network learns to match these targets via gradient descent and backpropagation.
In music generation, each input is represented by the notes that are being played at some time x. However, a basic neural network has no ability to remember previous inputs. This presents a problem as notes played at a point in time are dependent on the previous notes played.
Thankfully, recurrent neural networks exist.
The 1st prototype was used as a base to help us gain a better understanding of the task we are undertaking. “Ai music composer” by Manish Pawar was used as a guide.
How does it work
The model reads sequences of notes in the following manner:
Insights Gained
One would expect that the flexibility provided by this form of dataset representation, enables the model to express more creativity. However, that also meant that there were no rules or restrictions set in place to help guide the model to play notes that would sound coherent together. As expected, it resulted in sequences of notes that did not make sense together.
Also, due to the way the notes were read, there was no distinguishable accompaniment and melody in the generated music.
Music Generated
The 2nd prototype was inspired by “How to Generate Music using a LSTM Neural Network in Keras” by Sigurour Skuli.
How does it work
Unlike the 1st prototype, the 2nd prototype reads notes in the following manner:
Insights Gained
Prototype 2 is able to generate much more coherent music as compared to prototype 1. By creating a dictionary of possible notes and chords, the model managed to generate notes within the same key, hence resulting in music that did not sound nonsensical.
However, there were shortcomings to the model. As the velocity was fixed, there was no sense of accompaniment and melody due to the same volumes for every note. There was also a loss of emotion in the generated music, which is often provided by volume variation. Also, due to the fixed offset, there was no variation in tempo for the music generated. This resulted in mundane music that at least made sense.
Music Generated
In an attempt to overcome the shortcomings in prototype 2, prototype 2.5 was designed to include velocity, offset and duration variation.
How does it work
The input for this model is similar to the 2nd prototype. However, in this model, the note and chords velocity and velocities were read as part of their descriptions too. This resulted in an exponential increase in dictionary size.
Insights Gained
Unfortunately, due to the exponential increase in dictionary size, prototype 2.5 could not be executed. We had hit a roadblock as there was insufficient computer power available to run a project of this scale.
Another creative method for our model to learn note transitions, velocity variations, and timing (combination of offset and duration) designs was required if we were to generate better music.
The inspiration for the final prototype is simple : why restrict ourselves to one brain, when we can have multiple brains working on separate tasks.
How does it work
Exactly like it sounds, the final prototype consists of multiple models to generate music:
A sample input for each of the models is described as such (not in actual scale):
Insights Gained
Splitting the problem up for multiple networks proved to be a great idea for reducing the computational power required. Although the results are not as great as other state-of-the-art music generators out there, we feel that there has been tremendous progress for 2 weeks.
Music Generated
Due to the limited time we have, we could not thoroughly curate the datasets for training. In our experience with this project, we have noticed that it is important to ensure that the music used in each training session are similar in genre, speed, key type (major/minor), etc. There may also be many other confounding variables we are not familiar with since we do not have an in-depth knowledge of music composition.
As such, each training session was executed with a dataset that has a maximum of 20 songs. This restricts the knowledge our model can learn, and hence impacts the variation of the music generated.
In future iterations, we hope to be able to prepare larger datasets for the model to train with.
Also, the current model is limited to piano instrumentals only. It would be interesting to train the model on multi-instrumental compositions, and allow the model to compose orchestras. However, the undertaking of such a task requires large computational power, which is currently a restriction.
Steiner’s Muse experimentation and journey was motivated by GET1033 course material, in particular Machine Learning (ML) and Artificial Intelligence (AI). Most of today’s application in ML and AI is cold and practical, commonly used to solve business problems, in the form of Big Data and Data Analytics.
With inspiration from Dr Quitmeyer’s work, which has a common theme of unifying technology with nature, Steiner’s Muse was born. We wanted to introduce a humanistic side to computers. Hence Project Steiner was initiated to have a computer emulate human creativity by generating unique music.
Generating music using ML is not a new concept.
Project Steiner aims to explore the limits of generating music of different genres (jazz, classical, video game, anime etc.) using ML.
The heart of Steiner’s Muse is the LSTM Neural Network, which in the recent decade has exploded in popularity and provides us with an easily accessible generative medium. This is largely due to three main factors:
In the world of music composition, digital synthesizers has also evolved along with computers. Closing the gap between simulated instrument sounds and an actual recording. Thus composing music isn’t bounded by high entry barriers, anybody could download software and be a composer themselves.
Additionally, synthesizer music files (MIDI format) are a file type that allows computer programs to read scores as bits. This allows us to be able to work with music as data, which can then be used in ML. Combining all the points mentioned, the creation of a program to generate unique pieces of music isn’t science fiction but reality.
Steiner’s Muse can not only generate unique pieces for a specific genre, its volume is also unlimited. A human composer may take their entire lives to generate one week’s duration of musical pieces, Steiner’s Muse only needs a few minutes to do the same.
The module’s course material also covered digital intellectual property, where existing copyright laws can’t keep up with technological advancements. This creates grey areas on deciding who owns the copyright for machines that generate copyrightable content.
A prerequisite for Steiner’s Muse to learn how to compose music is having existing compositions to train on. If a person wrote his own songs, programmed his own song generator and used his songs for generating new songs. Then naturally, the person owns the songs generated.
However, what if the song owner, song generator programmer and user are all different people? Then the following questions might not have an answer at all:
Thus in such cases, it may be best to take a policy of least resistance. Where nobody can own the copyright of the computer generated song, nor commercialize it when there are conflicting parties.
This is a representation methodology for any digital format or genre, inspired from Janet H. Murray
Procedural
Within Steiner’s Muse, the procedural aspect might seem low as we are only able to perceive the generated music. However, to gain the capabilities to generate the music, Steiner’s Muse first has to form its own understanding of music composition. After giving it a dataset to study, Steiner’s Muse follows a sequence of rules for learning (a series of calculations). After Steiner’s Muse has created its own judgements on music, it can now follow its own set of rules to generate its own music, when given a sample of music to kickstart the process. Hence, the procedural aspect is high in Steiner’s Muse.
Participatory
A typical user need only input MIDI files for training and then listen to the music generated (Low). If the output is not to his liking, then the user may need to curate similar sounding songs for Steiner’s Muse to train more consistently (Medium).
A advanced user (with knowledge in Machine Learning) can have much higher elevated participation by tuning Steiner’s Muse internal network structure to change the way the music is generated (High). Thus, the participatory affordance varies from low to high depending on the type of user.
Encyclopedic
Steiner’s Muse can generate an endless sequence of music by itself. But in order to do so, it has to process the input into different parts such as notes, timing and velocity. All of this processed data is stored into dictionaries for Steiner’s Muse to refer to. Additionally, there is descriptive console text that shows the user the progress of training and a visualization of the processed data. Thus the encyclopedic affordance is high.
Spatial
The interaction between Steiner’s Muse and the user is just a console. There isn’t much navigation of information or virtual space at all other than visualizing raw or processed input data. Thus the spatial affordance is low.


The Maccabees’ Orlando Weeks to tour UK in 2020 – is new music coming soon?
Fans are patiently awaiting news on his debut solo album
The Maccabees‘ former frontman Orlando Weeks has announced a UK headline tour for 2020 – check out the full schedule below.
Weeks confirmed that he’d almost finished work on his first solo album over the summer, though details on the project are yet to emerge. In September, the musician headed out on the road for a string of live shows.
- Read More: The Maccabees turn Ally Pally into an emotional wreck at poignant, celebratory final ever show
Now the artist has shared new tour dates scheduled for early next year. Weeks’ 2020 tour will begin in Liverpool on March 5 and will also see him stop off in Leeds, Manchester, Glasgow, Norwich, London, Brighton, and Bristol throughout the month.
Tickets will go on general sale at 9am this coming Friday (November 15).
Orlando Weeks will play:
Thu March 05 2020 – LIVERPOOL Arts Club, Loft
Fri March 06 2020 – LEEDS City Varieties Music Hall
Sat March 07 2020 – MANCHESTER Stoller Hall
Sun March 08 2020 – GLASGOW Saint Luke’s
Tue March 10 2020 – NORWICH Norwich Arts Centre
Wed March 11 2020 – LONDON EartH (Theatre)
Thu March 12 2020 – BRIGHTON St Bartholomews Church
Fri March 13 2020 – BRISTOL St Georges
Back in July, Weeks revealed that he’d been at work on his debut album for the past 18 months, while promising that it was “very nearly done”.
“For me, holding my nerve has been a large part of finishing a record,” he said, “and there’s a certain confidence that comes from discovering a song can survive in a room full of strangers.
“The flip side of that is that you unearth problems you wish had stayed buried. There’s every chance it won’t work, but that’s the gamble.”
With new shows on the horizon, fans can expect to hear new material in the coming months.
The Maccabees released four studio albums before parting ways back in 2015. Announcing their split at the time, the band assured fans that they would “continue making music” in other forms.


FacetsExtended facet functions with additional options to customise the strips and axes of the classic ‘wrap’ and ‘grid’ layouts. |
|
|---|---|
Extended grid facets |
|
Extended wrapped facets |
|
Layout panels in a grid with nested strips |
|
Ribbon of panels with nested strips. |
|
Manual layout for panels |
|
Facet helpersHelper functions that can tweak the appearance of facet panels, the strips and position scales.. |
|
Default strips |
|
Strip with themed boxes and texts |
|
Nested strips |
|
Force a facetted plot to have specified panel sizes |
|
Set individual scales in facets |
|
Position guides and scalesAdditional ways to organise and display the x- and y-axes. |
|
Dendrogram position scales |
|
Dendrogram guide |
|
|
|
Axis guide with truncated line |
Axis guide with ticks for minor breaks |
|
Axis guide with ticks for logarithmic breaks |
|
Nested axis guide |
|
Manual axis |
|
Colour scales and guideTwo ways of mapping non-standard aesthetics to colour/fill scales and a legend of coloured text. |
|
String legend |
|
Multiple gradient colour scales |
|
Add a list of scales for non-standard aesthetics |
|
StatsStatistical layers that perform a data transformation |
|
Fitted theoretical density |
|
Difference ribbon |
|
Rolling Kernel |
|
Apply function to position coordinates |
|
Run length encoding |
|
GeomsA small collection of geometry layers. |
|
Point Paths |
|
Polygon parameterisation for rasters |
|
Rectangular rugs in the margins |
|
Aimed text |
|
PositionsTwo position adjustments that can be added to layers. |
|
Segregrating overlapping ranges |
|
Linearly transform coordinates |
|
MiscellaneousFunctions that don’t belong to a family of functions, may might be helpful in specific circumstances. |
|
Secondary axis helper |
|
Element list constructors |
|
Bind together factors |
|
Center limits |


Dots graph paper
Type
Isometricdots
Squaredots
Spacing
1/4 inch
1/2 inch
5 mm
1 cm
Color
Gray
Black
Blue
Green
Orange
Margin
Border
No border
Download:
A4
,
A3
,
Letter
,
Tabloid
Grid paper
Dots grid paper
Lined paper
Axonometric paper
Isometric paper
Hexagonal paper
Knitting paper


Knowledge compilation (KC) is a research area which aims to preprocess information to improve the time required to solve highly-demanding computational tasks (NP and Beyond NP problems). Pioneered more than two decades ago, KC is nowadays a very active field, being at the intersection of several areas of AI and computer science. I will discuss some key dimensions relating to KC: (1) the choice of a tractable language to compile into, which depends on its degree of tractability (operations it supports in polytime) and its succinctness (space efficiency of its representations); (2) the design of knowledge compilers; and (3) the applications of KC within AI, including probabilistic inference, machine learning and explanations.
Propositional SAT solvers are a success story of Computer Science. An academic curiosity until the early 90s, SAT solvers now find an ever increasing range of practical applications. The reason for this success are conflict-driven clause learning (CDCL) SAT solvers. This tutorial covers the use of CDCL SAT solvers as oracles for the class NP and it is organized into three main parts. The first part studies standard techniques for encoding constraints into propositional logic. The second part highlights the use of SAT oracles for solving computationally more challenging problems. The third part delves into practical applications of SAT oracles, highlights representative examples, and summarizes recent research trends.
This tutorial presents a basic overview of Satisfiability Modulo Theories (SMT), focusing mainly on the DPLL(T) approach but also giving some hints about some recent trends. We review the most interesting theories that SMT solvers can deal with and introduce the basic ingredients of a DPLL(T)-based SMT solver, including a description of the Nelson-Oppen combination method.
For SAT, the CDCL (Conflict Driven Clause Learning) calculus is currently considered to be the prime calculus deciding satisfiability. For SMT, the Nelson-Oppen theory combination together with CDCL(T) is currently considered to be the prime calculus deciding satisfiability. From a first-order logic with theories perspective, both approaches are dedicated to logics without first-order variables. I will show that the introduction of first-order variables implies the non-existence of a single prime calculus in the spirit of SAT or SMT. This holds already for decidable fragments of first-order logic with theories. Instead, different calculi based on the instantiation of variables, the approximation of formulas, an explicit partial model building, an implicit model building, and syntactic inference restrictions and combinations thereof represent the state-of-the-art in automated reasoning beyond SAT and SMT.
This tutorial describes the most important ideas of SAT solvers based on conflict driven clause learning, which is the dominant solver paradigm in SAT applications. Basics techniques include clause learning, the notion of implication graph, as well as clause minimization. We further discuss restarts and garbage collecting useless learned clauses. Efficient data structures for boolean constraint propagation are essential too.
Combining decision procedures is a key problem in satisfiability modulo theories. The talk will present the classic Nelson-Oppen solution to this problem, and extensions of this method. We will then discuss model-based combination methods that are implemented in state-of-the-art SMT solvers. We will focus on the common case of combining the theory of uninterpreted functions (QF_UF) with arithmetic and bitvector theories.
Traditional automated theorem proving for first-order logic is based on monolithic first-order calculi such as resolution and superposition. In contrast, instantiation-based methods combine efficient SAT/SMT technology with first-order reasoning. In this lecture we will discuss theoretical aspects such as completeness of instantiation-based calculi for first-order logic, redundancy elimination, implementation details, and applications such as finite model finding, QBF and bounded model checking. We will also take a look at recent developments such abstraction refinement for first-order theorem proving.
Amazon Web Services (AWS) uses and develops tools based on formal verification to reason about the security of systems that customers build on AWS and also to reason about the security of AWS itself. In this session, we will dive into how AWS uses SMT-based verification techniques to help customers reason about properties of their AWS deployments, such as access control and network reachability. We will also explore characteristics of AWS that make it amenable to such verification.
Modern SAT and SMT solvers are fantastically efficient on a wide variety of inputs, and they now routinely solve instances with a massive number of constraints and variables. This is, of course, despite the fact that SAT is NP-Complete, and so does not have an efficient (polynomial-time) algorithm unless P = NP, which is widely believed to be false. Clearly the theory of NP-Completeness is far too coarse to explain the behaviour of modern SAT solvers, and a more refined theoretical picture is needed.
Enter propositional proof complexity, which is a theory that gives a much more refined analysis of SAT solvers. In a word, the “proof complexity” approach to studying SAT solvers is to consider the behaviour of SAT solvers on instances with no satisfying assignments, noting that any complete solver must report “UNSAT” when given such an instance as input. The execution trace of the solver on this input is then a proof (in fact, a resolution proof) that the formula is unsatisfiable. We can therefore study the behaviour of SAT solvers by instead studying the proofs that they produce, and this allows us to abstract away many of the complex heuristics and technical engineering that goes into these algorithms.
In this talk we will give a survey of propositional proof complexity, emphasizing recent results studying SAT and SMT solvers from this perspective. No advanced background in complexity theory will be required.
This lecture presents HiFrog, a fully featured function-summarization-based model checker that uses SMT as the modeling and summarization language. The tool supports several encoding precisions through SMT: uninterpreted functions, linear real/integer arithmetics, and propositional logic. It employs our flexible interpolation framework for the construction and the use of function summaries most suitable for incremental program verification. In addition the tool allows optimized traversal of reachability properties, counter-example-guided summary refinement, summary compression, and user-provided summaries. I will describe the use of the tool through the description of its architecture and a rich set of features, give the tool demo and compare it to our earlier work where we introduced the SAT-based function summarization approach. The presentation will be complemented by an experimental evaluation on the practical impact the different SMT precisions have on program verification.
This lecture surveys selected discoveries and ideas in parallel reasoning, with a focus on parallel and distributed strategies for mechanical theorem proving in first-order logic. The lecture is organized in four parts. The first part covers approaches to parallel theorem proving prior to the inception of the Clause-Diffusion method. The second part presents the Clause-Diffusion method, that played a key role in the evolution of parallel reasoning from the parallelization of inferences to the parallelization of search, which is the dominating paradigm today. The third part draws both historic and conceptual connections between parallel theorem proving in first-order logic and parallel satisfiability (SAT) solving. The fourth part discusses the potential for new forays in parallel model-based theorem proving.
This tutorial describes an approach for systematic analysis of software systems. The primary focus is on automated testing where the user describes desired tests using logical formulas and SAT solvers enumerate non-equivalent test inputs that embody high quality test suites. A key enabling technology is provided by the well-known Alloy modeling language and SAT-based tool-set. While the focus is on the central ideas at the core of the approach, the tutorial also presents some recent work that uses SAT for debugging and repair.
Program synthesis is expanding rapidly and getting a lot of attention from both industry and academia. The goal of program synthesis is to find a program that satisfies the user intent expressed in the form of some specification. Program synthesis has proven to be useful to both end-users and programmers. For instance, program synthesis has been used to automate tedious tasks that arise in everyday life, such as string manipulations in spreadsheets or data wrangling tasks in R. Program synthesis has also been used for improving programmer productivity by automatically completing parts of a program or helping programmers use complex APIs.
This tutorial aims at showing how SAT technology and ideas can be used to synthesize real code. We will show how the synthesis problem of finding a sequence of Java APIs that satisfies a set of test cases can be encoded into SAT and solved via model enumeration. This approach works particularly well for libraries with many types. However, for programs that contain only one type (e.g. strings, tables), we need to augment this approach with specifications. We will show how these specifications can be used in a conflict-driven program synthesis framework. This framework introduces the notion of learning to program synthesis and opens new research directions that can push the boundaries of program synthesis.
Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a (typically quantifier-free) first-order formula with respect to some decidable first-order theory and their combinations thereof. SMT engines are widely used as backend engines in many application domains. Many SMT problems of interest, however, require the capability of finding models that are optimal wrt. some objective functions. These problems are grouped under the umbrella term of Optimization Modulo Theories (OMT).
This tutorial aims at providing an overview of the main problems, techniques, functionalities and applications of OMT, focusing on both expressivity and efficiency. Specific topics include, e.g., supporting objective functions expressed in distinct theories of interest; handling OMT incrementally; dealing with multiple objectives; dealing with important OMT sub-cases like Max-SMT. We briefly describe some interesting applications. Finally, we indicate some open problems and research directions.
Craig Interpolation is an important technique in applications of software verification. Interpolants extracted from proofs of software correctness can, for example, be used to generate loop invariants. In this talk, I will discuss how interpolants from so-called local proofs can be efficiently constructed, using for example a first order prover. I will also describe a technique of generating and optimizing interpolants based on transformations over the so-called “grey area” of local proofs. While local proofs admit efficient interpolation algorithms, standard complete proof systems, such as superposition, for theories having the interpolation property are not necessarily complete for local proofs. In this talk, I will therefore also investigate interpolant extraction from non-local proofs in the superposition calculus and prove a number of general results about interpolant extraction and complexity of extracted interpolants.
In this talk I will summarize recent efforts in machine learning for automated reasoning and the work of the N2Formal research group at Google. Our mission is to build an artificial mathematician, one that can understand natural mathematics found in scientific articles and books, and translate it to formal representations. So far, we have built a machine learning environment based on the interactive theorem prover HOL Light and a neural theorem prover called DeepHOL. Given a statement to prove, DeepHOL automatically selects appropriate premises and tactics, just like a human mathematician would. Training DeepHOL using imitation and reinforcement learning already achieves state-of-the-art performance in higher-order reasoning.


Worcester Red Sox to unveil new name and logo
by EndPlayWORCESTER, Mass. - The Triple-A affiliate of the Boston Red Sox is announcing its new name in conjunction with its move from Rhode Island to Massachusetts.
The new team name will be announced during a live television ceremony on Monday night.
The team, currently known as the Pawtucket Red Sox, or PawSox, will play one more season in Rhode Island before moving to a new $100 million, 10,000-seat ballpark in Worcester starting in the 2021 season.
The team has been referred to as the Worcester Red Sox.
>> Worcester city council approves loan deal for WooSox, stadium
Team president Charles Steinberg tells The Telegram & Gazette there have been more than 100 suggestions for a new name.
In addition to the name, the team will unveil a new logo and fan apparel at the ceremony airing on the New England Sports Network.


42
Current Credits
42
Recipeients
42
Number of SMS
Groups
5
Contacts
153
Numbers
Grade 8
Grade 9
Grade 10
No contacts. Add new contacts.
Compose New SMS
Type youe SMS below.
Character Used
142
Clear
Send


Salmon Cookies Shop
Branch Info
Branch Location :
Minimum Customers Per Hour :
Maximum Customers Per Hour :
Average Sales Per Hour :
Back To Home


智慧植栽系統
總 覽
操作
操作盆栽
選擇模式
手動
時間設定
觸發條件
新增/查看盆栽資訊
紀錄
歷史紀錄
3+
Alerts Center
December 12, 2019
A new monthly report is ready to download!
December 7, 2019
$290.29 has been deposited into your account!
December 2, 2019
Spending Alert: We've noticed unusually high spending for your account.
Show All Alerts


{% macro output(headingSize) %}
Web chat (opens in a new window)
Monday to Friday, 9am to 5pm.
Send us a message (opens in a new window)
We'll get back to you within 10 days.
0300 123 7050
Monday to Friday, 9am to 5pm.
Find out about call charges (opens in a new window)


User Login
If you are a PRIDE Submitter and want to download your own experiments, you can use the username and password you have chosen when you register with PRIDE.
If you are a journal reviewer, you should be given a PRIDE reviewer account. Type in the reviewer account username and password.
Click on Login button once finished, PRIDE Inspector will start to retrieve all of your project details.
My projects
Once login, you should see all your experimental projects listed in "My projects" dialog.
Click on View files button to download project file.
Project Download
The details of the experiments you can download are shown in the experiment details. The table below gives a short description for every column in the experiment details table:
| Column | Description |
| File Name | The name of the file |
| Size(M) | The size of experiment file to download in megabyte. |
| Type | Experimental file type |
| Download | Checkbox which you can select which experiment to download |


WITNESS LIST Criminal Jurisprudence Committee April 2, 1997-2:00P HB 490 For: Puente, Rep. Robert (Himself) On: Griffith, David (TDPS) HB 542 For: Acevedo,III, Ernest (Himself) Puente, Rep. Robert (Himself) Registering, but not testifying: Against: McLaughlin, James (TX Police Chiefs Assn) Scott, Rider (Greatr Dallas Crime Com) Watson, Sgt. Rick A. (Chief Click, Dallas PD) HB 968 For: Frantzen, Tim (CPRL) Hill, Gene (CPRL, TGBA) Hodges, Dean (CPRL) McFarlane, Sharon (CPRL, TGBA) Spates, Sherry (CPRL, TGBA) Uher, Rep. Tom (Himself) Against: Bias, James (Humane Society, US) Garcia, David (Houston SPCA) Gilleland, Ellis (Himself, Tx Animals) Registering, but not testifying: For: Clayton, Bill (CPRL) HB 1119 For: Allen, Rep. Ray (Himself) Hubbarth, Wm "Rusty" (Justice for All) Registering, but not testifying: For: Lyons, Laura (TAASA) Myers, Nell (People Against Vio Crim) Against: Hampton, Keith S. (TCDLA) McLaughlin, James (TX Police Chiefs Assoc) Watson, Sgt. Rick A. (Chief Click, Dallas PD) On: Bozarth, Melinda (TDCJ) Kazen, Raven (TDCJ-Victims Services) Shackelford, Wesley (TJPC) Wallace, Sherri (Dallas Co. Crim DA) HB 1467 For: Canales, Judge Paul (Himself) Puente, Rep. Robert (Himself) Registering, but not testifying: On: Cranford, Susan (TDCJ-CJAD) White, Bonita (TDCJ-CJAD) HB 1619 For: Landinger, Karen (Herself) Pickett, Rep. Joe (Himself) Registering, but not testifying: For: Davis, John (El Paso, Dist Atty) Against: Scott, Rider (Himself) HB 1620 For: Davis, John (El Paso Dist Atty) Pickett, Rep. Joe (Himself) HB 2194 For: Davis, Grace L. (Herself) Wise, Rep. Miquel (Himself) Registering, but not testifying: For: Lyons, Laura (TAASA) HB 2195 For: Davis, Grace L. (Herself) Wise, Rep. Miquel (Himself) Registering, but not testifying: For: Lyons, Laura (TAASA) HB 2435 On: Johnson, Brian (Office of Atty General) Registering, but not testifying: For: McLaughlin, James (TX Police Chiefs Assoc) Scott, Rider (Greater Dallas Crime Co) HB 2634 For: Baker, David W. (Tx Adult Probation Asso) Registering, but not testifying: On: Cranford, Susan (TDCJ-CJAD) White, Bonita (TDCJ-CJAD) HB 2635 On: Baker, Tom (TDCJ-State Jail Div.) HB 2658 For: Davis, John (El Paso, Dist Atty) Hirschi, Rep. John (Himself) Mancha, Barry (Wichita Co, Dist Atty) HB 3062 For: Davis, Grace L. (Herself) Hightower, Rep. Allen (Himself) Lyons, Laura (TAASA) Pelaez-Wagner, Natacha (Herself) Torres, Vincent (Himself) On: Kelly, Laurel (Office of Attorney Gen) Registering, but not testifying: For: Cole, Pat (TX Council/Family Viol) Davis, John (El Paso Co, DA) Gray, Chandler (TX CASA) Macha, Barry (Himself) Mok, Amy Wong (TAASA) Piper, Jane Quentan (TX CASA) Schneider, Christina (TX Council Family Viol) Wallace, Sherri (Dallas Co, Crim DA)


Emirate Airline Sends Woman Off Plane For Being Too Overweight
by Faderera FaladeOne Precious Mensah, the 2019 winner of Atinka TV’s plus size women reality show ‘Di Asa’ in Ghana, has allegedly been refused entry into the Emirates Airlines’ plane to Dubai.
Naija News understands that she was not allowed in after the airline complained that her body size is bigger than a single seat on Emirates Airlines’ flight.
Precious alongside two runners-up, Maafia and Gaza, were given a sponsored trip to Dubai, as a price for coming on top during the competition.
The runners-up, however, were able to go with the flight.


public interface ICollectionManager
| Modifier and Type | Method and Description |
|---|---|
Collection |
getCollection(UUID uuid)
Use this to get a collection based on its UUID.
|
Collection |
getCurrentCollection(String player)
Use this to get the current collection the specified player is standing
in.
|
IWorldMap |
getWorldMap()
Used to get the WorldMap interface.
|
boolean |
putNewCollection(Collection coll,
Location baseloc)
The method to add a new collection.
|
Plot |
reconstructPlot(String plugin,
String type,
Collection parent,
UUID uuid) |
Plot reconstructPlot(String plugin, String type, Collection parent, UUID uuid)
boolean putNewCollection(Collection coll, Location baseloc)
coll
- The collection to add.baseloc
- The center for the 3x3 area that will be claimed for that
collection. The y axis doesn't matter.IWorldMap getWorldMap()
Collection getCurrentCollection(String player)
player
- The name of the player you wan't to get info on.Collection getCollection(UUID uuid)
uuid
- The UUID of the collection you are requesting.


General
GET /api/series
Returns a list of series.
The following query string parameters are supported to filter, sort and pagingate the returned list:
| Query String Parameter | Type | Description |
|---|---|---|
filter |
string |
A comma-separated list of filters to limit the results with (see Filtering). See the below table for the list of available filters |
sort |
string |
A comma-separated list of sort criteria (see Sorting). See the below table for the list of available sort criteria |
limit |
integer |
The maximum number of results to return (see Pagination) |
offset |
integer |
The index of the first result to return (see Pagination) |
The following filters are available:
| Filter Name | Description |
|---|---|
contributors |
Series where the contributors specified in the metadata field match. Can occur multiple times |
Creator |
Series where the creator specified in the metadata field match (please use creator for version 1.1.0 and higher instead) |
creationDate |
Series that were created between two dates. The two dates are in UTC format to the second i.e. yyyy-MM-ddTHH:mm:ssZ e.g. 2014-09-27T16:25Z. They are seperated by a forward slash (url encoded or not) so an example of the full filter would be CreationDate:2015-05-08T00:00:00.000Z/2015-05-10T00:00:00.000Z |
language |
Series based upon the language specified |
license |
Series based upon the license specified |
organizers |
Series where the organizers specified in the metadata field match.  Can occur multiple times |
textFilter |
Filters series where any part of the series' metadata fields match this value |
title |
By the title of the series |
identifier |
By the technical identifiers of the series. Can occur multiple times (version 1.1.0 and higher) |
description |
By the description of the series (version 1.1.0 and higher) |
creator |
Series where the creator specified in the metadata field match (version 1.1.0 and higher) |
publishers |
Series where the publishers specified in the metadata field match. Can occur multiple times (version 1.1.0 and higher) |
rightsholder |
By the rights holder of the series (version 1.1.0 and higher) |
The list can be sorted by the following criteria:
| Sort Criteria | Description |
|---|---|
contributors |
By the series contributors |
created |
By when the series was created |
creator |
By who created the series |
title |
By the title of the series |
Sample request
https://opencast.domain.com/api/series?filter=creator:Default Administrator&sort=title:ASC&limit=2&offset=1
Response
200 (OK)
: A (potentially empty) list of series is returned as JSON array contained JSON objects describing the series:
| Field | Type | Description |
|---|---|---|
identifier |
string |
The unique identifier of the series |
created * |
datetime |
The data when the series was created |
creator |
string |
The name of the user that has created the series |
title * |
string |
The title of the series |
contributors * |
array[string] |
The contributors of the series |
publishers * |
array[string] |
The publishers of the series |
subjects * |
array[string] |
The subjects of the series |
organizers * |
array[string] |
The organizers of the series |
description * |
string |
The description of the series (version 1.1.0 and higher) |
language * |
string |
The language of the series (version 1.1.0 and higher) |
license * |
string |
The license of the series (version 1.1.0 and higher) |
rightsholder * |
string |
The rights holder of the series (version 1.1.0 and higher) |
* Metadata fields from the default metadata catalog dublincore/series
Example
[
{
"identifier": "dc11ab0a-fd5b-462d-a939-0a4703df38cf",
"creator": "Opencast Project Administrator",
"created": "2018-03-19T15:40:21Z",
"subjects": [
"Mathematics"
],
"organizers": [
"John Doe",
"Prof. X"
],
"publishers": [
"University of Prof. X"
],
"contributors": [
"Hans Muster",
"Maria Müller"
],
"title": "Advanced Mathematics"
},
{
"identifier": "6a4462ca-3783-432a-81c3-962ca756dc6f",
"creator": "Opencast Project Administrator",
"created": "2018-03-19T15:41:20Z",
"subjects": [
"Physics",
"Mathematics"
],
"organizers": [
"Dr. Who"
],
"publishers": [
"University of Prof. X",
"Doctor Who"
],
"contributors": [
"Dr. Who"
],
"title": "Basics of Physics"
}
]
GET /api/series/{series_id}
Returns a single series.
Response
200 (OK)
: The series is returned as a JSON object containing the following fields:
| Field | Type | Description |
|---|---|---|
identifier |
string |
The unique identifier of the series |
created * |
datetime |
The data when the series was created |
creator |
string |
The name of the user that has created the series |
title * |
string |
The title of the series |
contributors * |
array[string] |
The contributors of the series |
publishers * |
array[string] |
The publishers of the series |
subjects * |
array[string] |
The subjects of the series |
organizers * |
array[string] |
The organizers of the series |
organization * |
string |
The identifier of the tenant this series belongs to |
opt_out |
string |
Field is not used |
language * |
string |
The language of the series (version 1.1.0 and higher) |
license * |
string |
The license of the series (version 1.1.0 and higher) |
rightsholder * |
string |
The rights holder of the series (version 1.1.0 and higher) |
* Fields from the default metadata catalog dublincore/series
404 (NOT FOUND)
: The specified series does not exist.
Example
{
"identifier": "dc11ab0a-fd5b-462d-a939-0a4703df38cf",
"creator": "Opencast Project Administrator",
"opt_out": false,
"created": "2018-03-19T15:40:21Z",
"subjects": [
"Mathematics"
],
"organization": "mh_default_org",
"organizers": [
"John Doe",
"Prof. X"
],
"description": "This is a advanced mathematics course",
"publishers": [
"University of Prof. X"
],
"contributors": [
"Hans Muster",
"Maria Müller"
],
"title": "Advanced Mathematics"
}
POST /api/series
Creates a series.
| Form Parameters | Required | Type | Description |
|---|---|---|---|
metadata |
yes | catalogs |
Series metadata |
acl |
no | acl |
A collection of roles with their possible action |
theme |
no | string |
The theme ID to be applied to the series |
Sample
metadata:
[
{
"label": "Opencast Series DublinCore",
"flavor": "dublincore/series",
"fields": [
{
"id": "title",
"value": "Captivating title"
},
{
"id": "subjects",
"value": ["John Clark", "Thiago Melo Costa"]
},
{
"id": "description",
"value": "A great description"
}
]
}
]
acl:
[
{
"allow": true,
"action": "write",
"role": "ROLE_ADMIN"
},
{
"allow": true,
"action": "read",
"role": "ROLE_USER"
}
]
theme:
"1234"
Response
201 (CREATED)
: A new series is created and its identifier is returned in the Location
header.
400 (BAD REQUEST)
: The request is invalid or inconsistent.
401 (UNAUTHORIZED)
: The user doesn't have the rights to create the series.
Location: http://api.opencast.org/api/series/4fd0ef66-aea5-4b7a-a62a-a4ada0eafd6f
{
"identifier": "4fd0ef66-aea5-4b7a-a62a-a4ada0eafd6f"
}
DELETE /api/series/{series_id}
Deletes a series
Response
204 (NO CONTENT)
: The series has been deleted.
404 (NOT FOUND)
: The specified series does not exist.
Metadata
This section describes how to use the External API to work with metadata catalogs associated to series.
Opencast manages the bibliographic metadata of series using metadata catalogs which are identified by flavors.
The default metadata catalog for Opencast series has the flavor dublincore/series
. Opencast additionally supports
extended metadata catalogs for series that can be configured.
The External API supports both the default series metadata catalog and series extended metadata catalogs. For the default series metadata catalog, the metadata is directly returned in the responses.
Since the metadata catalogs can be configured, the External API provides a facility to retrieve the catalog configuration of series metadata catalogs. For more details about this mechanism, please refer to "Metadata Catalogs".
GET /api/series/{series_id}/metadata
Returns a series' metadata of all types.
Response
200 (OK)
: The series' metadata are returned as catalogs
404 (NOT FOUND)
: The specified series does not exist.
Example
[
{
"label": "EVENTS.EVENTS.DETAILS.CATALOG.EPISODE",
"flavor": "dublincore/series",
"fields": [
{
"id": "title",
"readOnly": false,
"value": "Captivating title",
"label": "EVENTS.EVENTS.DETAILS.METADATA.TITLE",
"type": "text",
"required": true
},
{
"id": "description",
"readOnly": false,
"value": "A great description",
"label": "EVENTS.EVENTS.DETAILS.METADATA.DESCRIPTION",
"type": "text_long",
"required": false
}
]
},
{
"label": "EVENTS.EVENTS.DETAILS.CATALOG.LICENSE",
"flavor": "license/series",
"fields": [
{
"id": "license",
"readOnly": false,
"value": "CCND",
"label": "EVENTS.EVENTS.DETAILS.METADATA.LICENSE",
"collection": {
"BSD": "EVENTS.LICENSE.BSD",
"GPL3": "EVENTS.LICENSE.GPL",
"CCND": "EVENTS.LICENSE.CCND"
},
"type": "text",
"required": false
}
]
}
]
GET /api/series/{series_id}/metadata
Returns a series' metadata collection of the given type when the query string parameter type is specified. For each metadata catalog there is a unique property called the flavor such as dublincore/series so the type in this example would be "dublincore/series".
| Query String Parameters | Type | Description |
|---|---|---|
type |
flavor |
The type of metadata to return |
Response
200 (OK)
: The series' metadata are returned as fields
above.
404 (NOT FOUND)
: The specified series does not exist.
Example
[
{
"id": "title",
"readOnly": false,
"value": "Captivating title",
"label": "EVENTS.EVENTS.DETAILS.METADATA.TITLE",
"type": "text",
"required": true
},
{
"id": "description",
"readOnly": false,
"value": "A great description",
"label": "EVENTS.EVENTS.DETAILS.METADATA.DESCRIPTION",
"type": "text_long",
"required": false
}
]
PUT /api/series/{series_id}/metadata
Update a series' metadata of the given type.
| Query String Parameters | Required | Type | Description |
|---|---|---|---|
type |
yes | flavor |
The type of metadata to update |
| Form Parameters | Required | Type | Description |
|---|---|---|---|
metadata |
yes | values |
Series metadata as Form param |
Note that metadata fields not contained in the argument won't be updated.
Example
metadata:
[
{
"id": "title",
"value": "Captivating title - edited"
},
{
"id": "creator",
"value": ["John Clark", "Thiago Melo Costa"]
},
{
"id": "description",
"value": "A great description - edited"
}
]
Response
200 (OK)
: The series' metadata have been updated.
400 (BAD REQUEST)
: The request is invalid or inconsistent.
404 (NOT FOUND)
: The specified series does not exist.
Returns: The full metadata catalog of the series
DELETE /api/series/{series_id}/metadata
Deletes a series' metadata catalog of the given type. All fields and values of that catalog will be deleted.
| Query String Parameters | Required | Type | Description |
|---|---|---|---|
type |
yes | flavor |
The type of metadata to delete |
Note that the default metadata catalog (type dublincore/series) cannot be deleted.
Response
204 (NO CONTENT)
: The metadata have been deleted.
403 (FORBIDDEN)
: The main metadata catalog dublincore/series cannot be deleted as it has mandatory fields.
404 (NOT FOUND)
: The specified series does not exist.
Access Policy
GET /api/series/{series_id}/acl
Returns a series' access policy.
Response
200 (OK)
: The series' access policy of type acl
is returned.
404 (NOT FOUND)
: The specified series does not exist.
Example
[
{
"allow": true,
"action": "write",
"role": "ROLE_ADMIN"
},
{
"allow": true,
"action": "read",
"role": "ROLE_USER"
}
]
PUT /api/series/{series_id}/acl
Updates a series' access policy.
| Parameters | Required | Type | Description | Default | Version |
|---|---|---|---|---|---|
acl |
yes | acl |
Access policy to be applied | ||
override |
no | boolean |
Whether the episode ACL of all events of this series should be removed | false | 1.2.0 |
Note that the existing access policy of the series will be overwritten.
Response
200 (OK)
: The updated access control list of type acl
is returned.
404 (NOT FOUND)
: The specified series does not exist.
Example
acl:
[
{
"allow": true,
"action": "write",
"role": "ROLE_ADMIN"
},
{
"allow": true,
"action": "read",
"role": "ROLE_USER"
}
]
returns
[
{
"allow": true,
"action": "write",
"role": "ROLE_ADMIN"
},
{
"allow": true,
"action": "read",
"role": "ROLE_USER"
}
]
Properties
Properties can be assigned to series in means of key-value pairs. Both the property name (key) and property value are
of type string
.
GET /api/series/{series_id}/properties
Returns a series' properties.
Response
200 (OK)
: The series' properties are returned as property
404 (NOT FOUND)
: The specified series does not exist.
Example
{
"ondemand": "true",
"live": "false"
}
PUT /api/series/{series_id}/properties
Add or update properties of a series.
| Form parameters | Required | Type | Description |
|---|---|---|---|
properties |
yes | property |
List of properties to be assigned to the series |
The request can be used to add new properties and/or update existing properties. Properties not included in the request are not affected.
Response
200 (OK)
: The added/updated series' properties are returned as JSON object.
404 (NOT FOUND)
: The specified series does not exist.
Example
Assume that the series already has the properties theme
=1000
and live
=true
.
To add the property ondemand
and update the value of the existing property live
the following form parameter is
used:
properties:
{
"ondemand": "true",
"live": "false"
}
The response of the request will contain the properties added/updated by this request:
{
"ondemand": "true",
"live": "false"
}
After this, the properties of the series are:
{
"theme": "1000",
"ondemand": "true",
"live": "false"
}


Last updated: November 15, 2017.
The mail-transfer program Sendmail can easily be configured for STARTTLS transport security using your Let's Encrypt credentials.
Consider also reading my article on email integrity and anti-spam/anti-spoofing with Sendmail.
1. Locate your Let's Encrypt directory.
sudo ls /etc/letsencrypt/live/example.com/
Replace example.com with your domain. The output should look like this:
cert.pem chain.pem fullchain.pem privkey.pem
Note: you need to have run letsencrypt first.
2. Modify sendmail.mc
sudo nano /etc/mail/sendmail.mc
dnl#
define(`confCACERT_PATH', `/etc/letsencrypt/live/example.com')dnl
define(`confCACERT', `/etc/letsencrypt/live/example.com/chain.pem')dnl
define(`confSERVER_CERT', `/etc/letsencrypt/live/example.com/cert.pem')dnl
define(`confSERVER_KEY', `/etc/letsencrypt/live/example.com/privkey.pem')dnl
dnl#
Append the above to the end of the file, replacing example.com with your domain.
This will also work with an ECDSA private key and Let's Encrypt.
dnl#
define(`confCACERT_PATH', `/etc/letsencrypt/ecdsa/example.com')dnl
define(`confCACERT', `/etc/letsencrypt/live/example.com/0001_chain.pem')dnl
define(`confSERVER_CERT', `/etc/letsencrypt/ecdsa/example.com/0000_cert.pem')dnl
define(`confSERVER_KEY', `/etc/letsencrypt/ecdsa/example.com/privkey.pem')dnl
dnl#
2. Reconfigure and restart Sendmail
sudo su
m4 /etc/mail/sendmail.mc > /etc/mail/sendmail.cf
exit
sudo service sendmail restart
I recommend uBlock Origin to protect against Disqus tracking and advertising.


✨ Main page ✨ About me ✨ Mystery ✨ Table ✨ Survey ✨ Contact ✨
This is exactly the same table as in the picture! ✨ wow! ✨ 😲
👽


Nick Jonas Celebrates New John Varvatos Fragrance On Day Off In Miami
Nick Jonas holds up his new fragrance JVxNJ Silver Edition with John Varvatos at the Macy’s Aventura store on Thursday (November 14) in Miami, Fla.
The 27-year-old musician and actor collaborated with the fashion designer on their latest scent, which is out now.
Nick spent his evening off from the Happiness Begins Tour to celebrate the launch of their new fragrance, which is described as a “fresh, effervescent and exhilarating fragrance that transports you and captures the moment when you can truly let go and relax.”
In case you missed the news, it was recently announced that the Jonas Brothers will be performing on the 2019 American Music Awards!


zcash-android-wallet-sdk
/
cash.z.wallet.sdk.block
/
CompactBlockProcessor
/
stop
stop
suspend
fun
stop
(
)
:
Unit
Sets the state to
Stopped
, which causes the processor loop to exit.


{% macro form(type) %}
| Card number: | ************7470 |
| Expiry date: | 11/19 |
| Name on card: | {{ data['full-name'] or 'Firstname Lastname' }} |
| Billing address: | 12 Nelson Road, Reading, RG1 1AA |
| Email address: |<EMAIL_ADDRESS>|
| Amount to pay: | £{% if type == 'certificate' %}15{% else %}75{% endif %}.00 |