A channel to discuss trading. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
dokrates21-Dec-18 07:25 PM
Vertigo21-Dec-18 08:35 PM
BTC going down? Wasn't it just going straight to 20k?
ver_User21-Dec-18 09:33 PM
it's a tricky zone, what's nice is it's decoupled from equities, for now, otherwise we'd be in the shit - maybe digital gold is here at last
BlackJesus21-Dec-18 10:19 PM
I've been gone so long from these chats
Work is consuming my life bleh.
Andersen21-Dec-18 10:30 PM
2 days ago KMD stay near 105-110 in this chart, today 50-60 . Looks not bad. Buy support https://coinmarketbook.cc/(edited)
SHossain21-Dec-18 10:30 PM
@BlackJesus don't forget to migrate any funds from zc
meatspoon21-Dec-18 10:57 PM
Why even work when you know exactly what is going to happen in the crypto markets?
ComputerGenie 👴👴👴21-Dec-18 11:10 PM
People still work?
silly suckers
Vertigo21-Dec-18 11:10 PM
@Andersen any list that has bitcot cash on top looses all credibility to me.
Andersen21-Dec-18 11:15 PM
People still want to buy scam , sad but that true. This chart show only buy support near spread price.
Likewise22-Dec-18 01:52 AM
one man's scam is the other's diamond I suppose
Hermes22-Dec-18 02:07 AM
I honestly think that the bear market was caused by BItcoin SV
Vertigo22-Dec-18 02:44 AM
I don't know about that but they sure showed how much power greed and centralization they have.

