{% extends 'panel.html' %} {% load static from staticfiles %} {% block head_title %}RunKeeper data import - Finalization{% endblock %} {% block panel_content %}
If available, we'll import the following data from RunKeeper. We may update your data sets over time to reflect updated data available from this data source.
{% include "scopes/study-data-description.html" %}Connecting this data to your account will earn you a RunKeeper badge for your Open Humans profile!
{% endblock %}


'Not on the wing!' - Liverpool fans nervous as Alex Oxlade-Chamberlain replaces Mohamed Salah
Mo Salah has been struggling with an injury in the build up to Crystal Palace vs Liverpool
by Scott TrotterJurgen Klopp has opted to start Mohamed Salah on the bench and bring Alex Oxlade-Chamberlain into the fold to face Crystal Palace.
The Egyptian international has struggled with a knock from the win over Leicester City and suffered a set back in the Reds win over Manchester City before the international break.
Ahead of the game Klopp said: “It was getting better and better and then…it is good but it was after the (City) game again, another tackle, it flared up again.
“It is not serious but in the short period we have to let it settle it is always tight for the game.
“We will see. He trained completely yesterday, a full session, but we have to see how he reacted.”
He was clearly not convinced enough to start Salah against the Eagles and Oxlade-Chamberlain makes his ninth Premier League appearance of the season as he continues to reestablish himself as a crucial part of Klopp's plans.
Fans appear to be pretty happy the former Arsenal star is been given a chance but a few are definitely a little nervous about the fact he may be starting directly in Salah's position. However, Klopp could opt for a diamond formation this afternoon.
See how fans reacted:


Welcome to Soldat Enterprise! We are tech consultancy firm, our headquarters being in Skibereen in Co.Cork. We specialise in the latest the software from Hyper Automation to Augmented Reality. We also have research centres located across Ireland and the UK alongside our offices. We offer premium business advice at an affordable price!


'Beast' Mtawarira retires after beauty of a World Cup win for South Africa
South Africa World Cup winner Tendai Mtawarira announced his retirement from international rugby on Wednesday and bows out as the most capped prop in Springbok history.
CAPE TOWN: South Africa World Cup winner Tendai Mtawarira announced his retirement from international rugby on Wednesday and bows out as the most capped prop in Springbok history.
The 34-year-old, whose ball carries led to affectionate chants of 'Beast' in stadia around the world, was a stand-out performer as the Boks beat England 32-12 to lift the Webb Ellis trophy in Yokohama on Saturday, the last of his 117 tests.
He won a number of scrum penalties on the loose-head side as South Africa dominated the set-piece to lay the platform for their third World Cup title.
"I am grateful for the opportunities afforded to me by many top coaches at the Springboks and the Sharks, and grateful to my numerous team mates in green and gold, and black and white, over the years," Zimbabwe-born Mtawarira said in a statement from South African Rugby.
"But most of all, to my wife Kuziva, and our two beautiful children, Talumba and Wangu, for sacrificing so much to allow me to chase my dreams. I really appreciate it immensely.
"I've been blessed to have been part of teams that achieved so much success over the years, and I have many memories to cherish forever, but I can honestly say that winning the Rugby World Cup is the perfect ending and cherry on top."
Mtawarira retires as the third most capped Bok behind former lock Victor Matfield (127 caps) and wing Bryan Habana (124).
He won his first cap in 2008 and also has the most appearances of any South African in Super Rugby with 159, all for the Durban-based Sharks.
(Reporting by Nick Said; Editing by Christian Radnedge)


{{ var pageTitle = 'Node Server Template Page'; var ejsUp = 'This message was placed here by ejs'; }} {{include inc.start.html}} {{include inc.header.html}}
Hey I am a node server manager.
I allow you to launch and monitor all of your node servers.
| name: | description: | status: | controls: |
|---|
There is no connection to the server :(
{{= ejsUp }}


Message Log
During this tutorial we’ll create a new MessageLog
class that will allow us to add messages and draw them to a console. We’ll then add a bunch of messages to the log to prove that it works
Designing the Message Log Class
How do we want to handle messages? We want a class that allows us to add messages to some sort of list. We also want to display some number of previous messages and have new messages scroll into view when they are added. Old messages after a certain limit should scroll out of view.
A decent structure for handling this is a Queue. You can read more about them from the link but basically you can think of it as a line at the grocery store. The first person to get in line is the first person to check out. In terms of our message log the oldest message will be the first one removed from the history.
Creating the Message Log Class
Create a new class in the Systems
folder called MessageLog.cs
. Add the following code to it:
// Represents a queue of messages that can be added to
// Has a method for and drawing to an RLConsole
public class MessageLog
{
// Define the maximum number of lines to store
private static readonly int _maxLines = 9;
// Use a Queue to keep track of the lines of text
// The first line added to the log will also be the first removed
private readonly Queue<string> _lines;
public MessageLog()
{
_lines = new Queue<string>();
}
// Add a line to the MessageLog queue
public void Add( string message )
{
_lines.Enqueue( message );
// When exceeding the maximum number of lines remove the oldest one.
if ( _lines.Count > _maxLines )
{
_lines.Dequeue();
}
}
// Draw each line of the MessageLog queue to the console
public void Draw( RLConsole console )
{
console.Clear();
string[] lines = _lines.ToArray();
for ( int i = 0; i < lines.Length; i++ )
{
console.Print( 1, i + 1, lines[i], RLColor.White );
}
}
}
Hooking up the Message Log
All of the remaining work will be handled in Game.cs
.
First in the section at the top of the file where we define Player
, DungeonMap
and CommandSystem
add the following:
public static MessageLog MessageLog { get; private set; }
Next in the Main()
method of Game.cs
add some code to instantiate a new MessageLog
and add a couple of messages to it. Don’t forget to also remove the old code that was setting the _messageConsole
to a blue color and printing “Messages” on it.
// Create a new MessageLog and print the random seed used to generate the level
MessageLog = new MessageLog();
MessageLog.Add( "The rogue arrives on level 1" );
MessageLog.Add( $"Level created with seed '{seed}'" );
// Remove these lines:
_messageConsole.SetBackColor( 0, 0, _messageWidth, _messageHeight, Swatch.DbDeepWater );
_messageConsole.Print( 1, 1, "Messages", Colors.TextHeading );
The last thing we need to do is call MessageLog.Draw()
in our OnRootConsoleRender()
method near where we call DungeonMap.Draw()
and Player.Draw()
.
MessageLog.Draw( _messageConsole );
Temporary Code for Generating Lots of Messages
Just to prove that our messages work the way we expect and remove old messages once we reach the limit we set of “9” lets log a bunch of messages. We’ll do this by adding a private member variable _steps
and increment it each time the player acts.
// Temporary member variable just to show our MessageLog is working
private static int _steps = 0;
// In OnRootConsoleUpdate() replace the if ( didPlayerAct ) block
if ( didPlayerAct )
{
// Every time the player acts increment the steps and log it
MessageLog.Add( $"Step # {++_steps}" );
_renderRequired = true;
}
Code on GitHub
As always the code for the tutorial series so far can be found on GitHub:
Bored waiting for the next tutorial?  It’s a fantastic ASCII art editor and can be used to design maps. I highly recommend you take a look at it.


{% extends "base.html" %} {% block title%}
| id | First name | Last name | Education | Passport | City | Age |
|---|---|---|---|---|---|---|
| id | First name | Last name | Education | Passport | City | Age |
| {{client.id}} | {{client.first_name}} | {{client.last_name}} | {{client.education}} | {{client.passport}} | {{client.city}} | {{client.age}} |


11 February 2004
Global surveillance guidelines
WHO has today issued on its website guidelines for global surveillance aimed at monitoring the spread of H5N1 infection in human and animal populations. The guidelines include the definition of a laboratory-confirmed case of human H5N1 infection, and describe procedures for reporting cases to WHO. The guidelines also provide recommended procedures to monitor changes in transmission patterns and to detect potential human-to-human transmission.
The guidelines are intended to improve global vigilance for the further spread of H5N1 infections in humans and animals, and for the first signs that human-to-human transmission may be occurring. Use of standardized procedures and reporting forms will improve the quality of information needed by WHO to advise on the most appropriate control measures.
Situation (poultry) China
Chinese authorities have announced a suspected outbreak of H5N1 avian influenza at a chicken farm in Tianjin. Spread to additional farms within several provinces has also been reported.
Altogether, outbreaks of H5N1 in poultry are suspected or confirmed at 39 farms in 14 of the country’s provinces, autonomous regions, and municipalities.
To date, no human cases have been reported in China.
Investigation of possible human-to-human transmission: data on second sister in family cluster in Viet Nam
WHO has today received the results from a study of virus isolated from a 23-year-old woman (see Updates 19 and 20) who is part of a family cluster in Viet Nam under investigation as the first possible instance of human-to-human transmission. Virus genetic material from this woman, as for the other case in this cluster, is of avian origin and contains no human influenza genes.


--- layout: page title: Local Attractions permalink: /attractions/ style: /css/attractions.css --- Javascript disabled? This page uses jQuery (off Google's Hosted Libraries), Google Maps Javascript API, and a local javascript file to create the interface. Feel free to read the data used for the map if you don't want to want to enable scripting. If you don't know what any of this means, something is wrong. Email us?
Javascript disabled? This page uses jQuery (off Google's Hosted Libraries), Google Maps Javascript API, and a local javascript file to create the interface. Feel free to read the data used for the map if you don't want to want to enable scripting.
If you don't know what any of this means, something is wrong. Email us?


(emonocle byEMIIA)
pssst! ... have you heard about Hashgraph?
Hashgraph is a distributed ledger technology (DLT) released by Swirlds (think: "Shared Worlds") in 2016. It promises some of the most important benefits of blockchain without its biggest limitations. It is comprised of a graph data structure which together with the Swirlds distributed consensus algorithm provides asynchronous byzantine fault tolerance, using what it calls "gossip about gossip."
Whaaaat? A system based on second hand rumors and some sort of whisper logs? We're really supposed to trust this thing? Read on to find out.
About the author
I am a developer of blockchain technologies, distributed ledger technologies, and decentralized consensus systems. At the time of writing this article I have no investment in any cryptocurrency, I do not work for or represent any organization related to cryptocurrencies or distributed ledger technologies. As of the time this article was posted, I am still learning about this area.
So why am I writing this?
Hashgraph impressed on me the value of gossip. Instead of waiting to share your opinion until you are absolutely certain of what you know, a "gossip protocol" says to share your observations early and often. So, here are mine about Hashgraph. Hashgraph mathematically proves that gossip can allow decentralized participants to rapidly share what they have observed (as well as what they have heard second-hand from others), and rapidly agree on what is to be believed. Who am I to argue with math?
How does Hashgraph use gossip?
 You tell some random participant what you know. They tell you what they know. Later, they tell some random participant what they know, which includes some (possibly second hand) information they learned from you. Eventually, participants are able to tally not only what they have observed, but also what other participants are likely to have observed, based on the gossip they've shared. Given enough second-hand information from enough credible witnesses, they can even predict the opinion of participants with whom they have not communicated.
Timestamps are also calculated incorporating the consensus opinion of when a event was observed, to counteract accidental or intentional timestamp errors.
As we know from human nature, gossip spreads like wildfire. Unlike how rumormills work in human society, when marshalled cleverly with the proper algorithms, gossip turns out to be provably fair.
How does Hashgraph compare to Bitcoin?
Distributed consensus is an extremely useful concept in distributed computing. For decades it was doable only among a small number of computers ("nodes"). Nakamoto's Bitcoin cryptocurrency presented a new way to achieve scalable decentralized consensus.
Despite Bitcoin demonstrating tremendous value, its blockchain plus Proof-of-Work (PoW) approach presents several pitfalls. It is:
- Wasteful since PoW expends huge amounts of computing power by design.
- Slow, limited to tens of transactions per second.
- Subject to allowing huge backlog of unconfirmed transactions to accumulate.
- Network bandwidth intensive.
- Susceptible to a 25% economic attack.
- Heavyweight. Full nodes must download the entire blockchain, currently 60 GB. Lightweight nodes must trust the full nodes.
Bitcoin protocol does not implement consensus in the traditional distributed computing sense. Instead it achieves consensus via probabilistic agreement. A primary goal of a cryptocurrency is to totally order transactions on a distributed ledger. Cryptocurrencies avoid the need for a trusted third party to timestamp transactions added to the ledger.
Hashgraph also provides a total order on a distributed transaction ledger, but does so using a different approach. Whereas the Bitcoin network builds up its transaction history in the form of a “blockchain”, adding a new block on top of the previous block every ten minutes, Hashgraph grows a time directed acyclic graph akin to a braided forest of trees using "virtual voting" and "gossip about gossip".
Activity is divided into rounds. At the beginning of a round, each node communicates state with some random other node. Since these two nodes already have a channel open, the random other node then shares back state of its own that it knows first hand, perhaps along with some state that it previously learned from another node. After a new event has seen at least 2/3 of previous events, a round is concluded and a new round begins.
When the new round is created, nodes say if they agree upon the data contained in events of the preceding round. The algorithm doesn't consider this to be voting per se, instead calling it a virtual election. There is no leader to present a motion for vote, nor to tally votes. Instead, to reach consensus on the events in the previous round, nodes verify that they are connected to these events.
(More strictly speaking, it is actually about finding paths through the graph that connect events in the current round with past events in the previous round. Please see : How it Works (Graphically).)
At this point, some applications could dump all previous events. In applications where the transaction timeseries can be summarized by sufficient statistics, the hashgraph history could be archived. This also means that a new node doesn't need to load the entire hashgraph history, greatly reducing the space required and allowing a smartphone to act as a node. There is no notion of full node and lightweight node, meaning that all nodes can participate in consensus and see the full ledger.
Virtual elections: better than regular elections?
Many people consider Hashgraph to be more comparable to PBFT, Paxos, Raft, Zab, and other consensus seeking systems that rely on leaders and traditional voting schemes. But Hashgraph eschews the comparison, because it doesn't use traditional voting. It comes to consensus about what happened, and when, by cleverly tallying highly compressed event logs based on "famous witnesses" that "strongly see" events.
If the timestamp of an event log is corrupted by a bad clock or is maliciously doctored, this will usually have no effect on the consensus timestamp, because consensus opinion on when something occurred is the median of timestamps observed by credible witnesses.
Unlike some other directed acyclic graph algorithms, or even Paxos, it really is quite easy to step through the Hashgraph algorithm. I couldn't do it more succinctly here. I'll again point the interested reader to whitepapers for how it works : graphically, and example voting scenarios.
Hashgraph: the good
It is fast, fair, and secure. It promises the following:
- Total ordering of events.
- Strong Byzantine Fault Tolerance (BFT), the gold standard of industrial grade distributed consensus.
- Minimal network bandwidth, because it passes things only around once.
- Provable 100% certainty on the order of transactions.
Because it is fast and requires low network bandwidth, it can be used as a distributed memory system. Because it provides a total order on transactions, it can be used as a multi-master database. Because it does not use Proof-of-Work, it does not require unnecessary computation.
Performance
Paypal and Visa tend to be held up as benchmarks or at the very least as future milestones for a DLT to achieve in order to replace an existing mainstream currency, payment system, or other commercial transaction logging systems.
Here are the transactions per second (tps) of PoW versus Paypal and Visa :
Of these, only PoW is a BFT DLT.
To be fair, because of its positioning and licensing, Hashgraph is more directly comparable to Hyperledger, which is another scalable DLT using a Practical Byzantine Fault Tolerance (PBFT) consensus algorithm. Other comparable enterprise-grade transaction processing systems include LMAX and its variants, such as LMAX Disruptor and Bitshares. LMAX is not a DLT, and Bitshares is billed as a decentralized exchange. That said, if we are going to use Visa and Paypal for comparison, then we might as well include these for context. Their ts/sec are as follows:
- Hyperledger : 1K tps to 10K tps
- Bitshares : 100K tps
- LMAX : 100K tps (2010) to 6M tps
Hashgraph's inventor says it will be able to attain 250K+ tps, more with sharding.
The bad
So what is the catch?
Hashgraph is currently being deployed in private, permissioned-based networks, although its designers propose means for implementing nonpermissioned and hybrid networks. How well it can be adapted to a truly decentralised public ledger remains to be seen, because it assumes that a node can determine :
- Addresses of random nodes in the network for messaging, and
- The number of other nodes N in the network
This is because the algorithm requires a node to be able to (a) pick another node at random, and (b) know the value of ⅔ * N. It needs a means of registering and unregistering of members in the network, whereas public blockchains allow nodes to sign in and out to the network without any notice.
The following seem to be the major showstoppers for many members of the cryptocurrency development community:
- There is no Hashgraph public ledger or cryptocurrency.
- US Patents #9,646,029, #9,529,923, #9,390,154.
- Requires a license to use.
A passing thought
Arrow's Theorem proves that no voting system is fair. I'm no voting theorist, but in my (extremely humble) opinion, Hashgraph comes pretty close. It makes one want to believe in democracy again. Real-time continuous nationwide elections anyone?
Acknowledgments
Thanks for helpful edits to Josh Quittner, Will Huang, Gregory Kennedy and Marcus Plutowski.
Concluding remark
DYOR ! Consider this to be informed gossip. But do share your gossip with me too. The math says to, so, yeah just do what the math says.


The page you're looking for could not be found. Here are some helpful links to get you back on track:
Resize the browser window to see how the background color of this paragraph changes on different screen sizes.


For Americans, survey reveals mobile devices top for news
NEW YORK, Nov 20 — Americans rely on their mobile devices for online news far more than desktop or laptop computers, building on a trend that began several years ago, a survey showed today.
The Pew Research Centre report found 57 per cent of US adults often get news from a smartphone or tablet compared with 30 per cent from a PC.
The share of Americans who often get news on a mobile device is more than double the 21 per cent who did so in 2013, the first time Pew asked this question.
The percentage who often get news on a desktop or laptop computer has remained relatively stable during this period.
Younger adults are far more likely than others often to use a mobile device for news — 72 per cent in the 18-29 age bracket compared with 38 per cent among those aged 65 and older.
The seniors were more likely to use a PC for news than the younger group, by a margin of 34 to 23 per cent, Pew found.
The survey comes as online giants such as Google, Facebook and Apple step up with new ways to deliver news and curb the spread of viral misinformation on their platforms.
The platforms have also come under increasing pressure from struggling legacy news organisations to offer a better share of digital ad revenues that stem from news stories.
Facebook last month began rolling out its dedicated “news tab” with professionally produced content in the latest move by the social network to promote journalism and shed its reputation as a platform for misinformation. — AFP


StackOverflow-Lite
Logout
Profile
Questions
Ask Question
Questions (2)
What is an Asynchronous Request?
answers (23)
votes (23)
How do you do messaging in Flask?
answers (3)
votes (2)


List item 1
DELETE
List item 2
DELETE
List item 3
DELETE
List item 4
DELETE
This is a header
Click Me!


AddressSearch (Demo)
Address searching with typeaheads and multiple choices
Doc
- Installation
Simply import Google Places API & AddressSearch into your HTML.
<link rel="stylesheet" href="address-search.min.css">
<script src="https://maps.googleapis.com/maps/api/js?key=YOUR_API_KEY&libraries=places"></script>
<script src="address-search.min.js"></script>
- How to use
Create a new AddressSearch
object with a query String or an Element as the first parameter :
let address = new AddressSearch('div.with[any="selector"]', options, delay);
// OR
let element = document.querySelector('li.terally[any="thing"]');
let address = new AddressSearch(element, options, delay);
- Options
You can automatically fill inputs with address informations when the user selects an address.
To do that, simply add the information type you want and the selector for the input to fill.
The options
object works as follows
// GET THE COMPONENT FULL NAME
typename : 'targetInput[selector]'
// GET THE COMPONENT SHORT NAME
typename_short : 'targetInput[selector]'
Available components:
{
street_number: '...',
route: '...',
country: '...',
administrative_area_level_1: '...',
administrative_area_level_2: '...',
administrative_area_level_3: '...',
administrative_area_level_4: '...',
administrative_area_level_5: '...',
colloquial_area: '...',
locality: '...',
sublocality: '...',
neighborhood: '...',
premise: '...',
subpremise: '...',
postal_code: '...',
point_of_interest: '...'
}
- Delay
You can use the third parameter to enter a delay (ms).
This delay will be used before displaying Google API predictions after each keypress.
This can help you mitigate the amount of requests made on your account.
The delay
parameter works as follows
new AddressSearch(element, options, 500);
- Methods
See the documentation for the method definitions.
- Example
See this JSFiddle for a working example
Authors
- Zenoo - Initial work - Zenoo.fr


Resilient kafka consumption
Thoth provides a resilient kafka consumer.
Installation
- sbt
val ThothVersion = "0.1.0*" libraryDependencies += "fr.maif" % "thoth-kafka-consumer-reactor$" % ThothVersion
- Maven
<properties> <thoth.version>0.1.0*</thoth.version> </properties> <dependencies> <dependency> <groupId>fr.maif</groupId> <artifactId>thoth-kafka-consumer-reactor$</artifactId> <version>${thoth.version}</version> </dependency> </dependencies>
- Gradle
def versions = [ ThothVersion: "0.1.0*" ] dependencies { implementation "fr.maif:thoth-kafka-consumer-reactor$:${versions.ThothVersion}" }
Usage
ResilientKafkaConsumer<String, String> resilientKafkaConsumer = ResilientKafkaConsumer.create(
// Name of the consumer (for logs etc ...)
"test",
ResilientKafkaConsumer.Config.create(
List.of(topic),
groupId,
receiverOptions
),
event -> {
System.out.println(event.value());
}
);
Consuming event
There 3 way to consume events : blocking, non-blocking, streams
Blocking
It append when you a blocking call (i.e JDBC), in this case, a “parallel” scheduler is chosen.
ResilientKafkaConsumer<String, String> resilientKafkaConsumer = ResilientKafkaConsumer.create(
// Name of the consumer (for logs etc ...)
"test",
ResilientKafkaConsumer.Config.create(
List.of(topic),
groupId,
receiverOptions
),
event -> {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
});
Non Blocking
ResilientKafkaConsumer<String, String> resilientKafkaConsumer = ResilientKafkaConsumer.create(
"test",
ResilientKafkaConsumer.Config.create(
List.of(topic),
groupId,
receiverOptions
),
// Non blocking handling
(ReceiverRecord<String, String> event) -> Mono.fromCallable(() -> {
System.out.println(event.value());
return event;
})
);
Streams
Stream handling is done using the reactor Flux
.
In that stream you can, skip, group etc do whatever you want but at the end you have to give back the event.
ResilientKafkaConsumer.createFromFlow(
"test",
ResilientKafkaConsumer.Config.create(
List.of(topic),
groupId,
receiverOptions
),
flux -> flux
.index()
.concatMap(messageAndIndex -> {
Long index = messageAndIndex.getT1();
System.out.println("Message number " + index);
var event = messageAndIndex.getT2();
Mono<String> asyncApiCall = asyncApiCall();
return asyncApiCall.map(it -> event);
})
);
Handling crash
The goal of this consumer is to handle crashes by retrying the failed event consumption. There two types of errors :
- Parsing / Business errors : in that case, you should push the failing event in a dead letter queue to analyse the issue and move to the next event.
- Technical errors : e.g. a database or an API that is not available at time, in that case, you have to let it crash. The consumer will let the event uncommitted, will disconnect from kafka and restart later, reading the message again.
You can configure the consumer to set appropriate values for restart interval …
ResilientKafkaConsumer.Config.create(
List.of(topic),
groupId,
receiverOptions
)
.withCommitSize(5)
.withMinBackoff(Duration.ofMillis(200))
.withMaxBackoff(Duration.ofMinutes(10))
.withRandomFactor(0.2d);
Status and lifecycles
The resilient kafka consumer has a lifecycle and will have the following states :
Starting
: The consumer is startingStarted
: The consumer has startedFailed
: The consumer has crashed and will restart, the kafka client is no longer connected to the cluster.Stopping
: The consumer is stoppingStopped
: The consumer is stopped, the kafka client is no longer connected to the cluster.
The status is exposed by the ResilientKafkaConsumer
using the status
method.
ResilientKafkaConsumer<String, String> resilientKafkaConsumer = ResilientKafkaConsumer.create(...);
Status status = resilientKafkaConsumer.status();
You can also register callbacks :
ResilientKafkaConsumer<String, String> resilientKafkaConsumer = ResilientKafkaConsumer.create(
ResilientKafkaConsumer.Config.create(
List.of(topic),
groupId,
receiverOptions
)
.withOnStarting(() -> Mono.fromRunnable(() -> {
}))
.withOnStarted((c, time) -> Mono.fromRunnable(() -> {
}))
.withOnStopping(() -> Mono.fromRunnable(() -> {
}))
.withOnStopped(() -> Mono.fromRunnable(() -> {
}))
.withOnFailed(e -> Mono.fromRunnable(() -> {
})),
event -> {
names.set(names.get() + " " + event.record().value());
}
);


From an existing but messy spritesheet, create a grid-like version of it
You may need to zoom out your browser if your spritesheet is large.


--- layout: post title: 7/29 date: '2013-07-29T23:06:00.001-06:00' author: Jacob . tags: - front-page modified_time: '2013-08-23T21:51:52.857-06:00' blogger_id: tag:blogger.com,1999:blog-6400085873105072120.post-6417619317163899502 blogger_orig_url: http://www.svlark.com/2013/07/729.html --- And another showing for tomorrow. And a part 2 for Behan's boat-schooling post today.


More...
|
| virtual bool | Active [get, set] |
| | Indicates the initial status of the filter (defaults to false). More...
|
| |
| virtual string | DataIndex [get, set] |
| | The Store data index of the field this filter represents. The dataIndex does not actually have to exist in the store. More...
|
| |
| virtual Menu | MenuDefaults [get, set] |
| |
| ParameterCollection | ItemDefaults [get] |
| |
| virtual JFunction | Serializer [get, set] |
| | A function to post-process any serialization. Accepts a filter state object containing 'property', 'value' and 'operator' properties, and may either mutate it, or return a completely new representation. More...
|
| |
| virtual int | UpdateBuffer [get, set] |
| |
◆ Active
| virtual bool Ext.Net.GridFilter.Config.Active |
|
getset |
Indicates the initial status of the filter (defaults to false).
◆ DataIndex
| virtual string Ext.Net.GridFilter.Config.DataIndex |
|
getset |
The Store data index of the field this filter represents. The dataIndex does not actually have to exist in the store.
◆ ItemDefaults
◆ MenuDefaults
| virtual Menu Ext.Net.GridFilter.Config.MenuDefaults |
|
getset |
◆ Serializer
| virtual JFunction Ext.Net.GridFilter.Config.Serializer |
|
getset |
A function to post-process any serialization. Accepts a filter state object containing 'property', 'value' and 'operator' properties, and may either mutate it, or return a completely new representation.
◆ UpdateBuffer
| virtual int Ext.Net.GridFilter.Config.UpdateBuffer |
|
getset |
The documentation for this class was generated from the following file:


The passive scanner runs against all requests and responses that are generated by ZAP or are proxied through it. If you want to configure the passive scan configuration then you should typically do so before running any other jobs. However you can run this job later, or multiple times, if you want different jobs to use different passive scan configurations.
- type: passiveScan-config # Passive scan configuration parameters: maxAlertsPerRule: 10 # Int: Maximum number of alerts to raise per rule scanOnlyInScope: true # Bool: Only scan URLs in scope (recommended) maxBodySizeInBytesToScan: # Int: Maximum body size to scan, default: 0 - will scan all messages enableTags: false # Bool: Enable passive scan tags, default: false - enabling them can impact performance disableAllRules: false # Bool: If true then will disable all rules before applying the settings in the rules section rules: # A list of one or more passive scan rules and associated settings which override the defaults - id: # Int: The rule id as per https://www.zaproxy.org/docs/alerts/ name: # String: The name of the rule for documentation purposes - this is not required or actually used threshold: # String: The Alert Threshold for this rule, one of Off, Low, Medium, High, default: MediumThe job saves the current passive scan configuration when a plan starts and resets it when the plan ends. This is primarily to ensure the scanOnlyInScope setting is not changed - the default is 'true' for the job but 'false' in the GUI.
Note that if you set disableAllRules
to true
then they will stay disabled when the plan has finished.
Automatically re-enabling them when the plan finishes could result in the rules becoming enabled while the passive scan
queue is being processed, for example if the passiveScan-wait job is not used,
or if it is used but with the maxDuration option is set.
In versions up to and including 0.16.0 running this job with the default settings would change scanOnlyInScope to 'true' in the GUI. This has proved confusing as many users use the GUI without setting a scope - when scanOnlyInScope is set to 'true' and no scope is defined then no passive scan alerts are raised.


Jonas Söderlund
They discuss the differing subschools of 'Management Science' or 'Operations Research' in a very clear set of separate conceptual labels. Would be very useful for positioning our contribution as 'process design' against some relevant school of study in this discipline.


{% extends 'base.html' %} {% load bootstrap3 %} {% block css %} {% endblock %} {% block content %}
| District | Organisation | Organisation Type | Organisation Address | Name | Phone | Website | Area | Location | Joined |
|---|---|---|---|---|---|---|---|---|---|
| {{ req.get_district_display }} | {{ req.organisation }} | {{ req.organisation_type }} | {{ req.organisation_address }} | {{ req.name }} | {{ req.phone }} | {{ req.website_url }} | {{ req.area }} | {{ req.location }} | {{ req.joined }} |


Alessia Cara, Will Arnett among those honoured at Canada's Walk of Fame
by David Friend, The Canadian PressSummary
The Grammy and Juno award-winning pop singer was among a group of Canadians being recognized for excellence
They will each be given stars in Toronto's entertainment district
Eight other influential names were added to Canada's Walk of Fame during the event
TORONTO — Alessia Cara says getting recognition at this year’s Canada’s Walk of Fame gala event ranks among the most tremendous honours she’s received in her career.
“I feel like getting acknowledged by your own country in this way is huge,” the 23-year-old performer said on the red carpet before she received the special 2019 Allan Slaight Music Impact honour on Saturday night.
“It’s one of those things where I’m going to have to see it to actually believe it.”
The Grammy and Juno award-winning pop singer was among a group of Canadians being recognized for excellence in their respected fields, which include science, sports, entertainment and business. They will each be given stars in Toronto’s entertainment district.
Eight other influential names were added to Canada’s Walk of Fame during the event, including architect Frank Gehry, hockey player Mark Messier, investor Jim Treliving, and speed skater Cindy Klassen.
“When I look at all the inductees, these are Canadians that have made such a difference in the world,” Klassen said.
“It’s incredible to be a part of that, a very humbling experience.”
Fellow inductee Will Arnett, whose work on “Arrested Development” and “Bojack Horseman” has ushered him into the echelons of comedy fame, said he’s honoured the organizers considered him worthy — but he has a few suggestions for future ceremonies to spice up the Canadiana.
First, he’d change their name to “The Sorrys,” and that’s only the start.
“Instead of just a regular tuxedo, if we wore Canadian tuxedos that would be better,” he said, pitching the combo of denim jeans and jackets.
As for the red carpet? He’d like to see a Zamboni crawling across it before the big show.
“They should have an ice carpet. Had nobody thought of an ice carpet? I can’t understand why.”
Triumph guitarist Rik Emmett said he was amused when he learned the rock band’s star would be near a stretch of King Street West where generations of his family worked in the Canadian Pacific Express building where Roy Thomson Hall now resides.
“Not only my dad worked there, but my grandfather worked there, my great uncles and my great grandfather,” he said.
“So, it’s very special.”
Posthumous honours went to children’s entertainer Ernie Coombs, known by many families as TV host Mr. Dressup, and James Naismith, who invented the game of basketball.
A telecast of the 2019 Canada’s Walk of Fame Awards airs Dec. 15 on CTV and will be available to stream through Crave on Dec. 20.
This report by The Canadian Press was first published Nov. 23, 2019.
Follow @dfriend on Twitter.
David Friend, The Canadian Press


{{superHero.name}}
Power stats
- Intelligence: {{superHero.powerstats.intelligence || 'N'}}
- Strength: {{superHero.powerstats.strength || 'N'}}
- Speed: {{superHero.powerstats.speed || 'N'}}
- Durability: {{superHero.powerstats.durability || 'N'}}
- Power: {{superHero.powerstats.power || 'N'}}
- Conbat: {{superHero.powerstats.conbat || 'N'}}
Appearance
- Gender: {{superHero.appearance.gender || 'N'}}
- Race: {{superHero.appearance.race || 'N'}}
- Height: {{superHero.appearance.height || 'N'}}
- Weight: {{superHero.appearance.weight || 'N'}}
- EyeColor: {{superHero.appearance.eyeColor || 'N'}}
- HairColor: {{superHero.appearance.hairColor || 'N'}}
Biography
- {{superHero.biography.fullName || 'N'}}
- {{superHero.biography.alterEgos || 'N'}}
- {{superHero.biography.aliases || 'N'}}
- {{superHero.biography.placeOfBirth || 'N'}}
- {{superHero.biography.firstAppearance || 'N'}}
- {{superHero.biography.publisher || 'N'}}
- {{superHero.biography.alignment || 'N'}}
work
- Occupation: {{superHero.work.occupation || 'N'}}
- Base: {{superHero.work.base || 'N'}}
Connections
{{superHero.connections.groupAffiliation || 'N'}}
{{superHero.connections.relatives || 'N'}}


References¶
| [Bengio07] |
|
| [Bengio09] |
|
| [BengioDelalleau09] |
|
| [BoulangerLewandowski12] | N Boulanger-Lewandowski, Y. Bengio and P. Vincent, Modeling Temporal Dependencies in High-Dimensional Sequences: Application to Polyphonic Music Generation and Transcription, in Proceedings of the 29th International Conference on Machine Learning (ICML), 2012. |
| [Fukushima] | Fukushima, K. (1980). Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position. Biological Cybernetics, 36, 193–202. |
| [Hinton06] | G.E. Hinton and R.R. Salakhutdinov, Reducing the Dimensionality of Data with Neural Networks, Science, 28 July 2006, Vol. 313. no. 5786, pp. 504 - 507. |
| [Hinton07] | G.E. Hinton, S. Osindero, and Y. Teh, “A fast learning algorithm for deep belief nets”, Neural Computation, vol 18, 2006 |
| [Hubel68] | Hubel, D. and Wiesel, T. (1968). Receptive fields and functional architecture of monkey striate cortex. Journal of Physiology (London), 195, 215–243. |
| [LeCun98] | LeCun, Y., Bottou, L., Bengio, Y., and Haffner, P. (1998d). Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11), 2278–2324. |
| [Lee08] |
|
| [Lee09] |
|
| [Ranzato10] |
|
| [Ranzato07] | M.A. Ranzato, C. Poultney, S. Chopra and Y. LeCun, in J. Platt et al., Efficient Learning of Sparse Representations with an Energy-Based Model, Advances in Neural Information Processing Systems (NIPS 2006), MIT Press, 2007. |
| [Serre07] | Serre, T., Wolf, L., Bileschi, S., and Riesenhuber, M. (2007). Robust object recog- nition with cortex-like mechanisms. IEEE Trans. Pattern Anal. Mach. Intell., 29(3), 411–426. Member-Poggio, Tomaso. |
| [Vincent08] |
|
| [Tieleman08] |
|
| [Xavier10] |
|


Options
Open scrubber in new tab instead of new window
Automatically open scrubber when opening GIFs
Start playing as soon as image loads
Loop animation
Mouse hover automatically scrubs
Player Background
Visible only with transparent GIF
Light
Dark
Checker
-
Keyboard Shortcuts
Pause/play GIF
Space Bar
Go back one frame
Left Arrow
Go forward one frame
Right Arrow
Toggle explode view
E, Esc, Backspace
Open options (this page)
O


Carefully Styled Heading
This is text on which we want to apply
very special
styling.
Name:
Show Name


We seek to tell our story through the food we serve
To help to achieve culinary awards and gain popularity, we select only the freshest seasonal products and pair them with exclusive wine list, which features small wine producers and select local Scottish craft ales.


Before Change
token = ""
if discovery_info is not None:
host = discovery_info["host"]
name = discovery_info["hostname"]
// if device already exists via config, skip discovery setup
if host in hass.data[DATA_NANOLEAF]:
return
_LOGGER.info("Discovered a new Nanoleaf: %s", discovery_info)
After Change
return
_LOGGER.info("Discovered a new Nanoleaf: %s", discovery_info)
conf = load_json(hass.config.path(CONFIG_FILE))
if host in conf and device_id not in conf:
conf[device_id] = conf.pop(host)
save_json(hass.config.path(CONFIG_FILE), conf)
token = conf.get(device_id, {}).get("token", "")
else:
host = config[CONF_HOST]
name = config[CONF_NAME]


Michael C. Frank
Research Interests [PDF]
How do we learn to communicate using language? I study children's language learning and how it interacts with their developing understanding of the social world. I use behavioral experiments, computational tools, and novel measurement methods like large-scale web-based studies, eye-tracking, and head-mounted cameras.
Curriculum Vitae [PDF]
Teaching
Representative Publications
- Frank, M. C., & Goodman, N. D. (2014). Inferring word meanings by assuming that speakers are informative. Cognitive Psychology, 75, 80-96.
- Frank, M. C. & Goodman, N. D. (2012). Predicting pragmatic reasoning in language games. Science, 336, 998.
- Frank, M. C., Vul, E., & Saxe, R. (2012). Measuring the development of social attention using free-viewing. Infancy, 17, 355-375.
- Frank, M. C., & Barner, D. (2011). Representing exact number visually using mental abacus. Journal of Experimental Psychology: General, 141, 134-149.
- Frank, M. C., Goodman, N. D., & Tenenbaum, J. B. (2009). Using
speakers’ referential intentions to model early
cross-situational
word learning. Psychological
Science, 20, 579-585.
(Exhaustive list of publications available through the Language and Cognition Lab.)


I'm a Natural Language Processing model.
You can teach me how to understand humans. Use the below input field to type a review/feelings/thoughts and I'll guess how you're feeling. Feel free to correct me if I make a mistake, I'm still a beginner.
You can teach me how to understand humans. Use the below input field to type a review/feelings/thoughts and I'll guess how you're feeling. Feel free to correct me if I make a mistake, I'm still a beginner.


FAQs
-
Can I use this offline?
For now, offline capability is not supported, as this is hosted as a web-app. Also, the question database is stored online.
-
Can I my phone to try this?
Yes you can, this web-app is fully mobile-friendly
-
How to answer questions?
For Multiple Choices or True/False Questions, just tap your answer and then tap on [Submit] button. Please take note that the chosen answer will have a green background.
-
Can I skip a question?
Yes you can, but of course, it will be marked as wrong answer
-
Can I view the correct answer?
Yes, after every answer submission, an alert box will validate your answer, if it is wrong, it will show you the correct answer.
-
How the questions are arranged?
All the questions are in random order, and for the choices, they are also in random order, so there may be some choices that says "All of the above" but it is placed on the top of the list, consider that as "All of the other answers" :P
-
What are the question types?
Most of the questions are in Multiple-Choices format, but there are also True/False and Enumeration. Identification or Fill-in-the-blank is also supported, but there are no questions yet.
-
How to answer enumeration type questions?
You must click the [Add Answer(s)] button and type your answer on the prompt box then choose [OK]
-
Is it case-sensitive?
No, and also, it is not space-sensitive, this is to minimize unwanted errors
-
Should you provide your answer in order?
No, you can have your answer in any order
-
What if I mispelled the answer?
Answer validation will be in substring rule. If the correct item is "Policy Owner", answers like "Policy Owners" will be marked as Correct. Some rules are also applied on dashes, acronyms, etc.
-
What is the scoring system?
Every correct answer is 1 point, if you finished all the questions, you will receive 10 bonus points


“Got any special plans for Father’s Day?” the cashier asked us, as she rang up our groceries.
“Just cooking that corned beef,” I replied, pointing to the brisket in her hand.
To be honest, I’d planned on cooking it long before I realized today was Father’s Day. It’s a Sunday, and Sundays are for cooking some sort of roast. I do so not because we eat a big traditional midday meal on Sundays. Rather a roast means leftovers, and I can start the week knowing that there will be something to pack for lunch on Monday, something to transform into subsequent meals as well.
The only problem, of course, is that I really don’t love roasts. Or to be a bit more accurate, I don’t much like roast beef. Or to be more accurate again, I didn’t much like roasts when I was growing up. But now that I’m an adult, now that I’m more interested in cooking and in eating, I’m getting better at preparing this meal.
I didn’t really like many of the roasts my mother would cook for us, although I’d sometimes enjoy the leftovers – that is, until they dragged on into the third or fourth day and I started to question if it was time for a curry because she’d exhausted all other ideas or if, in some sort of British imperialist awfulness, curry was something I associated with meats that had gone a bit gray.
I definitely did not like roast corned beef when I was growing up, always wishing we could just cut out the middle meal and go straight to the corned beef hash (which I later learned my grandmother would make from a can, not from a piece of beef that she’d brined and baked). I think my father had told me some sordid story about corned beef being rotting meat preserved with salt, and I couldn’t get the taste of rot out of my mind.
I did not like any of the meats that would appear from the crockpot where my mother would cook her corned beef – ham, short ribs, beef goulash, corned beef, all yuck. These were all less delicious cuts of meat, I knew as the butcher’s granddaughter, that needed to be cooked “low and slow” in order to tenderize them.
I can be excused from the table any goddamn time I want now. I can leave a big chunk of gristle or tough piece of meat on my plate. I can cook a roast with the leftovers in mind. I’m having corned beef hash for breakfast tomorrow, that’s for sure.


{% extends 'recruiter/index.html' %} {% load page_tags %} {% block jobs %}
Peeljobs is offering unlimited job posting and for the unlimited time period
Your post will be on live within one hour and you will get a notification mail if any job seeker applied for your job


Abstract
We introduce Adaptive Procedural Task Generation (APT-Gen), an approach for
progressively generating a sequence of tasks as curricula to facilitate
reinforcement learning in hard-exploration problems. At the heart of our
approach, a task generator learns to create tasks via a black-box procedural
generation module by adaptively sampling from the parameterized task space.
To enable curriculum learning in the absence of a direct indicator of
learning progress, the task generator is trained by balancing the agent's
expected return in the generated tasks and their similarities to the target
task. Through adversarial training, the similarity between the generated
tasks and the target task is adaptively estimated by a task discriminator
defined on the agent's behaviors. In this way, our approach can efficiently
generate tasks of rich variations for target tasks of unknown
parameterization or not covered by the predefined task space. Experiments
demonstrate the effectiveness of our approach through quantitative and
qualitative analysis in various scenarios.


misc
index
/home/epete/src/simfMRI/misc.py
Who knows what, really. The miscellaneous goes here.
Modules
numpy
Functions
process_prng
(prng)
See if <prng> is a numpy.random.RandomState object.
If it is return it. If not, try and create one by
RandomState(<prng>), which will work of prng was
None or a number.


cs4414: Operating Systems
Syllabus
Forum
Archives
PS3 Leaderboard
Autograder
Not logged in
Autograder Submission
Problem Set 1
Problem Set 2
Problem Set 3
Problem Set 4


MOVIEFLIX
MOVIEFLIX
Enter your email address
to continue.
Remember me
Enter your password to continue
Sign In


T
- Type of Node/Task IDR
- Type of Node/Task resultpublic interface DexecutorState<T extends Comparable<T>,R> extends DependencyAware<T>
Phase :
Current Phase Dexecutor is inGraph :
Exposes API around building graph unprocessed nodes count :
How many nodes are waiting to be processedprocessed nodes :
Nodes which are processed till that pointDiscontinued nodes :
Nodes for which processing should continue after system comes to valid state| Modifier and Type | Method and Description |
|---|---|
void |
addErrored(ExecutionResult<T,R> task)
Add to errored collection
|
void |
decrementUnProcessedNodesCount()
decrements the count of total number of unprocessed nodes
|
int |
erroredCount() |
void |
forcedStop()
called to force stop
|
Phase |
getCurrentPhase() |
Collection<Node<T,R>> |
getDiscontinuedNodes() |
ExecutionResults<T,R> |
getErrored() |
Node<T,R> |
getGraphNode(T id)
Returns the node with the given id
|
Set<Node<T,R>> |
getInitialNodes()
Returns the Set of nodes for which there is no incoming dependencies.
|
Set<Node<T,R>> |
getNonProcessedRootNodes() |
Collection<Node<T,R>> |
getProcessedNodes() |
int |
getUnProcessedNodesCount() |
int |
graphSize()
Returns the total number of nodes in this graph
|
void |
incrementUnProcessedNodesCount()
increments the count of total number of unprocessed nodes
|
boolean |
isDiscontinuedNodesNotEmpty() |
void |
markDiscontinuedNodesProcessed()
clear (or marks) all the discontinued nodes till this point as processed
|
void |
markProcessingDone(Node<T,R> node) |
void |
print(Traversar<T,R> traversar,
TraversarAction<T,R> action)
Prints the graph into the writer using the Traversar
|
void |
processAfterNoError(Collection<Node<T,R>> nodes)
Add to existing collection of discontinued nodes to be processed later, if system come to valid state.
|
void |
removeErrored(ExecutionResult<T,R> task)
Remove errored collection
|
void |
setCurrentPhase(Phase currentPhase)
sets the phase to that of provided
|
boolean |
shouldProcess(Node<T,R> node) |
void |
validate(Validator<T,R> validator)
validates the graph using the validator
|
addAsDependencyToAllInitialNodes, addAsDependentOnAllLeafNodes, addDependency, addIndependent
Node<T,R> getGraphNode(T id)
id
- The Unique node idint graphSize()
Set<Node<T,R>> getInitialNodes()
Set<Node<T,R>> getNonProcessedRootNodes()
void print(Traversar<T,R> traversar, TraversarAction<T,R> action)
traversar
- would traverse the graphaction
- callback which would be called based on traversevoid validate(Validator<T,R> validator)
validator
- based on which validation would happenvoid setCurrentPhase(Phase currentPhase)
currentPhase
- the phase that should be set toPhase getCurrentPhase()
int getUnProcessedNodesCount()
void incrementUnProcessedNodesCount()
void decrementUnProcessedNodesCount()
boolean shouldProcess(Node<T,R> node)
node
- on which test should happennode
should be processed by dexecutor or notvoid markProcessingDone(Node<T,R> node)
node
- Mark the node
as processed.Collection<Node<T,R>> getProcessedNodes()
boolean isDiscontinuedNodesNotEmpty()
true
if there nodes that should be processed, if some were discontinued due to error.
false
otherwiseCollection<Node<T,R>> getDiscontinuedNodes()
void markDiscontinuedNodesProcessed()
void processAfterNoError(Collection<Node<T,R>> nodes)
nodes
- which should be processed after retry successvoid addErrored(ExecutionResult<T,R> task)
task
- to add to errored collectionvoid removeErrored(ExecutionResult<T,R> task)
task
- to remove from errored collectionint erroredCount()
ExecutionResults<T,R> getErrored()
void forcedStop()
Copyright © 2016–2017 Dexecutor. All rights reserved.


---------------------------------------------------------- [STUDENT INIT] MegaMichael1000 [SETUP] Creating student dir: ./stuwork/MegaMichael1000 [PRE-WARN]: Expected non-empty: ./stuwork/MegaMichael1000/think-java-MegaMichael1000 [GITWORK] [Attempting DL:https://github.com/SwettSoquelHS/think-java-MegaMichael1000.git] Cloning into 'think-java-MegaMichael1000'... [GITWORK DONE]
[Assignment] >Think Java: Ch2-ch4< [DESC] HW1, Ch2-Ch4 *[BEGIN chapter2] [EXPECTING TARGETS] ['Date', 'Time']] [COMPILING] Date.java [SUCCESSFUL COMPILE] Date.java [RUNNING] Date --> Thursday, August 28, 2018 Thursday August 28 2018 <-- [OUTPUT OK] [COMPILING] Time.java [SUCCESSFUL COMPILE] Time.java [RUNNING] Time --> Seconds since midnight: 44520.0 Seconds remaining in day: 41880.0 Percentage of day: 48.47222 Time elapsed: 1810.0 <-- [OUTPUT OK] [SUMMARY] ['Date: PASSED - EXCELLENT!' 'Time: PASSED - EXCELLENT!'] [DONE chapter2] *[BEGIN chapter3] [EXPECTING TARGETS] ['Exercise3', 'Exercise4']] [COMPILING] Exercise3.java [SUCCESSFUL COMPILE] Exercise3.java [RUNNING] Exercise3 --> Enter the amount of seconds: 13 seconds = 0 hours, 0 minutes, 13 seconds. <-- [OUTPUT OK] [COMPILING] Exercise4.java [SUCCESSFUL COMPILE] Exercise4.java [RUNNING] Exercise4 --> I'm thinking of a number between 1 and 100 (including both). Can you guess what it is? Type a number: Your guess is: 13 The number I was thinking of is: 24 You were off by: 11 <-- [OUTPUT OK] [SUMMARY] ['Exercise3: PASSED - EXCELLENT!' 'Exercise4: PASSED - EXCELLENT!'] [DONE chapter3] *[BEGIN chapter4] [EXPECTING TARGETS] ['Multadd']] [COMPILING] Multadd.java [SUCCESSFUL COMPILE] Multadd.java [RUNNING] Multadd --> 5.0 1.0606601717798212 1.1241498650869424 <-- [OUTPUT OK] [SUMMARY] ['Multadd: PASSED - EXCELLENT!'] [DONE chapter4] [ASSIGNMENT DONE] Think Java: Ch2-ch4 [SCORE] 1.00
[Assignment] >Think Java: Ch6< [DESC] HW2, Ch 6 *[BEGIN chapter6] [EXPECTING TARGETS] ['Exercise4', 'Exercise5'] [SUMMARY] ['Exercise4: MISSING (- 0.50)' 'Exercise5: MISSING (- 0.50)'] [DONE chapter6] [ASSIGNMENT DONE] Think Java: Ch6 [SCORE] 0.00
[Assignment] >Swettercise1< [DESC] HW3: Third HW Assignment, Swettercise. Assigned with Chapter6 work *[BEGIN chapter6] [EXPECTING TARGETS] ['Swettercise1'] [COMPILING] Swettercise1.java [SUCCESSFUL COMPILE] Swettercise1.java [TESTING WITH] SwetterciseTest [COMPILING] SwetterciseTest.java [SUCCESSFUL COMPILE] SwetterciseTest.java [RUNNING] SwetterciseTest -->
Results for reverseStr()
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| reverseStr("I haz win?") | ?niw zah I | :) |
| reverseStr("007 bond james") | semaj dnob 700 | :) |
| reverseStr("banannas") | sannanab | :) |
| reverseStr("tacocat") | tacocat | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| collatzThis("12") | 12, 6, 3, 10, 5, 16, 8, 4, 2, 1 | :) |
| collatzThis("4") | 4, 2, 1 | :) |
| collatzThis("11") | 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| isPrime("12") | false | :) |
| isPrime("4") | false | :) |
| isPrime("7") | true | :) |
| isPrime("13") | true | :) |
| isPrime("15") | false | :) |
| isPrime("2048") | false | :) |
| isPrime("1031") | true | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| Exercise5.areFactors("8, [4, 2, 1]") | true | :) |
| Exercise5.areFactors("13, [1, 12, 99]") | false | :) |
| Exercise5.areFactors("26, [13, 26, 1]") | true | :) |
| Exercise5.areFactors("35, [5, 7]") | true | :) |
| Exercise5.areFactors("35, [5, 7, 34]") | false | :) |
| Exercise5.areFactors("12, [1, 12, 4, 6, 2, 3]") | true | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| Exercise6.arePrimeFactors("8, [4, 2, 1]") | false | :) |
| Exercise6.arePrimeFactors("8, [2, 2, 2]") | true | :) |
| Exercise6.arePrimeFactors("15, [3, 5]") | true | :) |
| Exercise6.arePrimeFactors("35, [5, 7, 1]") | true | false |
| Exercise6.arePrimeFactors("30, [2, 3, 5]") | true | :) |
| Exercise6.arePrimeFactors("31, [2, 3, 5]") | false | :) |
| Exercise6.arePrimeFactors("2431, [11, 13, 17]") | true | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| Exercise8.isAnagram("stop, mots") | false | :) |
| Exercise8.isAnagram("stop, pots") | true | :) |
| Exercise8.isAnagram("allen downey, well annoyed") | true | :) |
| Exercise8.isAnagram("flip, flop") | false | :) |
| Exercise8.isAnagram("ooooooh boy, oooooo hboy") | true | :) |
| Exercise8.isAnagram("oooooo hboy, ooooooh boy") | true | :) |
| Exercise8.isAnagram("now, won") | true | :) |
| Exercise8.isAnagram("larp test, lightning bolt") | false | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| isRoyalFlush("[Ace of Hearts, King of Hearts, Queen of Hearts, Jack of Hearts, 10 of Hearts]") | true | :) |
| isRoyalFlush("[Ace of Hearts, King of Hearts, Queen of Hearts, Jack of Hearts, 10 of Hearts]") | true | :) |
| isRoyalFlush("[Queen of Hearts, Queen of Clubs, Ace of Hearts, King of Hearts, 10 of Hearts]") | false | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| isStraightFlush("[10 of Diamonds, Jack of Diamonds, Queen of Diamonds, King of Diamonds, Ace of Diamonds]") | true | :) |
| isStraightFlush("[10 of Diamonds, Jack of Diamonds, Queen of Diamonds, King of Diamonds, Ace of Diamonds]") | true | :) |
| isStraightFlush("[3 of Diamonds, 4 of Diamonds, 5 of Diamonds, 6 of Diamonds, 10 of Diamonds]") | false | :) |
| isStraightFlush("[3 of Diamonds, 4 of Diamonds, 5 of Diamonds, 6 of Diamonds, 7 of Diamonds]") | true | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| isFlush("[Ace of Clubs, King of Clubs, Queen of Clubs, Jack of Clubs, 10 of Clubs]") | true | :) |
| isFlush("[Queen of Clubs, Jack of Clubs, Ace of Clubs, King of Clubs, 10 of Clubs]") | true | :) |
| isFlush("[3 of Clubs, 4 of Clubs, 5 of Clubs, 6 of Clubs, 10 of Clubs]") | true | :) |
| isFlush("[3 of Clubs, 4 of Clubs, 10 of Clubs, 6 of Clubs, 6 of Clubs]") | true | :) |
| isFlush("[3 of Clubs, 4 of Hearts, 10 of Clubs, 6 of Clubs, 6 of Clubs]") | false | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| isFullHouse("[Ace of Clubs, Ace of Diamonds, Queen of Clubs, Queen of Diamonds, Queen of Hearts]") | true | :) |
| isFullHouse("[Ace of Clubs, King of Diamonds, Queen of Clubs, Queen of Diamonds, Queen of Hearts]") | false | :) |
| Function Call | -->Your output<-- | Expected Output |
|---|---|---|
| isHighCard("[Ace of Clubs, Ace of Diamonds, Queen of Clubs, Queen of Diamonds, Queen of Hearts]") | 1 | :) |
| isHighCard("[3 of Diamonds, 3 of Hearts, 2 of Hearts, 2 of Clubs, 2 of Diamonds]") | 3 | :) |