They can pump and dump their own coin easy.
bishop22-Dec-18 03:05 AM
@Hermes Bear market started well before the ABC/SV bullshit
1
Hermes22-Dec-18 03:06 AM
well the recent crash...in some way
bishop22-Dec-18 03:10 AM
sure, it didn't help, but bear markets are 20% declines from the highs so naturally the bear market started long before that drama
Lumbi22-Dec-18 08:07 AM
miner farms have taken over the coin... governance is a joke
PoS is way better as long as it's a non-shitcoin like xrp(edited)
jl777c22-Dec-18 08:40 AM
144 * 12.5 = 1800 BTC per day from miners
daily trading volume: 1600000 BTC per day
circulating coins 17 million (maybe as little at 12 million)
if 1800/1.6 million or 1800/12 million is a takeover, then yes miners have taken over BTC
most other PoW coins will have similar percentages
miners are subject to hardfork attack, ie. XMR, SIA, etc
PoS is all about the initial distribution, which can be highly concentrated or just concentrated
PoW isnt better than PoS, PoS isnt better than PoW, it all depends on the details
3
Vertigo22-Dec-18 11:44 AM
Before KMD I was all on lisk but the cartels took over the forging now they vote each other and nobody can take them out no matter how little they share with voters.
I think pow better than dpos
jl777c22-Dec-18 12:01 PM
dPoS has some very serious problems, especially if a small number of delegates
ComputerGenie 👴👴👴22-Dec-18 12:03 PM
miner farms have taken over the coin
said at least one person about almost every coin since cgminer was invented
$KMD
Aside from being one of the strongest projects fundamentally, with a major catalyst ahead, the chart is a work of art imo.
One of the few alts on the market with on balance volume (green) trending up for the whole year.
On-balance volume (OBV) is a momentum indicator that uses volume flow to predict changes in stock price.
ComputerGenie 👴👴👴22-Dec-18 03:35 PM
it's amazing how efficiently consensus can be reached...
in a democracy
Do any of those still exist? and if so, why? (fyi: the US is not a democracy)(edited)
Lumbi22-Dec-18 03:35 PM
KMD could go PoS/PoW verus and thereby put a dent in the coal smog in china
Top 10 Biggest Bitcoin Mining Companies Bitcoin miners are critical to Bitcoin and its protection. Mining, as soon as performed at the average home pc, is no...
ver_User22-Dec-18 03:54 PM
KMDETH, isn't it time to break out soon?
of course, with ETHBTC as it is, this would not mean slow and steady for KMDBTC
It's official. The NASDAQ has now joined the Russell 2,000 and Dow Jones Transportations in bear markets. The Dow Jones Industrials and S&P 500 will soon join the party.
No, trump can fire powell. Its in the fed charter.
Banksters and their sycophants would raise holy hell but its in there
bishop22-Dec-18 10:23 PM
@actionslacks and what would the cause for removal be?
removal because you disagree with policy isn't grounds for removal
further, he's one of multiple voting members
actionslacks22-Dec-18 10:26 PM
Idk, I’m just saying it’s possible. And it would be glorius
bishop22-Dec-18 10:27 PM
Don't get me wrong, I have my own views on the fed and policy but I don't see any realistic probability this happens and should it, it will be political nightmare as it voids the "independence" of the fed (although that's another discussion altogether)
actionslacks22-Dec-18 10:29 PM
Well if nothing else its opening a lot of eyes to the feds “independence”
bishop22-Dec-18 10:32 PM
Policy error already has happened... hard to imagine unemployment going lower than levels it's currently at and they haven't generated sufficient inflation by the very metric they gauge inflation by.
You have markets goosed because of QE, the exact opposite should occur with QT
and rates are still relatively low by historical standards so the likelihood of being able to do something meaningful during the next recession is scary in itself. Every subsequent round of QE has less and less of an effect
actionslacks22-Dec-18 10:38 PM
Employment numbers are bs anyway. inflation numbers arent based on the price of what people actually need to live. The coming crash was baked into the cake long ago. The fed was out of bullets long ago(edited)
bishop22-Dec-18 10:39 PM
I agree, I'm simply saying they are using U4 and PCE and U4 isn't going to go much lower and PCE hasn't been consistently above 2%
if that's your dual mandate, you aren't achieving it
actionslacks22-Dec-18 10:41 PM
Ignoring housing costs and food prices when calculating inflation is deceiving. Real inflation has been well over 2% for decades now.
The feds only purpose is to gut the ussa. They have largely succeeded.
bishop22-Dec-18 10:55 PM
Ignoring housing costs and food prices when calculating inflation is deceiving. Real inflation has been well over 2% for decades now duh, that's not the point though in which metric they use
actionslacks22-Dec-18 11:16 PM
I’m not arguing the point, just pointing out the absurdity of the whole endeavor. CPI, PCE, etc. It’s all just lipstick on the communist pig that is central banking.
2
Likewise23-Dec-18 07:46 AM
in the mean time kmd has been losing volume as usual........
Likewise23-Dec-18 08:00 AM
quite an easy play trading wise but seems in the trading channel not traders are aroun d
Cheerio lads merry Xmas
Lumbi23-Dec-18 08:16 AM
ZEC looking like a breakout.. up or down?
Likewise23-Dec-18 08:52 AM
kmd sell some of the trading stash to buy back cheaper
where's at @Bitcoin Benny
havent seen you for a few day here
Lumbi23-Dec-18 11:13 AM
TRTL makin moves
pvnamk1923-Dec-18 11:23 AM
@SHossain Could you do an escrow service for me?
I want to exchange REVS vs KMD
🛡bstr15623-Dec-18 02:46 PM
"KMD could go PoS/PoW verus and thereby put a dent in the coal smog in china"
Meh... If you're talking environment, Merge mining is an overall better answer. Keeps benefits of PoW and doesn't require any additional hashpower that doesn't already exist mining for other chains.
Also can provide incredible resistance to 51% attack.
ComputerGenie 👴👴👴23-Dec-18 02:57 PM
Merge mining is an overall better answer.

It's your coin saying:
>I know I'll never have a real network, so I'll pretend I matter by doing this...
jl777c23-Dec-18 03:01 PM
not easy to convince miners to add merge mining for 40+ coins
ComputerGenie 👴👴👴23-Dec-18 03:12 PM
I think @! |🆉🆉🆉🆉🆉.🆉🆉| ! - crackers could answer as to miner willingness...
jl777c23-Dec-18 03:13 PM
BTC miners it would need to be
Lumbi23-Dec-18 04:23 PM
Mathematics and efficiency are divine concepts. The better we become, the better the world becomes.
Even if that means fresher air somewhere due to lower coal emissions.(edited)
Coinmetrics (@coinmetrics) report: Over 2 million Bitcoin Private tokens were covertly premined, breaking the 21 million supply cap
https://t.co/SNFj7rJCaJ


Fixed size chained hashtable. More...
Go to the source code of this file.
Data Structures | |
| struct | tommy_hashtable_struct |
| Hashtable container type. More... | |
Typedefs | |
| typedef tommy_node | tommy_hashtable_node |
| Hashtable node. | |
| typedef struct tommy_hashtable_struct | tommy_hashtable |
| Hashtable container type. | |
Functions | |
| void | tommy_hashtable_init (tommy_hashtable *hashtable, tommy_count_t bucket_max) |
| Initializes the hashtable. | |
| void | tommy_hashtable_done (tommy_hashtable *hashtable) |
| Deinitializes the hashtable. | |
| void | tommy_hashtable_insert (tommy_hashtable *hashtable, tommy_hashtable_node *node, void *data, tommy_hash_t hash) |
| Inserts an element in the hashtable. | |
| void * | tommy_hashtable_remove (tommy_hashtable *hashtable, tommy_search_func *cmp, const void *cmp_arg, tommy_hash_t hash) |
| Searches and removes an element from the hashtable. | |
| tommy_hashtable_node * | tommy_hashtable_bucket (tommy_hashtable *hashtable, tommy_hash_t hash) |
| Gets the bucket of the specified hash. | |
| void * | tommy_hashtable_search (tommy_hashtable *hashtable, tommy_search_func *cmp, const void *cmp_arg, tommy_hash_t hash) |
| Searches an element in the hashtable. | |
| void * | tommy_hashtable_remove_existing (tommy_hashtable *hashtable, tommy_hashtable_node *node) |
| Removes an element from the hashtable. | |
| void | tommy_hashtable_foreach (tommy_hashtable *hashtable, tommy_foreach_func *func) |
| Calls the specified function for each element in the hashtable. | |
| void | tommy_hashtable_foreach_arg (tommy_hashtable *hashtable, tommy_foreach_arg_func *func, void *arg) |
| Calls the specified function with an argument for each element in the hashtable. | |
| tommy_count_t | tommy_hashtable_count (tommy_hashtable *hashtable) |
| Gets the number of elements. | |
| tommy_size_t | tommy_hashtable_memory_usage (tommy_hashtable *hashtable) |
| Gets the size of allocated memory. |
Fixed size chained hashtable.
This hashtable is a standard implementation of a chained hashtable with a fixed size.
Note that performances starts to degenerate after reaching a load factor greater than 0.75. The tommy_hashdyn and tommy_hashlin hashtables fix this problem growing dynamically.
To initialize the hashtable you have to call tommy_hashtable_init() specifing the fixed bucket size.
tommy_hashslin hashtable; tommy_hashtable_init(&hashtable, 1024);
To insert elements in the hashtable you have to call tommy_hashtable_insert() for each element. In the insertion call you have to specify the address of the node, the address of the object, and the hash value of the key to use. The address of the object is used to initialize the tommy_node::data field of the node, and the hash to initialize the tommy_node::key field.
struct object { tommy_node node; // other fields int value; }; struct object* obj = malloc(sizeof(struct object)); // creates the object obj->value = ...; // initializes the object tommy_hashtable_insert(&hashtable, &obj->node, obj, tommy_inthash_u32(obj->value)); // inserts the object
To find and element in the hashtable you have to call tommy_hashtable_search() providing a comparison function, its argument, and the hash of the key to search.
int compare(const void* arg, const void* obj) { return *(const int*)arg != ((const struct object*)obj)->value; } int value_to_find = 1; struct object* obj = tommy_hashtable_search(&hashtable, compare, &value_to_find, tommy_inthash_u32(value_to_find)); if (!obj) { // not found } else { // found }
To iterate over all the elements in the hashtable with the same key, you have to use tommy_hashtable_bucket() and follow the tommy_node::next pointer until NULL. You have also to check explicitely for the key, as the bucket may contains different keys.
tommy_node* i = tommy_hashtable_bucket(&hashtable, tommy_inthash_u32(value_to_find)); while (i) { struct object* obj = i->data; // gets the object pointer if (obj->value == value_to_find) { printf("%d\n", obj->value); // process the object } i = i->next; // goes to the next element }
To remove an element from the hashtable you have to call tommy_hashtable_remove() providing a comparison function, its argument, and the hash of the key to search and remove.
struct object* obj = tommy_hashtable_remove(&hashtable, compare, &value_to_remove, tommy_inthash_u32(value_to_remove)); if (obj) { free(obj); // frees the object allocated memory }
To destroy the hashtable you have to remove all the elements, and deinitialize the hashtable calling tommy_hashtable_done().
tommy_hashtable_done(&hashtable);
If you need to iterate over all the elements in the hashtable, you can use tommy_hashtable_foreach() or tommy_hashtable_foreach_arg(). If you need a more precise control with a real iteration, you have to insert all the elements also in a tommy_list, and use the list to iterate. See the Tommy Multi Indexing example for more detail.
| typedef tommy_node tommy_hashtable_node |
Hashtable node.
This is the node that you have to include inside your objects.
| typedef struct tommy_hashtable_struct tommy_hashtable |
Hashtable container type.
| void tommy_hashtable_init | ( | tommy_hashtable * | hashtable, |
| tommy_count_t | bucket_max | ||
| ) |
Initializes the hashtable.
| buckets | Minimum number of buckets to allocate. The effective number used is the next power of 2. |
| void tommy_hashtable_done | ( | tommy_hashtable * | hashtable | ) |
Deinitializes the hashtable.
You can call this function with elements still contained, but such elements are not going to be freed by this call.
| void tommy_hashtable_insert | ( | tommy_hashtable * | hashtable, |
| tommy_hashtable_node * | node, | ||
| void * | data, | ||
| tommy_hash_t | hash | ||
| ) |
Inserts an element in the hashtable.
| void* tommy_hashtable_remove | ( | tommy_hashtable * | hashtable, |
| tommy_search_func * | cmp, | ||
| const void * | cmp_arg, | ||
| tommy_hash_t | hash | ||
| ) |
Searches and removes an element from the hashtable.
You have to provide a compare function and the hash of the element you want to remove. If the element is not found, 0 is returned. If more equal elements are present, the first one is removed.
| cmp | Compare function called with cmp_arg as first argument and with the element to compare as a second one. The function should return 0 for equal elements, anything other for different elements. |
| cmp_arg | Compare argument passed as first argument of the compare function. |
| hash | Hash of the element to find and remove. |
| tommy_hashtable_node* tommy_hashtable_bucket | ( | tommy_hashtable * | hashtable, |
| tommy_hash_t | hash | ||
| ) |
Gets the bucket of the specified hash.
The bucket is guaranteed to contain ALL the elements with the specified hash, but it can contain also others. You can access elements in the bucket following the ::next pointer until 0.
| hash | Hash of the element to find. |
| void* tommy_hashtable_search | ( | tommy_hashtable * | hashtable, |
| tommy_search_func * | cmp, | ||
| const void * | cmp_arg, | ||
| tommy_hash_t | hash | ||
| ) |
Searches an element in the hashtable.
You have to provide a compare function and the hash of the element you want to find. If more equal elements are present, the first one is returned.
| cmp | Compare function called with cmp_arg as first argument and with the element to compare as a second one. The function should return 0 for equal elements, anything other for different elements. |
| cmp_arg | Compare argument passed as first argument of the compare function. |
| hash | Hash of the element to find. |
| void* tommy_hashtable_remove_existing | ( | tommy_hashtable * | hashtable, |
| tommy_hashtable_node * | node | ||
| ) |
Removes an element from the hashtable.
You must already have the address of the element to remove.
| void tommy_hashtable_foreach | ( | tommy_hashtable * | hashtable, |
| tommy_foreach_func * | func | ||
| ) |
Calls the specified function for each element in the hashtable.
You can use this function to deallocate all the elements inserted.
tommy_hashtable hashtable; // initializes the hashtable tommy_hashtable_init(&hashtable, ...); ... // creates an object struct object* obj = malloc(sizeof(struct object)); ... // insert it in the hashtable tommy_hashdyn_insert(&hashtable, &obj->node, obj, tommy_inthash_u32(obj->value)); ... // deallocates all the objects iterating the hashtable tommy_hashtable_foreach(&hashtable, free); // deallocates the hashtable tommy_hashdyn_done(&hashtable);
| void tommy_hashtable_foreach_arg | ( | tommy_hashtable * | hashtable, |
| tommy_foreach_arg_func * | func, | ||
| void * | arg | ||
| ) |
Calls the specified function with an argument for each element in the hashtable.
| tommy_count_t tommy_hashtable_count | ( | tommy_hashtable * | hashtable | ) |
Gets the number of elements.
| tommy_size_t tommy_hashtable_memory_usage | ( | tommy_hashtable * | hashtable | ) |
Gets the size of allocated memory.
It includes the size of the tommy_hashtable_node of the stored elements.


Class LayeredSpatialMap<T>
ISpatialMap<T> implementation that can be used to efficiently represent multiple "layers" of objects, with each layer represented as an ISpatialMap<T> instance. It provides the regular spatial map functionality, as well as adds layer masking functionality that allow functions to operate on specific layers only.
Implements
Inherited Members
Namespace: SadRogue.Primitives.SpatialMaps
Assembly: TheSadRogue.Primitives.dll
Syntax
public sealed class LayeredSpatialMap<T> : AdvancedLayeredSpatialMap<T>, ISpatialMap<T>, IReadOnlyLayeredSpatialMap<T>, IReadOnlySpatialMap<T>, IEnumerable<ItemPositionPair<T>>, IEnumerable where T : class, IHasLayer, IHasID
Type Parameters
| Name | Description |
|---|---|
| T | Type of items stored in the layers. Type T must implement IHasID and IHasLayer, must be a reference type, and its Layer value MUST NOT change while the item is in the spatial map. |
Remarks
See the ISpatialMap<T> for documentation on the practical purpose of spatial maps. The objects stored in a LayeredSpatialMap must be reference types and implement both IHasID and IHasLayer. Each object in a spatial map is presumed to have a "layer", which is assumed to remain constant once the item is added to the layer mask.
Constructors
LayeredSpatialMap(Int32, Func<Int32, IListPool<T>>, IEqualityComparer<Point>, Int32, UInt32)
Constructor.
Declaration
public LayeredSpatialMap(int numberOfLayers, Func<int, IListPool<T>> customListPoolCreator = null, IEqualityComparer<Point> pointComparer = null, int startingLayer = 0, uint layersSupportingMultipleItems = 0U)
Parameters
| Type | Name | Description |
|---|---|---|
| Int32 | numberOfLayers | Number of layers to include. |
| Func<Int32, IListPool<T>> | customListPoolCreator | A function used to determine the list pool implementation used for the spatial maps which support multiple items in a location (if any). The function takes the layer it is creating the pool for as a parameter. If no custom creator is specified, a ListPool is used. |
| IEqualityComparer<Point> | pointComparer | Equality comparer to use for comparison and hashing of points, as object are added to/removed from/moved around the spatial map. Be especially mindful of the efficiency of its GetHashCode function, as it will determine the efficiency of many LayeredSpatialMap functions. Defaults to the default equality comparer for Point, which uses a fairly efficient generalized hashing algorithm. |
| Int32 | startingLayer | Index to use for the first layer. |
| UInt32 | layersSupportingMultipleItems | A layer mask indicating which layers should support multiple items residing at the same location on that layer. Defaults to no layers. Generate this layer mask via Default. |
Remarks
This class allows you to specify the starting index for layers in order to make it easy to
combine with other structures in a map which may represent other layers. For example, if a
startingLayer
of 0 is specified, layers in the spatial map will have numbers
in range[0, numberOfLayers - 1]. If 1 is specified, layers will have numbers in range [1-numberOfLayers],
and anything to do with layer 0 will be ignored. For example, If a layer-mask that includes layers 0,
2, and 3 is passed to a function, only layers 2 and 3 are considered (since they are the only ones that would
be included in the spatial map.


"""The io module provides the Python interfaces to stream handling. The
builtin open function is defined in this module.
At the top of the I/O hierarchy is the abstract base class IOBase. It
defines the basic interface to a stream. Note, however, that there is no
separation between reading and writing to streams; implementations are
allowed to raise an OSError if they do not support a given operation.
Extending IOBase is RawIOBase which deals simply with the reading and
writing of raw bytes to a stream. FileIO subclasses RawIOBase to provide
an interface to OS files.
BufferedIOBase deals with buffering on a raw byte stream (RawIOBase). Its
subclasses, BufferedWriter, BufferedReader, and BufferedRWPair buffer
streams that are readable, writable, and both respectively.
BufferedRandom provides a buffered interface to random access
streams. BytesIO is a simple stream of in-memory bytes.
Another IOBase subclass, TextIOBase, deals with the encoding and decoding
of streams into text. TextIOWrapper, which extends it, is a buffered text
interface to a buffered raw stream (`BufferedIOBase`). Finally, StringIO
is an in-memory stream for text.
Argument names are not part of the specification, and only the arguments
of open() are intended to be used as keyword arguments.
data:
DEFAULT_BUFFER_SIZE
An int containing the default buffer size used by the module's buffered
I/O classes. open() uses the file's blksize (as obtained by os.stat) if
possible.
"""
# New I/O library conforming to PEP 3116.
__author__ = ("Guido van Rossum<EMAIL_ADDRESS>"
"Mike Verdone<EMAIL_ADDRESS>"
"Mark Russell<EMAIL_ADDRESS>"
"Antoine Pitrou<EMAIL_ADDRESS>"
"Amaury Forgeot d'Arc<EMAIL_ADDRESS>"
"Benjamin Peterson<EMAIL_ADDRESS>__all__ = ["BlockingIOError", "open", "IOBase", "RawIOBase", "FileIO",
"BytesIO", "StringIO", "BufferedIOBase",
"BufferedReader", "BufferedWriter", "BufferedRWPair",
"BufferedRandom", "TextIOBase", "TextIOWrapper",
"UnsupportedOperation", "SEEK_SET", "SEEK_CUR", "SEEK_END"]
import _io
import abc
from _io import (DEFAULT_BUFFER_SIZE, BlockingIOError, UnsupportedOperation,
open, FileIO, BytesIO, StringIO, BufferedReader,
BufferedWriter, BufferedRWPair, BufferedRandom,
IncrementalNewlineDecoder, TextIOWrapper)
OpenWrapper = _io.open # for compatibility with _pyio
# Pretend this exception was created here.
UnsupportedOperation.__module__ = "io"
# for seek()
SEEK_SET = 0
SEEK_CUR = 1
SEEK_END = 2
# Declaring ABCs in C is tricky so we do it here.
# Method descriptions and default implementations are inherited from the C
# version however.
[docs]class IOBase(_io._IOBase, metaclass=abc.ABCMeta):
__doc__ = _io._IOBase.__doc__
[docs]class RawIOBase(_io._RawIOBase, IOBase):
__doc__ = _io._RawIOBase.__doc__
[docs]class BufferedIOBase(_io._BufferedIOBase, IOBase):
__doc__ = _io._BufferedIOBase.__doc__
[docs]class TextIOBase(_io._TextIOBase, IOBase):
__doc__ = _io._TextIOBase.__doc__
RawIOBase.register(FileIO)
for klass in (BytesIO, BufferedReader, BufferedWriter, BufferedRandom,
BufferedRWPair):
BufferedIOBase.register(klass)
for klass in (StringIO, TextIOWrapper):
TextIOBase.register(klass)
del klass
try:
from _io import _WindowsConsoleIO
except ImportError:
pass
else:
RawIOBase.register(_WindowsConsoleIO)


Make a diagram
Number of messages to send (> 100)
Message text to be sent
Send Http Chunk Asynchronous
Send Http Chunk Synchronous
Id
Save chart to database


Attention!
Register as a new author |
|
Simply fill in all of the fields below to register as an author prior to submitting material to Inderscience Publishers. The information gathered here will be used by the editors to communicate with you. It is very important that you provide a valid email address. All communications are made by email. |


Lightning executed 400-500K URLs/min on a machine with 16GB RAM and 8 CPUs, which is really impressive as compared to any other URL execution framework in the open source environment we tested.
Comparative study was done on similar projects.
Async-http-client did not suit our requirement due to the below limitations


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
CWP No.1389 of 2002 [1] *****
IN THE HIGH COURT OF PUNJAB AND HARYANA AT CHANDIGARH CWP No.1389 of 2002 Date of Decision:27.11.2012 M/s. Kundan Mill Board & Paper Mills ...Petitioner Vs. Union of India and another ...Respondents
CORAM: Hon'ble Mr. Justice A.K.Sikri, Chief Justice Hon'ble MR. Justice Rakesh Kumar Jain Present: Mr. Deepak Sibal,Advocate, for the petitioner.
Mr.B.S.Walia,Advocate, for the respondents.
**** A.K.SIKRI, CJ, (Oral) The petitioner-firm is engaged in the manufacture of cardboard. The "No Objection Certificate" for setting up the manufacturing unit was granted to it on 13.03.1991 and the consent, as required under Sections 25 and 26 of the Water (Prevention and control of Pollution) Act, 1977 (hereinafter referred to as the "1977 Act") for running the manufacturing unit was also granted upto 31.12.2010.
As per the case of the petitioner, till May 1998, the manufacturing process was continued without any dispute but in June 1998, the petitioner received two demand notices raised by respondent No.2 by CWP No.1389 of 2002 [2] ***** invoking Section 6(1A) of the1977 Act. The first demand was for payment of `54,955/- for the period 26.01.1992 to 28.02.1998 and the second demand was for payment of `3,004/- for the period from July 1990 till 25.01.1992. The appeals filed by the petitioner against the said demands were rejected and the writ petition bearing CWP No.12099 of 2000 was disposed of on 07.09.2000 with the direction that "the respondents- authorities shall appoint a paper technologist, who will visit the site of the petitioner alongwith the representative of the Board and the team shall assess the power consumption for the period of July 1990 to October 1999 and evaluate the production details for the corresponding period. The respondents-authorities shall then charge the cess as per the observations made by the Appellate Committee. The fee of the paper technologist expert shall be borne by the petitioner. If the Appellate committee comes to the conclusion that the petitioner was running the unit more than 2.5 ton, the petitioner shall not only pay the levy, but also, pay interest at the rate of 12% p.a. which shall be calculated by the respondents-authorities". Thereafter, the petitioner filed an application for review and the fee of the paper technologist was fixed @ `15,000/- in lump sum but till date no expert was appointed. The petitioner has, thus, challenged the demands raised by the respondent-Board in the present writ petition.
From the aforesaid narration, it becomes clear that two aspects need consideration in this matter:-
(i) "Whether the respondent Pollution Board could undertake 'best judgment assessment' and pass the orders in that manner; and CWP No.1389 of 2002 [3] *****
(ii) If the answer to the first question is in the affirmative, whether the manner in which 'the best judgment assessment' is carried out, is sustainable in law"?.
Insofar as the first question is concerned, answer to that has to be in affirmative i.e. in favour of the Pollution Board. As pointed above, in order to enable the Pollution Board to carry out assessment on actual basis, it was imperative on the part of the petitioner to install meter reflecting the actual consumption of water. The petitioner was also supposed to file the returns. Admittedly, no such returns were filed despite opportunities granted by the Pollution Board to the petitioner. Once the returns are not filed, the Pollution Board is left with no alternative but to take recourse to the 'best judgment assessment'. There is yet another factor which itself goes in favour of the Pollution Board.
The petitioner had approached the Appellate Committee, by filing appeal under Section 13 of the Water (Prevention & Control of Pollution) Cess Act, 1977. In the said appeal, orders were passed whereby the Appellate Committee decided that installed capacity of the mill may be got verified by engaging Paper Technologist along-with representative of the Board. It was further directed that the same team shall assess power consumption for the period from July 1990 to October 1999 and evaluate the production details for the corresponding period. Thereafter, the water cess shall be decided. In an event, it is found by the Appellate Committee that the installed capacity is 5.0 ton for which the NOC was obtained, the assessment order shall be drawn on the 5.0. ton capacity and the penalty shall be levied on the compound amount.
CWP No.1389 of 2002 [4] *****
The matter was adjourned thereafter and again taken up by the Appellate Committee on 28.6.2000. On this date, submissions of both the parties were considered and the Appellate Committee passed the order deciding that the balance payment be deposited along-with interest on or before 30.6.2000.
Significantly, the petitioner challenged this order by filing the writ petition No.12099 of 2000 in this Court. That writ petition was disposed of at the admission stage itself vide order dated 07.9.2000, directing the respondents to appoint Paper Technologist, who shall visit the site of the petitioner along-with the representative of the Board and the team shall assess the power consumption for the period July 1990 to October 1999 and evaluate the production details for the corresponding period. The Court specifically ordered that fee of the Paper Technologist shall be borne by the petitioner. It was also directed that if the Appellate Committee comes to the conclusion that the petitioner was running the unit more than 2.5. tone, the petitioner shall not only pay the levy but also pay interest at the rate of 12% per annum which shall be calculated by the respondent-authorities. We would like to point out that inspite of passing the order, the respondent had proceeded with the assessment taking into consideration installed capacity of 5 tons for which NOC was obtained, the petitioner on the other hand was maintaining that capacity of the plant was 2.5 tons and 5 tons.
Review of this order was sought and in the said review application, Division Bench of this Court passed an order dated 23.11.2001 CWP No.1389 of 2002 [5] ***** fixing the fee of the Paper Technologist at Rs.15,000/- in lump sum. Thereafter, the Pollution Board appointed the Expert from Saharanpur as the Paper Technologist to carry out the matter in terms of the order of this Court. A letter dated 17.11.2003 was addressed to the petitioner to deposit the fee and charges of the Institution which is accepted on record but the petitioner did not deposit the said fee.
Having regard to the same, we are of the view that neither the petitioner alleges violation of principle nor the petitioner can question the move of the respondents in proceeding with the 'best judgment assessment'.
Coming to the second issue as diluted above, it has to be decided as to whether the basis on which the 'best judgment assessment' is carried out, is correct or not.
As already pointed out above, the Pollution Board had taken into consideration the capacity of the petitioner as 5 metric tons and on that basis, water consumption is calculated in the absence of actual record, which could be furnished by the petitioner. The contention of the petitioner on the other hand, is that actual capacity installed was 2.5 metric tons. No doubt, this issue could be sorted out in clear terms and authoritatively, the petitioner had deposited the fee of consultant, to that extent, the petitioner is to be blamed. At the same time, we find on the basis of record that without the Expert going into that question, there are certain documents on record on the basis of which this controversy can be determined by this Court.
No doubt, the NOC was given by the Pollution Board for 5 CWP No.1389 of 2002 [6] ***** metric tons capacity. However, after obtaining NOC, the petitioner set up the factory and applied for consent of the Pollution Board under the provisions of Water (Prevention & Control of Pollution) Cess,Act,1978. In the said application dated 26.3.1993 submitted to the Pollution Board, the petitioner showed installed capacity. It is this application which was considered by the Pollution Board and the Pollution Board gave the consent vide order dated 29.1.1996 for three tons capacity. It can easily be inferred that before giving this consent, the Pollution Board might have inspected the factory of the petitioner but would have satisfied itself about the directions stated in the application for consent, wherein it was mentioned that installed capacity was 2.5 tons. Once we find from the record that the petitioner had constructed the factory with the installed capacity of 2.5 tons and consent was also given only for three tons, there cannot be any basis for making the assessment on the premise that 'No Objection Certificate' was obtained for five tons. No doubt, there could have been increase in the capacity afterwards, however, it could be only for three metric tons for which consent was given. If the petitioner had added the installed capacity more than three metric tons, the petitioner had to approach the Pollution Board again for fresh consent. No such event even took place. Therefore, on the basis of the material placed on record, we are of the opinion that 'the best judgment assessment' could have been done on the basis of consent order and not on the basis of 'NOC' given by the Pollution Board.
Mr.Walia, learned counsel for the Pollution Board has produced the record of assessment for the period from July 1990 to January CWP No.1389 of 2002 [7] ***** 25,1992. The assessment is made at `3004/-. For the period from January 26,1992 to February 1999, the assessment comes to `54955/-. Since these two assessment orders have been taken into consideration for five metric tones capacity, it should have been in our above discussion three metric tons capacity. We modify the assessment reducing the aforesaid amount by 40%.
As a result, this writ petition is partly allowed. The petitioner shall pay 60% of the amount assessed. This amount shall be paid within four weeks from the date of receipt of certified copy of this order along-with interest which shall be calculated at the rate of 9% per annum from January 01.2000 till the date of payment.
( A.K.SIKRI ) CHIEF JUSTICE 27.11.2012 (RAKESH KUMAR JAIN) vinod* JUDGE


Some parts of this website may not function correctly with JavaScript disabled, please
report any issues
so they can be resolved.
Home
Rooms
Museum
Entertainment
Book Now!
Light Mode
☰
Home
Explore
Rooms
Museum
Entertainment
Book Now!
Light Mode
❯
Bookings
Your Name
First name:
Last name:
Phone Number:
Room Number
Room Number:
Select Room
AI Revolution Master Suite
Child Slavery Family Suite
Minimalist Studio
Adults:
Adults:
Children:
Museum Tours
Room Number:
Select Tour
An Impossible Future Exhibit
Millennia Of War Exhibit
On The Shoulder Of Giants Exhibit
Tickets:
Preferred Date:
Submit!
References
▼


Note: this test requires dijit.


Problem 😱
You would like to have:
- visor mode on
cmd + .
- support for
alt + (< | > | backspace)
Solution 🤓
Before we begin let's ensure we have iterm2:
brew cask install iterm2
Let's address remaining issues in step by step approach:
1. visor mode on cmd + .
-
open iterm2
-
open preferences
cmd + ,
-
head to
keys
tab -
click
Create a dedicated Hotkey Window
-
add hotkey
cmd + .
-
check option of
floating window
- head to profiles section again and select window tab where you will need to have following settings:
style =
fullscreen
, screen =screen with cursor
, space =all spaces
- confirm changes and restart iterm2
Result:
2. support for alt + (< | > | backspace)
iTerm > Preferences > Profiles > Keys:
- Alt + left: Send Escape Sequence, Esc + b
- Alt + right: Send Escape Sequence, Esc + f
- Alt + backspace: Send Hex Code, 0x17


The internet is probably one of the most fascinating things ever created. One can find anything at anytime and even more than that the internet connects people from anywhere in the world.
The Internet has two faces: the one that we see, with beautiful made and websites and easy to work with and the one that we don't see. The face that we don't see is a bunch of written text that is called HTML language. So everything on the internet is made up of documents written in HTML.
HTML, known as Hypertext Markup Language is the language that computers understand. And all the HTML documents are connected on the internet thruough Hyperlinks.
HTML language contains elements that are each defined by tags. When we write HTML code, tags help us tell computers what each element represents.


First Name can't be blank
Last Name can't be blank
Enter correct email address.
Password must be at least 6 characters long.


When you first login, your current working directory is your home directory. Your home directory has the same name as your user-name, for example, ee91ab, and it is where your personal files and subdirectories are saved.
To find out what is in your home directory, type
% ls (short for list)
The ls command lists the contents of your current working directory.
There may be no files visible in your home directory, in which case, the UNIX prompt will be returned. Alternatively, there may already be some files inserted by the System Administrator when your account was created.
ls does not, in fact, cause all the files in your home directory to be listed, but only those ones whose name does not begin with a dot (.) Files beginning with a dot (.) are known as hidden files and usually contain important program configuration information. They are hidden because you should not change them unless you are very familiar with UNIX!!!
To list all files in your home directory including those whose names begin with a dot, type
% ls -a
ls is an example of a command which can take options: -a is an example of an option. The options change the behaviour of the command. There are online manual pages that tell you which options a particular command can take, and how each option modifies the behaviour of the command. (See later in this tutorial)
We will now make a subdirectory in your home directory to hold the files you will be creating and using in the course of this tutorial. To make a subdirectory called unixstuff in your current working directory type
% mkdir unixstuff
To see the directory you have just created, type
% ls
The command cd directory means change the current working directory to 'directory'. The current working directory may be thought of as the directory you are in, i.e. your current position in the file-system tree.
To change to the directory you have just made, type
% cd unixstuff
Type ls
to see the contents (which should be empty)
Make another directory inside the unixstuff directory called backups
Still in the unixstuff directory, type
% ls -a
As you can see, in the unixstuff directory (and in all other directories), there are two special directories called (.) and (..)
In UNIX, (.) means the current directory, so typing
% cd .
NOTE: there is a space between cd and the dot
means stay where you are (the unixstuff directory).
This may not seem very useful at first, but using (.) as the name of the current directory will save a lot of typing, as we shall see later in the tutorial.
(..) means the parent of the current directory, so typing
% cd ..
will take you one directory up the hierarchy (back to your home directory). Try it now.
Note: typing cd with no argument always returns you to your home directory. This is very useful if you are lost in the file system.
Pathnames enable you to work out where you are in relation to the whole file-system.
For example, to find out the absolute pathname of your home-directory, type
cd
to get back to your home-directory and then type
% pwd
The full pathname will look something like this -
/a/fservb/fservb/fservb22/eebeng99/ee91ab
which means that ee91ab (your home directory) is in the directory eebeng99 (the group directory),which is located on the fservb file-server.
Note:
/a/fservb/fservb/fservb22/eebeng99/ee91ab
can be shortened to
/user/eebeng99/ee91ab
Use the commands ls, pwd and cd to explore the file system.
(Remember, if you get lost, type cd by itself to return to your home-directory)
First type cd to get back to your home-directory, then type
% ls unixstuff
to list the conents of your unixstuff directory.
Now type
% ls backups
You will get a message like this -
backups: No such file or directory
The reason is, backups is not in your current working directory. To use a command on a file (or directory) not in the current working directory (the directory you are currently in), you must either cd to the correct directory, or specify its full pathname. To list the contents of your backups directory, you must type
% ls unixstuff/backups
Home directories can also be referred to by the tilde ~ character. It can be used to specify paths starting at your home directory. So typing
% ls ~/unixstuff
will list the contents of your unixstuff directory, no matter where you currently are in the file system.
What do you think
% ls ~
would list?
What do you think
% ls ~/..
would list?
ls |
list files and directories |
ls -a |
list all files and directories |
mkdir |
make a directory |
cd directory |
change to named directory |
cd |
change to home-directory |
cd ~ |
change to home-directory |
cd .. |
change to parent directory |
pwd |
display the path of the current directory |
<EMAIL_ADDRESS>© 9th October 2000


I code mostly in python but I have also done javascript and golang
before. I also had the opportunity to work with Lua, Java and
Scheme
I use Docker a lot to deploy my projects and I had the opportunity
to implement it with Kubernetes.
I also have knowledge in SQL database such as PostGre or non-SQL
such as MongoDB.
I love working on Linux with git, zsh and a good old-fashioned
terminal. I have tested many distro and desktop environments.
I also broke my system several times like any geek would. But
at least now I know how to fix it.
I have many ongoing projects that allow me to learn new things every
day and to improve my abilities.
- A discord bot
-
A web panel to manage my discord bot
-
A music sheet reader
-
An android app
-
And more...


{% include head.html %}
{% include nav.html %}
via GIPHY
{% include footer.html %} {% include js.html %}


Stories
Table of Content
Mythohistory (-20,000 AR to -15,000 AR)
Time of Legends (-5,000 AR to 0 AR)
Antiquities War (0 AR to 63 AR)
Ice Age (64 AR to 2943 AR)
Flood Ages (2934 AR to 3285 AR)
Champions of Kamigawa
Betrayers of Kamigawa
Saviors of Kamigawa
Modern History (3285 AR to 4205 AR)
Phyrexian Invasion (4205 AR to 4306 AR)
The Rift Era (4306 AR to 4500 AR)
The Mending Era (4500 AR to Present)
Khans of Tarkir
Fate Reforged
Dragons of Tarkir
Magic Origins
Conspiracy: Take the Crown
Battle for Zendikar
Oath of the Gatewatch
Shadows over Innistrad
Eldritch Moon
Kaladesh
Aether Revolt
Amonkhet
Hour of Devastation
Ixalan
Rivals of Ixalan
Dominaria
Vivien Reid
Children of the Nameless
Guilds of Ravnica
Ravnica Allegiance


Flexible Plans for Everyone.
Our plans are made for everyone. Whether you're just starting out on social media, or have been on there, we have a plan that's right for you.
Billed Monthly
Billed Yearly
$
4
/mo
Perfect plan you're just starting out.
- Linkedln Integartion
- Twitter Integartion
- Real-time Analytics
$
12
/mo
Perfect plan if you're a heavy user of social media.
- Linkedln Integartion
- Twitter Integartion
- Instagram Integartion
- Real-time Analytics
$
7
/mo
Perfect plan if you're just starting out.
- Linkedln Integartion
- Twitter Integartion


Success! All files have been uploaded.
File Details
| ID | Name | No. of Files | |
|---|---|---|---|
| 123 | test1 | 20 Mb | Download File |
| 239 | test2 | 10 Mb | Download File |
| 326 | test3 | 30 Mb | Download File |
| 123 | test4 | 100 Mb | Download File |
File Details
| ID | Name | No. of Files | |
|---|---|---|---|
| 123 | test1 | 20 Mb | Download File |
| 239 | test2 | 10 Mb | Download File |
| 326 | test3 | 30 Mb | Download File |
| 123 | test4 | 100 Mb | Download File |


Add Travel Insurance
ID
Date of formation
End Date
Start Date
Indemnity Amount
Monthly pay
Permanent Injury pay
Indemnity Amount
-->
Purpose


All of your Bookmarks
Work Bookmarks
School Bookmarks
Cooking Bookmarks
Kids Bookmarks
Family Bookmarks
Christmas Gifts Bookmarks
Birthday Gifts Bookmarks
No Category
Add new
bookmarks


Kota Silk
Rs. 2,500
Buy Now
Saree Color
Red with Brown
Saree Length
6.0m
Saree print
Printed Work
Blouse Color
Black
Blouse Length
0.9m
Blouse Fabric
Dhupion Silk
Saree Fabric
Kota Silk
Ratings
18


RhNAC Atg _at protein ABA genes thaliana Plant [], []. Figure gene promoter expression stress plants rose GUS drought involved activity Arabidopsis stomatal analysis NAC binding family regulatory signaling transcription superfamily tolerance used ABA-responsive Table control lines {border-style response sequence transgenic elements px;} #ffffff;} ABRE germination overexpressing plant putative root vector pathway using ABA-dependent OE# TFs ABA. data downstream sequences RhNAC-overexpressing abiotic abscisic leaves osmotic overexpression responses transcriptional unknown ABREs Fujita Physiol aperture dehydration leaf positions previous protoplasts regulation staining (OE#, Cell Liu analyzed cells cis-elements containing exogenous factor grown growth higher including independent measured number performed qRT-PCR responsive role seeds showed study, transformed upstream Kim P<., Zhang cis-acting closure days factors incubated indicate medium petals presence px; seed seedlings selected sensitivity transduction {font-family ABA, ABA-related DNA-binding RhNAC-silenced Shinozaki Stomatal acid conditions described detected expressed font-size fragments guard hypersensitivity kinase observed relative revealed signal ABA-signaling DNA Jiang OE#) OE#, PCR Yamaguchi-Shinozaki absence additional assay bind contain control. different double; enhanced enhances experiments fusion genes, induced isolated lateral previously probes rates ratio recognition represent result rice shown sites stresses study thaliana. treatment B). China Error Histochemical Pro RD, Sci bars border-color border-width classified conserved constructs cumulative element exposed finger fold genes. greater identified important investigated levels listed microarray n = ). pathways plants, plants. promoter, region regions results solid; stress-related transferred truncated up-regulated {font-style {font-weight **: -week-old A). ABF, ABI AREB AREB, Click However, Information LINK Maruyama Overexpression Protein RING RhNAC, S). Seki Trends WRKY Yoshida abaxial amplified apertures assays biological bold cDNA cell closure, compared conditions, construct core courier; current effect em; error examined extracts factor, file. homolog internal light mesophyll method normal old opening petals. play position potential primary primers pt;} reaction regulated regulating reporter respectively, resulting rose, shown. software standard stress-responsive suggest supplemented surfaces test. transformation type vascular zipper


An introduction to WebVR
Berlin - 10.08.2017
By Andrés Cuervo & Stefanie Doll
Microsoft Edge
Chrome for Android
Firefox
Chromium
Samsung Internet
Oculus Carmel
Servo
WebVR Polyfill
VR Headsets
Mobile Phone &
Cardboard
Tablets
Desktop
WebGL
Gampad
Web Audio
WebRTC
Geolocation
and more...
Entity Box = Geometry + Material + Position
Entity Ball = Geometry + Material + Position + Velocity + Physics
Entity is an empty container
<a-entity>
Components add a certain apperance, behaviour and/or functionality
System provides the global scope
<a-scene >
Setup of repetitive tasks & components needed
Go to: https://berlin-aframe-workshop.glitch.me
and click on the "Remix this project!" link
Then click "Show live" in the upper left corner and click on Lesson 1 "Playing with primitives".
ctrl + alt + i
It provides a basic shape for an entity
It gives appearance to an entity
Right-handed coordinate system
It places entities at certain spots in 3D space
Position is relative to <a-scene> or the parent-element.
It defines the orientation of an entity
#### Some other things to know: - default position for entities is "`0 0 0`" - the default camera position is "`0 1.6 0`" - Position is relative to a-scene or to the parent element
<a-animation>
component as a child
Use the 'src' attribute of the material component
You can use 3D-Objects in your A-Frame scenes.
Exports from Unity, Blender, Google Blocks, Sketchfab (...) and shared ressources.
Use together with the scale component
Models by "Anna dream brush" & Timothy 'YM' Johnson
<a-assets>
– <a-assets-item>
<a-mixin>
The ID of the asset or mixin is used as a refenrence on the entity.
Try to rebuild this scene!
Got back to the course overview and follow the links for Lesson 3.
See a pattern?
A-Frame is built on the concept of components:
Javascript that hooks into the component lifecycle (`init`, `tick`, `remove`, etc.).
Allows you to define more complicated behavior to make custom interactions, materials, & more!
AFRAME.registerComponent('my-color', {
schema : {
color : { default : '#DDAADD' }
},
init : function () {
this.el.setAttribute('material', 'color', this.data.color)}});
Register event listeners without Javascript
https://github.com/ngokevin/aframe-event-set-componenthttps://berlin-aframe-workshop.glitch.me/
Use the aframe-event-set-component
to change the color of the <a-box> on mouseenter and mouseleave.


/* <CoffeeScript> tableFormatter = require('./table') </CoffeeScript> */ /** * @class analize.correlate */ /* <CoffeeScript> correlate = {} correlate.correlate = (points, xField = 'x', yField = 'y') -> </CoffeeScript> */ /** * @method correlate * @member analize.correlate * @param {Object[]} points * @param {String} [xField = 'x'] Will consider the field named xField as the x value in the correlation * @param {String} [yField = 'y'] Will consider the field named yField as the x value in the correlation * @return {Object} Returns an object with all the calculated correlation values {intercept, slope, rSquared, description, correlation} * * data = [ * {col1: 1, col2: 4}, * {col1: 2, col2: 8}, * ] * * console.log(require('../').correlate.correlate(data, 'col2', 'col1')) * # { * # intercept: 0, * # slope: 0.25, * # rSquared: 1, * # description: "y = 0.25 * x + 0 with R^2 of 1 and Pearson's correlation coefficient of 1", * # correlation: 1 * # } * */ /* <CoffeeScript> n = points.length sumX = 0 sumY = 0 sumXY = 0 sumX2 = 0 sumY2 = 0 for point in points if point[xField] and point[yField] sumX += point[xField] sumY += point[yField] sumXY += point[xField] * point[yField] sumX2 += point[xField] * point[xField] sumY2 += point[yField] * point[yField] div = (n * sumX2) - (sumX * sumX) intercept = ((sumY * sumX2) - (sumX * sumXY)) / div slope = ((n * sumXY) - (sumX * sumY)) / div num = sumXY - (sumX * sumY / n) den = Math.sqrt((sumX2 - Math.pow(sumX, 2) / n) * (sumY2 - Math.pow(sumY, 2) / n)) if den is 0 correlation = 0 else correlation = num / den rSquared = Math.pow(correlation, 2) description = "y = #{slope} * x + #{intercept} with R^2 of #{rSquared} and Pearson's correlation coefficient of #{correlation}" return {intercept, slope, rSquared, description, correlation} correlate.correlationTable = (data, inputFields, outcomeFields, useRSquared = false, rawOutput = false) -> </CoffeeScript> */ /** * @method correlationTable * @member analize.correlate * @param {Object[]} data * @param {String} [inputFields = <all fields in first row>] Defaults to all fields in the first row * @param {String} [outcomeFields = <all fields in first row>] Defaults to all fields in the first row * @param {Boolean} [useRSquared = false] By default, the Pearson's correlation value (aka R) will be output. Setting this to `true` will cause it to output R^2 * @param {Boolean} [rawOutput = false] By default, the output will be a markdown formatted table. Setting this to `true` will cause it to output an Array of Objects * @return {String | Object[]} Returns all the calculated correlation values * * data = [ * {col1: 1, col2: 4, col3: -10}, * {col1: 2, col2: 8, col3: -20}, * {col1: 3, col2: 15, col3: -30}, * ] * * console.log(require('../').correlate.correlationTable(data)) * # | input | col1 | col2 | col3 | * # | ----- | -----:| -----:| -----:| * # | col1 | 1.00 | 0.99 | -1.00 | * # | col2 | 0.99 | 1.00 | -0.99 | * # | col3 | -1.00 | -0.99 | 1.00 | * */ /* <CoffeeScript> fields = Object.keys(data[0]) inputFields = inputFields or fields outcomeFields = outcomeFields or fields table = [] for inputField in inputFields row = {input: inputField} for outcomeField in outcomeFields correlationResult = correlate.correlate(data, outcomeField, inputField) if useRSquared row[outcomeField] = correlationResult.rSquared else row[outcomeField] = correlationResult.correlation table.push(row) if rawOutput return table else return tableFormatter.table.toString(table, null, null, null, 2) exports.correlate = correlate </CoffeeScript> */


14 November 2002
Disease Outbreak Reported
As of 13 November 2002, the WHO Collaborating Centre for Arthropod Borne Viruses - Western Hemisphere, at the Centers for Disease Control and Prevention (CDC) has reported 3 587 human cases of the West Nile virus, with 211 deaths occurring in 39 states and the District of Columbia. During 2002, West Nile virus activity (evidence of infections in birds, humans, mosquitoes, and other animals - primarily horses) has been documented in 43 states and the District of Columbia (see previous report).


We have a Rails app that sends its mail through SendGrid.
SendGrid lets you specify metadata in your mail headers, which you can put to excellent use.
The activity log
SendGrid’s highly useful activity log (docs) lists the last week of sent mail. Not the full mail, but the recipient e-mail address, the time it was sent, and its state (delivered, link in mail was clicked etc) as far as SendGrid can tell.
You can filter the list by e-mail address, which is really handy for debugging and customer support.
But the list doesn’t contain the mail body, or subject, or anything to help you tell which mail is which.
This can be solved with SendGrid metadata and some Action Mailer trickery.
Categories
You can set up to 10 categories as SendGrid metadata on each mail:
1 2 3 4 5 6 7 8 9 10 11 |
|
They’re not predefined, so you can use an unlimited number of categories in total.
You can use categories to filter your statistics. Categories are also displayed in the activity log, which may give you an idea of what we’ll do in a bit.
Unique arguments
You can also add any keys and values you like as so-called unique arguments:
1 2 3 4 5 6 |
|
They’re also shown in the activity log.
Note that the values will be turned into strings. If a value is a Ruby array, you’ll just see “Array” in SendGrid, so if you want them, do:
1 2 3 4 5 |
|
Setting metadata from mail automatically
So how do we automatically store the mailer and action (and some additional goodies) in the SendGrid metadata?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
|
Any mailer that inherits from ApplicationMailer
will now get the following metadata:
- A category with the name of the mailer, e.g. “MyMailer”
- A category with the mailer and action, e.g. “MyMailer#hello”
- A unique argument with the Rails environment, e.g. “production”
- A unique argument with the arguments passed into the mailer as a hash from argument name to value, like “{:foo_id=>123, :bar_id=>456}”
The mailer arguments will be rather a lot of text if you pass in full Active Record instances. If you use resque_mailer like we do, you will usually be passing only record ids, so it will be more compact.
Instead of this:
The log will show this:
Having this data is really handy, and I was pretty happy with this implementation. Sure beats looking at the call chain :)


Migration Guide 2.0.x to 2.1.x
Some parts of the 2.0 API have changed in the Akka 2.1 release. This guide lists the the changes and explains what you will need to do to upgrade your program to work with Akka 2.1.
Migrating from Akka 2.0.x to Akka 2.1.x is relatively straightforward. In Akka 2.1 the API has undergone some basic housekeeping, for example some package names have changed, but otherwise usage is largely unchanged. User programs will generally only need simple, mechanical changes in order to work with Akka 2.1.
If you are migrating from Akka 1.3.x you will need to follow the instructions for migrating from Akka 1.3.x to 2.0.x before following the instructions in this guide.
Scala Version
Akka 2.1 uses a new version of Scala. Change your project build and dependencies to Scala version 2.10.1.
Config Dependency
Akka's configuration system has graduated from Akka to become the Typesafe config project. The configuration system was previously embedded within akka-actor.jar, now it is specified as a dependency of akka-actor.jar.
If your are using a build tool with automatic dependency resolution, such as sbt or Maven, then you will not notice a difference. Otherwise you will need to ensure that config-1.0.0.jar is present on your classpath.
Pieces Moved to Scala Standard Library
Change the following import statements.
| Search | Replace with |
|---|---|
| akka.dispatch.Await | scala.concurrent.Await |
| akka.dispatch.Future | scala.concurrent.Future |
| akka.dispatch.Promise | scala.concurrent.Promise |
| akka.dispatch.ExecutionContext | scala.concurrent.ExecutionContext |
| akka.util.Duration | scala.concurrent.duration.Duration |
| akka.util.duration | scala.concurrent.duration |
| akka.util.Deadline | scala.concurrent.duration.Deadline |
| akka.util.NonFatal | scala.util.control.NonFatal |
| akka.japi.Util.manifest | akka.japi.Util.classTag |
Scheduler Dispatcher
The ExecutionContext to use for running scheduled tasks must now be specified. You can use an Akka Dispatcher for this purpose.
Scala:
import context.dispatcher // Use this Actors' Dispatcher as ExecutionContext
context.system.scheduler.scheduleOnce(10 seconds, self, Reconnect)
import system.dispatcher // Use ActorSystem's default Dispatcher as ExecutionContext
system.scheduler.scheduleOnce(50 milliseconds) {
testActor ! System.currentTimeMillis
}
Java:
// Use this Actors' Dispatcher as ExecutionContext
getContext().system().scheduler().scheduleOnce(Duration.create(
10, TimeUnit.SECONDS), getSelf(), new Reconnect(),
getContext().getDispatcher());
// Use ActorSystem's default Dispatcher as ExecutionContext
system.scheduler().scheduleOnce(Duration.create(50, TimeUnit.MILLISECONDS),
new Runnable() {
@Override
public void run() {
testActor.tell(System.currentTimeMillis());
}
}, system.dispatcher());
API Changes to Future - Scala
v2.0:
def square(i: Int): Future[Int] = Promise successful i * i
v2.1:
def square(i: Int): Future[Int] = Future successful i * i
v2.0:
val failedFilter = future1.filter(_ % 2 == 1).recover {
case m: MatchError => //When filter fails, it will have a MatchError
}
v2.1:
val failedFilter = future1.filter(_ % 2 == 1).recover {
// When filter fails, it will have a java.util.NoSuchElementException
case m: NoSuchElementException =>
}
A Promise is no longer also a Future, obtain the reference to its Future by calling promise.future.
v2.0:
Await.result(promise, duration)
v2.1:
Await.result(promise.future, duration)
API Changes to Future - Java
v2.0:
ExecutorService yourExecutorServiceGoesHere = Executors.newSingleThreadExecutor();
ExecutionContextExecutorService ec =
ExecutionContexts.fromExecutorService(yourExecutorServiceGoesHere);
// Use ec with your Futures
Future<String> f1 = Futures.successful("foo", ec);
// Then you shut the ec down somewhere at the end of your application.
ec.shutdown();
v2.1:
ExecutorService yourExecutorServiceGoesHere = Executors.newSingleThreadExecutor();
ExecutionContext ec =
ExecutionContexts.fromExecutorService(yourExecutorServiceGoesHere);
//No need to pass the ExecutionContext here
Future<String> f1 = Futures.successful("foo");
// Then you shut the ExecutorService down somewhere at the end of your application.
yourExecutorServiceGoesHere.shutdown();
v2.0:
Future<String> f1 = future(new Callable<String>() {
public String call() {
return "Hello" + "World";
}
}, system.dispatcher());
v2.1:
final ExecutionContext ec = system.dispatcher();
Future<String> f1 = future(new Callable<String>() {
public String call() {
return "Hello" + "World";
}
}, ec);
v2.0:
Future<String> future1 = Futures.successful("value", system.dispatcher()).andThen(
new OnComplete<String>() {
public void onComplete(Throwable failure, String result) {
if (failure != null)
sendToIssueTracker(failure);
}
}).andThen(new OnComplete<String>() {
public void onComplete(Throwable failure, String result) {
if (result != null)
sendToTheInternetz(result);
}
});
v2.1:
final ExecutionContext ec = system.dispatcher();
Future<String> future1 = Futures.successful("value").andThen(
new OnComplete<String>() {
public void onComplete(Throwable failure, String result) {
if (failure != null)
sendToIssueTracker(failure);
}
}, ec).andThen(new OnComplete<String>() {
public void onComplete(Throwable failure, String result) {
if (result != null)
sendToTheInternetz(result);
}
}, ec);
A Promise is no longer also a Future, obtain the reference to its Future by calling promise.future().
v2.0:
Await.result(promise, duration);
v2.1:
Await.result(promise.future(), duration);
API changes to DynamicAccess
All methods with scala.Either[Throwable, X] have been changed to use scala.util.Try[X].
DynamicAccess.withErrorHandling has been removed since scala.util.Try now fulfills that role.
API changes to Serialization
All methods with scala.Either[Throwable, X] have been changed to use scala.util.Try[X].
Empty Props
v2.0 Scala:
val router2 = system.actorOf(Props().withRouter(
RoundRobinRouter(routees = routees)))
v2.1 Scala:
val router2 = system.actorOf(Props.empty.withRouter(
RoundRobinRouter(routees = routees)))
v2.0 Java:
ActorRef router2 = system.actorOf(new Props().withRouter(
RoundRobinRouter.create(routees)));
v2.1 Java:
ActorRef router2 = system.actorOf(Props.empty().withRouter(
RoundRobinRouter.create(routees)));
Props: Function-based creation
v2.0 Scala:
Props(context => { case someMessage => context.sender ! someMessage })
v2.1 Scala:
Props(new Actor { def receive = { case someMessage => sender ! someMessage } })
Failing Send
When failing to send to a remote actor or an actor with a bounded or durable mailbox the message will now be silently delivered to ActorSystem.deadletters instead of throwing an exception.
Graceful Stop Exception
If the target actor of akka.pattern.gracefulStop isn't terminated within the timeout then the Future is completed with a failure of akka.pattern.AskTimeoutException. In 2.0 it was akka.actor.ActorTimeoutException.
getInstance for Singletons - Java
v2.0:
import static akka.actor.Actors.*;
if (msg.equals("done")) {
myActor.tell(poisonPill());
} else if (msg == Actors.receiveTimeout()) {
v2.1:
import akka.actor.PoisonPill;
import akka.actor.ReceiveTimeout;
if (msg.equals("done")) {
myActor.tell(PoisonPill.getInstance());
} else if (msg == ReceiveTimeout.getInstance()) {
Testkit Probe Reply
v2.0:
probe.sender ! "world"
v2.1:
probe.reply("world")
log-remote-lifecycle-events
The default value of akka.remote.log-remote-lifecycle-events has changed to on. If you don't want these events in the log then you need to add this to your configuration:
akka.remote.log-remote-lifecycle-events = off
Stash postStop
Both Actors and UntypedActors using Stash now override postStop to make sure that stashed messages are put into the dead letters when the actor stops. Make sure you call super.postStop if you override it.
Forwarding Terminated messages
Forwarding Terminated messages is no longer supported. Instead, if you forward Terminated you should send the information in your own message.
v2.0:
context.watch(subject)
def receive = {
case t @ Terminated => someone forward t
}
v2.1:
case class MyTerminated(subject: ActorRef)
context.watch(subject)
def receive = {
case Terminated(s) => someone forward MyTerminated(s)
}
Custom Routers and Resizers
The API of RouterConfig, RouteeProvider and Resizer has been cleaned up. If you use these to build your own router functionality the compiler will tell you if you need to make adjustments.
v2.0:
class MyRouter(target: ActorRef) extends RouterConfig {
override def createRoute(p: Props, prov: RouteeProvider): Route = {
prov.createAndRegisterRoutees(p, 1, Nil)
v2.1:
class MyRouter(target: ActorRef) extends RouterConfig {
override def createRoute(provider: RouteeProvider): Route = {
provider.createRoutees(1)
v2.0:
def resize(props: Props, routeeProvider: RouteeProvider): Unit = {
val currentRoutees = routeeProvider.routees
val requestedCapacity = capacity(currentRoutees)
if (requestedCapacity > 0) {
val newRoutees = routeeProvider.createRoutees(props, requestedCapacity, Nil)
routeeProvider.registerRoutees(newRoutees)
} else if (requestedCapacity < 0) {
val (keep, abandon) = currentRoutees.splitAt(currentRoutees.length +
requestedCapacity)
routeeProvider.unregisterRoutees(abandon)
delayedStop(routeeProvider.context.system.scheduler, abandon)(
routeeProvider.context.dispatcher)
}
v2.1:
def resize(routeeProvider: RouteeProvider): Unit = {
val currentRoutees = routeeProvider.routees
val requestedCapacity = capacity(currentRoutees)
if (requestedCapacity > 0) routeeProvider.createRoutees(requestedCapacity)
else if (requestedCapacity < 0) routeeProvider.removeRoutees(
-requestedCapacity, stopDelay)
Duration and Timeout
The akka.util.Duration class has been moved into the Scala library under the scala.concurrent.duration package. Several changes have been made to tighten up the duration and timeout API.
FiniteDuration is now used more consistently throught the API. The advantage is that if you try to pass a possibly non-finite duration where it does not belong you’ll get compile errors instead of runtime exceptions.
The main source incompatibility is that you may have to change the declared type of fields from Duration to FiniteDuration (factory methods already return the more precise type wherever possible).
Another change is that Duration.parse was not accepted by the Scala library maintainers; use Duration.create instead.
v2.0:
final Duration d = Duration.parse("1 second");
final Timeout t = new Timeout(d);
v2.1:
final FiniteDuration d = Duration.create(1, TimeUnit.SECONDS);
final Timeout t = new Timeout(d); // always required finite duration, now enforced
Package Name Changes in Remoting
The package name of all classes in the akka-remote.jar artifact now starts with akka.remote. This has been done to enable OSGi bundles that don't have conflicting package names.
Change the following import statements. Please note that serializers are often referenced from configuration files.
Search -> Replace with:
akka.routing.RemoteRouterConfig ->
akka.remote.routing.RemoteRouterConfig
akka.serialization.ProtobufSerializer ->
akka.remote.serialization.ProtobufSerializer
akka.serialization.DaemonMsgCreateSerializer ->
akka.remote.serialization.DaemonMsgCreateSerializer
Package Name Changes in Durable Mailboxes
The package names of all classes in the akka-file-mailbox.jar artifact now start with akka.actor.mailbox.filebased. This has been done to enable OSGi bundles that don't have conflicting package names.
Change the following import statements. Please note that the FileBasedMailboxType is often referenced from configuration.
Search -> Replace with:
akka.actor.mailbox.FileBasedMailboxType ->
akka.actor.mailbox.filebased.FileBasedMailboxType
akka.actor.mailbox.FileBasedMailboxSettings ->
akka.actor.mailbox.filebased.FileBasedMailboxSettings
akka.actor.mailbox.FileBasedMessageQueue ->
akka.actor.mailbox.filebased.FileBasedMessageQueue
akka.actor.mailbox.filequeue.* ->
akka.actor.mailbox.filebased.filequeue.*
Actor Receive Timeout
The API for setting and querying the receive timeout has been made more consistent in always taking and returning a Duration; the wrapping in Option has been removed.
(Samples for Java, Scala sources are affected in exactly the same way.)
v2.0:
getContext().setReceiveTimeout(Duration.create(10, SECONDS));
final Option<Duration> timeout = getContext().receiveTimeout();
final isSet = timeout.isDefined();
resetReceiveTimeout();
v2.1:
getContext().setReceiveTimeout(Duration.create(10, SECONDS));
final Duration timeout = getContext().receiveTimeout();
final isSet = timeout.isFinite();
getContext().setReceiveTimeout(Duration.Undefined());
ConsistentHash
akka.routing.ConsistentHash has been changed into an immutable data structure.
v2.0:
val consistentHash = new ConsistentHash(Seq(a1, a2, a3), replicas = 10)
consistentHash += a4
val a = consistentHash.nodeFor(data)
v2.1:
var consistentHash = ConsistentHash(Seq(a1, a2, a3), replicas = 10)
consistentHash = consistentHash :+ a4
val a = consistentHash.nodeFor(data)
Contents


Syringa vulgaris was first formally described by Carl Linnaeus in 1753 and the description was published in Species Plantarum. The Latin specific epithet vulgaris means “common” (in the sense of “widespread”.
Syringa vulgaris (lilac or common lilac) is a species of flowering plant in the olive family Oleaceae, native to the Balkan Peninsula, where it grows on rocky hills. Grown for its scented pink flowers in spring, this large shrub or small tree is widely cultivated and has been naturalized in parts of Europe and North America. It is not regarded as an aggressive species, found in the wild in widely scattered sites, usually in the vicinity of past or present human habitations.


Notes Service Privacy Policy
This document describes how Notes Service mobile applications and service ("the Service", "We") collects, uses and shares Your private data.
Protecting and being transparent about Your private data is our priority.
- Your phone number will be used as Your identifier within the Service;
- Your name will not be visible to other users;
- Your information collected within the Service will not be visible to other users;
- We will do our best to protect Your information;
- We will not share Your information with any third parties unless required by law.


Lifeway Wesleyan Church Craft Show Dec. 2, 2017
Welcome Signs
Block Sign
Block Signs
Baby Burp Cloths
Holiday Wreath


Library of functions to perform halo abundance matching¶
This class handles a light cone and assigns galaxies to the halos
Library of function to create halo catalogs matched to a density.
-
class
HaloSelection.
MultiDarkMock
(hdu, area, mockOutput_dir, mockName, zmin, zmax, nGal_Deg2)[source]¶ Parameters: - hdu – hdu of the lightcone
- area – area in deg2
- mockOutput_dir – directory where to output mocks
- mockName – name of the file where to save the mock
- zmin – minimum redshift array defining the bins
- zmax – maximum redshift array defining the bins
- nGal_Deg2 – number of galaxies per square degrees
-
compare_clustering_data_mock
(w_data, xi_data, theta_min_chi2=-2.3, theta_max_chi2=-1.5, w_bins=15, s_min_chi2=0.5, s_max_chi2=1.2, s_bins=10)[source]¶ Compares the clustering of the mock catalog and the clustering of the data. :param w_data: angular clustering from the data [x, y, yErr]. :param xi_data: monopole clustering from the data [x, y, yErr].
-
get_distrib_QTY
(colN, z1, z2)[source]¶ Computes the cumulative histogram of a column for halos in the range z1, z2. :param colN: name of the column you want to take the histogram. :param z1: minimum redshift :param z2: maximum redshift
-
get_distrib_QTY_cen
(colN, z1, z2)[source]¶ Computes the cumulative histogram of a column for central halos in the range z1, z2. :param colN: name of the column you want to take the histogram. :param z1: minimum redshift :param z2: maximum redshift
-
get_distrib_QTY_sat
(colN, z1, z2)[source]¶ Computes the cumulative histogram of a column for satellite halos in the range z1, z2. :param colN: name of the column you want to take the histogram. :param z1: minimum redshift :param z2: maximum redshift
-
initialize
()[source]¶ Initializes the procedure by putting into memroy arrays of central and satellites.
-
make_GaussianFsat_catalog
(colN, means, scatters, fsats)[source]¶ Creates lists of ids of centrals and satellite galaxies corresponding to the density given in the n(z). :param colN: name of the column you construct the catalog with :param means: means of the Gaussians, array the same length of the redshift bin :param scatters: scatters of the Gaussians, array the same length of the redshift bin :param fsats: fractions of satellite, array the same length of the redshift bin
-
make_Gaussian_catalog
(colN, means, scatters)[source]¶ Creates lists of ids of centrals and satellite galaxies corresponding to the density given in the n(z). :param colN: name of the column you construct the catalog with :param means: means of the Gaussians, array the same length of the redshift bin :param scatters: scatters of the Gaussians, array the same length of the redshift bin
-
make_LogNorm_catalog
(colN, means, scatters)[source]¶ Creates lists of ids of centrals and satellite galaxies corresponding to the density given in the n(z). :param colN: name of the column you construct the catalog with :param means: means of the Gaussians, array the same length of the redshift bin :param scatters: scatters of the Gaussians, array the same length of the redshift bin
-
make_shamIncomplete_catalog
(colN, incompletenessFactor)[source]¶ Creates lists of ids of halos corresponding to the density given in the n(z). For every bin of redshift, it gets the distribution o fthe column of interest and matches to the density of galaxies in the NZ given. Then provides a column of ids extracted from teh lightcone. :param colN: name of the column you wish to work on for the sham.
-
make_shamMAX_catalog
(colN, maxQTY)[source]¶ Creates lists of ids of centrals and satellite galaxies corresponding to the density given in the n(z). For every bin of redshift, it gets the distribution o fthe column of interest and matches to the density of galaxies in the NZ given. Then provides a column of ids extracted from teh lightcone. :param colN: name of the column you wish to work on for the sham.
-
make_sham_catalog
(colN='mvir')[source]¶ Creates lists of ids of halos corresponding to the density given in the n(z). For every bin of redshift, it gets the distribution o fthe column of interest and matches to the density of galaxies in the NZ given. Then provides a column of ids extracted from teh lightcone. :param colN: name of the column you wish to work on for the sham.
-
select_Gaussian
(meanQTY, scatterQTY, nGal_perbin, IDhz, QTY)[source]¶ Creates lists of ids of centrals and satellite galaxies corresponding to the density given in the n(z) and to a gaussian distribution . For every bin of redshift, it gets the distribution o fthe column of interest and matches to the density of galaxies in the NZ given. Then provides a column of ids extracted from teh lightcone. :param colN: name of the column you wish to work on for the sham. :param meanQTY: mean of the distribution :param scatterQTY: scatter of the distribution :param nGal_perbin: total number of galaxies in this bins to mock :param IDhz: IDs of the halos in this bin :param QTY: array of the column to do the match on, mass, velocity, ...
-
select_GaussianFsat
(meanQTY, scatterQTY, fsat, nGal_perbin, IDhz_c, QTY_c, IDhz_s, QTY_s)[source]¶ Extracts the ids of halos to create a mock with a Gaussian distribution. :param colN: name of the column you wish to work on for the sham. :param meanQTY: mean of the distribution :param scatterQTY: scatter of the distribution :param fsat: fraction of satellite in this bin :param nGal_perbin: total number of galaxies in this bins to mock :param IDhz_c: IDs of the central halos in this bin :param QTY_c: column to do the match on, mass, velocity, ... for the central halos :param IDhz_s: IDs of the satellite halos in this bin :param QTY_s: column to do the match on, mass, velocity, ... for the satellite halos
-
select_LogNorm
(meanQTY, scatterQTY, nGal_perbin, IDhz, QTY, nn, bb)[source]¶ Creates lists of ids of centrals and satellite galaxies corresponding to the density given in the n(z) and to a gaussian distribution . For every bin of redshift, it gets the distribution o fthe column of interest and matches to the density of galaxies in the NZ given. Then provides a column of ids extracted from teh lightcone. :param colN: name of the column you wish to work on for the sham. :param meanQTY: mean of the distribution :param scatterQTY: scatter of the distribution :param nGal_perbin: total number of galaxies in this bins to mock :param IDhz: IDs of the halos in this bin :param QTY: array of the column to do the match on, mass, velocity, ...
-
select_sham
(nGal_perbin, IDhz, QTY, nn, bb)[source]¶ Returns the ids corresponding to a given density. :param nGal_perbin: number of galaxies to be selected :param IDhz: parent ID distribution :param QTY: quantity to select halos on :param nn: cumulative distribution o QTY :param bb: bins of the cumulative distribution
-
select_shamIncomplete
(incompFactor, nGal_perbin, IDhz, QTY, nn, bb)[source]¶ Returns the ids corresponding to a given density and an incompleteness factor. :param nGal_perbin: number of galaxies to be selected :param IDhz: parent ID distribution :param QTY: quantity to select halos on :param nn: cumulative distribution o QTY :param bb: bins of the cumulative distribution :param incompFactor: incompleteness factor compared to the max of QTY : max(QTY)/incompFactor will be set as the max of the extracted distribution.
-
select_shamMAX
(QTY_max, nGal_perbin, IDhz, QTY, nn, bb)[source]¶ Returns the ids corresponding to a given density with a maximum in the QTY. :param nGal_perbin: number of galaxies to be selected :param IDhz: parent ID distribution :param QTY: quantity to select halos on :param nn: cumulative distribution o QTY :param bb: bins of the cumulative distribution :param QTY_max: the max of QTY is set to QTY_max.
-
writeClusteringParamFile
(type, decade='')[source]¶ Writes the clustering commands that command the CUTE code, see Alonso et al. 2012 https://arxiv.org/abs/1210.1833 :param type: monopole or angular or ... :param decade: string suffix that is appended if you study different scales (decades) _d1, _d2, _d3 are used for the angular clustering.


School System: DLSU Ateneo Institutions: DLSU - Manila DLSU - Dasma Ateneo - Davao Ateneo - Katipunan Next Step Add Programs Program: Common Areas Computer Science Computer Engineering Political Science Statistics Type of Survey: Preliminary Consultancy Formal Revisit Interim Resurvey Areas: Select All Faculty Instruction Laboratories Libraries Community Physical Plant Student Services Administration Add Back Next Step Assign Accreditors Chairperson: Add Chairperson PAASCU Rep: Add Representative Add Representative Back Submit × close Full Name Institution Discipline/Specialization Primary Survey Area Secondary Survey Areas Total Surveys City Controls View Edit Delete × close Adding a PAASCU Rep/Chair Name Position Contact Number


CONFIG & STORAGE
Config and Storage resources are responsible for injecting data into your applications and persisting data externally to your container.
Common resource types:
- ConfigMaps for providing text key value pairs injected into the application through environment variables, command line arguments, or files
- Secrets for providing binary data injected into the application through files
- Volumes for providing a filesystem external to the Container. Maybe shared across Containers within the same Pod and have a lifetime persisting beyond a Container or Pod.


EMPLOYEE DIRECTORY
For full functionality of this site it is necessary to enable JavaScript. Here are the
instructions how to enable JavaScript in your web browser
.


{% extends "layout-chs.html" %} {% block page_title %} Dividends {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %}<EMAIL_ADDRESS>Your details Your filings Companies you follow Sign out Back Dividends 2016 2015 Dividends The average number of persons employed by the company during the accounting period. Dividends (current year) Dividends (previous year) Save and continue {% endblock %}
The average number of persons employed by the company during the accounting period.


The Dana 20 transfer case used in IH Scouts and trucks is bolt
compatible with most Jeep trucks. The Scout 800 used the Dana 20
from mid 60s when it was introduced until 1972. The Scout II and
related models used the Dana 20 from 1972 until 1979. The only
real difference between the versions used in the Jeep and the
Scout is the shift linkage. A neat part about the Dana 20 used
in some early Scout 800s is it came from the factory with a twin
stick shifter.


{% extends "security/base.html" %} {% from "security/_macros.html" import render_field_with_errors, render_field, render_field_errors, render_form_errors %} {% block content %} {% include "security/_messages.html" %}


SAT instances of the Pigeon Hole Problem
The Pigeon Hole problem asks whether it is possible to place
n+1 pigeons in n holes without two pigeons being in the
same hole (obviously, it's not possible).
SAT encoding
The SAT encoding of this problem is very straightforward. For each
pigeon i we have a variable x_{ij} which means that
pigeon i is placed in hole j. Then we have n+1
clauses which say that a pigeon has to be placed in some hole. Then
for each hole we have a set of clauses ensuring that only one single
pigeon is placed into that hole. This encoding leads to in total
n * (n+1) propositional variables and to (n+1) +
n * (n * (n+1) / 2) clauses.
Benchmark instances
There are five instances available at the DIMACS benchmark set which
encode the pigeon hole problem for six to ten holes; details on the
instances are given in Table 1.
| instance |
holes |
vars |
clauses |
satisfiable? |
| hole6.cnf |
6 |
42 |
133 |
no |
| hole7.cnf |
7 |
56 |
204 |
no |
| hole8.cnf |
8 |
72 |
297 |
no |
| hole9.cnf |
9 |
90 |
415 |
no |
| hole10.cnf |
10 |
110 |
561 |
no |
Table 1: SAT-encodings of the pigeon hole problem
Acknowledgements
The instances have originally
been contributed by John Hooker
and are also contained in a collection of SAT instances at the
Forschungsinstitut fü anwendungsorientierte Wissensverarbeitung in
Ulm, Germany.


Press
Ctrl↑ to change the current item to the previous
Press
Ctrl↓ to change the current item to the next
Press
Shift↑ to change the current item to the previous
Press
Shift↓ to change the current item to the next
Press
PageUp to select the next page item
Press
PageDown to select the previous page item
Press
Home to select the first item
Press
End to select the last item
Press
Space to collapse/expand a group header or to select/unselect the current item
Press
A..
Z0..
9 to select the next item started with the pressed key
Treelist with options
These treelists has a list coming from html options
String Array ModelSelected fruct model is: {{ fruct }}Disabled tree-list
Check me to disable tree-list below
Selected deep country model :
{{deepCountry | json}}
Multi level
Multi selection
Multi selection example
Multi selection shortcuts :
Press
CtrlSpace to add/remove the current item to the selection
Press
Shift↑ to select a range orf items
Press
Shift↓ to select a range orf items
Selected country model :
{{ item.naqme }}
Grouping and Drag Drop
Grouping example
{{ item.label }}public{{ item.label }}
You can drag and drop items the the area bellow (That will display a JSON representation of the dropped model) :
Autocomplete
Autocomplete 2 characters minimum
Variable Row Size
Variable Row height example
Templating Examples
Item Template
An exemple with auto sized item template
Header Template and Group Template
Treelist with an header template
This is a header template, click to sort the list.
public{{ item.groupName }}
Search Prefix and Suffix Templates
publicmore_vert
Item Template including a control
{{item.model}} Text d'alignementText d'alignement
Pre-Selections from html inputs
Preselection with the input selectedModel
Preselections with the input selectedModels
Preselection with the input selectedItem
Pre-Selections from javascript
The collection fructItemsWithPreSelection has a pre-selected item
Pre-Events and on Demand
Confirm Selection
A dialog will confirm the selection of an item
Confirm Expand and Collapse
A dialog will confirm the expand and collapse or an item if the children are not loaded. The children will be loaded asynchronously after the item expansion.
Performance Examples
10K items with Item Template
An exemple with 10000 auto sized templatized itemsrefresh


--- layout: post status: publish published: true title: Crooks in the Curves - Episode 8.24 author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 11890 wordpress_url: http://ivyenvy.com/?p=11890 date: '2016-05-25 22:17:43 +0000' date_gmt: '2016-05-26 03:17:43 +0000' categories: - Podcast tags: [] comments: [] ---
On this, the 402nd of the Ivy Envy Podcast, we talk about the Cubs' series win over the Cardinals in St. Louis. It was a weird series, considering the Cubs lost in walk-off fashion on Monday and then won a wacky and nail-biting game on Wednesday.
In the episode, Corey talks about how the Cubs have been impressive, even while playing under .500 baseball over the last few series. He also defends Jorge Soler again after some social media discussions. Andy talks about pitching, both the good and the bad Cubs pitching in the series with the Cardinals.
Kurt previews the Cubs upcoming series with the Phillies and Andy tells a couple of Rube Waddell stories.


After a six hour car trip, I made it home, feeling a bit tired, and just wanted to relax. I took a 1 mg. tablet of clonazapam and made myself a light dinner (a bagel with cream cheese and a soda). While making dinner I also prepared my Kava tea. I took about a third of an ounce of wildcrafted kava and soaked it in a couple cups of water over medium-high heat. After the mixture lightly boiled, I let it sit on low for about twenty minutes. After this, I drained the tea and poured the remaining liquid back in the pot. I then added a generous tablespoon of Kava powder. I stirred well and let the mixture sit on a medium low heat for about ten minutes. Then I drank it.
Some people complain about the taste of KavaKava. I love it.  After I finished my cup I felt the effects. A definite head-change with mild euphoria is what I experienced. It made me feel sociable and at ease. I was able to concentrate on my drawing and was not easily distracted. The clonazapam added an even mellower effect to the Kava. I am a big fan of Kava. I stopped smoking pot a few months ago and have found that kava is a nice substitute. It is not at all as strong as marijuana, but it doesn't ever give me the sluggish, cloady, blah feeling that pot often does (it also doesn't produce panic-atacks and paranoid episodes, which were occuring after seven years of smoking pot.) Kava is a mild relaxer that helps me focus on tasks and takes away a lot of my anxiety. I highly recomend it to those who suffer from depression and anxiety. It works for me.
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.


About us Work
A few words about us
Who are you?
NERDISM - (noun) The practices or behaviors of nerds; nerdiness.
We are a creative design and development firm in Dallas, TX, founded by people who believe that functionality and beauty can be integrated to make something special we can use to further your business or personal brand.
What we do?
We take your idea or existing business and bring it to the world in way that grabs the attention of the consumer and magnifies your product so you can increase profitability.
We believe that humor combined with amazing design and a creative use of technology can make complicated ideas more understandable and products more fun.
Why we do it?
We like money and paying our bills on time, and doing it surrounded by people we like and doing things we really love to do.
That's probably oversimplified, but we do this because we are good at it, and we make a difference in each others lives as well as our clients. We are incredibly lucky people.
Why Choose Nerdism
CUSTOMER SERVICE
You are always first . . really. We care about you, and we aren't successful unless you are happy.
CREATIVE DESIGN
We will consult with you to produce the layout, content, graphic design and/or logos or branding that can transform your business or personal brand.
CUSTOMIZED DEVELOPMENT
We will build, create and maintain your website, application or software . . . and we are really good at it.
SOCIAL MEDIA MANAGEMENT
We create and manage top-performing social media campaigns on Twitter, Facebook, Snapchat and Instagram for your business.
SEO
We use specific strategies and techniques to increase the amount of visitors to your site, via a high-ranking placement on each search engine.
THE NERDS
We have special and talented people doing great things. We would love to be doing those things for you.
Client talk
“Our target audience is Males and Females ages zero and up.”
“We want it to look like this, but don't copy it. Just make it different enough, but keep it the same.”
“I'll know what I want when I see it.”


jQuery WhatsNearby Demos
Simple map
Simple map using data-address attribute
Showing restaurants, cafes and gyms, 500 meters around the center.
Showing restaurants, cafes and gyms, 500 meters around the center and excluding bars.
Custom markup (inside the initial div)


---
layout: page
title: Team
subtitle: People define this group. If you are a current student at CMU, you can apply to the lab via this form. If you are interested in a PhD with us, please apply to CMU.
roles:
- Professor
- PhD Student
- Affiliated Professor
- Visiting PhD Student
- Visiting Student
- Masters Student
- Undergraduate Student
---
Current Members
{% for role in page.roles %}
{% for person in site.people %}
{% if person.role == role %}
{% unless person.alumni_since %}
{% endunless %}
{% endif %}
{% endfor %}
{% endfor %}
Past Members
{% assign alumni = site.people | where_exp: 'p', 'p.alumni_since' %}
{% assign sorted_alumni = alumni | sort: 'alumni_since' | reverse %}
{% for person in sorted_alumni %}
{% endfor %}
You can find instructions for editing this list in the repository for this website.


Story Editing: How to Assess and Fix Your First Draft
by Kristina Stanley
Price: 27 US$
Get invitationAbout
We all get excited when we type “The End” on our first draft, but before you share your story with others, you owe it to yourself to tell the best possible story.
Don't miss your chance to learn story editing from someone who trains story editors. Kristina Stanley will share what she’s learned from working with structural editors around the world and show you how to apply that knowledge to your story.
Date: Wed, Sep 9, 2020
Time: 10:00 PM EEST
Location: Kigali, Rwanda


| Methods Allowed | Endpoint | Task | Difficulty |
|---|---|---|---|
| POST | /auth |
Basic auth to this endpoint with creds... Username is "wayne", Password is "Youre10PlyBud!". You'll get back a header 'Token', you'll need to provide it and its value as a header for your next API calls. |
|
| GET | /alcohol | Data to be used for rest of Challenges (below) | |
| POST | /alcohol/activity/1 |
Send the name of the MOST expensive item, PAYLOAD EX {'answer': 'YOUR_GUESS_HERE'} |
ez pz |
| POST | /alcohol/activity/2 |
Send the name of the LEAST expensive item, PAYLOAD EX {'answer': 'YOUR_GUESS_HERE'} |
ez pz |
| POST | /alcohol/activity/3 |
Send the top 10% most expensive items, PAYLOAD EX {'answer': [ {name,price},{name,price},... ] } |
smedium |
| POST | /alcohol/activity/4 |
Clean up the product names, and remove all punctionation and special chars PAYLOAD EX {'answer': [ {name,price},{name,price},... ] } |
gettin spicy |


VTC Conf is a conference call room generator based on WebRTC
Let people know what are you speaking about!
Join in and share your topic. It's free!
VTC Conf is a conference call room generator based on WebRTC
Let people know what are you speaking about!
Join in and share your topic. It's free!


CROW
Stay Clean
DATABASE
USER TABLE
SERVICE AND BILL
UPDATE AND CONFIRM
COMPLAIN STATUS
User Id
Name
Email
Adress


# -*- coding: utf-8 -*-
"""Copyright 2019 DScribe developers
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
"""
from abc import ABC, abstractmethod
import numpy as np
from sklearn.metrics.pairwise import pairwise_kernels
[docs]class LocalSimilarityKernel(ABC):
"""An abstract base class for all kernels that use the similarity of local
atomic environments to compute a global similarity measure.
"""
def __init__(self, metric, gamma=None, degree=3, coef0=1, kernel_params=None, normalize_kernel=True):
"""
Args:
metric(string or callable): The pairwise metric used for
calculating the local similarity. Accepts any of the sklearn
pairwise metric strings (e.g. "linear", "rbf", "laplacian",
"polynomial") or a custom callable. A callable should accept
two arguments and the keyword arguments passed to this object
as kernel_params, and should return a floating point number.
gamma(float): Gamma parameter for the RBF, laplacian, polynomial,
exponential chi2 and sigmoid kernels. Interpretation of the
default value is left to the kernel; see the documentation for
sklearn.metrics.pairwise. Ignored by other kernels.
degree(float): Degree of the polynomial kernel. Ignored by other
kernels.
coef0(float): Zero coefficient for polynomial and sigmoid kernels.
Ignored by other kernels.
kernel_params(mapping of string to any): Additional parameters
(keyword arguments) for kernel function passed as callable
object.
normalize_kernel(boolean): Whether to normalize the final global
similarity kernel. The normalization is achieved by dividing each
kernel element :math:`K_{ij}` with the factor
:math:`\sqrt{K_{ii}K_{jj}}`
"""
self.metric = metric
self.gamma = gamma
self.degree = degree
self.coef0 = coef0
self.kernel_params = kernel_params
self.normalize_kernel = normalize_kernel
[docs] def create(self, x, y=None):
"""Creates the kernel matrix based on the given lists of local
features x and y.
Args:
x(iterable): A list of local feature arrays for each structure.
y(iterable): An optional second list of features. If not specified
it is assumed that y=x.
Returns:
The pairwise global similarity kernel K[i,j] between the given
structures, in the same order as given in the input, i.e. the
similarity of structures i and j is given by K[i,j], where features
for structure i and j were in features[i] and features[j]
respectively.
"""
symmetric = False
if y is None:
y = x
symmetric = True
# First calculate the "raw" pairwise similarity of atomic environments
n_x = len(x)
n_y = len(y)
C_ij_dict = {}
for i in range(n_x):
for j in range(n_y):
# Skip lower triangular part for symmetric matrices
if symmetric and j < i:
continue
x_i = x[i]
# Save time on symmetry
if symmetric and j == i:
y_j = None
else:
y_j = y[j]
C_ij = self.get_pairwise_matrix(x_i, y_j)
C_ij_dict[i, j] = C_ij
# Calculate the global pairwise similarity between the entire
# structures
K_ij = np.zeros((n_x, n_y))
for i in range(n_x):
for j in range(n_y):
# Skip lower triangular part for symmetric matrices
if symmetric and j < i:
continue
C_ij = C_ij_dict[i, j]
k_ij = self.get_global_similarity(C_ij)
K_ij[i, j] = k_ij
# Save data also on lower triangular part for symmetric matrices
if symmetric and j != i:
K_ij[j, i] = k_ij
# Enforce kernel normalization if requested.
if self.normalize_kernel:
if symmetric:
k_ii = np.diagonal(K_ij)
x_k_ii_sqrt = np.sqrt(k_ii)
y_k_ii_sqrt = x_k_ii_sqrt
else:
# Calculate self-similarity for X
x_k_ii = np.empty(n_x)
for i in range(n_x):
x_i = x[i]
C_ii = self.get_pairwise_matrix(x_i)
k_ii = self.get_global_similarity(C_ii)
x_k_ii[i] = k_ii
x_k_ii_sqrt = np.sqrt(x_k_ii)
# Calculate self-similarity for Y
y_k_ii = np.empty(n_y)
for i in range(n_y):
y_i = y[i]
C_ii = self.get_pairwise_matrix(y_i)
k_ii = self.get_global_similarity(C_ii)
y_k_ii[i] = k_ii
y_k_ii_sqrt = np.sqrt(y_k_ii)
K_ij /= np.outer(x_k_ii_sqrt, y_k_ii_sqrt)
return K_ij
[docs] def get_pairwise_matrix(self, X, Y=None):
"""Calculates the pairwise similarity of atomic environments with
scikit-learn, and the pairwise metric configured in the constructor.
Args:
X(np.ndarray): Feature vector for the atoms in structure A
Y(np.ndarray): Feature vector for the atoms in structure B
Returns:
np.ndarray: NxM matrix of local similarities between structures A
and B, with N and M atoms respectively.
"""
if callable(self.metric):
params = self.kernel_params or {}
else:
params = {"gamma": self.gamma,
"degree": self.degree,
"coef0": self.coef0}
return pairwise_kernels(X, Y, metric=self.metric,
filter_params=True, **params)
[docs] @abstractmethod
def get_global_similarity(self, localkernel):
"""
Computes the global similarity between two structures A and B.
Args:
localkernel(np.ndarray): NxM matrix of local similarities between
structures A and B, with N and M atoms respectively.
Returns:
float: Global similarity between the structures A and B.
"""