Course Career:
Choose your level of education.
Who you are?Grad, Undergrad
or Med student
Term:
Choose your term of your enrollment.
Which semester are you enrolling for?
Fall, Spring or Summer sem
Specialization:
Choose your specialization interests.
Which stream are you interested in?
Computers, ELectricals or Dental


Jail Escape Murder Suspects
by Associated Press1 / 2This photo provided Monday, Nov. 4, 2019, by the Monterey County Sheriff's Office shows a hole that Santos Fonseca and Jonathan Salazar escaped through in the county jail in Salinas, Calif. Two murder suspects escaped the jail over the weekend after climbing through the hole they made in a bathroom ceiling in their housing unit and then working their way through a wall until they reached a hatch they kicked open to leave the building, an official said Monday, Nov. 4, 2019. (Monterey County Sheriff's Office via AP)
MARINA, Calif. (AP) — The Latest on the capture of two inmates who escaped a California jail (all times local):
11:20 a.m.
An official says two murder suspects who escaped a California jail were captured Wednesday by U.S. Customs and Border Protection agents as they tried to enter the United States from Mexico.
Monterey County Sheriff's Office Capt. John Thornburg says authorities received a tip that 20-year-old Jonathan Salazar and 21-year-old Santos Fonseca had been spotted in Tijuana, across the border from San Diego, and had alerted federal officials.
Thornburg says the two are in the custody of Monterey County officials and are on their way to a jail in Salinas, 440 miles (708 kilometers) north of the U.S.-Mexico border.
___
8:00 a.m.
Authorities say one of two murder suspects who escaped from a California jail was reported to be at a motel about 10 miles (16 kilometers) from the jail, but authorities found no one there after a nearly eight-hour standoff.
Monterey County Sheriff's Office Capt. John Thornburg tells KPIX-TV deputies surrounded a motel in the town of Marina on Tuesday after getting a call from an employee who reported spotting 20-year-old Jonathan Salazar.
Deputies found his motel room empty.
Deputies say Salazar and 21-year-old Santos Fonseca escaped Sunday from the Monterey County jail in Salinas after climbing thorough a hole they made on the ceiling of a bathroom.
Both had been in custody since 2018 and were awaiting trial on murder counts and "numerous other felony charges" in separate cases.


Radiant Media Player
UWP Xbox Demo Video App
Select a player
MP4 VOD player
DASH VOD AVC
DASH Multiple audio
DASH VOD HEVC
DASH LIVE AVC
DASH DRM 2 PlayReady
DASH DRM 3 PlayReady
DASH with video ads (rmp-vast)
Environment API (rmp)
Environment API (Shaka Player)


T3A05 advanced web Pages by Leo.html
Links to >=3 HTML CSS and Form resources such as:
W3schools HTML Refer
W3schools CSS Reference
This is
bold
this isn't.
Get 8 different CSS things working
The animation Property
Move an element from 0px to 200px left. The animation lasts for 5 seconds. It then starts over again, and go on forever (infinite).
MY WEB PAGE LOOKS COOL!
Hello World!
This page has a light blue background color!


FILE MAPPING
问题描述 :
It is often helpful for computer users to see a visual representation of the file structure on their computers. The “explorer” in Microsoft Windows is an example of such a system. Before the days of graphical user interfaces, however, such visual representations were not possible. The best that could be done was to show a static “map”of directories and files, using indentation as a guide to directory contents. For example:
ROOT
| DIR1
| File1
| File2
| File3
| DIR2
| DIR3
| File1
File1
File2
This shows that the root directory contains two files and three subdirectories. The first subdirectory contains 3 files, the second is empty and the third contains one file.
输入:
Write a program that reads a series of data sets representing a computer file structure. A data set ends with a line containing a single *, and the end of valid data is denoted by a line containing a single #. The data set contains a series of file and directory names. (The root directory is assumed to be the starting point.) The end of a directory is denoted by a ‘]’ Directory names begin with a lower case ‘d’ and file names begin with a lower case ‘f’ File names may or may not have an extension (such as fmyfile.dat or fmyfile). File and directory names may not contain spaces.
输出:
Note that the contents of any directory should list any subdirectories first, followed by files, if any. All files should be in alphabetical order within each directory. Note that each data set output is marked by the label “DATA SET x:” where x denotes the number of the set, beginning at 1. Note also the blank line between the output data sets. Each level of indentation should show a ‘|’ followed by 5 spaces.
样例输入:
file1 file2 dir3 dir2 file1 file2 ] ] file4 dir1 ] file3 * file2 file1 * #
样例输出:
DATA SET 1: ROOT | dir3 | | dir2 | | file1 | | file2 | dir1 file1 file2 file3 file4 DATA SET 2: ROOT file1 file2
解题代码:
/*<EMAIL_ADDRESS>*/ import java.io.*; public class Main { public static void main(String[] args) throws Exception{ //System.setIn(new FileInputStream(new File("E:\\in.txt"))); //System.setOut(new PrintStream(new File("E:\\out.txt"))); BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String s; Node root=new Node("ROOT",null); Node curr=root; Node t,n; int count=1; tag: while(true){ switch((s=br.readLine()).charAt(0)){ case 'f': t=new Node(s,curr); if(curr.fleftmost==null) curr.fleftmost=t; else{ if(t.compareTo(curr.fleftmost)< 0){ t.frightsib=curr.fleftmost; curr.fleftmost=t; }else{ n=curr.fleftmost; while(n.frightsib!=null&&t.compareTo(n.frightsib)>0){ n=n.frightsib; } t.frightsib=n.frightsib; n.frightsib=t; } } break; case 'd': t=new Node(s,curr); if(curr.dleftmost==null) curr.dleftmost=curr.drightmost=t; else{ curr.drightmost.drightsib=t; curr.drightmost=t; } curr=curr.drightmost; break; case ']': curr=curr.parent; break; case '*': print(root,count++); curr=root=new Node("ROOT",null); break; case '#': break tag; } } } static void print(Node root,int count) { System.out.println("DATA SET "+count+":"); print0(root,0); System.out.println(); } static void print0(Node root, int d) { for(int i=0;i< d;i++){ System.out.print("| "); } System.out.println(root.content); Node t=root.dleftmost; while(t!=null){ print0(t,d+1); t=t.drightsib; } t=root.fleftmost; while(t!=null){ print0(t,d); t=t.frightsib; } } } class Node implements Comparable< Node>{ String content; Node parent; Node fleftmost; Node frightsib; Node dleftmost; Node drightsib; Node drightmost; Node(String c,Node n){ content=c; parent=n; } @Override public int compareTo(Node o) { return this.content.compareTo(o.content); } }
(adsbygoogle = window.adsbygoogle || []).push({});
為甚麼fln*20+0.5f
不是HDU 2411。。标题党么。。。
第二种解法如果数组有重复元素 就不正确
代码可真够长的！
不好意思，写错了．应该是 path[0]=0, visited[V] = true;
赞！！~~大赞！！~
程序是对的。有些地方用了C++的写法
是穷举，但是代码有优化（v数组），并不是2^n。测试数据应该没问题，之前有超时的代码。
必须试过啊
21行中，j<10可改为j<10-i，减少比较次数
第二种想法，我想来好久，为啥需要一个newhead，发现是把最后一个节点一直返回到嘴上面这层函数。厉害，这道题之前没样子想过。
原来的主机不行，目前更换到了国内主机
5.1处，反了；“上一个操作符的优先级比操作符ch的优先级大，或栈是空的就入栈。”如代码所述，应为“上一个操作符的优先级比操作符ch的优先级小，或栈是空的就入栈。”
换句话说，A[k/2-1]不可能大于两数组合并之后的第k小值，所以我们可以将其抛弃。
应该是，不可能小于合并后的第K小值吧


{% extends "layout.html" %} {% block body %}
Welcome to the Employee Manager! To get started, login and add or edit some employees or register with us today!


Report 3 Bangladesh
This report is created based on a publicly available data. The data are available on a Google Sheet. Please see the Data Source section for link. Please note that publicly available data are not official and MAY BE UNRELIABLE. I personally did not verify them. I am using them for educational purposes. Use at your discretion.
3.1 Epidemic curve and search for peak
The epidemic curve for Bangladesh and a tentative peak. The red line in the plot indicates a potential peak based on available data. IF the peak (red line) is at the far right, then we may not have reached a peak yet. We must have sustained decrease of incidences to be sure about any peak.
We fit a log linear model to estimate the doubling time (growh phase) and halving time (decline phase, when that happens). The estimated fitted line (solid line) with 95% confidence interval (dotten lines) are superimposed on the epidemic curve below.
The current doubling time as of 2020-09-10 is 9.9 days with a 95% confidence interval of (9.1, 10.9) days.
3.1.1 Estimating the Overall Reproduction Number, \(R_0\)
The log-linear model estimates the \(R_0\) as follows:
## Min. 1st Qu. Median Mean 3rd Qu. Max.
## 1.511 1.567 1.591 1.592 1.612 1.679
3.1.2 Estimating the Effectuve Reproduction Number (\(R_e\))
The estimation of effective reproduction number involves the distribution of serial interval (SI). Based on the literature (REF to be added), a gamma distribution with mean 7.5 and standard deviation 3.5
3.1.3 Simulating the \(R_e\) on Weekly Sliding Window
Now we perform a simulation of different SI distribution to obtain the \(R_e\). For this, we vary the parameters of gamma distribution and obtain the following.
# Recalculating with varying SI distribution parameters
# we get these results:
config = make_config(list(mean_si = 7.5, std_mean_si = 3.5,
min_mean_si = 2, max_mean_si =10.0,
std_si = 3.5, std_std_si = 1,
min_std_si = 0.5, max_std_si = 4))
bd_res_uncertain_si <-
estimate_R(bd_confirmed_cases$daily_cases, method = "uncertain_si",
config = config)
plot_Ri(bd_res_uncertain_si)
| t_start | t_end | Mean(R) | Std(R) | Quantile.0.025(R) | Quantile.0.975(R) | |
|---|---|---|---|---|---|---|
| 105 | 106 | 112 | 1.046632 | 0.0169938 | 1.0189608 | 1.081899 |
| 106 | 107 | 113 | 1.049673 | 0.0145129 | 1.0231781 | 1.079145 |
| 107 | 108 | 114 | 1.064205 | 0.0138124 | 1.0355469 | 1.090588 |
| 108 | 109 | 115 | 1.067638 | 0.0154839 | 1.0303541 | 1.093207 |
| 109 | 110 | 116 | 1.072344 | 0.0178503 | 1.0300534 | 1.099355 |
| 110 | 111 | 117 | 1.066645 | 0.0202760 | 1.0205370 | 1.096095 |
| 111 | 112 | 118 | 1.027756 | 0.0209605 | 0.9843239 | 1.059694 |
The effective reproduction number based on the last week’s incidences show an average of 1.03 with a 95% confidence interval (0.98, 1.06).
3.1.4 Simulating \(R_e\) on a Monthly Sliding Window
| t_start | t_end | Mean(R) | Std(R) | Quantile.0.025(R) | Quantile.0.975(R) | |
|---|---|---|---|---|---|---|
| 59 | 60 | 89 | 1.328111 | 0.1218987 | 1.093749 | 1.527731 |
| 60 | 61 | 90 | 1.326367 | 0.1225633 | 1.096821 | 1.529301 |
| 61 | 62 | 91 | 1.319118 | 0.1219674 | 1.093018 | 1.523864 |
| 62 | 63 | 92 | 1.312845 | 0.1204491 | 1.092004 | 1.517296 |
| 63 | 64 | 93 | 1.306606 | 0.1180362 | 1.090871 | 1.508910 |
| 64 | 65 | 94 | 1.303426 | 0.1154575 | 1.092073 | 1.502786 |
| 65 | 66 | 95 | 1.296084 | 0.1126439 | 1.088118 | 1.490242 |
| 66 | 67 | 96 | 1.289401 | 0.1097843 | 1.086316 | 1.478005 |
| 67 | 68 | 97 | 1.284089 | 0.1072704 | 1.085707 | 1.467915 |
| 68 | 69 | 98 | 1.268620 | 0.1041213 | 1.075342 | 1.446044 |
| 69 | 70 | 99 | 1.256148 | 0.1003377 | 1.072203 | 1.427868 |
| 70 | 71 | 100 | 1.248356 | 0.0963948 | 1.073534 | 1.414545 |
| 71 | 72 | 101 | 1.247968 | 0.0931521 | 1.078450 | 1.409307 |
| 72 | 73 | 102 | 1.243734 | 0.0904911 | 1.077346 | 1.399898 |
| 73 | 74 | 103 | 1.241699 | 0.0882930 | 1.077199 | 1.392902 |
| 74 | 75 | 104 | 1.224717 | 0.0856263 | 1.063337 | 1.370345 |
| 75 | 76 | 105 | 1.206741 | 0.0819941 | 1.054814 | 1.345852 |
| 76 | 77 | 106 | 1.195827 | 0.0779376 | 1.055362 | 1.329129 |
| 77 | 78 | 107 | 1.182595 | 0.0735190 | 1.051625 | 1.310244 |
| 78 | 79 | 108 | 1.174473 | 0.0690322 | 1.052361 | 1.295629 |
| 79 | 80 | 109 | 1.162138 | 0.0643547 | 1.047242 | 1.275574 |
| 80 | 81 | 110 | 1.168266 | 0.0606673 | 1.060065 | 1.275402 |
| 81 | 82 | 111 | 1.168308 | 0.0584652 | 1.058817 | 1.269725 |
| 82 | 83 | 112 | 1.157930 | 0.0568349 | 1.048442 | 1.254106 |
| 83 | 84 | 113 | 1.146390 | 0.0549897 | 1.041503 | 1.238319 |
| 84 | 85 | 114 | 1.147418 | 0.0532516 | 1.048453 | 1.236274 |
| 85 | 86 | 115 | 1.135368 | 0.0515691 | 1.038929 | 1.221583 |
| 86 | 87 | 116 | 1.127179 | 0.0492675 | 1.037022 | 1.210468 |
| 87 | 88 | 117 | 1.116696 | 0.0464521 | 1.032996 | 1.196648 |
| 88 | 89 | 118 | 1.099904 | 0.0429453 | 1.023926 | 1.175051 |
The effective reproduction number based on the last months’s incidences show an average of 1.1 with a 95% confidence interval (1.02, 1.18).
3.1.5 Cumulative Deaths (official and unofficial)
| country | Total Deaths |
|---|---|
| Bangladesh | 4593 |
| Bangladesh(unoff) | 1217 |
3.2 Bangladesh in South Asia
3.2.1 Infection
| country | Total Cases |
|---|---|
| India | 4465863 |
| Bangladesh | 331078 |
| Pakistan | 300030 |
| Indonesia | 203342 |
| Bangladesh(unoff) | 156391 |
| Singapore | 57166 |
| Nepal | 49219 |
| Malaysia | 9583 |
| Sri Lanka | 3147 |
| Bhutan | 234 |
3.2.2 Deaths
| country | Total Deaths |
|---|---|
| India | 75062 |
| Indonesia | 8336 |
| Pakistan | 6365 |
| Bangladesh | 4593 |
| Bangladesh(unoff) | 1217 |
| Nepal | 312 |
| Malaysia | 128 |
| Singapore | 27 |
| Sri Lanka | 12 |
| Bhutan | 0 |
3.2.3 Cases and deaths compared on a specific day
Bangladesh has entered into day 186 since first confirmed case.
| Country | Total cases | Total deaths |
|---|---|---|
| India | 1803695 | 38135 |
| Indonesia | 184268 | 7750 |
| Pakistan | 295053 | 6283 |
| Bangladesh | 331078 | 4593 |
| Malaysia | 8943 | 124 |
| Nepal | 19063 | 49 |
| Singapore | 50369 | 27 |
| Sri Lanka | 2814 | 11 |
| Bhutan | 233 | 0 |


{% extends 'layout.html' %} {% block content %}
We're experiencing problems from our end. Please try again in the future.


Meowww. Meowwwwwww..... Meow, meow, meow, meeeeow, meow, mmmmmmeow, meow. Now I don't have to stretch my paws.
No where near as scary as those wireless headphones!
My friends used to judge me because I was always reaching for my spectacles. Now they just see the results on my stories. :)
The team is amazing! snapRing will be better than Nucleus. It has to; I invested.


int a;
a = (4 + 3) * 2; // Grouping expressions
if (a > 10) { // Containing expressions
line(a, 0, a, 100); // Containing a list of parameters
}
Grouping and containing expressions and parameters. Parentheses have multiple functions relating to functions and structures. They are used to contain a list of parameters passed to functions and control structures and they are used to group expressions to control the order of execution. Some functions have no parameters and in this case, the space between parentheses is blank.
int[] numbers = new int[3];
numbers[0] = 90;
numbers[1] = 150;
numbers[2] = 30;
int a = numbers[0] + numbers[1]; // Sets variable a to 240
int b = numbers[1] + numbers[2]; // Sets variable b to 180
The array access operator is used to specify a location within an array. The data at this location can be defined with the syntax array[element] = value or read with the syntax value = array[element].
int[] a = { 5, 20, 25, 45, 70 };
void setup() {
size(100, 100);
}
void draw() {
for(int i=0; i < a.length; i++) {
line(0, a[i], 50, a[i]);
}
}
Define the beginning and end of functions blocks and statement blocks such as the for() and if() structures. Curly braces are also used for defining inital values in array declarations.
In JavaScript, a string is a sequence characters enclosed in single or double quotes.
'abc' === "abc"


{% load i18n %}
{% blocktrans trimmed %} After completing your purchase, we will ask you to transfer the money to a bank account, using a personal reference code. {% endblocktrans %}


Portfolio
This could be a showcase of your work! We are using the Isotope Jquery plugin to filter results. This is the strict version, you should also check out the great Masonry version. All photos © by Dimitra Giannouka.
Lorem Ipsum
travel
Lorem Ipsum
people
Lorem Ipsum
artists
Lorem Ipsum
people
Lorem Ipsum
travel
Lorem Ipsum
people
Lorem Ipsum
poetic
Lorem Ipsum
artists
Lorem Ipsum
travel
Lorem Ipsum
artists
Lorem Ipsum
poetic


- callback(VFunc0) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked when all async operations are
finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(VFunc1<?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(VFunc2<?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(VFunc3<?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(VFunc4<?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(VFunc5<?, ?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(VFunc6<?, ?, ?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(VFunc7<?, ?, ?, ?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callback(def<Object>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on a new thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc0) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc1<?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc2<?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc3<?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc4<?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc5<?, ?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc6<?, ?, ?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(VFunc7<?, ?, ?, ?, ?, ?, ?>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- callbackSync(def<Object>) - Method in class net.cassite.style.AsyncGroup
-
The given lambda will be invoked on current thread when all async
operations are finished or thrown with an exception.
Arguments would be filled with result of the Asyncs in the order of
async operations were added.
- Case(T, def<R>) - Method in class net.cassite.style.SwitchBlock
-
add a Case block to the expression
- Case(T, R) - Method in class net.cassite.style.SwitchBlock
-
add a Case block to the expression
- Case(T, VFunc0) - Method in class net.cassite.style.SwitchBlock
-
add a Case block to the expression
- Case(T, RFunc0<R>) - Method in class net.cassite.style.SwitchBlock
-
add a Case block to the expression
- ClassSup<T> - Class in net.cassite.style.reflect
-
Supporter for Class objects
- ClassSup(Class<T>) - Constructor for class net.cassite.style.reflect.ClassSup
-
Construct the class supporter with given Class object
- clear() - Method in class net.cassite.style.aggregation.JoinedList
-
- cls(Class<T>) - Static method in class net.cassite.style.reflect.Reflect
-
create a class supporter with given class
- cls(String) - Static method in class net.cassite.style.reflect.Reflect
-
create a class supporter with given class name
- cls(T) - Static method in class net.cassite.style.reflect.Reflect
-
create a class supporter with given object
- cls(Class<T>) - Static method in class net.cassite.style.Style
-
create a class supporter with given class
- cls(String) - Static method in class net.cassite.style.Style
-
create a class supporter with given class name
- cls(T) - Static method in class net.cassite.style.Style
-
create a class supporter with given object
- cls(Class<T>) - Method in interface net.cassite.style.var
-
create a class supporter with given class
- cls(String) - Method in interface net.cassite.style.var
-
create a class supporter with given class name
- cls(Object) - Method in interface net.cassite.style.var
-
create a class supporter with given object
- CollectionFuncSup<T> - Class in net.cassite.style.aggregation
-
Supporter of collections
- ComparableFuncSup<T> - Class in net.cassite.style.util
-
Supporter of Comparable objects.
Usually we don't need to know how much larger or smaller one object is than
another
We only need to know whether one is larger or smaller than the other.
Readable methods are provided to determine larger/smaller/equal
- compareTo(T) - Method in class net.cassite.style.util.ComparableFuncSup
-
Simply invokes Comparable.compareTo(Object)
- constructor() - Method in class net.cassite.style.reflect.ClassSup
-
Retrieve constructor with no parameters
- constructor(Class<?>...) - Method in class net.cassite.style.reflect.ClassSup
-
Retrieve constructor with given parameters types
- constructor(A1FuncSup<Class<?>>) - Method in class net.cassite.style.reflect.ClassSup
-
Retrieve constructor with given parameters types in the form of a
$(array/iterable)
- constructors() - Method in class net.cassite.style.reflect.ClassSup
-
retrieve all constructors
- ConstructorSup<T> - Class in net.cassite.style.reflect
-
Supporter for Constructors
- contains(Object) - Method in class net.cassite.style.aggregation.JoinedList
-
- containsAll(Collection<?>) - Method in class net.cassite.style.aggregation.JoinedList
-
- Continue - Exception in net.cassite.style.control
-
- Continue() - Constructor for exception net.cassite.style.control.Continue
-
- Continue() - Static method in class net.cassite.style.Core
-
Jump to next loop
- Continue() - Static method in class net.cassite.style.Style
-
Jump to next loop
- Continue() - Method in interface net.cassite.style.var
-
Jump to next loop
- copy() - Static method in class net.cassite.style.$
-
- copyFunc() - Static method in class net.cassite.style.$
-
- Core - Class in net.cassite.style
-
- current() - Static method in class net.cassite.style.$
-
- currentIndex - Variable in class net.cassite.style.LoopInfo
-
index of the iterator current position


Body Parameters
email
required
Type String
It is used for login.
password
required
Type String
It is used for login.
app_name
required
Type String
It is used for your application name.
app_discription
required
Type String
It is used for your application description.
app_image
required
Type File
It is used for your application image.
app_logo
required
Type File
It is used for your application logo.
Json Response
{
"id": 61,
"name": "string",
"description": "string",
"notifications_used": 0,
"app_qr": QR_imge.png ,
"created_at": "2021-01-09",
"app_image": "image.jpg",
"status": 200
}
Body Parameters
email
required
Type String
It is used for login to get your all notifications.
password
required
Type String
It is used for login to get your all notifications.
app_name
required
Type String
It is used for your application name to get your all notifications.
Json Response
{
"id": 61,
"name": "string",
"all_notifications": 0,
"status": 200
}
Body Parameters
email
required
Type String
It is used for login to send notifications to registered users.
password
required
Type String
It is used for login to send notifications to registered users.
app_name
required
Type String
It is used to send notifications to registered users against app name provided.
title
required
Type String
It is a title for notification that you are going to send.
description
required
Type String
It is a description for notification that you are going to send.
Json Response
{
"id": 61,
"title": "app title",
"description": "app description",
"app_id": "app id",
"created_at": "2021-02-08",
"notifications_sent": 10,
"status": 200
}
Body Parameters
email
required
Type String
It is used for login to get all apps.
password
required
Type String
It is used for login to get all apps.
Json Response
{
"id": 61,
"my_apps": "5",
"status": 200
}


1. Download ApacheTomcat (used newest version) to C drive
2. Download Jenkins WarFile (used newest version)
3. Place Jenkins WarFile in \webapps directory of ApacheTomcat
4. Startup ApacheTomcat from \bin directory by running startup.bat
5. Default Jenkins port is 8080, access by going to localhost:8080/jenkins
5a.  Go to Manage Jenkins, then to Manage Plugins
7. Select Available Tab, search for necessary plugins, Med-Fleet used:
7a. Github plugin
--Need to set up link to SAREC-Lab/SEStudio-MedFleet Git Repo
--Set up repo polling at specified interval, will look for changes, and start specified jobs if diff is found
7b. Android Emulator Plugin
--Poll for any changes to PhoneApp folder, pulls code, grabs gradlew file, opens Android emulator and verifies build with each check-in
7c. HTTP POST Plugin
-- Send post requests to specified sites, in our case ticketing system
7d. SiteMonitor Plugin
-- Monitor any ip, used to lightly monitor all hosts to ensure they have heartbeat
7e. Email Extension Plugin (Never got fully working, gmail would block login attmepts, but can tell something is wrong anytime security message is received from google!)
--Supposed to leverage gmail instead of needing smtp server, to send notifications of failure or no heartbeat, see above
7f. Maven Plugin (never got fully working)
--Poll for any changes to MissionControl folder, pulls code, grabs pom file, and verifies build with each check-in
Note: Microsoft Azure Accounts Team disabled the server hosting Jenkins on 6/6/2016 due to spending limit overage.
If it happens to allow the server back up, you can access at: http://<IP_ADDRESS>:8080/jenkins/


A javascript class that transforms an image within a container into a background image with a cover-style effect, based on a given ratio.
* Resize screen width to see how each image maintains its aspect ratio and stays centered within its parent container.


...
Ateneo de Manila University
December 14–15, 2019
OFFICIAL SCOREBOARD
[DEMO]
...
...
Legend:
Solved First
Solved
Tried, Incorrect
Pending Judgement
Sponsors


pbmtomacp(1) pbmtomacp(1) NAME pbmtomacp - convert a portable bitmap into a MacPaint file SYNOPSIS pbmtomacp [-l left] [-r right] [-b bottom] [-t top] [pbmfile] DESCRIPTION Reads a portable bitmap as input. If no input-file is given, standard input is assumed. Produces a MacPaint file as output. The generated file is only the data fork of a picture. You will need a program such as mcvert to generate a Macbinary or a BinHex file that con‐ tains the necessary information to identify the file as a PNTG file to MacOS. OPTIONS Left, right, bottom & top let you define a square into the pbm file, that must be converted. Default is the whole file. If the file is too large for a MacPaint-file, the bitmap is cut to fit from ( left, top ). BUGS The source code contains comments in a language other than English. SEE ALSO ppmtopict(1), macptopbm(1), pbm(5), mcvert(1) AUTHOR Copyright (C) 1988 by Douwe van der Schaaf (...!mcvax!uvapsy!vdschaaf). 31 August 1988 pbmtomacp(1)


Registration form
First name
*
Last name
*
E-mail
*
Password
*
Date of birth
*
Phone number
*
Height [m]
Submit


Apple price:
$
Buy
Sell
0
Avg $
Orange price:
$
Buy
Sell
0
Avg $
Banana price:
$
Buy
Sell
0
Avg $
Grape price:
$
Buy
Sell
0
Avg $
Welcome to the Fruit Bazaar!
Time Remaining 5:00
Money Remaining: $


Demo App
Accounts
Username
Name
Surname
Phone Number
Actions
Previous
Next
Add New Account
×
Add New Account
Account Created.
Username
Name
Surname
Telephone Number
Captcha Text
×
Edit Account
Account Edited.
Username
Name
Surname
Telephone Number
×
Delete Account
Delete operation needs approval.
Account Deleted.


For months I had been hoping for another salvia dream, so tantalizing and inconclusive were the few I'd had already. At last it happened, when the gremlins that control my dreaming were in a particularly mischievous mood.
An Eductated Impulse
In my dream I had just acquired a new 'party bowl', recommended to me specifically for use with the salvia. The leaf was old. 5 months, Burning Man old. I knew as soon as I got the bowl that I would use it that night. Had to make sure it worked, didn't I? But this decision wasn't entirely impulsive. I'd been craving a session with the numinous for some time, mustering up my courage against a fear which had grown stale with waiting. It was the right time.
'POOF You're Dead'
The bowl filled, I collected myself. Water pipe, with ice -- check. Lighter -- check. Glass of water -- check. Writing utensil and paper -- check. Pillow -- I was set. The lights were out except for one small lamp nearby, because this lesson is learned in darkness. I caught the stream of my breathing and, praying for grace, ignited the leaf. Three large tokes in rapid succession finished the bowl, and by the second one I could already feel the effects coming on. It was a deep tingling closing in around me, coming down from my head and in from my limbs.
I barely managed to switch off the light before I collapsed. It wasn't so much a loss of muscular control as a full-on somatic commandment: 'Lie down, NOW.' It was similar to that critical point in the onset of a mushroom trip, when sitting becomes too much and you retire to a more comfortable position, that of a corpse. Only this happened much faster.
It occurred to me that anyone watching would have seen me basically slump over, staring into space. Had I been poisoned? Well, YES, in a sense, very much so. Intentionally so. I knew that I was physically safe enough; I'd heard no reports of salvia toxicity, at least with raw leaf. I also knew there were no guarantees in this business... But these fears were fleeting. They gave way to a greater depth.
This is the death plant, I realized. (One of them, at least.) I felt I understood a bit what it meant to die, to have one's conciousness secede from its union with the body, leaving certain familiar elements of understanding behind. And yet, there was consciousness. Some part of me knew that it had to get back, that there were friends and family who loved me, who would be tragically disappointed were they to lose me this way. Was it the Ego, telling stories of this boy it remembered, building him back out of memories and nothing? Or were the effects of the drug simply fading?
Beelzebub
Gradually, I began to recover. It was an upwards process, halting, like I was surfacing in thrusts from beneath an avalanche of green snow. Soon I was able to sit up and write a bit, but another wave hit me and I lay down, this time with headphones on, to drown out noises from the street. No music, though.
Again in darkness, eyes closed. It was me who lay there now, not some pseudo-cadaver as before. But the presence of the herb was still with me. On previous encounters with it, I have experienced a phenomenon wherein the ambient sounds condensed into a single insectoid buzzing language. This now began to happen, only it built in intensity until it exceeded any previous experience.
A complex, multiharmonic hum, quite possibly related to the sound of cars outside and the refrigerator across the room from where I lay. I knew better than to try and identify the source, though. Let it come as it will. And so it continued to build, speaking to me in some higher-dimensional tongue which I could not yet understand. Aloof, deliberate, like a bored god reading me my rights. As it rose in pitch and intensity, the sound began to resonate throughout my entire body, most strongly in my spine. It felt as if great energy was flowing through me, as if my whole nervous system had been electrified. I was not twitching, or convlusing -- I was buzzing. It felt pretty good! (The image reprinted by the McKennas, of the bee-headed mushroom shaman, flashed briefly in my mind.)
The buzzing lasted for quite awhile, perhaps 5 minutes, and faded slowly. Nothing like the brief visionary spasms of kundalini action I've noticed with cannabis. This was no trick of perspective. Even after I sat up and felt mostly 'down', I was suffused with a pleasant low-level tingling. Other than a little social displacement, interacting with others online, I felt fine.
Smoke and Mirrors
Looking back on this dream, I should say that it didn't feel entirely healthy. This had to do with the method of ingestion. Smoking the leaves had several disadvantages, most notably the discomfort caused by inhaling hot smoke. The use of a water pipe did not eliminate this. As with most smoke experiences, such discomfort can color the trip, and may have contributed to my immediate sense of having been poisoned.
The effects of smoked salvia leaf do not last long. This is good for those who may not be ready to deal with issues of mortality. But it seems to be a virtue of the plant itself, this audience with death, and the short recovery allows no time to struggle or make peace with it. You can just grit your teeth and bear it, as I did, and pop back out none the wiser. So it seems a longer session, chewed leaf or mouthwash, might be preferable.
Finally, perhaps most importantly: the need to take in much smoke quickly was disconcerting. It felt juvenile. I felt like a school kid huffing solvents.  I may try it again, but I will also explore other options.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


{{ref improve|date=December 2014}} {{Infobox prepared food | name = Hard sauce | image = | caption = Christmas dessert including hard sauce (lower centre) for pudding (and on tarts at upper left) | alternate_name = | country = England | region = | creator = | course = Dessert | type = Sauce | served = Cold | main_ingredient = Butter, sugar, flavouring (rum, brandy, whiskey, sherry, vanilla or other) | variations = | calories = | other = }}
Hard sauce is a sweet, rich dessert sauce made by creaming or beating butter and sugar with rum (rum butter), brandy (brandy butter), whiskey, sherry (sherry butter), vanilla or other flavorings. It is served cold, often with hot desserts.
It is typically served with plum pudding, bread pudding, Indian pudding, hasty pudding, and other heavy puddings as well as with fruitcakes and gingerbread.
In the U.K. brandy butter is particularly associated with the Christmas and New Year season and Christmas pudding and warm mince pies, serving as a seasonal alternative to cream, ice cream or custard. At Cambridge, it is also known as Senior Wrangler sauce.
Though it is called a sauce, it is neither a liquid nor smooth. It could be more accurately classified as a spread and has the consistency of butter. It is easy to make and keeps for months under refrigeration. It can be pressed into a decorative mold before chilling.
Under European Community regulations, to be called rum/brandy/sherry butter, it must contain at least 20% butterfat.<ref>"Commission Regulation (EC) No 445/2007 of 23 April 2007 laying down certain detailed rules for the application of Council Regulation (EC) No 2991/94 laying down standards for spreadable fats and of Council Regulation (EEC) No 1898/87 on the protection of designations used in the marketing of milk and milk products" [1]</ref>
Contents |
<references/>
{{Foods featuring butter}} {{Dessert sauces}} {{dessert-stub}}


NIF Objects | Compound Types | Enum Types | Basic Types | File Versions
| Name | Type | Arg | Arr1 | Arr2 | Cond | Description | From | To |
|---|---|---|---|---|---|---|---|---|
| Collision Type | BoundVolumeType | Type of collision data. | ||||||
| Sphere | SphereBV | collisionType == 0 | Sphere | |||||
| Box | BoxBV | collisionType == 1 | Box | |||||
| Capsule | CapsuleBV | collisionType == 2 | Capsule | |||||
| HalfSpace | HalfSpaceBV | collisionType == 5 | Half Space |


Volleyball
Team name, mascot, color, and logo.
Serial COM port identifier to which the scoreboard console is connected.


/dev/blog
Bez Hermoso, Software Engineer @ Square
The bluebird
library doesn’t quite work with Angular out-of-the-box. You’ll have to configure bluebird
to execute resolution/rejection functions within Angular’s digest loop. I also learned that even if you have that in place, ui-router
’s Resolve functionality still wouldn’t work with bluebird
promises. You’ll have to do something extra for that, too:
If you need bluebird
’s superior Promise
objects within Angular and with ui-router
, you’ll have to configure it like this:
var app = angular.module('main');
app.run(function ($rootScope, $q) {
// This ensures that resolutions/rejections are ran
// within Angular's digest loop:
Promise.setScheduler(function (fn) {
$rootScope.$evalAsync(fn);
});
// Wrap the promise's resolution/rejection within a $q.defer promise.
Promise.prototype.qDeferred = function () {
var deferred = $q.defer();
this.then(deferred.resolve, deferred.reject);
return deferred.promise;
};
});
With that in place, we can now easily produce a Promise object of the proper type whenever necessary:
$stateProvider.state('stuff', {
resolve: {
collection: function () {
return Promise.all([ ... ]).qDeferred();
}
}
});
// This will work now as well:
Promise.map(urls, function (url) {
return $http.get(url);
}).then(function (results) {
$scope.results = results;
});