text stringlengths 1 22.8M |
|---|
The Steyr-Münichholz concentration camp was one in a number of subcamps of the Mauthausen-Gusen concentration camp in Upper Austria. Inmates were drawn from the main camp, in order to exploit their labor for producing arms in Steyr-Daimler-Puch corporation factories, and to build air-raid bunkers in the town of Steyr.
Roughly 300 Mauthausen-Gusen inmates had been doing construction work at the Steyr facilities since spring 1941, being transferred back and forth between Mauthausen and Steyr on a daily basis. Because of growing scarcity of workers skilled for the incipient manufacture of aircraft engines and ball bearings, in fall 1941 the Steyr-Daimley-Puch management began lobbying for the allocation of more aptly skilled concentration camp inmates, and the establishment of a local subcamp. On January 5, 1942, Georg Meindl, general manager of Steyr-Daimler-Puch and SS Brigadeführer wrote to the SS and Police Leader of the region, Ernst Kaltenbrunner:
„(...) should be, if possible, workers specialising in the metal trades, or otherwise workers that can be educated on the work with machines. The daily transfer of these inmates to Mauthausen does not only make necessary larger commitment of guarding personnel, but also diminishes the output of the inmates.“
The establishment of a subcamb on the premises of a detention facility in nearby Garsten was opposed by the prison administration. Therefore, a makeshift camp was established in the vicinity of the factory premises in spring 1942.
Most inmates originated from Spain, France, Poland, Italy, Greece, Russia, and Czechoslovakia. Their total number varied between 1,000 and 2,000. In April 1945 however, the number rose to 3,090, as several death marches with inmates from the Wiener Neustadt subcamp went through the town.
Many inmates died from malnutrition, working constantly at a fast pace irrespective of weather conditions, and lack of health treatment. A number were also killed in air raids on the Steyr factories in February and April 1944. The exact total number of deaths, however, remains unknown to this day. The names of 226 inmates show on the records of the city crematory. Inmates who went sick were usually sent back to be killed at the main camp at Mauthausen.
The camp was liberated by US troops on May 5, 1945.
The last remaining barracks (which had contained the camp's dining hall) were demolished by the private owner of the premises in 1993, before explorations into setting up a memorial had come to fruition, sparking outrage among concerned locals.
References |
Cremastobombycia kipepeo is a moth of the family Gracillariidae. It is found in eastern Kenya in east African coastal forest.
The length of the forewings is 1.76 mm. The forewings are light ochreous with irroration of darker shading. The hindwings are pale beige with a golden shine. Adults are on wing from late March to early April.
Etymology
The name of this species is derived from kipepeo the common name meaning moth, butterfly in Swahili.
References
Endemic moths of Kenya
Moths described in 2012
Lithocolletinae
Moths of Africa
Lepidoptera of Kenya
Taxa named by Jurate de Prins |
J. Müller is a German group of companies with its registered office in Brake (Unterweser). The company was established in 1821 and has been family-owned ever since. J. Müller has its own seaport terminals in Brake and Bremen and operates these terminals for the handling and seaport logistics of bulk goods and packaged goods. In addition, the group is active in various other fields of the economy, including in the trade of steel, wood and animal proteins (fish meal). J. Müller AG is the parent company of J. Müller Weser GmbH & Co. KG.
Company Structure
The J. Müller group includes four more companies in addition to the public limited company, which acts as the group's holding company. Parts of the operational business of J. Müller Weser are outsourced to specialised subsidiaries.
J. MÜLLER AG
J. Müller Aktiengesellschaft carries out all of the key tasks of the group. This primarily includes the strategic and organisational development of the company and the management of the investment assets.
J. MÜLLER Weser
In 2018, the group's operational business was streamlined to J. MÜLLER Weser GmbH & Co. KG as a result of the merger of several subsidiaries. Since this point in time, this company has been implementing the product-oriented and market-oriented alignment of the group.
LogServ
The subsidiary LogServ Logistik Services operates Europe's largest plant for goods handling and the storage of solid and liquid sulphur at its location in Brake.
B-LOG
In the form of a joint venture company, J. MÜLLER Weser carries out lorry transportation of GMP+ compliant agricultural products and breakbulk via B-LOG Bulk Logistic.
MÜLLER & OORBURG Logistics
MÜLLER & OORBURG Logistics GmbH also operates as a joint venture company. The company focuses on the Europe-wide chartering of barges at the terminals in Brake and Bremen.
Business divisions
J. Müller has a trimodal terminal at the port in Brake, which enables the onwards transportation of goods by ship, rail or lorry. In accordance with the requirements for the processing of goods, which sometimes vary significantly, products can be handled on-site or stored at a location that is separate from the transshipment location.
Agricultural products
One of the company's primary fields of activity is the shipping and storage of agricultural products. Around 4 million tonnes of agricultural goods are handled each year at the Brake site. The goods primarily include feed, feed additives, grain and eco products, as well as fertiliser.
Forestry products
One of J. Müller's fields of activity has been the transshipment of paper pulp since 1968. These goods include paper, round timber, sawn timber and various derived timber products. These goods are predominantly exported for the construction industry in the USA, North Africa and Great Britain. With more than a million transshipment tonnes a year, Brake seaport is the largest import port for paper pulp in Germany.
Maritime proteins
The port terminal in Bremen, which specialises in the transshipment of fish meal and krill meal, has silo capacities of 65,000 tonnes. With an unloading capacity of 20,000 tonnes a day, J. Müller also has the largest connected silo installation in Europe.
Freight and shipping services
In addition to the transshipment of goods at the company's port terminals, the provision of ship services is an area of activity in which J. Müller operates. These services include the provision and chartering of ships and the handling of administrative matters typical to the field of shipping.
Further business divisions
The Brake port facilities have been modernised and expanded thanks to high investment levels. The Niedersachsenkai, which opened in 2009, offers the corresponding special vehicles and heavy goods areas, which also enable the transshipment of packaged goods, heavy machinery and wind energy plants. The 450-metre-long quay with a total of 500,000 m² of potential space is also a significant transshipment location for the European iron and steel market. The processing of these goods is summarised under the breakbulk business division.
History
In 1821 Johann Müller founded a Freight forwarder business on the Lower Weser. In the following years he specialized in the direct handling of goods and transport. In 1862, the railway line between Bremerhaven and Geestemünde was built, which led to losses in maritime trade and thus also in J. Müller. During the time of National Socialism, the business of the company continued. In 1937, Hans Müller founded an inland shipping company and expanded crane operations in Brake.
1953 Müller bought the Bremer-Besigheimer Ölfabriken at Bremer Holzhafen (one of Bremen harbours). Today this place is the headquarter of J. Müller Weser GmbH. The company Bremer-Besigheimer Ölfabriken was founded in Besigheim in 1895 and opened a branch in Bremer Holzhafen. From 1920, only the branch was operated on the Weser. In 2008 the legal form of the management holding was changed from a GmbH & Co. KG to a stock corporation. Until 2015, the group structure was retained with the connection of the most important business areas as independent companies below the management holding. From the end of 2015 to the end of 2018, the main operating companies and thus the entire operational business were combined in several steps through mergers and acquisitions to form J. Müller Weser GmbH & Co. KG, based in Brake.
Seaport Brake
The seaport Brake (seehafen Brake) is today dominated by the facilities and extensive areas by J. Müller. The company also sells space for port-related industrial settlements at the Brake Logistics Center (BLC), in the Niedersachsen Port (Boitwarder Groden) and development areas in the Niedersachsenkai area.
The company and its CEO Jan Müller is committed to the controversial and court-contested Weservertiefung. Jan Müller said, this would be important, so that ships with grain bulk could run his plant in Brake.
References
Transport companies of Germany
Logistics companies of Germany
German companies established in 1821
Transport companies established in 1821 |
```c
/* ssl/s3_cbc.c */
/* ====================================================================
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. All advertising materials mentioning features or use of this
* software must display the following acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit. (path_to_url"
*
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For written permission, please contact
* openssl-core@openssl.org.
*
* 5. Products derived from this software may not be called "OpenSSL"
* nor may "OpenSSL" appear in their names without prior written
* permission of the OpenSSL Project.
*
* 6. Redistributions of any form whatsoever must retain the following
* acknowledgment:
* "This product includes software developed by the OpenSSL Project
* for use in the OpenSSL Toolkit (path_to_url"
*
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
* ====================================================================
*
* This product includes cryptographic software written by Eric Young
* (eay@cryptsoft.com). This product includes software written by Tim
* Hudson (tjh@cryptsoft.com).
*
*/
#include "../crypto/constant_time_locl.h"
#include "ssl_locl.h"
#include <openssl/md5.h>
#include <openssl/sha.h>
/*
* MAX_HASH_BIT_COUNT_BYTES is the maximum number of bytes in the hash's
* length field. (SHA-384/512 have 128-bit length.)
*/
#define MAX_HASH_BIT_COUNT_BYTES 16
/*
* MAX_HASH_BLOCK_SIZE is the maximum hash block size that we'll support.
* Currently SHA-384/512 has a 128-byte block size and that's the largest
* supported by TLS.)
*/
#define MAX_HASH_BLOCK_SIZE 128
/*-
* ssl3_cbc_remove_padding removes padding from the decrypted, SSLv3, CBC
* record in |rec| by updating |rec->length| in constant time.
*
* block_size: the block size of the cipher used to encrypt the record.
* returns:
* 0: (in non-constant time) if the record is publicly invalid.
* 1: if the padding was valid
* -1: otherwise.
*/
int ssl3_cbc_remove_padding(const SSL *s,
SSL3_RECORD *rec,
unsigned block_size, unsigned mac_size)
{
unsigned padding_length, good;
const unsigned overhead = 1 /* padding length byte */ + mac_size;
/*
* These lengths are all public so we can test them in non-constant time.
*/
if (overhead > rec->length)
return 0;
padding_length = rec->data[rec->length - 1];
good = constant_time_ge(rec->length, padding_length + overhead);
/* SSLv3 requires that the padding is minimal. */
good &= constant_time_ge(block_size, padding_length + 1);
padding_length = good & (padding_length + 1);
rec->length -= padding_length;
rec->type |= padding_length << 8; /* kludge: pass padding length */
return constant_time_select_int(good, 1, -1);
}
/*-
* tls1_cbc_remove_padding removes the CBC padding from the decrypted, TLS, CBC
* record in |rec| in constant time and returns 1 if the padding is valid and
* -1 otherwise. It also removes any explicit IV from the start of the record
* without leaking any timing about whether there was enough space after the
* padding was removed.
*
* block_size: the block size of the cipher used to encrypt the record.
* returns:
* 0: (in non-constant time) if the record is publicly invalid.
* 1: if the padding was valid
* -1: otherwise.
*/
int tls1_cbc_remove_padding(const SSL *s,
SSL3_RECORD *rec,
unsigned block_size, unsigned mac_size)
{
unsigned padding_length, good, to_check, i;
const unsigned overhead = 1 /* padding length byte */ + mac_size;
/* Check if version requires explicit IV */
if (SSL_USE_EXPLICIT_IV(s)) {
/*
* These lengths are all public so we can test them in non-constant
* time.
*/
if (overhead + block_size > rec->length)
return 0;
/* We can now safely skip explicit IV */
rec->data += block_size;
rec->input += block_size;
rec->length -= block_size;
} else if (overhead > rec->length)
return 0;
padding_length = rec->data[rec->length - 1];
/*
* NB: if compression is in operation the first packet may not be of even
* length so the padding bug check cannot be performed. This bug
* workaround has been around since SSLeay so hopefully it is either
* fixed now or no buggy implementation supports compression [steve]
*/
if ((s->options & SSL_OP_TLS_BLOCK_PADDING_BUG) && !s->expand) {
/* First packet is even in size, so check */
if ((CRYPTO_memcmp(s->s3->read_sequence, "\0\0\0\0\0\0\0\0", 8) == 0) &&
!(padding_length & 1)) {
s->s3->flags |= TLS1_FLAGS_TLS_PADDING_BUG;
}
if ((s->s3->flags & TLS1_FLAGS_TLS_PADDING_BUG) && padding_length > 0) {
padding_length--;
}
}
if (EVP_CIPHER_flags(s->enc_read_ctx->cipher) & EVP_CIPH_FLAG_AEAD_CIPHER) {
/* padding is already verified */
rec->length -= padding_length + 1;
return 1;
}
good = constant_time_ge(rec->length, overhead + padding_length);
/*
* The padding consists of a length byte at the end of the record and
* then that many bytes of padding, all with the same value as the length
* byte. Thus, with the length byte included, there are i+1 bytes of
* padding. We can't check just |padding_length+1| bytes because that
* leaks decrypted information. Therefore we always have to check the
* maximum amount of padding possible. (Again, the length of the record
* is public information so we can use it.)
*/
to_check = 255; /* maximum amount of padding. */
if (to_check > rec->length - 1)
to_check = rec->length - 1;
for (i = 0; i < to_check; i++) {
unsigned char mask = constant_time_ge_8(padding_length, i);
unsigned char b = rec->data[rec->length - 1 - i];
/*
* The final |padding_length+1| bytes should all have the value
* |padding_length|. Therefore the XOR should be zero.
*/
good &= ~(mask & (padding_length ^ b));
}
/*
* If any of the final |padding_length+1| bytes had the wrong value, one
* or more of the lower eight bits of |good| will be cleared.
*/
good = constant_time_eq(0xff, good & 0xff);
padding_length = good & (padding_length + 1);
rec->length -= padding_length;
rec->type |= padding_length << 8; /* kludge: pass padding length */
return constant_time_select_int(good, 1, -1);
}
/*-
* ssl3_cbc_copy_mac copies |md_size| bytes from the end of |rec| to |out| in
* constant time (independent of the concrete value of rec->length, which may
* vary within a 256-byte window).
*
* ssl3_cbc_remove_padding or tls1_cbc_remove_padding must be called prior to
* this function.
*
* On entry:
* rec->orig_len >= md_size
* md_size <= EVP_MAX_MD_SIZE
*
* If CBC_MAC_ROTATE_IN_PLACE is defined then the rotation is performed with
* variable accesses in a 64-byte-aligned buffer. Assuming that this fits into
* a single or pair of cache-lines, then the variable memory accesses don't
* actually affect the timing. CPUs with smaller cache-lines [if any] are
* not multi-core and are not considered vulnerable to cache-timing attacks.
*/
#define CBC_MAC_ROTATE_IN_PLACE
void ssl3_cbc_copy_mac(unsigned char *out,
const SSL3_RECORD *rec,
unsigned md_size, unsigned orig_len)
{
#if defined(CBC_MAC_ROTATE_IN_PLACE)
unsigned char rotated_mac_buf[64 + EVP_MAX_MD_SIZE];
unsigned char *rotated_mac;
#else
unsigned char rotated_mac[EVP_MAX_MD_SIZE];
#endif
/*
* mac_end is the index of |rec->data| just after the end of the MAC.
*/
unsigned mac_end = rec->length;
unsigned mac_start = mac_end - md_size;
/*
* scan_start contains the number of bytes that we can ignore because the
* MAC's position can only vary by 255 bytes.
*/
unsigned scan_start = 0;
unsigned i, j;
unsigned div_spoiler;
unsigned rotate_offset;
OPENSSL_assert(orig_len >= md_size);
OPENSSL_assert(md_size <= EVP_MAX_MD_SIZE);
#if defined(CBC_MAC_ROTATE_IN_PLACE)
rotated_mac = rotated_mac_buf + ((0 - (size_t)rotated_mac_buf) & 63);
#endif
/* This information is public so it's safe to branch based on it. */
if (orig_len > md_size + 255 + 1)
scan_start = orig_len - (md_size + 255 + 1);
/*
* div_spoiler contains a multiple of md_size that is used to cause the
* modulo operation to be constant time. Without this, the time varies
* based on the amount of padding when running on Intel chips at least.
* The aim of right-shifting md_size is so that the compiler doesn't
* figure out that it can remove div_spoiler as that would require it to
* prove that md_size is always even, which I hope is beyond it.
*/
div_spoiler = md_size >> 1;
div_spoiler <<= (sizeof(div_spoiler) - 1) * 8;
rotate_offset = (div_spoiler + mac_start - scan_start) % md_size;
memset(rotated_mac, 0, md_size);
for (i = scan_start, j = 0; i < orig_len; i++) {
unsigned char mac_started = constant_time_ge_8(i, mac_start);
unsigned char mac_ended = constant_time_ge_8(i, mac_end);
unsigned char b = rec->data[i];
rotated_mac[j++] |= b & mac_started & ~mac_ended;
j &= constant_time_lt(j, md_size);
}
/* Now rotate the MAC */
#if defined(CBC_MAC_ROTATE_IN_PLACE)
j = 0;
for (i = 0; i < md_size; i++) {
/* in case cache-line is 32 bytes, touch second line */
((volatile unsigned char *)rotated_mac)[rotate_offset ^ 32];
out[j++] = rotated_mac[rotate_offset++];
rotate_offset &= constant_time_lt(rotate_offset, md_size);
}
#else
memset(out, 0, md_size);
rotate_offset = md_size - rotate_offset;
rotate_offset &= constant_time_lt(rotate_offset, md_size);
for (i = 0; i < md_size; i++) {
for (j = 0; j < md_size; j++)
out[j] |= rotated_mac[i] & constant_time_eq_8(j, rotate_offset);
rotate_offset++;
rotate_offset &= constant_time_lt(rotate_offset, md_size);
}
#endif
}
/*
* u32toLE serialises an unsigned, 32-bit number (n) as four bytes at (p) in
* little-endian order. The value of p is advanced by four.
*/
#define u32toLE(n, p) \
(*((p)++)=(unsigned char)(n), \
*((p)++)=(unsigned char)(n>>8), \
*((p)++)=(unsigned char)(n>>16), \
*((p)++)=(unsigned char)(n>>24))
/*
* These functions serialize the state of a hash and thus perform the
* standard "final" operation without adding the padding and length that such
* a function typically does.
*/
static void tls1_md5_final_raw(void *ctx, unsigned char *md_out)
{
MD5_CTX *md5 = ctx;
u32toLE(md5->A, md_out);
u32toLE(md5->B, md_out);
u32toLE(md5->C, md_out);
u32toLE(md5->D, md_out);
}
static void tls1_sha1_final_raw(void *ctx, unsigned char *md_out)
{
SHA_CTX *sha1 = ctx;
l2n(sha1->h0, md_out);
l2n(sha1->h1, md_out);
l2n(sha1->h2, md_out);
l2n(sha1->h3, md_out);
l2n(sha1->h4, md_out);
}
#define LARGEST_DIGEST_CTX SHA_CTX
#ifndef OPENSSL_NO_SHA256
static void tls1_sha256_final_raw(void *ctx, unsigned char *md_out)
{
SHA256_CTX *sha256 = ctx;
unsigned i;
for (i = 0; i < 8; i++) {
l2n(sha256->h[i], md_out);
}
}
# undef LARGEST_DIGEST_CTX
# define LARGEST_DIGEST_CTX SHA256_CTX
#endif
#ifndef OPENSSL_NO_SHA512
static void tls1_sha512_final_raw(void *ctx, unsigned char *md_out)
{
SHA512_CTX *sha512 = ctx;
unsigned i;
for (i = 0; i < 8; i++) {
l2n8(sha512->h[i], md_out);
}
}
# undef LARGEST_DIGEST_CTX
# define LARGEST_DIGEST_CTX SHA512_CTX
#endif
/*
* ssl3_cbc_record_digest_supported returns 1 iff |ctx| uses a hash function
* which ssl3_cbc_digest_record supports.
*/
char ssl3_cbc_record_digest_supported(const EVP_MD_CTX *ctx)
{
#ifdef OPENSSL_FIPS
if (FIPS_mode())
return 0;
#endif
switch (EVP_MD_CTX_type(ctx)) {
case NID_md5:
case NID_sha1:
#ifndef OPENSSL_NO_SHA256
case NID_sha224:
case NID_sha256:
#endif
#ifndef OPENSSL_NO_SHA512
case NID_sha384:
case NID_sha512:
#endif
return 1;
default:
return 0;
}
}
/*-
* ssl3_cbc_digest_record computes the MAC of a decrypted, padded SSLv3/TLS
* record.
*
* ctx: the EVP_MD_CTX from which we take the hash function.
* ssl3_cbc_record_digest_supported must return true for this EVP_MD_CTX.
* md_out: the digest output. At most EVP_MAX_MD_SIZE bytes will be written.
* md_out_size: if non-NULL, the number of output bytes is written here.
* header: the 13-byte, TLS record header.
* data: the record data itself, less any preceeding explicit IV.
* data_plus_mac_size: the secret, reported length of the data and MAC
* once the padding has been removed.
* data_plus_mac_plus_padding_size: the public length of the whole
* record, including padding.
* is_sslv3: non-zero if we are to use SSLv3. Otherwise, TLS.
*
* On entry: by virtue of having been through one of the remove_padding
* functions, above, we know that data_plus_mac_size is large enough to contain
* a padding byte and MAC. (If the padding was invalid, it might contain the
* padding too. )
* Returns 1 on success or 0 on error
*/
int ssl3_cbc_digest_record(const EVP_MD_CTX *ctx,
unsigned char *md_out,
size_t *md_out_size,
const unsigned char header[13],
const unsigned char *data,
size_t data_plus_mac_size,
size_t data_plus_mac_plus_padding_size,
const unsigned char *mac_secret,
unsigned mac_secret_length, char is_sslv3)
{
union {
double align;
unsigned char c[sizeof(LARGEST_DIGEST_CTX)];
} md_state;
void (*md_final_raw) (void *ctx, unsigned char *md_out);
void (*md_transform) (void *ctx, const unsigned char *block);
unsigned md_size, md_block_size = 64;
unsigned sslv3_pad_length = 40, header_length, variance_blocks,
len, max_mac_bytes, num_blocks,
num_starting_blocks, k, mac_end_offset, c, index_a, index_b;
unsigned int bits; /* at most 18 bits */
unsigned char length_bytes[MAX_HASH_BIT_COUNT_BYTES];
/* hmac_pad is the masked HMAC key. */
unsigned char hmac_pad[MAX_HASH_BLOCK_SIZE];
unsigned char first_block[MAX_HASH_BLOCK_SIZE];
unsigned char mac_out[EVP_MAX_MD_SIZE];
unsigned i, j, md_out_size_u;
EVP_MD_CTX md_ctx;
/*
* mdLengthSize is the number of bytes in the length field that
* terminates * the hash.
*/
unsigned md_length_size = 8;
char length_is_big_endian = 1;
/*
* This is a, hopefully redundant, check that allows us to forget about
* many possible overflows later in this function.
*/
OPENSSL_assert(data_plus_mac_plus_padding_size < 1024 * 1024);
switch (EVP_MD_CTX_type(ctx)) {
case NID_md5:
if (MD5_Init((MD5_CTX *)md_state.c) <= 0)
return 0;
md_final_raw = tls1_md5_final_raw;
md_transform =
(void (*)(void *ctx, const unsigned char *block))MD5_Transform;
md_size = 16;
sslv3_pad_length = 48;
length_is_big_endian = 0;
break;
case NID_sha1:
if (SHA1_Init((SHA_CTX *)md_state.c) <= 0)
return 0;
md_final_raw = tls1_sha1_final_raw;
md_transform =
(void (*)(void *ctx, const unsigned char *block))SHA1_Transform;
md_size = 20;
break;
#ifndef OPENSSL_NO_SHA256
case NID_sha224:
if (SHA224_Init((SHA256_CTX *)md_state.c) <= 0)
return 0;
md_final_raw = tls1_sha256_final_raw;
md_transform =
(void (*)(void *ctx, const unsigned char *block))SHA256_Transform;
md_size = 224 / 8;
break;
case NID_sha256:
if (SHA256_Init((SHA256_CTX *)md_state.c) <= 0)
return 0;
md_final_raw = tls1_sha256_final_raw;
md_transform =
(void (*)(void *ctx, const unsigned char *block))SHA256_Transform;
md_size = 32;
break;
#endif
#ifndef OPENSSL_NO_SHA512
case NID_sha384:
if (SHA384_Init((SHA512_CTX *)md_state.c) <= 0)
return 0;
md_final_raw = tls1_sha512_final_raw;
md_transform =
(void (*)(void *ctx, const unsigned char *block))SHA512_Transform;
md_size = 384 / 8;
md_block_size = 128;
md_length_size = 16;
break;
case NID_sha512:
if (SHA512_Init((SHA512_CTX *)md_state.c) <= 0)
return 0;
md_final_raw = tls1_sha512_final_raw;
md_transform =
(void (*)(void *ctx, const unsigned char *block))SHA512_Transform;
md_size = 64;
md_block_size = 128;
md_length_size = 16;
break;
#endif
default:
/*
* ssl3_cbc_record_digest_supported should have been called first to
* check that the hash function is supported.
*/
OPENSSL_assert(0);
if (md_out_size)
*md_out_size = 0;
return 0;
}
OPENSSL_assert(md_length_size <= MAX_HASH_BIT_COUNT_BYTES);
OPENSSL_assert(md_block_size <= MAX_HASH_BLOCK_SIZE);
OPENSSL_assert(md_size <= EVP_MAX_MD_SIZE);
header_length = 13;
if (is_sslv3) {
header_length = mac_secret_length + sslv3_pad_length + 8 /* sequence
* number */ +
1 /* record type */ +
2 /* record length */ ;
}
/*
* variance_blocks is the number of blocks of the hash that we have to
* calculate in constant time because they could be altered by the
* padding value. In SSLv3, the padding must be minimal so the end of
* the plaintext varies by, at most, 15+20 = 35 bytes. (We conservatively
* assume that the MAC size varies from 0..20 bytes.) In case the 9 bytes
* of hash termination (0x80 + 64-bit length) don't fit in the final
* block, we say that the final two blocks can vary based on the padding.
* TLSv1 has MACs up to 48 bytes long (SHA-384) and the padding is not
* required to be minimal. Therefore we say that the final six blocks can
* vary based on the padding. Later in the function, if the message is
* short and there obviously cannot be this many blocks then
* variance_blocks can be reduced.
*/
variance_blocks = is_sslv3 ? 2 : 6;
/*
* From now on we're dealing with the MAC, which conceptually has 13
* bytes of `header' before the start of the data (TLS) or 71/75 bytes
* (SSLv3)
*/
len = data_plus_mac_plus_padding_size + header_length;
/*
* max_mac_bytes contains the maximum bytes of bytes in the MAC,
* including * |header|, assuming that there's no padding.
*/
max_mac_bytes = len - md_size - 1;
/* num_blocks is the maximum number of hash blocks. */
num_blocks =
(max_mac_bytes + 1 + md_length_size + md_block_size -
1) / md_block_size;
/*
* In order to calculate the MAC in constant time we have to handle the
* final blocks specially because the padding value could cause the end
* to appear somewhere in the final |variance_blocks| blocks and we can't
* leak where. However, |num_starting_blocks| worth of data can be hashed
* right away because no padding value can affect whether they are
* plaintext.
*/
num_starting_blocks = 0;
/*
* k is the starting byte offset into the conceptual header||data where
* we start processing.
*/
k = 0;
/*
* mac_end_offset is the index just past the end of the data to be MACed.
*/
mac_end_offset = data_plus_mac_size + header_length - md_size;
/*
* c is the index of the 0x80 byte in the final hash block that contains
* application data.
*/
c = mac_end_offset % md_block_size;
/*
* index_a is the hash block number that contains the 0x80 terminating
* value.
*/
index_a = mac_end_offset / md_block_size;
/*
* index_b is the hash block number that contains the 64-bit hash length,
* in bits.
*/
index_b = (mac_end_offset + md_length_size) / md_block_size;
/*
* bits is the hash-length in bits. It includes the additional hash block
* for the masked HMAC key, or whole of |header| in the case of SSLv3.
*/
/*
* For SSLv3, if we're going to have any starting blocks then we need at
* least two because the header is larger than a single block.
*/
if (num_blocks > variance_blocks + (is_sslv3 ? 1 : 0)) {
num_starting_blocks = num_blocks - variance_blocks;
k = md_block_size * num_starting_blocks;
}
bits = 8 * mac_end_offset;
if (!is_sslv3) {
/*
* Compute the initial HMAC block. For SSLv3, the padding and secret
* bytes are included in |header| because they take more than a
* single block.
*/
bits += 8 * md_block_size;
memset(hmac_pad, 0, md_block_size);
OPENSSL_assert(mac_secret_length <= sizeof(hmac_pad));
memcpy(hmac_pad, mac_secret, mac_secret_length);
for (i = 0; i < md_block_size; i++)
hmac_pad[i] ^= 0x36;
md_transform(md_state.c, hmac_pad);
}
if (length_is_big_endian) {
memset(length_bytes, 0, md_length_size - 4);
length_bytes[md_length_size - 4] = (unsigned char)(bits >> 24);
length_bytes[md_length_size - 3] = (unsigned char)(bits >> 16);
length_bytes[md_length_size - 2] = (unsigned char)(bits >> 8);
length_bytes[md_length_size - 1] = (unsigned char)bits;
} else {
memset(length_bytes, 0, md_length_size);
length_bytes[md_length_size - 5] = (unsigned char)(bits >> 24);
length_bytes[md_length_size - 6] = (unsigned char)(bits >> 16);
length_bytes[md_length_size - 7] = (unsigned char)(bits >> 8);
length_bytes[md_length_size - 8] = (unsigned char)bits;
}
if (k > 0) {
if (is_sslv3) {
unsigned overhang;
/*
* The SSLv3 header is larger than a single block. overhang is
* the number of bytes beyond a single block that the header
* consumes: either 7 bytes (SHA1) or 11 bytes (MD5). There are no
* ciphersuites in SSLv3 that are not SHA1 or MD5 based and
* therefore we can be confident that the header_length will be
* greater than |md_block_size|. However we add a sanity check just
* in case
*/
if (header_length <= md_block_size) {
/* Should never happen */
return 0;
}
overhang = header_length - md_block_size;
md_transform(md_state.c, header);
memcpy(first_block, header + md_block_size, overhang);
memcpy(first_block + overhang, data, md_block_size - overhang);
md_transform(md_state.c, first_block);
for (i = 1; i < k / md_block_size - 1; i++)
md_transform(md_state.c, data + md_block_size * i - overhang);
} else {
/* k is a multiple of md_block_size. */
memcpy(first_block, header, 13);
memcpy(first_block + 13, data, md_block_size - 13);
md_transform(md_state.c, first_block);
for (i = 1; i < k / md_block_size; i++)
md_transform(md_state.c, data + md_block_size * i - 13);
}
}
memset(mac_out, 0, sizeof(mac_out));
/*
* We now process the final hash blocks. For each block, we construct it
* in constant time. If the |i==index_a| then we'll include the 0x80
* bytes and zero pad etc. For each block we selectively copy it, in
* constant time, to |mac_out|.
*/
for (i = num_starting_blocks; i <= num_starting_blocks + variance_blocks;
i++) {
unsigned char block[MAX_HASH_BLOCK_SIZE];
unsigned char is_block_a = constant_time_eq_8(i, index_a);
unsigned char is_block_b = constant_time_eq_8(i, index_b);
for (j = 0; j < md_block_size; j++) {
unsigned char b = 0, is_past_c, is_past_cp1;
if (k < header_length)
b = header[k];
else if (k < data_plus_mac_plus_padding_size + header_length)
b = data[k - header_length];
k++;
is_past_c = is_block_a & constant_time_ge_8(j, c);
is_past_cp1 = is_block_a & constant_time_ge_8(j, c + 1);
/*
* If this is the block containing the end of the application
* data, and we are at the offset for the 0x80 value, then
* overwrite b with 0x80.
*/
b = constant_time_select_8(is_past_c, 0x80, b);
/*
* If this the the block containing the end of the application
* data and we're past the 0x80 value then just write zero.
*/
b = b & ~is_past_cp1;
/*
* If this is index_b (the final block), but not index_a (the end
* of the data), then the 64-bit length didn't fit into index_a
* and we're having to add an extra block of zeros.
*/
b &= ~is_block_b | is_block_a;
/*
* The final bytes of one of the blocks contains the length.
*/
if (j >= md_block_size - md_length_size) {
/* If this is index_b, write a length byte. */
b = constant_time_select_8(is_block_b,
length_bytes[j -
(md_block_size -
md_length_size)], b);
}
block[j] = b;
}
md_transform(md_state.c, block);
md_final_raw(md_state.c, block);
/* If this is index_b, copy the hash value to |mac_out|. */
for (j = 0; j < md_size; j++)
mac_out[j] |= block[j] & is_block_b;
}
EVP_MD_CTX_init(&md_ctx);
if (EVP_DigestInit_ex(&md_ctx, ctx->digest, NULL /* engine */ ) <= 0)
goto err;
if (is_sslv3) {
/* We repurpose |hmac_pad| to contain the SSLv3 pad2 block. */
memset(hmac_pad, 0x5c, sslv3_pad_length);
if (EVP_DigestUpdate(&md_ctx, mac_secret, mac_secret_length) <= 0
|| EVP_DigestUpdate(&md_ctx, hmac_pad, sslv3_pad_length) <= 0
|| EVP_DigestUpdate(&md_ctx, mac_out, md_size) <= 0)
goto err;
} else {
/* Complete the HMAC in the standard manner. */
for (i = 0; i < md_block_size; i++)
hmac_pad[i] ^= 0x6a;
if (EVP_DigestUpdate(&md_ctx, hmac_pad, md_block_size) <= 0
|| EVP_DigestUpdate(&md_ctx, mac_out, md_size) <= 0)
goto err;
}
EVP_DigestFinal(&md_ctx, md_out, &md_out_size_u);
if (md_out_size)
*md_out_size = md_out_size_u;
EVP_MD_CTX_cleanup(&md_ctx);
return 1;
err:
EVP_MD_CTX_cleanup(&md_ctx);
return 0;
}
#ifdef OPENSSL_FIPS
/*
* Due to the need to use EVP in FIPS mode we can't reimplement digests but
* we can ensure the number of blocks processed is equal for all cases by
* digesting additional data.
*/
void tls_fips_digest_extra(const EVP_CIPHER_CTX *cipher_ctx,
EVP_MD_CTX *mac_ctx, const unsigned char *data,
size_t data_len, size_t orig_len)
{
size_t block_size, digest_pad, blocks_data, blocks_orig;
if (EVP_CIPHER_CTX_mode(cipher_ctx) != EVP_CIPH_CBC_MODE)
return;
block_size = EVP_MD_CTX_block_size(mac_ctx);
/*-
* We are in FIPS mode if we get this far so we know we have only SHA*
* digests and TLS to deal with.
* Minimum digest padding length is 17 for SHA384/SHA512 and 9
* otherwise.
* Additional header is 13 bytes. To get the number of digest blocks
* processed round up the amount of data plus padding to the nearest
* block length. Block length is 128 for SHA384/SHA512 and 64 otherwise.
* So we have:
* blocks = (payload_len + digest_pad + 13 + block_size - 1)/block_size
* equivalently:
* blocks = (payload_len + digest_pad + 12)/block_size + 1
* HMAC adds a constant overhead.
* We're ultimately only interested in differences so this becomes
* blocks = (payload_len + 29)/128
* for SHA384/SHA512 and
* blocks = (payload_len + 21)/64
* otherwise.
*/
digest_pad = block_size == 64 ? 21 : 29;
blocks_orig = (orig_len + digest_pad) / block_size;
blocks_data = (data_len + digest_pad) / block_size;
/*
* MAC enough blocks to make up the difference between the original and
* actual lengths plus one extra block to ensure this is never a no op.
* The "data" pointer should always have enough space to perform this
* operation as it is large enough for a maximum length TLS buffer.
*/
EVP_DigestSignUpdate(mac_ctx, data,
(blocks_orig - blocks_data + 1) * block_size);
}
#endif
``` |
Mobile Seva is an UN award-winning e-governance initiative by government of India. This programme was launched in 2011, by Department of Electronics and Information Technology, Government of India. This programme includes a Mobile Applications Store that by December, 2013, contained 240 applications available free. The programme takes benefit of ubiquitous mobile phone use all over India, to enable interaction between the Indian government and its citizens.
Services offered
By the end of May, 2014, more than 1000 government bodies from all over India had integrated their services through Mobile Seva, this integration was enabled through various methods such as text messages, mobile applications, Unstructured Supplementary Service Data, and Interactive Voice Response System. The system by May 2014 had delivered 930 million mobile text messages to Indian citizens. 318 "pull based" services were available. The MobileAppStore hosted on the Mobile e-governance Service Delivery Gateway provides 300 mobile applications for 24x7 service.
Amongst applications available are those related to tracking of Right to Information, passport applications, status of voters lists, locating of hospitals, police stations, ATMs, post offices, railway stations, hostels, sending of alerts in emergencies, downloading of various statutory documents such as birth, death certificates, pension forms, remote monitoring of health parameters by health professionals, maintenance of health records, processing of loud speaker permits.
Awards
Mobile Seva is second place co-winner of the 2014 United Nations Public Service Awards. This award was won under the category "promoting whole of government approaches in the information age"
See also
MyGov.in
References
External links
E-government in India
Ministry of Communications and Information Technology (India) |
The caval opening of diaphragm (also foramen of vena cava, vena caval foramen) is an opening in the central tendon of diaphragm giving passage to the inferior vena cava as well as to some terminal branches of the right phrenic nerve, and some lymphatic vessels en route to middle phrenic and mediastinal lymph nodes. The foramen occurs between the middle leaf and the right leaf of the central tendon of diaphragm, with the fibres of the central tendon uniting vigorously with the adventitia of the inferior vena cava (resulting in dilation of the IVC with contraction of the diaphragm during inspiration so as to facilitate venous return to the heart).
It is the superior-most of the three large diaphragmatic openings and is situated at the level of (sources differ) the 8th thoracic vertebra (T8)/the intervertebral disc between T8 and T9 vertebrae. It is situated slightly to the right of the midline.
References
Thoracic diaphragm |
Stanley J. Davis (May 8, 1908January 23, 2003) was a Michigan politician.
Early life
Davis was born in Poland on May 8, 1908. Davis graduated from Grand Rapids Union High School and took extension courses at the University of Michigan.
Career
Davis was a florist. Davis served as mayor of Grand Rapids, Michigan from 1949 to 1950. In 1950, was the unsuccessful Democratic candidate for the Michigan Senate seat representing the 17th district. Davis once again served as the mayor of Grand Rapids from 1958 to 1963 after unsuccessfully running for the position in 1956. In 1961, Davis was an unsuccessful candidate for the position of delegate to Michigan state constitutional convention from Kent County 1st District. On November 4, 1964, Davis was elected to the Michigan House of Representatives where he represented the 92nd district from January 13, 1965 to 1972. Davis was not re-elected to this position in 1972, and once again was defeated in an election for the same position in 1974.
Personal life
Davis was married to Gladys M. Werkema. Together they had three children. Davis was a member of the Elks and the Knights of Columbus. Davis was a member of the St. James Roman Catholic Church.
Death
Davis died on January 23, 2003.
References
1908 births
2003 deaths
Catholics from Michigan
Mayors of Grand Rapids, Michigan
Polish emigrants to the United States
Democratic Party members of the Michigan House of Representatives
20th-century American politicians |
"Coach Steven" is the twentieth episode of the first season of American animated television series Steven Universe, which premiered on August 21, 2014 on Cartoon Network. It was written and storyboarded by Raven M. Molisee and Paul Villeco.
The episode features the debut of Sugilite (voiced by guest star Nicki Minaj), the fusion of Garnet and Amethyst. After witnessing the power of Sugilite, Steven becomes obsessed with becoming stronger, to the distress of Pearl, who believes he mistakes brute force for "real" strength.
Plot
The Crystal Gems arrive at the ancient Gem Communication Hub to destroy the malfunctioning antenna. Garnet (Estelle) asks Amethyst (Michaela Dietz) to fuse with her to destroy it. Pearl (Deedee Magno Hall) objects, cautious of the instability of Garnet and Amethyst's combined form, but Garnet dismisses her misgivings and fuses with Amethyst, producing Sugilite (Nicki Minaj). Reveling in her immense size and strength, Sugilite begins recklessly smashing the pillars of the antenna with her giant, wrecking-ball–like flail. When Steven (Zach Callison) is hit by debris, Pearl takes him home, leaving Sugilite to finish the demolition alone. Moments after they teleport out, falling debris destroys the warp pad.
Later, Steven shows off his injury to his friends Lars (Matthew Moy) and Sadie (Kate Micucci). When they mock how much Steven is making of a tiny cut, he proposes that they all need to become stronger, and enlists his father Greg (Tom Scharpling) to build a makeshift gym on the beach. Steven explains to Pearl what he's doing: he wants to be stronger so he can be more useful, like Sugilite. When Pearl tells him, "There are different ways of being strong," Steven retorts, "I want to be strong in the real way."
As Lars, Sadie, and Greg begin their workout, Pearl sings the song "Strong in the Real Way", lamenting Steven's admiration of Sugilite's brute strength and hoping she herself can be a more positive role model for him. Steven sings a second verse, coaching the others in their workout before beginning his own.
The next morning, Steven is too sore to move. Sugilite comes stomping up the beach, outraged that Pearl and Steven left her behind and unwilling to separate. She begins attacking Pearl and smashing Greg's gym. As Pearl despairs that she isn't strong enough to protect Steven, he grabs his megaphone and coaches her back into self-confidence. Heartened, Pearl allows Sugilite to chase her to the top of the hill, and then throws her spear at the cliff beneath Sugilite's foot so she loses her footing. Sugilite falls to the beach below, and her flail lands on her head, separating her. As Garnet and Amethyst reel on the sand, Pearl embraces them; and Garnet apologizes for not listening to Pearl's advice earlier.
Music
The episode features the song "Strong in the Real Way", performed by Deedee Magno Hall (as Pearl) and Zach Callison (as Steven), composed by series creator Rebecca Sugar. Guitars were performed by Stemage.
Broadcast and reception
"Coach Steven" had an advance screening at San Diego Comic-con and had its television premiere on Cartoon Network on August 21, 2014. Its initial American broadcast was viewed by approximately 1.852 million viewers and received a Nielsen household rating of 0.35, meaning it was viewed by 0.35% of all households.
Cecilia Mazumdar Stanger of the Minnesota Daily wrote that she found the episode disappointing at first, especially because guest star Minaj did not participate in the episode's song. However, she adds that the episode "had all of the elements that make Steven Universe such a compelling cartoon."
In the Italian dub of the episode, Lars' line "We're not married" was censored.
References
Steven Universe episodes
2015 American television episodes |
```python
#!/pxrpythonsubst
#
#
# path_to_url
from __future__ import print_function
from pxr import Ar, Tf, Sdf, Usd, UsdMtlx, UsdShade
import unittest
def _EmptyLayer():
stage = Usd.Stage.CreateInMemory()
return stage.GetRootLayer().ExportToString()
class TestFileFormat(unittest.TestCase):
def test_EmptyFile(self):
"""
Verify that an empty MaterialX document fails.
"""
with self.assertRaises(Tf.ErrorException) as e:
UsdMtlx._TestString('')
def test_MissingFile(self):
"""
Verify that a missing MaterialX file fails.
"""
with self.assertRaises(Tf.ErrorException) as e:
UsdMtlx._TestFile('non-existent-file.xml')
def test_BadMagic(self):
"""
Verify that a MaterialX file with a bad XML header fails.
"""
with self.assertRaises(Tf.ErrorException) as e:
UsdMtlx._TestString('''<?not_xml version="1.0" ?>''')
def test_EmptyXMLDocument(self):
"""
Verify that a MaterialX file with only an XML header fails.
"""
with self.assertRaises(Tf.ErrorException) as e:
UsdMtlx._TestString('''<?xml version="1.0" ?>''')
def test_MissingMaterialXDocument(self):
"""
Verify that a MaterialX file without a materialx element is okay.
"""
stage = UsdMtlx._TestString(
'''<?xml version="1.0" ?>
<not_materialx version="1.35">
</not_materialx>
''')
self.assertEqual(stage.GetRootLayer().ExportToString(),
_EmptyLayer())
def test_EmptyMaterialXDocument(self):
"""
Verify that a file with an empty a materialx element is okay.
"""
stage = UsdMtlx._TestString(
'''<?xml version="1.0" ?>
<materialx version="1.35">
</materialx>
''')
self.assertEqual(stage.GetRootLayer().ExportToString(),
_EmptyLayer())
def test_DuplicateName(self):
"""
Verify that a MaterialX file with duplicate element names fails.
"""
with self.assertRaises(Tf.ErrorException) as e:
UsdMtlx._TestString(
'''<?xml version="1.0" ?>
<materialx version="1.35">
<typedef name="type1">
<typedef name="type1">
</materialx>
''')
def test_Cycle(self):
"""
Verify that a MaterialX file with an inherits cycle fails.
"""
with self.assertRaises(Tf.ErrorException) as e:
UsdMtlx._TestString(
'''<?xml version="1.0" ?>
<materialx version="1.35">
<nodedef name="n1" type="float" node="test" inherit="n2">
<nodedef name="n2" type="float" node="test" inherit="n1">
</materialx>
''')
def test_NodeGraphs(self):
"""
Test general MaterialX node graph conversions.
"""
stage = UsdMtlx._TestFile('NodeGraphs.mtlx', nodeGraphs=True)
stage.GetRootLayer().Export('NodeGraphs.usda')
def test_MultiBindInputs(self):
"""
Test MaterialX conversion with mutliple bind inputs.
"""
stage = UsdMtlx._TestFile('MultiBindInputs.mtlx')
# Get the node graph and make sure there are exactly 3 inputs
nodeGraph = UsdShade.NodeGraph.Get(stage,
Sdf.Path('/MaterialX/Materials/layered/ND_layerShader'))
inputs = nodeGraph.GetInputs()
self.assertEqual(len(inputs), 3)
# Make sure each input is connected as expected
inputToSource = {
'weight_1':
'/MaterialX/Materials/layered/NodeGraphs/layered_layer1_gradient',
'weight_2':
'/MaterialX/Materials/layered/NodeGraphs/layered_layer2_gradient',
'weight_3':
'/MaterialX/Materials/layered/NodeGraphs/layered_layer3_gradient'
}
for inputName, source in inputToSource.items():
input = nodeGraph.GetInput(inputName)
self.assertEqual(input.HasConnectedSource(), True)
self.assertEqual(
input.GetConnectedSources()[0][0].source.GetPath(), source)
def test_MultiOutputNodes(self):
"""
Test MaterialX nodes with multiple outputs
"""
stage = UsdMtlx._TestFile('MultiOutputNode.mtlx')
testInfo = [
('/MaterialX/Materials/test_m/test_ng/specular',
'artistic_ior', 'extinction'),
('/MaterialX/Materials/test_m/test_ng/ior',
'artistic_ior', 'ior')
]
for path, connNodeName, connectionName in testInfo:
node = UsdShade.Shader.Get(stage, path)
conn = node.GetInput('in').GetConnectedSources()[0][0]
self.assertEqual(conn.source.GetPath().name, connNodeName)
self.assertEqual(conn.sourceName, connectionName)
def test_nodesWithoutNodegraphs(self):
"""
Test MaterialX material with nodes not contained in a nodegraph and no
explicit outputs
"""
stage = UsdMtlx._TestFile('GraphlessNodes.mtlx')
stage.GetRootLayer().Export('GraphlessNodes.usda')
def test_NodegraphsWithInputs(self):
"""
Test that inputs on nodegraphs are found and connected when used
inside that nodegraph
"""
stage = UsdMtlx._TestFile('NodeGraphInputs.mtlx')
path = '/MaterialX/Materials/test_material/test_nodegraph/mult1'
node = UsdShade.Shader.Get(stage, path)
conn = node.GetInput('in2').GetConnectedSources()[0][0]
self.assertEqual(conn.source.GetPath().name, 'test_nodegraph')
self.assertEqual(conn.sourceName, 'scale')
def test_Looks(self):
"""
Test general MaterialX look conversions.
"""
stage = UsdMtlx._TestFile('Looks.mtlx')
stage.GetRootLayer().Export('Looks.usda')
def test_StdlibShaderRefs(self):
"""
Test that we can use a shader nodedef from the MaterialX stdlib.
"""
stage = UsdMtlx._TestFile('usd_preview_surface_gold.mtlx')
# check stage contents
mprim = stage.GetPrimAtPath("/MaterialX/Materials/USD_Gold")
self.assertTrue(mprim)
material = UsdShade.Material(mprim)
self.assertTrue(material)
input = material.GetInput("specularColor")
self.assertTrue(input)
self.assertEqual(input.GetFullName(),"inputs:specularColor")
def test_customNodeDefs(self):
"""
Test that custom nodedefs are flattend out and replaced with
their associated nodegraph
"""
stage = UsdMtlx._TestFile('CustomNodeDef.mtlx')
stage.GetRootLayer().Export('CustomNodeDef.usda')
@unittest.skipIf(not hasattr(Ar.Resolver, "CreateIdentifier"),
"Requires Ar 2.0")
def test_XInclude(self):
"""
Verify documents referenced via XInclude statements are read
properly.
"""
stage = UsdMtlx._TestFile('include/Include.mtlx')
stage.GetRootLayer().Export('Include.usda')
stage = UsdMtlx._TestFile('include/Include.usdz[Include.mtlx]')
stage.GetRootLayer().Export('Include_From_Usdz.usda')
@unittest.skipIf(not hasattr(Ar.Resolver, "CreateIdentifier"),
"Requires Ar 2.0")
def test_EmbedInUSDZ(self):
"""
Verify that a MaterialX file can be read from within a .usdz file.
"""
stage = UsdMtlx._TestFile(
'usd_preview_surface_gold.usdz[usd_preview_surface_gold.mtlx]')
stage.GetRootLayer().Export('usd_preview_surface_gold.usda')
def test_Capabilities(self):
self.assertTrue(Sdf.FileFormat.FormatSupportsReading('.mtlx'))
self.assertFalse(Sdf.FileFormat.FormatSupportsWriting('.mtlx'))
self.assertFalse(Sdf.FileFormat.FormatSupportsEditing('.mtlx'))
def test_ExpandFilePrefix(self):
"""
Test active file prefix defined by the fileprefix attribute
in a parent tag.
"""
stage = UsdMtlx._TestFile('ExpandFilePrefix.mtlx')
for nodeName, expectedResult in [
('image_base', 'outer_scope/textures/base.tif'),
('image_spec', 'inner_scope/textures/spec.tif')
]:
primPath = f'/MaterialX/Materials/test_material/test_nodegraph/{nodeName}'
shader = UsdShade.Shader.Get(stage, primPath)
self.assertTrue(shader)
fileInput = shader.GetInput('file')
self.assertTrue(fileInput)
actualResult = fileInput.Get().path
self.assertEqual(actualResult, expectedResult)
if __name__ == '__main__':
unittest.main()
``` |
```smalltalk
using System.Net.Sockets;
using Microsoft.VisualStudio.TestTools.UnitTesting;
using Renci.SshNet.Messages.Transport;
namespace Renci.SshNet.Tests.Classes
{
[TestClass]
public class your_sha256_hashrictKex : SessionTest_ConnectingBase
{
protected override bool ServerSupportsStrictKex
{
get
{
return false;
}
}
protected override void ActionAfterKexInit()
{
var ignoreMessage = new IgnoreMessage();
var ignore = ignoreMessage.GetPacket(8, null);
// MitM sends ignore message to client
_ = ServerSocket.Send(ignore, 4, ignore.Length - 4, SocketFlags.None);
// MitM drops server message
ServerOutboundPacketSequence++;
}
[TestMethod]
public void DoesNotThrowException()
{
Session.Connect();
}
}
}
``` |
In mathematics, a double affine Hecke algebra, or Cherednik algebra, is an algebra containing the Hecke algebra of an affine Weyl group, given as the quotient of the group ring of a double affine braid group. They were introduced by Cherednik, who used them to prove Macdonald's constant term conjecture for Macdonald polynomials. Infinitesimal Cherednik algebras have significant implications in representation theory, and therefore have important applications in particle physics and in chemistry.
References
A. A. Kirillov Lectures on affine Hecke algebras and Macdonald's conjectures Bull. Amer. Math. Soc. 34 (1997), 251–292.
Macdonald, I. G. Affine Hecke algebras and orthogonal polynomials. Cambridge Tracts in Mathematics, 157. Cambridge University Press, Cambridge, 2003. x+175 pp.
Algebras
Representation theory |
, also known as Akio Gotō, was a Japanese author.
Biography
Gotō was born in Yongheung County, Chōsen (now Kumya County, South Hamgyong Province, North Korea). He fled with his family to Kyūshū, Japan while in junior high school. He studied Russian literature at Waseda University, with particular interest in Nikolai Gogol. He then worked at an advertising agency and a publishing house, before becoming a professional novelist in 1968.
Major prizes
1977 Hirabayashi Taiko Award for Yume katari (Dreams Speak)
1981 Tanizaki Prize for Yoshino-dayu (吉野大夫, The Courtesan Yoshino)
English translations
Shot By Both Sides (Hasamiuchi, 1973), trans. Tom Gill, Japanese Literature Publishing Project, 2005 list. Published in the United States by Counterpoint, fall 2008.
Selected works
Shiteki seikatsu, 1969.
Waraijigoku, 1969.
Nani?, 1970.
Kakarenai hōkoku, 1971.
Kankei, 1971.
En to daen no sekai, 1972.
Gotō Meisei shū, 1972.
Hasamiuchi (Attacked from Both Sides), 1973.
Yonjissai no Oburōmofu, 1973.
Fumbet suzakari no mufumbetsu, 1974.
Fushigi na temaneki, 1975.
Nemuri otoko no me, 1975.
Ōinaru mujun, 1975.
Omoigawa, 1975.
Ugetsu monogatari kikō, 1975.
Meguriai, 1976.
Hasamiuchi, 1977.
Waraizaka, 1977.
Yukikaeri, 1977.
Yume katari (Dreams Speak)
Sake neko ningen, 1978.
Torashima, 1978.
Yonjissai no Oburōmofu (四十歲 の オブローモフ), Tōkyō : Ōbunsha, 1978.
Yume to yume no aida, 1978.
Hari no ana kara, 1979.
Uso no yō na nichijō, 1979.
Hachigatsu, 1980.
Ugetsu Monogatari, Harusame Monogatari, 1980.
Mieru sekai, mienai sekai, 1981.
Warai no hōhō : aruiwa Nikorai Gōgori (笑い の 方法 : あるいは ニコライ ゴーゴリ), Tōkyō : Chūō Kōronsha, 1981.
Yoshinodayu (吉野大夫), 1981.
Fukushū no jidai, Tōkyō : Fukutake Shoten, 1983.
Nanji no rinjin (汝 の 隣人), Tōkyō : Kawade Shobō Shinsha, 1983.
Shōsetsu ikani yomi ikani kaku ka, 1983.
Omocha no chi, chi, chi (おもちゃ の 知、 知、 知), Tōkyō : Tōjusha, 1984.
Bungaku ga kawaru toki (文学 が 変る とき), Tōkyō : Chikuma Shobō, 1987.
Kafuka no meikyū : Akumu no hōhō (カフカ の 迷宮 : 悪夢 の 方法 ), Tōkyō : Iwanami Shoten, 1987.
Memento mori : Watakushi no shokudō shujutsu taiken (メメント モリ : 私 の 食道 手術 体験), Tōkyō : Chūō Kōronsha, 1990.
Sukēpu gōto (スケープ ゴート), Tōkyō : Nihon Bungeisha, 1990.
References
External links
Meisei Goto at J'Lit Books from Japan
Synopsis of Shot by Both Sides at JLPP (Japanese Literature Publishing Project)
1932 births
1999 deaths
Japanese writers
Japanese people of Korea under Japanese rule
People from Kumya County
Waseda University alumni |
was a junior college in Kōfu, Yamanashi, Yamanashi Prefecture, Japan.
The institute was founded in 1966 by Yamanashi Prefecture.closed at 2006.
Japanese junior colleges |
Do Your Duty is a 1928 American silent comedy film directed by William Beaudine. This is lost film.
Cast
Charles Murray as Tim Maloney (as Charlie Murray)
Lucien Littlefield as Andy McIntosh
Charles Delaney as Danny Sheehan Jr
Ed Brady as Ritzy Dalton
Blue Washington as Dude Jackson
Doris Dawson as Mary Ellen Maloney
Aggie Herring as Mrs. Maloney
George C. Pearce as Captain Dan Sheehan (as George Pierce)
References
External links
1928 films
1928 comedy films
Silent American comedy films
American silent feature films
American black-and-white films
Films directed by William Beaudine
Lost American comedy films
1928 lost films
1920s American films |
Medicine is a continually updated, evidence-based medical review journal covering internal medicine and its specialties. It was established by Simon Campbell-Smith in 1972 and is published by Medicine Publishing. The editor-in-chief is Allister Vale (City Hospital, Birmingham).
Scope
The journal aims to cover the fundamentals of internal medicine in a systematic way during a recurring four-year cycle – it can be seen as a general medicine textbook that is published "a chapter at a time". It covers the topics at a level appropriate to the non-specialist, providing clinicians with up-to-date, understandable clinical information. It is aimed specifically at trainees in internal medicine and its specialties who are preparing for postgraduate examinations. The journal is abstracted and indexed by Scopus and Embase.
Editors-in-chief
The following persons have been editor-in-chief ("chairman of the board") of the journal:
Sir John McMichael FRS (1972–1978)
Sir John Badenoch (1979–1996)
Alasdair Geddes (1996–2002)
Allister Vale (2003–present)
References
External links
Internal medicine journals
Elsevier academic journals
English-language journals
Monthly journals
Academic journals established in 1972 |
Pass is a village in the administrative district of Gmina Błonie, within Warsaw West County, Masovian Voivodeship, in east-central Poland. It lies approximately west of Błonie, west of Ożarów Mazowiecki, and west of Warsaw.
References
Pass |
Dimitre Ganev Kalkanov (; born 5 April 1966) is a Bulgarian former professional footballer who played as a defender or defensive midfielder.
Career
Kalkanov started his career with Lokomotiv Plovdiv. He took part in the 1985 FIFA World Youth Championship with Bulgaria, making three appearances in that tournament. Kalkanov then played in Hong Kong for Instant-Dict and Happy Valley, and in Malaysia for Selangor and Kelantan. While in Hong Kong, Kalkanov won the Hong Kong Footballer of the Year award in 1998, becoming the first non-Hong Konger to win the award. He played for the Hong Kong League XI at the 1998 Dynasty Cup, 2000 Guangdong–Hong Kong Cup and the Carlsberg Cup in 2000 and 2001.
In 1998, he also made an appearance as part of the Hong Kong League XI against the Bulgaria national football team in a friendly match.
References
1966 births
Living people
Bulgarian men's footballers
Bulgaria men's youth international footballers
Bulgarian expatriate men's footballers
PFC Lokomotiv Plovdiv players
First Professional Football League (Bulgaria) players
Expatriate men's footballers in Hong Kong
Expatriate men's footballers in Malaysia
Bulgarian expatriate sportspeople in Hong Kong
Bulgarian expatriate sportspeople in Malaysia
Kelantan F.C. players
Selangor F.C. players
Double Flower FA players
Happy Valley AA players
Men's association football defenders
Men's association football midfielders
Hong Kong League XI representative players |
Emilio Fernando Azcárraga Jean (; born 21 February 1968) is a Mexican businessman who currently serves as the chairman of both mass media company Televisa and professional football team Club América.
In 1997, at the age of 29, Azcárraga Jean became the CEO of Grupo Televisa – which had been founded by his family in 1973 – following the death of his father Emilio Azcárraga Milmo. He led Televisa for twenty years, and was credited with the financial turnaround of a highly indebted and struggling company. Under Azcárraga Jean, Televisa expanded its satellite TV, cable and telecommunications businesses, however the rise of the internet and growing competition are considered the main reasons behind years of declining advertising revenue. He stepped down from his role as CEO in 2017, though still serves as the company’s chairman of the board.
Early life and education
He was born in Mexico City in 1968. His father is Emilio Azcárraga Milmo and his mother is Nadine Jean, a French citizen and third wife of Azcárraga Milmo.
He attended Lakefield College School in Ontario, Canada, and Universidad Iberoamericana until fifth semester.
Career
He became the CEO of Grupo Televisa at the age of 29, after the death of his father. He is one of the richest businesspersons in Latin America, ranked seventh-richest in Mexico and 512th-richest globally with a fortune estimated at $2.3 billion as of March 2011.
He is also a Board Member of Univision and Banamex. Azcárraga Jean is also a global board member of Endeavor. Endeavor is an international non-profit development organization that finds and supports high-impact entrepreneurs in emerging markets.
Azcárraga Jean is widely credited for turning around Televisa into the prosperous company after the death of his father. Azcárraga, together with his close friends and colleagues José Bastón, Alfonso de Angoitia Noriega and Bernardo Gómez were able to bring Televisa back from a near bankruptcy.
On October 26, 2017, Televisa announced that Azcárraga Jean was stepping down as CEO of the firm on January 1, 2018. This decision came amid Televisa's declining advertisement sales and growing competition in the online market.
Ancestors
Awards and honors
2004, Golden Plate Award of the American Academy of Achievement
2012, Grand Order of Solidarity Award of the Organizacion Internacional de Teletones (Oritel)
2014, Broadcasting & Cable Hall of Fame
2014, Tarikoff Legacy Award
2017, International Emmy Directorate Award
See also
Azcárraga family
List of billionaires
References
External links
Profile on Endeavor's Board of Directors
1968 births
Emilio Azcarraga Jean
Lakefield College School alumni
Mexican football chairmen and investors
Universidad Iberoamericana alumni
Living people
Businesspeople from Mexico City
Mexican billionaires
Mexican mass media owners
Mexican people of Basque descent
Mexican people of English descent
Mexican people of French descent
Mexican people of Irish descent
Magazine publishers (people)
Mexican newspaper publishers (people)
International Emmy Directorate Award
Mexican television executives
Chairmen of Televisa |
Guadalmena is a river of the Province of Albacete, Spain.
Rivers of Spain
Rivers of the Province of Albacete
Rivers of Castilla–La Mancha |
Anthony Blackwood (born 13 September 1982) is an English professional rugby league footballer who played for the Crusaders RL in the Super League, and the South Wales Scorpions in Championship 1. He has previously represented Wales and played as a or .
Background
Blackwood was born in Barrow-In-Furness, Cumbria, England.
Playing career
Formerly a back-row player, Blackwood signed for Crusaders in 2007 from Halifax. He is a former Leigh Centurions academy captain.
International honours
Blackwood made his Wales début against Scotland in 2005, winning caps for Wales while at Halifax, and Celtic Crusaders 2005...present 7(6?)-caps 3-tries 12-points.
A regular and one of the most committed Welsh internationals, Anthony joined the Crusaders from Halifax at the start of last season following an impressive record with the Yorkshire-side. He continued to impress at the Crusaders in both the 2007 and 2008 season scoring 14 tries in year one followed by 11 in 2008
References
1982 births
Living people
Barrow Raiders players
British expatriates in France
Crusaders Rugby League players
English people of Welsh descent
English rugby league players
Expatriate rugby league players in France
Halifax R.L.F.C. players
Leigh Leopards players
Rugby league players from Barrow-in-Furness
Rugby league second-rows
Rugby league wingers
South Wales Scorpions players
Wales national rugby league team players
Welsh rugby league players |
In physics, the observer effect is the disturbance of an observed system by the act of observation. This is often the result of utilizing instruments that, by necessity, alter the state of what they measure in some manner. A common example is checking the pressure in an automobile tire, which causes some of the air to escape, thereby changing the pressure to observe it. Similarly, seeing non-luminous objects requires light hitting the object to cause it to reflect that light. While the effects of observation are often negligible, the object still experiences a change (leading to the Schrödinger's cat thought experiment). This effect can be found in many domains of physics, but can usually be reduced to insignificance by using different instruments or observation techniques.
A notable example of the observer effect occurs in quantum mechanics, as demonstrated by the double-slit experiment. Physicists have found that observation of quantum phenomena by a detector or an instrument can change the measured results of this experiment. Despite the "observer effect" in the double-slit experiment being caused by the presence of an electronic detector, the experiment's results have been interpreted by some to suggest that a conscious mind can directly affect reality. However, the need for the "observer" to be conscious (versus merely existent, as in a unicellular microorganism) is not supported by scientific research, and has been pointed out as a misconception rooted in a poor understanding of the quantum wave function and the quantum measurement process.
Particle physics
An electron is detected upon interaction with a photon; this interaction will inevitably alter the velocity and momentum of that electron. It is possible for other, less direct means of measurement to affect the electron. It is also necessary to distinguish clearly between the measured value of a quantity and the value resulting from the measurement process. In particular, a measurement of momentum is non-repeatable in short intervals of time. A formula (one-dimensional for simplicity) relating involved quantities, due to Niels Bohr (1928) is given by
where
is uncertainty in measured value of momentum,
is duration of measurement,
is velocity of particle before measurement,
is velocity of particle after measurement,
is the reduced Planck constant.
The measured momentum of the electron is then related to , whereas its momentum after the measurement is related to . This is a best-case scenario.
Electronics
In electronics, ammeters and voltmeters are usually wired in series or parallel to the circuit, and so by their very presence affect the current or the voltage they are measuring by way of presenting an additional real or complex load to the circuit, thus changing the transfer function and behavior of the circuit itself. Even a more passive device such as a current clamp, which measures the wire current without coming into physical contact with the wire, affects the current through the circuit being measured because the inductance is mutual.
Thermodynamics
In thermodynamics, a standard mercury-in-glass thermometer must absorb or give up some thermal energy to record a temperature, and therefore changes the temperature of the body which it is measuring.
Quantum mechanics
The theoretical foundation of the concept of measurement in quantum mechanics is a contentious issue deeply connected to the many interpretations of quantum mechanics. A key focus point is that of wave function collapse, for which several popular interpretations assert that measurement causes a discontinuous change into an eigenstate of the operator associated with the quantity that was measured, a change which is not time-reversible.
More explicitly, the superposition principle ( of quantum physics dictates that for a wave function , a measurement will result in a state of the quantum system of one of the possible eigenvalues , of the operator which in the space of the eigenfunctions .
Once one has measured the system, one knows its current state; and this prevents it from being in one of its other states — it has apparently decohered from them without prospects of future strong quantum interference. This means that the type of measurement one performs on the system affects the end-state of the system.
An experimentally studied situation related to this is the quantum Zeno effect, in which a quantum state would decay if left alone, but does not decay because of its continuous observation. The dynamics of a quantum system under continuous observation are described by a quantum stochastic master equation known as the Belavkin equation. Further studies have shown that even observing the results after the photon is produced leads to collapsing the wave function and loading a back-history as shown by delayed choice quantum eraser.
When discussing the wave function which describes the state of a system in quantum mechanics, one should be cautious of a common misconception that assumes that the wave function amounts to the same thing as the physical object it describes. This flawed concept must then require existence of an external mechanism, such as a measuring instrument, that lies outside the principles governing the time evolution of the wave function , in order to account for the so-called "collapse of the wave function" after a measurement has been performed. But the wave function is not a physical object like, for example, an atom, which has an observable mass, charge and spin, as well as internal degrees of freedom. Instead, is an abstract mathematical function that contains all the statistical information that an observer can obtain from measurements of a given system. In this case, there is no real mystery in that this mathematical form of the wave function must change abruptly after a measurement has been performed.
A consequence of Bell's theorem is that measurement on one of two entangled particles can appear to have a nonlocal effect on the other particle. Additional problems related to decoherence arise when the observer is modeled as a quantum system.
Confusion with uncertainty principle
The uncertainty principle has been frequently confused with the observer effect, evidently even by its originator, Werner Heisenberg. The uncertainty principle in its standard form describes how precisely we may measure the position and momentum of a particle at the same time – if we increase the precision in measuring one quantity, we are forced to lose precision in measuring the other.
An alternative version of the uncertainty principle, more in the spirit of an observer effect, fully accounts for the disturbance the observer has on a system and the error incurred, although this is not how the term "uncertainty principle" is most commonly used in practice.
See also
Observer (special relativity)
References
Physical phenomena |
Annamaria Petrozza is an American chemist who is a professor at the Istituto Italiano di Tecnologia. Her research considers sustainable materials for optoelectronic devices. She was awarded the 2022 Materials Research Society Award in Innovation in Materials Characterization.
Early life and education
Petrozza completed her masters degree in electronic engineering at the École Superieure d'Electricité, where she focused on device physics and engineering. She moved to the Polytechnic University of Milan for graduate studies, working in optoelectronics. She earned her doctorate at the University of Cambridge, where she worked alongside Richard Friend and Ji-Seon Kim on optoelectronic processes in hybrid semiconductors. Shen then moved to Sharp Corporation, where she worked on novel photovoltaics. At Sharp, her main focus was understanding the needs of the photovoltaic market.
Research and career
In 2010, Petrozza joined the Center for Nano Science and Technology (CNST) at the Istituto Italiano di Tecnologia. Her research considers new materials platforms for optoelectronics, with a focus on sustainable optoelectronic materials.
Awards and honors
2014 Innovators Under 35 Italy
2017 Royal Society of Chemistry Emerging Investigators
2017 European Research Council Consolidator Grant
2022 Distinguished Scientist Fellowship from the King Saud University
2022 Materials Research Society Innovation in Materials Characterization
2022 Fellow of Royal Society of Chemistry
Publications
References
Living people
Year of birth missing (living people)
Supélec alumni
Polytechnic University of Milan alumni
Alumni of the University of Cambridge
Sharp Corporation people
Fellows of the Royal Society of Chemistry |
Greek letters are used in mathematics, science, engineering, and other areas where mathematical notation is used as symbols for constants, special functions, and also conventionally for variables representing certain quantities. In these contexts, the capital letters and the small letters represent distinct and unrelated entities. Those Greek letters which have the same form as Latin letters are rarely used: capital A, B, E, Z, H, I, K, M, N, O, P, T, Y, X. Small ι, ο and υ are also rarely used, since they closely resemble the Latin letters i, o and u. Sometimes, font variants of Greek letters are used as distinct symbols in mathematics, in particular for ε/ϵ and π/ϖ. The archaic letter digamma (Ϝ/ϝ/ϛ) is sometimes used.
The Bayer designation naming scheme for stars typically uses the first Greek letter, α, for the brightest star in each constellation, and runs through the alphabet before switching to Latin letters.
In mathematical finance, the Greeks are the variables denoted by Greek letters used to describe the risk of certain investments.
Typography
The Greek letter forms used in mathematics are often different from those used in Greek-language text: they are designed to be used in isolation, not connected to other letters, and some use variant forms which are not normally used in current Greek typography.
The OpenType font format has the feature tag "mgrk" ("Mathematical Greek") to identify a glyph as representing a Greek letter to be used in mathematical (as opposed to Greek language) contexts.
The table below shows a comparison of Greek letters rendered in TeX and HTML.
The font used in the TeX rendering is an italic style. This is in line with the convention that variables should be italicized. As Greek letters are more often than not used as variables in mathematical formulas, a Greek letter appearing similar to the TeX rendering is more likely to be encountered in works involving mathematics.
Concepts represented by a Greek letter
Αα (alpha)
represents:
the first angle in a triangle, opposite the side a
the statistical significance of a result
the false positive rate in statistics ("Type I" error)
the fine-structure constant in physics
the angle of attack of an aircraft
an alpha particle (He2+)
angular acceleration in physics
the linear thermal expansion coefficient
the thermal diffusivity
In organic chemistry the α-carbon is the backbone carbon next to the carbonyl carbon, most often for amino acids
right ascension in astronomy
the brightest star in a constellation
Iron ferrite and numerous phases within materials science
the return in excess of the compensation for the risk borne in investment
the α-conversion in lambda calculus
the independence number of a graph
a placeholder for ordinal numbers in mathematical logic
a type of receptor for the neurotransmitter noradrenaline in neuroscience
Ββ (beta)
represents the beta function
represents:
the thermodynamic beta, equal to (kBT)−1, where kB is Boltzmann's constant and T is the absolute temperature.
the second angle in a triangle, opposite the side b
the standardized regression coefficient for predictor or independent variables in linear regression (unstandardized regression coefficients are represented with the lower-case Latin b, but are often called "betas" as well)
the ratio of collector current to base current in a bipolar junction transistor (BJT) in electronics (current gain)
the false negative rate in statistics ("Type II" error)
the beta coefficient, the non-diversifiable risk, of an asset in mathematical finance
the sideslip angle of an airplane
a beta particle (e− or e+)
the beta brain wave in brain or cognitive sciences
ecliptic latitude in astronomy
the ratio of plasma pressure to magnetic pressure in plasma physics
β-reduction in lambda calculus
the ratio of the velocity of an object to the speed of light as used in the Lorentz factor
a type of receptor for the noradrenaline neurotransmitter in neuroscience
Γγ (gamma)
represents:
the circulation in fluid dynamics
the reflection coefficient of a transmission or telecommunication line.
the confinement factor of an optical mode in a waveguide
the gamma function, a generalization of the factorial
the upper incomplete gamma function
the modular group, the group of fractional linear transformations
the gamma distribution, a continuous probability distribution defined using the gamma function
second-order sensitivity to price in mathematical finance
the Christoffel symbols of the second kind
the stack alphabet in the formal definition of a pushdown automaton , or the tape-alphabet in the formal definition of a Turing machine
the Feferman–Schütte ordinal Γ0
represents:
the specific weight of substances
the lower incomplete gamma function
the third angle in a triangle, opposite the side c
the Euler–Mascheroni constant in mathematics
gamma rays and the photon
the heat capacity ratio in thermodynamics
the Lorentz factor in special relativity
the flight path angle of an airplane
Δδ (delta)
represents:
a finite difference
a difference operator
a symmetric difference
the Laplace operator
giving heat in a chemical reaction
the angle that subtends the arc of a circular curve in surveying
the maximum degree of any vertex in a given graph
sensitivity to price in mathematical finance
the discriminant of a polynomial (in a quadratic polynomial determines the nature of the roots)
represents:
percent error
a variation in the calculus of variations
the Kronecker delta function
the Feigenbaum constants
the force of interest in mathematical finance
the Dirac delta function
the receptor which enkephalins have the highest affinity for in pharmacology
the Skorokhod integral in Malliavin calculus, a subfield of stochastic analysis
the minimum degree of any vertex in a given graph
a partial charge. δ− represents a negative partial charge, and δ+ represents a positive partial charge chemistry (See also: Solvation)
the chemical shift of an atomic nucleus in NMR spectroscopy. For protons, this is relative to tetramethylsilane = 0.
stable isotope compositions
declination in astronomy
noncentrality measure in statistics
The transition function in the formal definition of a finite automaton, pushdown automaton, or Turing machine
Infinitesimal - see
Not to be confused with ∂ which is based on the Latin letter d but often called a "script delta."
Εε (epsilon)
represents:
a small positive quantity; see limit
a random error in regression analysis
the absolute value of an error
in set theory, the limit ordinal of the sequence
in computer science, the empty string
the Levi-Civita symbol
in electromagnetics, dielectric permittivity
emissivity
strain in continuum mechanics
permittivity
the Earth's axial tilt in astronomy
elasticity in economics
electromotive force
in chemistry, the molar extinction coefficient of a chromophore
in mathematics, a surreal number that is bigger than zero, but smaller than all the non-negative numbers.
set membership symbol ∈ is based on ε
(digamma)
is sometimes used to represent the digamma function, though the Latin letter F (which is nearly identical) is usually substituted.
A hypothetical particle Ϝ speculated to be implicated in the 750 GeV diphoton excess, now known to be simply a statistical anomaly
Ζζ (zeta)
represents:
the Riemann zeta function and other zeta functions in mathematics
the damping ratio
Ηη (eta)
represents:
the Eta function of Ludwig Boltzmann's H-theorem ("Eta" theorem), in statistical mechanics
Information theoretic (Shannon) entropy
represents:
the intrinsic wave impedance of a medium (e.g. the impedance of free space)
the partial regression coefficient in statistics, also interpreted as an effect size measure for analyses of variance
the eta meson
viscosity
the Dedekind eta function
energy conversion efficiency
efficiency (physics)
the Minkowski metric tensor in relativity
η-conversion in lambda calculus
the learning rate in machine learning and statistics
Θθ (theta)
(uppercase) represents:
an asymptotically tight bound related to big O notation.
sensitivity to the passage of time in mathematical finance
in set theory, a certain ordinal number
Heaviside step function
(lowercase) represents:
a plane angle in geometry
the angle to the x axis in the xy-plane in spherical or cylindrical coordinates (mathematics)
the angle to the z axis in spherical coordinates (physics)
the potential temperature in thermodynamics
theta functions
the angle of a scattered photon during a Compton scattering interaction
the angular displacement of a particle rotating about an axis
the Watterson estimator in population genetics
("script theta"), the cursive form of theta, often used in handwriting, represents
the first Chebyshev function in number theory
Theta role in linguistics
Ιι (iota)
represents:
an inclusion map in set theory
the index generator function in APL (in the form ⍳)
the imaginary number equal to square root of −1
the interior product
Κκ (kappa)
represents:
the Kappa number, indicating lignin content in pulp
represents:
the Von Kármán constant, describing the velocity profile of turbulent flow
the kappa curve, a two-dimensional algebraic curve
the condition number of a matrix in numerical analysis
the connectivity of a graph in graph theory
curvature
dielectric constant
thermal conductivity (usually a lowercase Latin )
electrical conductivity of a solution
thermal diffusivity
a spring constant (usually a lowercase Latin )
the heat capacity ratio in thermodynamics (usually )
the receptor which dynorphins have the highest affinity for in pharmacology
Einstein gravitational constant
Λλ (lambda)
represents:
the Lebesgue constant (interpolation), a bound for the interpolation error
the von Mangoldt function in number theory
the set of logical axioms in the axiomatic method of logical deduction in first-order logic
the cosmological constant
the lambda baryon
a diagonal matrix of eigenvalues in linear algebra
a lattice
molar conductivity in electrochemistry
Iwasawa algebra
represents:
one wavelength of electromagnetic radiation
the decay constant in radioactivity
function expressions in the lambda calculus
a general eigenvalue in linear algebra
the expected number of occurrences in a Poisson distribution in probability
the arrival rate in queueing theory
the failure rate in reliability engineering
the Lagrange multiplier in mathematical optimization, known as the shadow price in economics
the Lebesgue measure denotes the volume or measure of a Lebesgue measurable set
longitude in geodesy
linear density
ecliptic longitude in astronomy
the Liouville function in number theory
the Carmichael function in number theory
the empty string in formal grammar
a formal system (lambda calculus) in mathematical logic
thermal conductivity
the Lorentz transformation
Μμ (mu)
represents:
the Möbius function in number theory
the population mean or expected value in probability and statistics
a measure in measure theory
micro-, an SI prefix denoting 10−6 (one millionth)
Micrometre or micron (retired in 1967 as a standalone symbol, replaced by "μm" using the standard SI meaning)
the coefficient of friction in physics
the service rate in queueing theory
the dynamic viscosity in physics
magnetic permeability in electromagnetics
a muon
reduced mass
the ion mobility in plasma physics
the Standard gravitational parameter in celestial mechanics
population mean in statistics
chemical potential in thermodynamics
Absolute refractive index of a medium in optics
Absorption coefficient
Amplification factor
Magnetic moment of a dipole
Νν (nu)
represents:
frequency in physics in hertz (Hz)
Poisson's ratio in material science
a neutrino
kinematic viscosity of liquids
stoichiometric coefficient in chemistry
true anomaly in celestial mechanics
degrees of freedom in statistics
the matching number of a graph
the p-adic valuation of a number
Ξξ (xi)
represents:
the original Riemann Xi function, i.e. Riemann's lower case ξ, as denoted by Edmund Landau and currently
the xi baryon
represents:
the original Riemann Xi function
the modified definition of Riemann xi function, as denoted by Edmund Landau
Οο (omicron)
Ππ (pi)
represents:
the product operator in mathematics
a plane
the unary projection operation in relational algebra
osmotic pressure
represents:
Archimedes' constant (more commonly just called Pi), the ratio of a circle's circumference to its diameter
the prime-counting function
the state distribution of a Markov chain
in reinforcement learning, a policy function defining how a software agent behaves for each possible state of its environment
a type of covalent bond in chemistry (pi bond)
a pion (pi meson) in particle physics
in statistics, the population proportion
nucleotide diversity in molecular genetics
in electronics, a special type of small signal model is referred to as a hybrid-pi model
in discrete mathematics, a permutation
Projection
ϖ (a graphic variant, see pomega) represents:
angular frequency of a wave, in fluid dynamics (angular frequency is usually represented by but this may be confused with vorticity in a fluid dynamics context)
longitude of pericenter, in astronomy
comoving distance, in cosmology
Ρρ (rho)
represents:
one of the Gegenbauer functions in analytic number theory (may be replaced by the capital form of the Latin letter P).
represents:
one of the Gegenbauer functions in analytic number theory.
the Dickman-de Bruijn function
the radius in a polar, cylindrical, or spherical coordinate system
the correlation coefficient in statistics
the radius of convergence in real analysis
the sensitivity to interest rate in mathematical finance
density (mass or charge per unit volume; may be replaced by the capital form of the Latin letter D)
resistivity
the shape and reshape operators in APL (in the form ⍴)
the rename operator in relational algebra
the plastic number
Rho meson
Σσς (sigma)
represents:
the summation operator
the covariance matrix
the set of terminal symbols in a formal grammar
Mathematical surface
Sigma baryon
represents:
Stefan–Boltzmann constant in blackbody radiation
the divisor function in number theory
the real part of the complex variable in analytic number theory
the sign of a permutation in the theory of finite groups
the population standard deviation, a measure of spread in probability and statistics
a type of covalent bond in chemistry (sigma bond)
the selection operator in relational algebra
stress in mechanics
electrical conductivity
area density
Cross section
nuclear cross section
surface charge density for microparticles
standard deviation of a random variable in statistics
Spectrum of a matrix
Spin
Ττ (tau)
represents:
torque, the net rotational force in mechanics
the elementary tau lepton in particle physics
a mean lifetime, of an exponential decay or spontaneous emission process
the time constant of any device, such as an RC circuit
proper time in relativity
one turn: the constant ratio of a circle's circumference to its radius, with value (6.283...).
Kendall tau rank correlation coefficient, a measure of rank correlation in statistics
Ramanujan's tau function in number theory
shear stress in continuum mechanics
a type variable in type theories, such as the simply typed lambda calculus
path tortuosity in reservoir engineering
in topology, a given topology
the tau in biochemistry, a protein associated to microtubules
the number of divisors of highly composite numbers
precision (), the reciprocal of variance, in statistics
ϒυ (upsilon)
(U+03D2) represents:
the upsilon meson
Φφ (phi)
represents:
the work function in physics; the energy required by a photon to remove an electron from the surface of a metal
magnetic flux or electric flux
the cumulative distribution function of the normal distribution in statistics
phenyl functional group in organic chemistry (pseudoelement symbol)
the reciprocal of the golden ratio (represented by , below), also represented as
the value of the integration of information in a system (based on integrated information theory)
Geopotential
Alternative symbol for a wave function in quantum mechanics
Note: The empty set symbol ∅ looks similar, but is unrelated to the Greek letter.
or represents:
the golden ratio 1.618... in mathematics, art, and architecture
Euler's totient function in number theory
the argument of a complex number in mathematics
the value of a plane angle in physics and mathematics
the angle to the z axis in spherical coordinates (mathematics)
epoch or phase difference between two waves or vectors
the angle to the x axis in the xy-plane in spherical or cylindrical coordinates (physics)
latitude in geodesy
radiant flux
neutron flux
Potential energy
electric potential
a scalar field in quantum field theory
the probability density function of the normal distribution in statistics
the Veblen functions
Χχ (chi)
represents:
the chi distribution in statistics ( is the more frequently encountered chi-squared distribution)
the chromatic number of a graph in graph theory
the Euler characteristic in algebraic topology
electronegativity in the periodic table
the Fourier transform of a linear response function
a character in mathematics; especially a Dirichlet character in number theory
sometimes the mole fraction
a characteristic or indicator function in mathematics
the magnetic susceptibility of a material in physics
the fission neutron energy spectrum in neutron transport
Ψψ (psi)
represents:
water potential
a quaternary combinator in combinatory logic
a symbol for psychology
represents:
the wave function in the Schrödinger equation of quantum mechanics
the J/psi mesons in particle physics
the stream function in fluid dynamics
the reciprocal Fibonacci constant
the second Chebyshev function in number theory
the polygamma function in mathematics
the supergolden ratio
Ωω (omega)
represents:
Absolute Infinity
the SI unit measure of electrical resistance, the ohm
the right ascension of the ascending node (RAAN) or Longitude of the ascending node in astronomy and orbital mechanics
the omega constant 0.5671432904097838729999686622...
an asymptotic lower bound notation related to big O notation
in probability theory and statistical mechanics, the support
a solid angle
the omega baryon
the arithmetic function counting a number's prime factors counted with multiplicity
the density parameter in cosmology
the first uncountable ordinal (also written as ω1)
Chaitin's constant for a given computer program
represents:
angular velocity / radian frequency (rad/sec)
the argument of periapsis in astronomy and orbital mechanics
a complex cube root of unity — the other is — (used to describe various ways of calculating the discrete Fourier transform)
the differentiability class (i.e. ) for functions that are infinitely differentiable because they are complex analytic
the first infinite ordinal
the omega meson
the set of natural numbers in set theory (although or N is more common in other areas of mathematics)
an asymptotic dominant notation related to big O notation
in probability theory, a possible outcome of an experiment
the arithmetic function counting a number's distinct prime factors
the symbol ϖ, a graphic variant of π, is sometimes construed as omega with a bar over it; see π
the unsaturated fats nomenclature in biochemistry (e.g. ω−3 fatty acids)
the first uncountable ordinal (also written as Ω)
the clique number (number of vertices in a maximum clique) of a graph in graph theory
See also
Blackboard bold letters used in mathematics
English pronunciation of Greek letters
List of mathematical uses of Latin letters
List of letters used in mathematics and science
Glossary of mathematical symbols
Mathematical Alphanumeric Symbols (a Unicode block)
Mathematical notation
greek symbols
References
External links
A pronunciation guide with audio
Greek alphabet letters onclick copy paste |
The 14th Congress of Deputies is the current meeting of the Congress of Deputies, the lower house of the Spanish , with the membership determined by the results of the general election held on 10 November 2019. The congress met for the first time on 3 December 2019. According to the Constitution of Spain the maximum legislative term of the congress is 4 years from the preceding election.
Election
The 14th Spanish general election under the 1978 Constitution was held on 10 November 2019. It saw the Spanish Socialist Workers' Party (PSOE) remaining the largest party in the Congress of Deputies, but falling short of a majority.
History
The new congress met for the first time on 3 December 2019 and after two rounds of voting Meritxell Batet (PSOE) was elected as President of the Congress of Deputies with the support of the Unidos Podemos–En Comú Podem (UP–ECP) and various nationalist and regionalist parties.
Other members of the Bureau of the Congress of Deputies were also elected on 21 May 2019: Alfonso Rodríguez (PSOE), First Vice-President; Ana Pastor (PP), Second Vice-President; Gloria Elizo (UP), Third Vice-President; Ignacio Gil (Vox), Fourth Vice-President; Gerardo Pisarello (ECP), First Secretary; Sofía Hernanz (PSOE), Second Secretary; Javier Sánchez (UP), Third Secretary; and Adolfo Suárez (PP), Fourth Secretary.
Government
Shortly after the election the PSOE and Unidas Podemos–En Comú Podem agreed to form a coalition government, the first in Spain since the restoration of democracy. Caretaker Prime Minister Pedro Sánchez (PSOE) was re-elected narrowly in January 2020 with the support of the UP–ECP and various nationalist and regionalist parties.
Deaths, resignations and expulsions
The 14th congress has seen the following deaths, resignations and expulsions:
13 January 2020 – Beatriz Corredor (PSOE) resigned for personal reasons. She was replaced by Isaura Leal (PSOE) on 4 February 2020.
15 January 2020 – Dolores Delgado (PSOE) resigned after being appointed Attorney General of Spain. She was replaced by Omar Anguita (PSOE) on 4 February 2020.
21 January 2020 – Héctor Illueca (UP) and Francisco Salazar (PSOE) resigned after being appointed Director of the Labour Inspesctorate and deputy chief of staff of the government respectively. They were replaced by Rosa Medel (UP) and José Losada (PSOE) respectively on 4 February 2020.
22 January 2020 – Elena Máñez (PSOE) resigned after being appointed Minister of Economy, Research and Employment of the Canary Islands. She was replaced by Juan Fuentes (PSOE) on 4 February 2020.
27 January 2020 – Francisco Polo (PSOE) resigned after being appointed High Commissioner for a Entrepreneurial Nation. He was replaced by Sonia Guerra (PSOE) on 4 February 2020.
29 January 2020 – José Guirao (PSOE) resigned to return to cultural management and María Rosell (UP) resigned after being appointed government delegate against gender violence. They were replaced by Indalecio Gutiérrez (PSOE) and Meri Pita (UP) respectively on 4 February 2020.
11 February 2020 – José Manuel Franco (PSOE), José Javier Izquierdo (PSOE) and María Marrodán (PSOE) resigned after being appointed government delegates in the Community of Madrid, Castile and León and La Rioja respectively. They were replaced by Rafael Vélez (PSOE), Julio del Valle (PSOE) and Raquel Pedraja (PSOE) respectively.
21 February 2020 - Isabel Celaá, Fernando Grande-Marlaska, Reyes Maroto, José Montilla Martos, Luis Planas, Teresa Ribera, Margarita Robles, Juan Carlos Campo, Pedro Saura (PSOE) resigned as Deputies to focus on their minister or junior minister positions. They were replaced by Daniel Senderos, Gemma Araujo, Gema López, Inmaculada Oria, Antonio Hurtado Zurera, Julio Navalpotro, Manuel Arribas, José Ramón Ortega and Carmen Baños respectively.
13 March 2020 - Pablo Arangüena and Marina Ortega (PSOE) resigned to run in the 2020 Galician regional election. They were replaced by Diego Taibo and Uxía Tizón respectively.
21 May 2020 - Marcos de Quinto (Cs) resigned. He was replaced by Miguel Ángel Gutiérrez.
15 July 2020 - Isabel García Tejerina (PP) resigned. She was replaced by Gabriel Elorriaga.
12 November 2020 - Carlos Fernández-Roca (Vox) resigned. He was replaced by Mercedes Jara.
31 January 2021 - María Pilar Ramallo (PP) resigned to focus in her job as mayor of Marín, Pontevedra. She was replaced by Juan Manuel Constenla.
4 March 2021 - Jaume Alonso-Cuevillas (JxCat) resigned after being elected to the Parliament of Catalonia in the 2021 Catalan regional election. He was replaced by Josep Pagès.
11 March 2021 - Laura Borràs (JxCat) and Ignacio Garriga (Vox) resigned after being elected to the Parliament of Catalonia in the 2021 Catalan regional election. They were replaced by Pilar Calvo and Juan Carlos Segura respectively.
26 March 2021 - Pablo Iglesias Turrión (UP) resigned in order to run for President of the Community of Madrid in the 2021 Madrilenian regional election, he was replaced by Mercedes Pérez Merino. Marta Martín Llaguno (Cs) resigned, she was replaced by Juan Ignacio López-Bas.
4 May 2021 - Joan Josep Nuet (ERC) was expelled following a debarment procedure from the Supreme Court of Spain. He was replaced by Gerard Álvarez i García.
8 June 2021 - María Márquez Guerrero (UP) resigned and was replaced by Miguel Ángel Bustamante Martín.
27 July 2021 - Pilar Cancela Rodríguez (PSOE) resigned after being named secretary of State of International Cooperation. She was replaced by Natividad González Laso.
5 October 2021 - Noelia Vera (UP) resigned and retired from politics, and was replaced by Juan Antonio Delgado Ramos.
22 October 2021 - Alberto Rodríguez (UP) was expelled following a debarment procedure from the Supreme Court of Spain. No other UP candidate took his seat, remaining vacant in protest for the ruling.
30 November 2021 - Teresa Jiménez-Becerril (PP) resigned when appointed associate to the Spanish Ombudsman. She was replaced by Ricardo Tarno.
28 March 2022 - Manuel Gabriel González Ramos (PSOE) resigned when appointed to the board of directors of Enagás. He was replaced by José Carlos Díaz Rodríguez.
4 April 2022 - Pablo Casado (PP), leader of the opposition, resigned after a party rebellion against him. He was replaced by Percival Manglano.
21 April 2022 - Pablo Montesinos (PP) resigned in solidarity with former party leader Pablo Casado. He was replaced by Ángel Luis González Muñoz.
27 June 2022 - Macarena Olona (Vox) and Juan Antonio Delgado Ramos (UP) resigned after being elected to the Parliament of Andalusia in the 2022 Andalusian regional election. They were replaced by Onofre Miralles and José Luis Bueno Pinto respectively.
30 June 2022 - Pedro Quevedo (NC) resigned. He was replaced by María Fernández Pérez.
26 July 2022 - Carolina España (PP) resigned after being appointed Finance Minister of the Regional Government of Andalusia. She was replaced by Isabel Gema Pérez Recuerda.
27 July 2022 - María José García-Pelayo Jurado (PP) resigned after being appointed Senator. She was replaced by José Ignacio Romaní.
18 October 2022 - Magdalena Valerio (PSOE) resigned after being appointed President of the Spanish Council of State. She was replaced by Aurelio Zapata Simón.
18 November 2022 - Miguel Ángel Bustamante (UP) resigned after being indicted of domestic violence; he was replaced by Ezequiel García Nieto.
5 December 2022 - Adolfo Suárez Illana (PP) retired from politics. He was replaced by Miguel Ángel Quintanilla Navarro.
1 February 2023 - Odón Elorza (PSOE) resigned. He was replaced by María Luisa García Gurrutxaga.
14 February 2023 - Juan Bernardo Fuentes Curbelo (PSOE), nicknamed Tito Berni, resigned after being involved in a corruption scandal. He was replaced by José Francisco Duque.
17 March 2023 - Teodoro García Egea, right-hand man of former PP leader Pablo Casado, resigned. He was replaced by Antonia López Moya.
Members
See also
14th Cortes Generales
14th Senate of Spain
Notes
References
2019 establishments in Spain
Congress of Deputies (Spain)
Spain |
```javascript
/*
Myrtille: A native HTML4/5 Remote Desktop Protocol client.
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/*****************************************************************************************************************************************************************************************************/
/*** Touchscreen ***/
/*****************************************************************************************************************************************************************************************************/
function Touchscreen(base, config, dialog, display, network, user)
{
this.init = function()
{
try
{
user.addListener('touchmove', function(e) { touchMove(e); }, user.getPassiveEventListeners() ? { passive: true } : false);
user.addListener('touchstart', function(e) { touchTap(e, 1); }, user.getPassiveEventListeners() ? { passive: true } : false);
user.addListener('touchend', function(e) { touchTap(e, 0); }, user.getPassiveEventListeners() ? { passive: true } : false);
}
catch (exc)
{
dialog.showDebug('touchscreen init error: ' + exc.message);
throw exc;
}
};
function processEvent(e)
{
if (e == null)
e = window.event;
if (e == null)
return false;
if (!setTouchPosition(e))
return false;
return true;
}
function setTouchPosition(e)
{
var scrollLeft = (document.documentElement.scrollLeft ? document.documentElement.scrollLeft : document.body.scrollLeft);
var scrollTop = (document.documentElement.scrollTop ? document.documentElement.scrollTop : document.body.scrollTop);
//dialog.showDebug('browser width: ' + display.getBrowserWidth() + ', height: ' + display.getBrowserHeight());
//dialog.showDebug('scroll left: ' + scrollLeft + ', top: ' + scrollTop);
//dialog.showDebug('horizontal offset: ' + display.getHorizontalOffset() + ', vertical: ' + display.getVerticalOffset());
if (e.touches[0])
{
touchX = Math.round(e.touches[0].pageX ? e.touches[0].pageX : e.touches[0].clientX + scrollLeft) - display.getHorizontalOffset();
touchY = Math.round(e.touches[0].pageY ? e.touches[0].pageY : e.touches[0].clientY + scrollTop) - display.getVerticalOffset();
}
//dialog.showDebug('touch X: ' + touchX + ', Y: ' + touchY);
if (touchX < 0 || touchY < 0 || touchX > display.getBrowserWidth() + scrollLeft - display.getHorizontalOffset() || touchY > display.getBrowserHeight() + scrollTop - display.getVerticalOffset())
{
//dialog.showDebug('touch out of bounds, ignoring');
return false;
}
//dialog.showDebug('*************************');
return true;
}
/*************************************************************************************************************************************************************************************************/
/*** Move ***/
/*************************************************************************************************************************************************************************************************/
// last touch position
var lastTouchX = null;
var lastTouchY = null;
// current touch position
var touchX;
var touchY;
// touch move sampling (same mechanism as mouse)
var touchMoveCount = 0;
function touchMove(e)
{
try
{
//dialog.showDebug('touch move');
if (!processEvent(e))
return false;
// the touch move event can be fired repeatedly if there is an external application stealing the focus to the browser (i.e.: windows task manager, fiddler, etc. on a 1 sec interval)
// when the browser gets the focus back, it fires a touch move event...
// so, if the touch didn't moved since last call, exit
if (lastTouchX != null && lastTouchY != null && lastTouchX == touchX && lastTouchY == touchY)
{
//dialog.showDebug('touch move repeated, ignoring');
return false;
}
// detect gestures (simple swipe for now, may evolve into more advanced gestures)
var gesture = false;
var xDiff;
var yDiff;
if (user.getVerticalSwipeEnabled())
{
xDiff = lastTouchX - touchX;
yDiff = lastTouchY - touchY;
// horizontal move is more significant than vertical
if (Math.abs(xDiff) > Math.abs(yDiff))
{
if (xDiff > 0)
{
//dialog.showDebug('left swipe');
}
else
{
//dialog.showDebug('right swipe');
}
}
else
{
if (yDiff > 0)
{
//dialog.showDebug('up swipe');
}
else
{
//dialog.showDebug('down swipe');
}
// handle gestures
gesture = true;
}
}
touchMoveCount++;
var send = true;
if (!gesture)
{
// sampling (same mechanism as mouse)
if (config.getMouseMoveSamplingRate() == 5 ||
config.getMouseMoveSamplingRate() == 10 ||
config.getMouseMoveSamplingRate() == 20 ||
config.getMouseMoveSamplingRate() == 25 ||
config.getMouseMoveSamplingRate() == 50)
{
send = touchMoveCount % (100 / config.getMouseMoveSamplingRate()) == 0;
}
// sampling debug: display a dot at the current touch move position (green: move sent, red: dropped) - only if canvas is enabled
/*
if (config.getDebugEnabled() && config.getDisplayMode() == config.getDisplayModeEnum().CANVAS)
{
display.getCanvas().getCanvasContext().fillStyle = send ? '#00FF00' : '#FF0000';
display.getCanvas().getCanvasContext().fillRect(touchX, touchY, 1, 1);
}
*/
if (send)
{
user.triggerActivity();
sendEvent(base.getCommandEnum().SEND_MOUSE_MOVE.text + touchX + '-' + touchY); // same event as mouse move
}
}
else
{
user.triggerActivity();
// cancel the touch tap preceding the gesture
// replace it by a touch move to set the gesture initial position
if (touchTapTimeout != null)
{
//dialog.showDebug('cancelling touch tap');
window.clearTimeout(touchTapTimeout);
touchTapTimeout = null;
touchTapCancelled = true;
sendEvent(base.getCommandEnum().SEND_MOUSE_MOVE.text + lastTouchTapX + '-' + lastTouchTapY);
}
else
{
// sample touch gestures to avoid sending too many mouse wheel events and thus scrolling too fast
// some browsers may support a finer touch definition; this is the case of firefox compared to chrome (!)
send = touchMoveCount % (display.isFirefoxBrowser() ? 10 : 5) == 0;
// sampling debug: display a dot at the current touch move position (green: move sent, red: dropped) - only if canvas is enabled
/*
if (config.getDebugEnabled() && config.getDisplayMode() == config.getDisplayModeEnum().CANVAS)
{
display.getCanvas().getCanvasContext().fillStyle = send ? '#00FF00' : '#FF0000';
display.getCanvas().getCanvasContext().fillRect(touchX, touchY, 1, 1);
}
*/
if (send)
{
if (yDiff > 0)
{
// scroll down
sendEvent(base.getCommandEnum().SEND_MOUSE_WHEEL_DOWN.text + lastTouchTapX + '-' + lastTouchTapY);
}
else
{
// scroll up
sendEvent(base.getCommandEnum().SEND_MOUSE_WHEEL_UP.text + lastTouchTapX + '-' + lastTouchTapY);
}
}
}
}
// update the last touch position
lastTouchX = touchX;
lastTouchY = touchY;
}
catch (exc)
{
dialog.showDebug('touchscreen move error: ' + exc.message);
}
user.cancelEvent(e);
return false;
}
/*************************************************************************************************************************************************************************************************/
/*** Tap ***/
/*************************************************************************************************************************************************************************************************/
// last touch tap position
var lastTouchTapX = null;
var lastTouchTapY = null;
// wait for a potential gesture following a touch tap
// if there is a gesture, the touch tap is cancelled
var touchTapTimeout = null;
var touchTapCancelled = false;
function touchTap(e, start)
{
try
{
//dialog.showDebug('touch tap');
if (touchTapCancelled)
{
//dialog.showDebug('touch tap cancelled');
touchTapCancelled = false;
return false;
}
if (!processEvent(e))
return false;
touchTapTimeout = window.setTimeout(function()
{
user.triggerActivity();
//dialog.showDebug('touch ' + (start ? 'start' : 'end'));
if (user.getRightClickButton() != null && user.getRightClickButton().value == 'Right-Click ON')
{
//dialog.showDebug('emulating mouse right click ' + (start ? 'down' : 'up'));
sendEvent(base.getCommandEnum().SEND_MOUSE_RIGHT_BUTTON.text + start + touchX + '-' + touchY);
if (!start)
{
user.toggleRightClick(user.getRightClickButton());
}
}
else
{
sendEvent(base.getCommandEnum().SEND_MOUSE_LEFT_BUTTON.text + start + touchX + '-' + touchY); // same event as mouse left button
}
}, 250);
// update the last touch tap position
lastTouchTapX = touchX;
lastTouchTapY = touchY;
}
catch (exc)
{
dialog.showDebug('touchscreen tap ' + (start ? 'start' : 'end') + ' error: ' + exc.message);
}
user.cancelEvent(e);
return false;
}
/*************************************************************************************************************************************************************************************************/
/*** Network ***/
/*************************************************************************************************************************************************************************************************/
function sendEvent(touchEvent)
{
if (touchEvent != null)
{
// pass the event to the network
network.processUserEvent('mouse', touchEvent); // same logic as mouse
}
}
}
``` |
```php
<?php
namespace Illuminate\Foundation;
class AliasLoader
{
/**
* The array of class aliases.
*
* @var array
*/
protected $aliases;
/**
* Indicates if a loader has been registered.
*
* @var bool
*/
protected $registered = false;
/**
* The singleton instance of the loader.
*
* @var \Illuminate\Foundation\AliasLoader
*/
protected static $instance;
/**
* Create a new AliasLoader instance.
*
* @param array $aliases
*/
private function __construct($aliases)
{
$this->aliases = $aliases;
}
/**
* Get or create the singleton alias loader instance.
*
* @param array $aliases
* @return \Illuminate\Foundation\AliasLoader
*/
public static function getInstance(array $aliases = [])
{
if (is_null(static::$instance)) {
return static::$instance = new static($aliases);
}
$aliases = array_merge(static::$instance->getAliases(), $aliases);
static::$instance->setAliases($aliases);
return static::$instance;
}
/**
* Load a class alias if it is registered.
*
* @param string $alias
* @return bool|null
*/
public function load($alias)
{
if (isset($this->aliases[$alias])) {
return class_alias($this->aliases[$alias], $alias);
}
}
/**
* Add an alias to the loader.
*
* @param string $class
* @param string $alias
* @return void
*/
public function alias($class, $alias)
{
$this->aliases[$class] = $alias;
}
/**
* Register the loader on the auto-loader stack.
*
* @return void
*/
public function register()
{
if (! $this->registered) {
$this->prependToLoaderStack();
$this->registered = true;
}
}
/**
* Prepend the load method to the auto-loader stack.
*
* @return void
*/
protected function prependToLoaderStack()
{
spl_autoload_register([$this, 'load'], true, true);
}
/**
* Get the registered aliases.
*
* @return array
*/
public function getAliases()
{
return $this->aliases;
}
/**
* Set the registered aliases.
*
* @param array $aliases
* @return void
*/
public function setAliases(array $aliases)
{
$this->aliases = $aliases;
}
/**
* Indicates if the loader has been registered.
*
* @return bool
*/
public function isRegistered()
{
return $this->registered;
}
/**
* Set the "registered" state of the loader.
*
* @param bool $value
* @return void
*/
public function setRegistered($value)
{
$this->registered = $value;
}
/**
* Set the value of the singleton alias loader.
*
* @param \Illuminate\Foundation\AliasLoader $loader
* @return void
*/
public static function setInstance($loader)
{
static::$instance = $loader;
}
/**
* Clone method.
*
* @return void
*/
private function __clone()
{
//
}
}
``` |
```kotlin
package mega.privacy.android.shared.original.core.ui.controls.dialogs.internal
import androidx.compose.foundation.layout.fillMaxWidth
import androidx.compose.foundation.layout.padding
import androidx.compose.material.AlertDialog
import androidx.compose.material.LocalAbsoluteElevation
import androidx.compose.material.MaterialTheme
import androidx.compose.material.Text
import androidx.compose.runtime.Composable
import androidx.compose.runtime.CompositionLocalProvider
import androidx.compose.ui.ExperimentalComposeUiApi
import androidx.compose.ui.Modifier
import androidx.compose.ui.platform.testTag
import androidx.compose.ui.semantics.semantics
import androidx.compose.ui.semantics.testTagsAsResourceId
import androidx.compose.ui.text.font.FontWeight
import androidx.compose.ui.unit.dp
import androidx.compose.ui.window.DialogProperties
import mega.privacy.android.shared.original.core.ui.controls.buttons.TextMegaButton
import mega.privacy.android.shared.original.core.ui.theme.MegaOriginalTheme
import mega.privacy.android.shared.original.core.ui.theme.extensions.conditional
import mega.privacy.android.shared.original.core.ui.utils.composeLet
@Composable
internal fun BaseMegaAlertDialog(
text: String?,
confirmButtonText: String,
cancelButtonText: String?,
onConfirm: () -> Unit,
onDismiss: () -> Unit,
modifier: Modifier = Modifier,
title: String? = null,
onCancel: () -> Unit = onDismiss,
dismissOnClickOutside: Boolean = true,
dismissOnBackPress: Boolean = true,
) = BaseMegaAlertDialog(
content = text?.composeLet {
Text(
text = text,
style = MaterialTheme.typography.subtitle1,
color = MegaOriginalTheme.colors.text.secondary,
modifier = Modifier.testTag(CONTENT_TAG),
)
},
confirmButtonText = confirmButtonText,
cancelButtonText = cancelButtonText,
onConfirm = onConfirm,
onDismiss = onDismiss,
modifier = modifier,
title = title,
onCancel = onCancel,
dismissOnClickOutside = dismissOnClickOutside,
dismissOnBackPress = dismissOnBackPress,
)
@Composable
internal fun BaseMegaAlertDialog(
confirmButtonText: String,
cancelButtonText: String?,
onConfirm: () -> Unit,
onDismiss: () -> Unit,
modifier: Modifier = Modifier,
content: @Composable (() -> Unit)? = null,
title: String? = null,
onCancel: () -> Unit = onDismiss,
dismissOnClickOutside: Boolean = true,
dismissOnBackPress: Boolean = true,
cancelEnabled: Boolean = true,
confirmEnabled: Boolean = true,
) = BaseMegaAlertDialog(
text = content,
buttons = {
AlertDialogFlowRow {
cancelButtonText?.let {
TextMegaButton(
modifier = Modifier.testTag(CANCEL_TAG),
text = cancelButtonText,
onClick = onCancel,
enabled = cancelEnabled
)
}
TextMegaButton(
modifier = Modifier.testTag(CONFIRM_TAG),
text = confirmButtonText,
onClick = onConfirm,
enabled = confirmEnabled
)
}
},
onDismiss = onDismiss,
modifier = modifier,
title = title,
dismissOnClickOutside = dismissOnClickOutside,
dismissOnBackPress = dismissOnBackPress
)
@Composable
internal fun BaseMegaAlertDialog(
text: String,
buttons: @Composable (() -> Unit),
onDismiss: () -> Unit,
modifier: Modifier = Modifier,
title: String? = null,
dismissOnClickOutside: Boolean = true,
dismissOnBackPress: Boolean = true,
) = BaseMegaAlertDialog(
text = {
Text(
text = text,
style = MaterialTheme.typography.subtitle1,
color = MegaOriginalTheme.colors.text.secondary,
modifier = Modifier.testTag(CONTENT_TAG),
)
},
buttons = buttons,
onDismiss = onDismiss,
modifier = modifier,
title = title,
dismissOnClickOutside = dismissOnClickOutside,
dismissOnBackPress = dismissOnBackPress
)
@OptIn(ExperimentalComposeUiApi::class)
@Composable
private fun BaseMegaAlertDialog(
buttons: @Composable (() -> Unit),
onDismiss: () -> Unit,
modifier: Modifier = Modifier,
text: @Composable (() -> Unit)? = null,
title: String? = null,
dismissOnClickOutside: Boolean = true,
dismissOnBackPress: Boolean = true,
) = CompositionLocalProvider(LocalAbsoluteElevation provides 24.dp) {
AlertDialog(
modifier = modifier.semantics { testTagsAsResourceId = true },
backgroundColor = MegaOriginalTheme.colors.background.surface1,
title = title?.composeLet {
Text(
modifier = Modifier
.testTag(TITLE_TAG)
.conditional(text == null) {
// For dialog without text, add padding to the bottom of the title
padding(bottom = 18.dp)
}
.fillMaxWidth(),
text = it,
fontWeight = FontWeight.Medium,
style = MaterialTheme.typography.h6,
color = MegaOriginalTheme.colors.text.primary,
)
},
text = text,
onDismissRequest = onDismiss,
buttons = buttons,
properties = DialogProperties(
dismissOnBackPress = dismissOnBackPress,
dismissOnClickOutside = dismissOnClickOutside,
),
)
}
/**
* Confirm button's test tag
*/
const val CONFIRM_TAG = "mega_alert_dialog:button_confirm"
/**
* Cancel button's test tag
*/
const val CANCEL_TAG = "mega_alert_dialog:button_cancel"
internal const val TITLE_TAG = "mega_alert_dialog:text_title"
internal const val CONTENT_TAG = "mega_alert_dialog:text_content"
internal const val OPTION1_TAG = "mega_alert_dialog:button_option1"
internal const val OPTION2_TAG = "mega_alert_dialog:button_option2"
``` |
The 1986 NCAA basketball tournament was the 62nd season in the Philippine National Collegiate Athletic Association (NCAA). For the fourth time in five years, the Letran Knights have crowned themselves basketball champions in the Seniors division. The Staglets of San Sebastian College beat comebacking San Beda Red Cubs, 2–1, in their own title series for the Junior division championship.
Seniors' tournament
Elimination round
Format:
Tournament divided into two halves: winners of the two halves dispute the championship in a best-of-3 finals series unless:
A team wins both rounds. In that case, the winning team automatically wins the championship.
A third team has a better cumulative record than both finalists. In that case, the third team has to win in a playoff against the team that won the second round to face the team that won in the first round in a best-of-3 finals series.
First round team standings
Second round team standings
Taking the first round pennant was San Sebastian, losing only to Jose Rizal College, 92–93. The Letran Knights dropped two games in the first round to Mapua, 82–84, and San Sebastian, 75–79, and figured in a three-way tie for second place with Mapua Cardinals and Perpetual Help College.
Sophomore quintet Perpetual Help Altas could have sweep the second round if not for the loss to San Sebastian Stags in their last outing. Letran managed to force a tie for first place with the Atlas and a playoff ensued with the Knights winning comfortably, 100–79, to arrange a championship setto with defending champions San Sebastian for the third time in five years.
Letran showed up with only 10 players. Their 11th man Salvador Ramos was disqualified from playing right from the start of the league after it was found out that he had already graduated.
Finals
Letran dictated the tempo early, leading by as many as 13 points in one stage, 46–33. The Knights survived the Stags' spirited rally in the last two minutes to win.
See also
UAAP Season 49 men's basketball tournament
References
External links
www.gameface@bounce past
62
1986 in Philippine basketball |
Slobodan Šnajder (; born 8 July 1948) is a Croatian writer and publicist.
Šnajder was born in 1948 in Zagreb, where he graduated in philosophy and English studies from the Faculty of Philosophy. He was co-founder and editor of the theatre journal Prolog as well as the editor of the editions published by Cekade. His short stories, essays and plays were published since 1966. From January to June 1993, he was a columnist in daily newspaper Glas Slavonije, Osijek, (Reader for the Melancholics), and, since January 1994 till 2013, in a daily newspaper Novi list, Rijeka, (Dangerous Connections). He is a member of the Advisory Board of the left-wing magazine Novi Plamen. His columns and his plays have supporters and opposers.
Although Šnajder has been writing prose since ever, his first full-length novel Morendo was issued in 2012.
Works
The very first professional production of Šnajder was his early play Minigolf – Drama Theatre Gavella, Zagreb, directed by Dino Radojević.
The Croatian National Theatre of Zagreb (HNK) has staged three of his plays, Kamov, smrtopis (Kamov, the Necrography) (1978), Držićev san (Dream of Držić) (1980), both produced by Ljubiša Ristić, and “Nevjesta od vjetra” (Bride of the Wind), staged by Ivica Boban. Kamov, smrtopis was staged in March 2003 by the Zagreb Youths' Theatre (ZKM) in the production of Branko Brezovec.
Dumanske tišine (Silences of a nun) is a play that was staged all over what was Yugoslavia. Another play of him, “Zmijin svlak” (The Snakeskin), about mass-rapings in Bosnian war, was played all over Europe, from Tübingen, Oslo, Warsaw, Kraków, Veroli near Rome (Festival Dionysia), Frankfurt/Main, Dublin, Wien, Kopenhagen, till Belgrade. This happens to be his mostly played text abroad, but not in Croatia.
But there is another play that seems to be much more controversial right from the date it was issued till today: Hrvatski Faust (Croatian Faust). There are certain similarities between debates in the context of Ralph Hochhut’s play “Stellvertreter” and this play of Šnajder. The opening night was in Split, 1982, directed by Dino Radojević. Very soon the play was staged in Varaždin (Petar Veček) and Belgrade (Slobodan Unkovski). But all the ideas to make it in Zagreb, where the events described in the play took place in 1942, under regime of ustaša (Croatian “quislings”), were made impossible from the very first moment. Actually, the play takes into consideration the history of the very theatre itself that in the seventies played two Šnajder's plays.
Šnajder’s Faust-play has something to do with what Germans call “Aufarbeitung der Geschichte” (workup of the history). Something like this is never an easy task, not for Germans, neither for many Croats.
“Croatian Faust” was the first Šnajder’s play of many that was played abroad: in 1987 Roberto Ciulli staged right this play in his Theater a.d. Ruhr. This production was shown everywhere in Germany, in several European countries, and in the USA (Chicago). SAT1 made a special movie-version.
The last production of Šnajder in relative normal circumstances used to be “Bauhaus” (ZKM, directed by Paolo Magelli, at the beginning of 1990). For the next decade Šnajder was excluded from any repertoire and theatre in his native town and land. At the end of 1999 Petar Veček staged Šnajder’s postsocialist grand-guignol “Kod Bijelog labuda” (At the White Swan), again in Varaždin. But Šnajder was played in Europe, because that sort of proscribed censorship could not work outside Croatia. Some productions in Europe, besides “Snakeskin”: “Hrvatski Faust” (Croatian Faust, Burgtheater, Wien, directed by Hans Hollmann), “Utjeha sjevernih mora” (Comfort of the Northern Seas in Frankfurt/Oder, directed by Michael Funke), “Nevjesta od vjetra” (Bride of the Wind, directed by film-maker Werner Schroeter). Miloš Lazin produced Šnajder’s play “Ines & Denise” in French, first in Sarajevo, then his theatre played this title in many French towns. French opening night took place in Villeneuve-les-Avignon in 1997.
A play about Josip Broz Tito, The Bones in Stone, was staged in March 2007 at the National Theatre of Bitola, Republic of Macedonia, directed by Branko Brezovec. In the year 2010 Kruna Tarle made his play written for puppets – Moja draga Tilla! ("My dear Tilla!”. Tilla stays here for the German actress Tilla Durieux who emigrated to Kingdom of Yugoslavia between the wars). That was a coproduction of Zagreb Puppet Theatre and Hfs Ernst Busch, German Academy for puppet-theatre from Berlin. German team made their own version, the opening nights took place in Leverkusen, after that in Berlin.
His most recent plays are: Enciklopedija izgubljenog vremena (Encyclopaedia of the Wasted Time, which is some sort of post-socialist Jedermann (Everyman), that is to say a sort of ‘transitional’ miracle-play), and Kako je Dunda spasila domovinu (How Dunda Managed to Save Her Country), based on motives of Maupassant.
Encyclopaedia of the Wasted Time was awarded by The Royal Theatre in Cetinje, Montenegro, 2009.
For more than eighteen years Šnajder has been writing weekly political columns, first in Glas Slavonije, daily newspaper issued in Osijek, Croatia, under the title “Početnica za melankolike” (Reader for Melancholics), further on in “Novi list”, issued in Rijeka. These are symbolically entitled Opasne veze (Les Liaisons dangereuses, after de Laclos). The selection covering the columns written until 1999 was published in the book Kardinalna greška (Cardinal Mistake), while the ones published from 1999 to mid-2004 are collected in another book - Umrijeti pod zvijezdom (To Die Under the Star).
Slobodan Šnajder is signatory of the Declaration on the Common Language of the Croats, Serbs, Bosniaks and Montenegrins within the project Languages and Nationalisms (Jezici i nacionalizmi). The declaration is against political separation of four Serbo-Croatian standard variants that leads to a series of negative social, cultural and political phenomena in which linguistic expression is enforced as a criterion of ethno-national affiliation and as a means of political loyalty in successor states of former Yugoslavia.
Bibliography
Kamov (Cekade, Zagreb 1978)
Hrvatski Faust (Cekade, Zagreb 1981)
Glasi iz Dubrave (Cekade, Zagreb 1986)
Der kroatische Faust (Theater heute, 6), Berlin 1987
Radosna apokalipsa (IC Rijeka, Rijeka 1988)
Kroatischer Faust (Burgtheater, Vienna 1993)
Utjeha sjevernih mora (Durieux, Zagreb 1996)
Knjiga o sitnom (Konzor, Zagreb 1996)
Skora weza (Dialog, 9) Warszawa 1997
Snakeskin, Performing Arts Journal, Cambridge, Massachusetts, vol. XX. No 3/1998
Schlangenhaut (Theater heute, 12), Berlin 1999
Kardinalna greška (Novi list – Adamić, Rijeka 1999)
La dépouille du serpent, (L'espace d'un instant, Paris 2002)
Umrijeti pod zvijezdom (Novi list – Adamić, Rijeka 2005)
Knjiga o sitnom - proza i dramoleti (Prometej, Zagreb 2005)
Kaspariana – eseji (Prometej, Zagreb 2005)
Smrtopis – drame (Prometej, Zagreb 2005)
Početnica za melankolike – proza (Prometej, Zagreb 2006)
Radosna apokalipsa - eseji i kritike (Prometej, Zagreb 2006)
Bosanske drame (Prometej, Zagreb 2006)
Боснійські драми (Bosniysky dramy, in Ukrainian, translated by Alla Tatarenko, Видавництво Анетти Антоненко, Lviv 2021)
505 sa crtom (Profil International, Zagreb 2007)
San o mostu (Prometej, Zagreb 2007)
Neka gospođica B. (Prometej, Zagreb 2007)
Faustova oklada (Prometej, Zagreb 2007)
Morendo, novel (Profil International, Zagreb 2011)
Hrvatski Faust i drugi drami (in Macedonian, selected and translated by Jelena Lužina), Blesok, Skopje 2011)
Le Cinquième évangile (L'espace d'un instant, Pariz 2012)
Tri pjesi (in Russian, selected by Larisa Saveljeva, translated by Natalija Vagapova and Larisa Saveljeva, Tri kvadrata, Moscow, 2012)
Umrijeti u Hrvatskoj : pet eseja (Fraktura, Zagreb 2019),
Doba mjedi (TIM press, Zagreb 2015)
2nd edition(TIM press, Zagreb 2016)
3rd edition (TIM press, Zagreb 2018)
4th Croatian and 1st Serbian edition (Akademska knjiga, Novi Sad 2021)
5 th edition (Fraktura, Zagreb 2022)
Doba brona (in Slovenian, translated by Sonja Polanc, V.B.Z. Ljubljana, Ljubljana 2017)
Исцелување на светот (Isceluvanje na svetot - in Macedonian, translated by Vladimir Jankovski, Antolog, Skopje 2018)
Reparatur der Welt (in German, translated by Mirjana Wittmann and Klaus Wittmann, Paul Zsolnay Verlag, Wien 2019)
La riparazione del mondo (in Italian, translated by Alice Parmeggiani, Solferino, *Milano 2019)
De reparatie van de wereld (in Dutch, translated by Roel Schuyt, Uitgeverij Wereldbibliotheek, Amsterdam 2020)
Мідна доба (Mydna doba, in Ukrainian, translated by Andriy Lyubka, НОРА-ДРУК, Kyiv 2021)
Rézkorszak (in Hungarian, translated by Csordás Gábor, Vince Kiadó, Budapest 2022)
Literary awards
How Dunda saved Her Country (2008) - Croatian National Award for Plays "Marin Držić"
The Encyclopaedia of the Wasted Time (2009) - Award of the Royal Theatre, Cetinje, Montenegro; Croatian National Award for Plays "Marin Držić"
Doba mjedi (2016)- Meša Selimović Literary Award
Doba mjedi (2016) - Radomir Konstantinović Literary Award
Doba mjedi (2016) - Mirko Kovač Literary Award
Doba mjedi (2016) - roman@tportal.hr Literary Award
Doba mjedi (2016) - “Kočić's feather“ Literary Award
Umrijeti u Hrvatskoj : pet eseja (2019) - Višnja Machiedo Literary Award
See also
Novi list
Novi Plamen
References
External links
1948 births
Living people
Writers from Zagreb
Croatian dramatists and playwrights
Faculty of Humanities and Social Sciences, University of Zagreb alumni
Croatian novelists
Signatories of the Declaration on the Common Language |
```objective-c
//===- LiveIntervalUnion.h - Live interval union data struct ---*- C++ -*--===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
//
// LiveIntervalUnion is a union of live segments across multiple live virtual
// registers. This may be used during coalescing to represent a congruence
// class, or during register allocation to model liveness of a physical
// register.
//
//===your_sha256_hash------===//
#ifndef LLVM_CODEGEN_LIVEINTERVALUNION_H
#define LLVM_CODEGEN_LIVEINTERVALUNION_H
#include "llvm/ADT/IntervalMap.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/CodeGen/LiveInterval.h"
#include "llvm/CodeGen/SlotIndexes.h"
#include <cassert>
#include <limits>
namespace llvm {
class raw_ostream;
class TargetRegisterInfo;
#ifndef NDEBUG
// forward declaration
template <unsigned Element> class SparseBitVector;
using LiveVirtRegBitSet = SparseBitVector<128>;
#endif
/// Union of live intervals that are strong candidates for coalescing into a
/// single register (either physical or virtual depending on the context). We
/// expect the constituent live intervals to be disjoint, although we may
/// eventually make exceptions to handle value-based interference.
class LiveIntervalUnion {
// A set of live virtual register segments that supports fast insertion,
// intersection, and removal.
// Mapping SlotIndex intervals to virtual register numbers.
using LiveSegments = IntervalMap<SlotIndex, const LiveInterval *>;
public:
// SegmentIter can advance to the next segment ordered by starting position
// which may belong to a different live virtual register. We also must be able
// to reach the current segment's containing virtual register.
using SegmentIter = LiveSegments::iterator;
/// Const version of SegmentIter.
using ConstSegmentIter = LiveSegments::const_iterator;
// LiveIntervalUnions share an external allocator.
using Allocator = LiveSegments::Allocator;
private:
unsigned Tag = 0; // unique tag for current contents.
LiveSegments Segments; // union of virtual reg segments
public:
explicit LiveIntervalUnion(Allocator &a) : Segments(a) {}
// Iterate over all segments in the union of live virtual registers ordered
// by their starting position.
SegmentIter begin() { return Segments.begin(); }
SegmentIter end() { return Segments.end(); }
SegmentIter find(SlotIndex x) { return Segments.find(x); }
ConstSegmentIter begin() const { return Segments.begin(); }
ConstSegmentIter end() const { return Segments.end(); }
ConstSegmentIter find(SlotIndex x) const { return Segments.find(x); }
bool empty() const { return Segments.empty(); }
SlotIndex startIndex() const { return Segments.start(); }
SlotIndex endIndex() const { return Segments.stop(); }
// Provide public access to the underlying map to allow overlap iteration.
using Map = LiveSegments;
const Map &getMap() const { return Segments; }
/// getTag - Return an opaque tag representing the current state of the union.
unsigned getTag() const { return Tag; }
/// changedSince - Return true if the union change since getTag returned tag.
bool changedSince(unsigned tag) const { return tag != Tag; }
// Add a live virtual register to this union and merge its segments.
void unify(const LiveInterval &VirtReg, const LiveRange &Range);
// Remove a live virtual register's segments from this union.
void extract(const LiveInterval &VirtReg, const LiveRange &Range);
// Remove all inserted virtual registers.
void clear() { Segments.clear(); ++Tag; }
// Print union, using TRI to translate register names
void print(raw_ostream &OS, const TargetRegisterInfo *TRI) const;
#ifndef NDEBUG
// Verify the live intervals in this union and add them to the visited set.
void verify(LiveVirtRegBitSet& VisitedVRegs);
#endif
// Get any virtual register that is assign to this physical unit
const LiveInterval *getOneVReg() const;
/// Query interferences between a single live virtual register and a live
/// interval union.
class Query {
const LiveIntervalUnion *LiveUnion = nullptr;
const LiveRange *LR = nullptr;
LiveRange::const_iterator LRI; ///< current position in LR
ConstSegmentIter LiveUnionI; ///< current position in LiveUnion
SmallVector<const LiveInterval *, 4> InterferingVRegs;
bool CheckedFirstInterference = false;
bool SeenAllInterferences = false;
unsigned Tag = 0;
unsigned UserTag = 0;
// Count the virtual registers in this union that interfere with this
// query's live virtual register, up to maxInterferingRegs.
unsigned collectInterferingVRegs(unsigned MaxInterferingRegs);
// Was this virtual register visited during collectInterferingVRegs?
bool isSeenInterference(const LiveInterval *VirtReg) const;
public:
Query() = default;
Query(const LiveRange &LR, const LiveIntervalUnion &LIU)
: LiveUnion(&LIU), LR(&LR) {}
Query(const Query &) = delete;
Query &operator=(const Query &) = delete;
void reset(unsigned NewUserTag, const LiveRange &NewLR,
const LiveIntervalUnion &NewLiveUnion) {
LiveUnion = &NewLiveUnion;
LR = &NewLR;
InterferingVRegs.clear();
CheckedFirstInterference = false;
SeenAllInterferences = false;
Tag = NewLiveUnion.getTag();
UserTag = NewUserTag;
}
void init(unsigned NewUserTag, const LiveRange &NewLR,
const LiveIntervalUnion &NewLiveUnion) {
if (UserTag == NewUserTag && LR == &NewLR && LiveUnion == &NewLiveUnion &&
!NewLiveUnion.changedSince(Tag)) {
// Retain cached results, e.g. firstInterference.
return;
}
reset(NewUserTag, NewLR, NewLiveUnion);
}
// Does this live virtual register interfere with the union?
bool checkInterference() { return collectInterferingVRegs(1); }
// Vector generated by collectInterferingVRegs.
const SmallVectorImpl<const LiveInterval *> &interferingVRegs(
unsigned MaxInterferingRegs = std::numeric_limits<unsigned>::max()) {
if (!SeenAllInterferences || MaxInterferingRegs < InterferingVRegs.size())
collectInterferingVRegs(MaxInterferingRegs);
return InterferingVRegs;
}
};
// Array of LiveIntervalUnions.
class Array {
unsigned Size = 0;
LiveIntervalUnion *LIUs = nullptr;
public:
Array() = default;
~Array() { clear(); }
// Initialize the array to have Size entries.
// Reuse an existing allocation if the size matches.
void init(LiveIntervalUnion::Allocator&, unsigned Size);
unsigned size() const { return Size; }
void clear();
LiveIntervalUnion& operator[](unsigned idx) {
assert(idx < Size && "idx out of bounds");
return LIUs[idx];
}
const LiveIntervalUnion& operator[](unsigned Idx) const {
assert(Idx < Size && "Idx out of bounds");
return LIUs[Idx];
}
};
};
} // end namespace llvm
#endif // LLVM_CODEGEN_LIVEINTERVALUNION_H
``` |
Follmer, Clogg and Company Umbrella Factory, also known as Van Sciver Building, is a historic factory building located at Lancaster, Lancaster County, Pennsylvania. It was built between about 1880 and 1905, and is a "U"-shaped, brick complex measuring approximately 144 feet by 250 feet. It housed Follmer, Clogg and Company, a manufacturer of umbrellas and parachutes, until the 1940s. In 1944, it was acquired by the Van Sciver Furniture Company and housed a furniture store, warehouse, and repair shop until 1982.
It was listed on the National Register of Historic Places in 1986.
References
Industrial buildings and structures on the National Register of Historic Places in Pennsylvania
Industrial buildings completed in 1905
Buildings and structures in Lancaster, Pennsylvania
National Register of Historic Places in Lancaster, Pennsylvania
1905 establishments in Pennsylvania |
The Zhou Yongjun incident was a political controversy which involved the rendition of Zhou Yongjun (), a former student activist during the 1989 Tiananmen Square protests and massacre, by the Hong Kong authorities to the People's Republic of China. Zhou attempted to enter Hong Kong from the United States via Macau using a forged Malaysian passport. Zhou's supporters alleged the renditioning to be illegal, and his lawyer, Democratic Party chairman Albert Ho, described Zhou's case as "posing the biggest challenge to the one country, two systems principle laid down in the Basic Law." The Government of Hong Kong refused to comment on individual cases, and the People's Republic of China said Zhou was detained on several charges, including one of financial fraud.
Background on Zhou
Zhou was a student at the China University of Political Science and Law at the time of the student protests and ensuing military crackdown on 4 June 1989. He was among a group of students who were photographed kneeling in front of the Great Hall of the People on 22 April that year to present a list of demands to China's leaders after the death of Hu Yaobang.
Zhou was arrested and held for two years in prison for his role in the protests. He subsequently lost his enrolment status as a student as well as his family registration as a Beijing resident. In 1992, Zhou fled to Hong Kong and then travelled to the United States, where he was granted resident's status. His first attempt to re-enter China was in 1998, but he was caught and sentenced to three years of administrative detention in a re-education-through-labour camp. After his release, he again left in 2002 for the United States.
The incident
Illegal entry into Hong Kong
Zhou made a second attempt to reenter mainland China on 28 September 2008, but he was intercepted by immigration department officials at the Hong Kong Macau Ferry Terminal, on suspicion of entering Hong Kong using a counterfeited travel document. He had travelled from the United States to Macao, using a Malaysian passport purchased from a travel agent in Los Angeles. The passport was in the name of Wang Xingxiang, a known alias of Zhong Gong leader Zhang Hongbao. He had repeatedly been denied requests for an official permit to return to China by the Chinese authorities. Zhou was on his way to Sichuan to visit his ailing father. Zhou was documented in Sichuan saying he was detained on arrival in Hong Kong and then secretly handed over to Shenzhen authorities two days later. Lawyer Li Jinjin said Zhou was initially held at the No.1 Detention Center in the southern city of Shenzhen, and later transferred to the Shenzhen Yantian Detention Center. In May 2009, seven months after his arrest, Zhou's family was notified that he had been detained by Sichuan authorities on fraud charges. The indictment by prosecutors in Shehong county stated Zhou used the alias of Wang Xingxiang, and attempted to transfer money from an account at Hang Seng Bank in Hong Kong to two banks, in the city and in Australia.
His lawyer, pan-democrat legislator Albert Ho, held a press conference on 12 October 2009 during which he said his client was picked up by immigration officers, put into a van and driven across the border to mainland China against his will. Ho said that normal protocol would be to send him back to his place of origin, which in this case would be Macau or the United States. Furthermore, Ho noted that there was no agreement with the mainland on extradition, and demanded that the Hong Kong government explain why Zhou was handed over to Shenzhen authorities; he appealed to Chief Executive Donald Tsang to make available police records of the incident and to press for Zhou's release. The Hong Kong Government, speaking only in general terms, said in an official statement that "a passenger whose travel document does not meet the entry requirements will be repatriated to his or her place of embarkation or origin."
The trial
Zhou was tried in Shehong, and was sentenced to nine years in jail for a fraud attempted in Hong Kong. The Times remarked that "details of the charges against Zhou are vague, as is common in China’s opaque legal system." Wang Xingxiang, the name in Zhou's bogus passport, was placed on a money laundering watch list following a complaint by the Hang Seng Bank received a suspicious request to transfer HK$6 million out of an account registered in that name. The transfer was not completed as the signature on the transfer form did not match that of the account signatory.
After Zhou was sentenced, Secretary for Security, Ambrose Lee, rejected accusations the government knowingly turned Zhou over to the mainland authorities. On the other hand, he also denied there had been any serious errors in the Hong Kong Government's handling of the incident. A South China Morning Post article on this goes on to state that "However, a person with direct knowledge of the case said immigration officers did not know Zhou's real identity when they repatriated him and that Zhou did not state that he had residency in another country when officers told him that he would be sent to the mainland."
An editorial in the South China Morning Post on 6 February 2010 said the Chinese government action appeared to be extra-territorial. It criticized the Hong Kong government for hiding behind bland statements, and urged it to defend the principle of 'One country, two systems'
References
External links
mirror mirror mirror
1989 Tiananmen Square protests and massacre
2009 in Hong Kong
Political controversies in China
Human rights in China |
Critical systems thinking (CST) is a systems approach designed to aid decision-makers, and other stakeholders, improve complex problem situations that cross departmental and, often, organizational boundaries. CST sees systems thinking as essential to managing multidimensional 'messes' in which technical, economic, organizational, human, cultural and political elements interact. It is critical in a positive manner because it seeks to capitalize on the strengths of existing approaches while also calling attention to their limitations. CST seeks to allow systems approaches such as systems engineering, system dynamics, organizational cybernetics, soft systems methodology, critical systems heuristics, and others, to be used together, in a responsive and flexible way, to maximize the benefits they can bring.
History
CST has its origins in the 1980s with accounts of how the theoretical partiality of existing systems methodologies limited their ability to guide interventions in the full range of problem situations; calls for pluralism in systems practice; and suggestions about how those disadvantaged by systems designs could be given a voice and have impact. CST was largely developed at the Centre for Systems Studies, University of Hull, based on research by Michael C Jackson, Paul Keys, and Robert L Flood. It came to prominence in 1991 with the publication of three books - Critical Systems Thinking: Directed Readings, Systems Methodology for the Management Sciences, and Creative Problem Solving: Total Systems Intervention. The first was a collection of papers, accompanied by a commentary, which traced the origins and outlined the major themes of the approach. It highlighted the contributions of authors such as Flood, Fuenmayor, Jackson, Mingers, Oliga and Ulrich. The second offered a critique of existing systems approaches from the perspective of social theory, made the case for CST and sought to demonstrate that it could take the lead in enriching theory and practice in the management sciences. The third was the first attempt to show how CST could be used in practice. Since 1991, CST has been taken forward by authors such as Robert L Flood, Michael C Jackson, John Mingers and Gerald Midgley.
Recent developments
Recent developments have centered on the application of CST in practice - in particular Gerald Midgley's 'Systemic Intervention', focusing on boundary critique, and Michael C Jackson's multiperspectival and multimethodological 'Critical Systems Practice' (CSP). Adopting a pragmatist orientation, Jackson has set out, in a series of papers, how the four commitments of CST can be applied in practice. CSP has 4 main stages - Explore, Produce, Intervene, and Check (EPIC) - and various sub-stages:
Explore the problem situation
view it from a variety of systemic perspectives
identify primary and secondary issues
Produce an appropriate intervention strategy
appreciate the variety of systems approaches
choose appropriate systems methodologies
choose appropriate systems models and methods
structure, schedule and set objectives for the intervention
Intervene flexibly (revisiting the first two stages as necessary)
Check on progress
evaluate the improvements achieved
reflect on the systems approaches used
discuss and agree next steps
See also
systems engineering
system dynamics
Organizational cybernetics
Soft systems methodology
Systems thinking
Systems theory
References
Systems theory
Systems thinking |
```go
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package main
import (
"context"
"encoding/json"
"errors"
"fmt"
"os"
survey "github.com/AlecAivazis/survey/v2"
surveycore "github.com/AlecAivazis/survey/v2/core"
"github.com/spf13/cobra"
"github.com/pulumi/pulumi/pkg/v3/backend"
"github.com/pulumi/pulumi/pkg/v3/backend/display"
"github.com/pulumi/pulumi/pkg/v3/resource/deploy"
"github.com/pulumi/pulumi/pkg/v3/resource/edit"
"github.com/pulumi/pulumi/pkg/v3/resource/stack"
"github.com/pulumi/pulumi/sdk/v3/go/common/apitype"
"github.com/pulumi/pulumi/sdk/v3/go/common/diag/colors"
"github.com/pulumi/pulumi/sdk/v3/go/common/resource"
"github.com/pulumi/pulumi/sdk/v3/go/common/slice"
"github.com/pulumi/pulumi/sdk/v3/go/common/tokens"
"github.com/pulumi/pulumi/sdk/v3/go/common/util/cmdutil"
"github.com/pulumi/pulumi/sdk/v3/go/common/util/contract"
"github.com/pulumi/pulumi/sdk/v3/go/common/util/result"
)
func newStateCmd() *cobra.Command {
cmd := &cobra.Command{
Use: "state",
Short: "Edit the current stack's state",
Long: `Edit the current stack's state
Subcommands of this command can be used to surgically edit parts of a stack's state. These can be useful when
troubleshooting a stack or when performing specific edits that otherwise would require editing the state file by hand.`,
Args: cmdutil.NoArgs,
}
cmd.AddCommand(newStateEditCommand())
cmd.AddCommand(newStateDeleteCommand())
cmd.AddCommand(newStateUnprotectCommand())
cmd.AddCommand(newStateRenameCommand())
cmd.AddCommand(newStateUpgradeCommand())
cmd.AddCommand(newStateMoveCommand())
return cmd
}
// locateStackResource attempts to find a unique resource associated with the given URN in the given snapshot. If the
// given URN is ambiguous and this is an interactive terminal, it prompts the user to select one of the resources in
// the list of resources with identical URNs to operate upon.
func locateStackResource(opts display.Options, snap *deploy.Snapshot, urn resource.URN) (*resource.State, error) {
candidateResources := edit.LocateResource(snap, urn)
switch {
case len(candidateResources) == 0: // resource was not found
return nil, fmt.Errorf("No such resource %q exists in the current state", urn)
case len(candidateResources) == 1: // resource was unambiguously found
return candidateResources[0], nil
}
// If there exist multiple resources that have the requested URN, prompt the user to select one if we're running
// interactively. If we're not, early exit.
if !cmdutil.Interactive() {
errorMsg := "Resource URN ambiguously referred to multiple resources. Did you mean:\n"
for _, res := range candidateResources {
errorMsg += fmt.Sprintf(" %s\n", res.ID)
}
return nil, errors.New(errorMsg)
}
// Note: this is done to adhere to the same color scheme as the `pulumi new` picker, which also does this.
surveycore.DisableColor = true
prompt := "Multiple resources with the given URN exist, please select the one to edit:"
prompt = opts.Color.Colorize(colors.SpecPrompt + prompt + colors.Reset)
options := slice.Prealloc[string](len(candidateResources))
optionMap := make(map[string]*resource.State)
for _, ambiguousResource := range candidateResources {
// Prompt the user to select from a list of IDs, since these resources are known to all have the same URN.
message := fmt.Sprintf("%q", ambiguousResource.ID)
if ambiguousResource.Protect {
message += " (Protected)"
}
if ambiguousResource.Delete {
message += " (Pending Deletion)"
}
options = append(options, message)
optionMap[message] = ambiguousResource
}
var option string
if err := survey.AskOne(&survey.Select{
Message: prompt,
Options: options,
PageSize: optimalPageSize(optimalPageSizeOpts{nopts: len(options)}),
}, &option, surveyIcons(opts.Color)); err != nil {
return nil, errors.New("no resource selected")
}
return optionMap[option], nil
}
// runStateEdit runs the given state edit function on a resource with the given URN in a given stack.
func runStateEdit(
ctx context.Context, stackName string, showPrompt bool,
urn resource.URN, operation edit.OperationFunc,
) error {
return runTotalStateEdit(ctx, stackName, showPrompt, func(opts display.Options, snap *deploy.Snapshot) error {
res, err := locateStackResource(opts, snap, urn)
if err != nil {
return err
}
return operation(snap, res)
})
}
// runTotalStateEdit runs a snapshot-mutating function on the entirety of the given stack's snapshot.
// Before mutating, the user may be prompted to for confirmation if the current session is interactive.
func runTotalStateEdit(
ctx context.Context, stackName string, showPrompt bool,
operation func(opts display.Options, snap *deploy.Snapshot) error,
) error {
opts := display.Options{
Color: cmdutil.GetGlobalColorization(),
}
s, err := requireStack(ctx, stackName, stackOfferNew, opts)
if err != nil {
return err
}
return totalStateEdit(ctx, s, showPrompt, opts, operation)
}
func totalStateEdit(ctx context.Context, s backend.Stack, showPrompt bool, opts display.Options,
operation func(opts display.Options, snap *deploy.Snapshot) error,
) error {
snap, err := s.Snapshot(ctx, stack.DefaultSecretsProvider)
if err != nil {
return err
} else if snap == nil {
return nil
}
if showPrompt && cmdutil.Interactive() {
confirm := false
surveycore.DisableColor = true
prompt := opts.Color.Colorize(colors.Yellow + "warning" + colors.Reset + ": ")
prompt += "This command will edit your stack's state directly. Confirm?"
if err = survey.AskOne(&survey.Confirm{
Message: prompt,
}, &confirm, surveyIcons(opts.Color)); err != nil || !confirm {
return result.FprintBailf(os.Stdout, "confirmation declined")
}
}
// The `operation` callback will mutate `snap` in-place. In order to validate the correctness of the transformation
// that we are doing here, we verify the integrity of the snapshot before the mutation. If the snapshot was valid
// before we mutated it, we'll assert that we didn't make it invalid by mutating it.
stackIsAlreadyHosed := snap.VerifyIntegrity() != nil
if err = operation(opts, snap); err != nil {
return err
}
// If the stack is already broken, don't bother verifying the integrity here.
if !stackIsAlreadyHosed && !backend.DisableIntegrityChecking {
contract.AssertNoErrorf(snap.VerifyIntegrity(), "state edit produced an invalid snapshot")
}
sdep, err := stack.SerializeDeployment(ctx, snap, false /* showSecrets */)
if err != nil {
return fmt.Errorf("serializing deployment: %w", err)
}
// Once we've mutated the snapshot, import it back into the backend so that it can be persisted.
bytes, err := json.Marshal(sdep)
if err != nil {
return err
}
dep := apitype.UntypedDeployment{
Version: apitype.DeploymentSchemaVersionCurrent,
Deployment: bytes,
}
return s.ImportDeployment(ctx, &dep)
}
// Prompt the user to select a URN from the passed in state.
//
// stackName is the name of the current stack.
//
// snap is the snapshot of the current stack. If (*snap) is not nil, it will be set to
// the retrieved snapshot value. This allows caching between calls.
//
// Prompt is displayed to the user when selecting the URN.
func getURNFromState(
ctx context.Context, stackName string, snap **deploy.Snapshot, prompt string,
) (resource.URN, error) {
if snap == nil {
// This means we won't cache the value.
snap = new(*deploy.Snapshot)
}
if *snap == nil {
opts := display.Options{
Color: cmdutil.GetGlobalColorization(),
}
s, err := requireStack(ctx, stackName, stackLoadOnly, opts)
if err != nil {
return "", err
}
*snap, err = s.Snapshot(ctx, stack.DefaultSecretsProvider)
if err != nil {
return "", err
}
if *snap == nil {
return "", errors.New("no snapshot found")
}
}
urnList := make([]string, len((*snap).Resources))
for i, r := range (*snap).Resources {
urnList[i] = string(r.URN)
}
var urn string
err := survey.AskOne(&survey.Select{
Message: prompt,
Options: urnList,
}, &urn, survey.WithValidator(survey.Required), surveyIcons(cmdutil.GetGlobalColorization()))
if err != nil {
return "", err
}
result := resource.URN(urn)
contract.Assertf(result.IsValid(),
"Because we chose from an existing URN, it must be valid")
return result, nil
}
// Ask the user for a resource name.
func getNewResourceName() (tokens.QName, error) {
var resourceName string
err := survey.AskOne(&survey.Input{
Message: "Choose a new resource name:",
}, &resourceName, surveyIcons(cmdutil.GetGlobalColorization()),
survey.WithValidator(func(ans interface{}) error {
if tokens.IsQName(ans.(string)) {
return nil
}
return errors.New("resource names may only contain alphanumerics, underscores, hyphens, dots, and slashes")
}))
if err != nil {
return "", err
}
contract.Assertf(tokens.IsQName(resourceName),
"Survey validated that resourceName %q is a QName", resourceName)
return tokens.QName(resourceName), nil
}
``` |
```go
/*
*/
package grpclogging_test
import (
"bytes"
"crypto/ecdsa"
"crypto/elliptic"
"crypto/rand"
"crypto/tls"
"crypto/x509"
"crypto/x509/pkix"
"encoding/pem"
"math/big"
"net"
"testing"
"time"
"github.com/hyperledger/fabric/common/grpclogging/testpb"
. "github.com/onsi/ginkgo/v2"
. "github.com/onsi/gomega"
)
//go:generate protoc --proto_path=testpb --go_out=plugins=grpc,paths=source_relative:testpb testpb/echo.proto
func TestGrpclogging(t *testing.T) {
RegisterFailHandler(Fail)
RunSpecs(t, "Grpclogging Suite")
}
var (
clientCertWithKey tls.Certificate
serverCertWithKey tls.Certificate
caCertPool *x509.CertPool
clientTLSConfig *tls.Config
serverTLSConfig *tls.Config
)
var _ = BeforeSuite(func() {
var err error
caCert, caKey := generateCA("test-ca", "127.0.0.1")
clientCert, clientKey := issueCertificate(caCert, caKey, "client", "127.0.0.1")
clientCertWithKey, err = tls.X509KeyPair(clientCert, clientKey)
Expect(err).NotTo(HaveOccurred())
serverCert, serverKey := issueCertificate(caCert, caKey, "server", "127.0.0.1")
serverCertWithKey, err = tls.X509KeyPair(serverCert, serverKey)
Expect(err).NotTo(HaveOccurred())
caCertPool = x509.NewCertPool()
added := caCertPool.AppendCertsFromPEM(caCert)
Expect(added).To(BeTrue())
serverTLSConfig = &tls.Config{
Certificates: []tls.Certificate{serverCertWithKey},
ClientAuth: tls.VerifyClientCertIfGiven,
ClientCAs: caCertPool,
RootCAs: caCertPool,
}
clientTLSConfig = &tls.Config{
Certificates: []tls.Certificate{clientCertWithKey},
RootCAs: caCertPool,
ClientSessionCache: tls.NewLRUClientSessionCache(10),
}
})
//go:generate counterfeiter -o fakes/echo_service.go --fake-name EchoServiceServer . echoServiceServer
type echoServiceServer interface {
testpb.EchoServiceServer
}
func newTemplate(subjectCN string, hosts ...string) x509.Certificate {
notBefore := time.Now().Add(-1 * time.Minute)
notAfter := time.Now().Add(365 * 24 * time.Hour)
serialNumberLimit := new(big.Int).Lsh(big.NewInt(1), 128)
serialNumber, err := rand.Int(rand.Reader, serialNumberLimit)
Expect(err).NotTo(HaveOccurred())
template := x509.Certificate{
Subject: pkix.Name{CommonName: subjectCN},
SerialNumber: serialNumber,
NotBefore: notBefore,
NotAfter: notAfter,
KeyUsage: x509.KeyUsageKeyEncipherment | x509.KeyUsageDigitalSignature,
ExtKeyUsage: []x509.ExtKeyUsage{x509.ExtKeyUsageServerAuth, x509.ExtKeyUsageClientAuth},
BasicConstraintsValid: true,
}
for _, h := range hosts {
if ip := net.ParseIP(h); ip != nil {
template.IPAddresses = append(template.IPAddresses, ip)
} else {
template.DNSNames = append(template.DNSNames, h)
}
}
return template
}
func pemEncode(derCert []byte, key *ecdsa.PrivateKey) (pemCert, pemKey []byte) {
certBuf := &bytes.Buffer{}
err := pem.Encode(certBuf, &pem.Block{Type: "CERTIFICATE", Bytes: derCert})
Expect(err).NotTo(HaveOccurred())
keyBytes, err := x509.MarshalECPrivateKey(key)
Expect(err).NotTo(HaveOccurred())
keyBuf := &bytes.Buffer{}
err = pem.Encode(keyBuf, &pem.Block{Type: "EC PRIVATE KEY", Bytes: keyBytes})
Expect(err).NotTo(HaveOccurred())
return certBuf.Bytes(), keyBuf.Bytes()
}
func generateCA(subjectCN string, hosts ...string) (pemCert, pemKey []byte) {
privateKey, err := ecdsa.GenerateKey(elliptic.P384(), rand.Reader)
Expect(err).NotTo(HaveOccurred())
publicKey := privateKey.Public()
template := newTemplate(subjectCN, hosts...)
template.KeyUsage |= x509.KeyUsageCertSign
template.IsCA = true
derBytes, err := x509.CreateCertificate(rand.Reader, &template, &template, publicKey, privateKey)
Expect(err).NotTo(HaveOccurred())
return pemEncode(derBytes, privateKey)
}
func issueCertificate(caCert, caKey []byte, subjectCN string, hosts ...string) (pemCert, pemKey []byte) {
tlsCert, err := tls.X509KeyPair(caCert, caKey)
Expect(err).NotTo(HaveOccurred())
ca, err := x509.ParseCertificate(tlsCert.Certificate[0])
Expect(err).NotTo(HaveOccurred())
privateKey, err := ecdsa.GenerateKey(elliptic.P384(), rand.Reader)
Expect(err).NotTo(HaveOccurred())
publicKey := privateKey.Public()
template := newTemplate(subjectCN, hosts...)
derBytes, err := x509.CreateCertificate(rand.Reader, &template, ca, publicKey, tlsCert.PrivateKey)
Expect(err).NotTo(HaveOccurred())
return pemEncode(derBytes, privateKey)
}
``` |
Mazeh Farj-e Esfandan (, also Romanized as Māzeh Farj-e Esfandān) is a village in Bahmayi-ye Sarhadi-ye Gharbi Rural District, Dishmok District, Kohgiluyeh County, Kohgiluyeh and Boyer-Ahmad Province, Iran. At the 2006 census, its population was 176, in 28 families.
References
Populated places in Kohgiluyeh County |
```objective-c
// Generated file
// clang-format off
const char *g_dilate_normalmap_shader =
"#version 450\n"
"\n"
"// Dilates a normalmap by filling \"empty\" pixels with the average of surrounding pixels.\n"
"// Assumes the input image is tiled: dilation will not interact across tiles.\n"
"// One run of this shader will dilate by 1 pixel.\n"
"\n"
"layout (local_size_x = 8, local_size_y = 8, local_size_z = 1) in;\n"
"\n"
"// We must use alternating images because each iteration reads neighbor pixels\n"
"layout (set = 0, binding = 0, rgba8ui) restrict readonly uniform uimage2D u_src_image;\n"
"layout (set = 0, binding = 1, rgba8ui) restrict writeonly uniform uimage2D u_dst_image;\n"
"\n"
"layout (set = 0, binding = 2) uniform Params {\n"
" int u_tile_size;\n"
"};\n"
"\n"
"void main() {\n"
" // This color corresponds to a null normal.\n"
" const ivec4 nocol = ivec4(127, 127, 127, 255);\n"
" const ivec2 pixel_pos = ivec2(gl_GlobalInvocationID.xy);\n"
"\n"
" const ivec4 col11 = ivec4(imageLoad(u_src_image, pixel_pos));\n"
" if (col11 != nocol) {\n"
" imageStore(u_dst_image, pixel_pos, col11);\n"
" return;\n"
" }\n"
"\n"
" //const ivec2 im_size = imageSize(u_src_image).xy;\n"
"\n"
" const ivec2 p01 = pixel_pos + ivec2(-1, 0);\n"
" const ivec2 p21 = pixel_pos + ivec2(1, 0);\n"
" const ivec2 p10 = pixel_pos + ivec2(0, -1);\n"
" const ivec2 p12 = pixel_pos + ivec2(0, 1);\n"
"\n"
" ivec4 col_sum = ivec4(0,0,0,0);\n"
" int count = 0;\n"
"\n"
" const ivec4 col01 = ivec4(imageLoad(u_src_image, p01));\n"
" // Don't sample pixels of different tiles than the current one.\n"
" // This also takes care of image borders, but we must do it more explicitely for negative borders\n"
" // because of how division works\n"
" if (col01 != nocol && pixel_pos.x != 0 && (pixel_pos.x - 1) / u_tile_size == pixel_pos.x / u_tile_size) {\n"
" col_sum += col01;\n"
" ++count;\n"
" }\n"
"\n"
" const ivec4 col21 = ivec4(imageLoad(u_src_image, p21));\n"
" if (col21 != nocol && (pixel_pos.x + 1) / u_tile_size == pixel_pos.x / u_tile_size) {\n"
" col_sum += col21;\n"
" ++count;\n"
" }\n"
"\n"
" const ivec4 col10 = ivec4(imageLoad(u_src_image, p10));\n"
" if (col10 != nocol && pixel_pos.y != 0 && (pixel_pos.y - 1) / u_tile_size == pixel_pos.y / u_tile_size) {\n"
" col_sum += col10;\n"
" ++count;\n"
" }\n"
"\n"
" const ivec4 col12 = ivec4(imageLoad(u_src_image, p12));\n"
" if (col12 != nocol && (pixel_pos.y + 1) / u_tile_size == pixel_pos.y / u_tile_size) {\n"
" col_sum += col12;\n"
" ++count;\n"
" }\n"
"\n"
" ivec4 col_avg = count == 0 ? col11 : col_sum / count;\n"
"\n"
" imageStore(u_dst_image, pixel_pos, col_avg);\n"
"}\n";
// clang-format on
``` |
Roger Federer was the defending champion, but did not participate this year.
Feliciano López won the title, defeating Guillermo Cañas 6–4, 1–6, 7–5, 3–6, 7–5 in the final.
Seeds
Draw
Finals
Top half
Bottom half
External links
Main draw
Vienna Open
2004 ATP Tour |
Marjorie May Bacon, later Marjorie Macbeth-Raeburn (6 January 1902 – 9 February 1988) was a British printmaker and painter.
Biography
Bacon was born in Ipswich and lived in Great Yarmouth as a child. Bacon attended Yarmouth Art School from 1914–23 where she won a scholarship in 1917 and by 1921 passed the Board of Education's drawing examinations at the earliest age possible. She studied at the Norwich School of Art and then at the Royal College of Art in London, obtaining her diploma in 1927.
Bacon produced aquatints, wood-engravings and lithographs. She exhibited at the Royal Academy and with the New English Art Club. Her Royal Academy exhibits included Miss Aline Wilson of Welby Park, 1934. An oil painting by Bacon depicting Queen Elizabeth and Princess Margaret as children riding on horses is held in the Royal Collection.
In 1936, in London, Bacon married the artist Henry Macbeth-Raeburn and, by 1939, the couple were living in Great Yarmouth. In the 1940s, she was a member of, and exhibited with, the Ipswich Art Club.
References
External links
1902 births
1988 deaths
20th-century English painters
20th-century English women artists
Alumni of Norwich University of the Arts
Alumni of the Royal College of Art
Artists from Ipswich |
Howard Margolis (1932 – April 29, 2009) was an American social scientist. He earned a BA in Government from Harvard University in 1953 and a PhD in Political Science from MIT in 1979. From 1990 to 2009, he was on the faculty of the University of Chicago and taught as well at the University of Chicago's Harris School of Public Policy Studies.
His work on social theory focuses on individual choice and judgments shaping aggregate social outcomes and involved mathematical modeling. Margolis also published extensively on cognition, public policy, and the history of science.
Bibliography
Margolis, Howard (2007). Cognition and Extended Rational Choice. New York: Routledge.
Margolis, Howard (2002). It Started with Copernicus: How Turning the World Inside Out Led to the Scientific Revolution. McGraw-Hill.
Margolis, Howard (1996). Dealing with Risk: Why Expert and Lay Intuition Conflict, and What Might Be Done about It'. University of Chicago Press.
Margolis, Howard (1993). Paradigms and Barriers: How Habits of Mind Govern Scientific Belief. University of Chicago Press.
Margolis, Howard (1987). Patterns, Thinking, and Cognition: A Theory of Judgment. University of Chicago Press.
Margolis, Howard (1982). Selfishness, Altruism, and Rationality: A Theory of Social Choice''. Cambridge Press.
References
1932 births
2009 deaths
American social scientists
Harvard University alumni
University of Chicago faculty
MIT School of Humanities, Arts, and Social Sciences alumni |
```python
#
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# ==============================================================================
"""Offline dump analyzer of TensorFlow Debugger (tfdbg)."""
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import argparse
import sys
# Google-internal import(s).
from tensorflow.python.debug.cli import analyzer_cli
from tensorflow.python.debug.lib import debug_data
from tensorflow.python.platform import app
def main(_):
if FLAGS.log_usage:
pass # No logging for open-source.
if not FLAGS.dump_dir:
print("ERROR: dump_dir flag is empty.", file=sys.stderr)
sys.exit(1)
print("tfdbg offline: FLAGS.dump_dir = %s" % FLAGS.dump_dir)
debug_dump = debug_data.DebugDumpDir(
FLAGS.dump_dir, validate=FLAGS.validate_graph)
cli = analyzer_cli.create_analyzer_ui(
debug_dump,
tensor_filters={"has_inf_or_nan": debug_data.has_inf_or_nan},
ui_type=FLAGS.ui_type)
title = "tfdbg offline @ %s" % FLAGS.dump_dir
cli.run_ui(title=title, title_color="black_on_white", init_command="lt")
if __name__ == "__main__":
parser = argparse.ArgumentParser()
parser.register("type", "bool", lambda v: v.lower() == "true")
parser.add_argument(
"--dump_dir", type=str, default="", help="tfdbg dump directory to load")
parser.add_argument(
"--log_usage",
type="bool",
nargs="?",
const=True,
default=True,
help="Whether the usage of this tool is to be logged")
parser.add_argument(
"--ui_type",
type=str,
default="curses",
help="Command-line user interface type (curses | readline)")
parser.add_argument(
"--validate_graph",
nargs="?",
const=True,
type="bool",
default=True,
help="""\
Whether the dumped tensors will be validated against the GraphDefs\
""")
FLAGS, unparsed = parser.parse_known_args()
app.run(main=main, argv=[sys.argv[0]] + unparsed)
``` |
Richard Lee Blakeley (16 August 1971 – 5 August 2017) was a British opera and theatre director.
Born in Mirfield, West Yorkshire to Carol and Richard Blakeley, Blakeley was educated at The Mirfield Free Grammar School. He subsequently studied theatre at the Royal Scottish Academy of Music and Drama, beginning at age 18. He also studied at the University of Glasgow. He returned to the Royal Scottish Academy to study theatre directing. There, he was accidentally assigned as director of a student production of Gustav Holst's The Wandering Scholar. The resulting success initiated his career interest in opera direction.
Whilst at the Royal Scottish Academy, Blakeley had worked with David McVicar on the latter's production of Handel's Semele. Blakeley later worked at English National Opera (ENO), and re-connected with McVicar, who made Blakeley his assistant. He assisted McVicar at the Royal Opera House on its 2003 production of Die Zauberflöte and its 2004 production of Faust, and served as a regular revival director of these productions at Covent Garden.
In 2001, Blakeley directed the first dramatic staging of Handel's cantata Clori, Tirst e Fileno, at the gay nightclub Heaven in London. Other notable productions as director in his own right included the 2006 European premiere of Tobias Picker's Therese Raquin, his self-described 'breakout' production of Rusalka at Wexford Festival Opera in 2007, and the 2008 Scottish Opera production of Judith Weir's A Night at the Chinese Opera.
At the Théâtre du Châtelet in Paris, Blakeley directed the French premiere of Stephen Sondheim's A Little Night Music (2010), and subsequent productions of Sondheim's Sweeney Todd (2011), and of Sunday in the Park with George (2013), and Into the Woods (2014), The King and I (2014). His directorial work in theatre included Pat Kirkwood Is Angry.
Blakeley received a Winston Churchill Traveling Fellowship in 2007. This took him to many of the major opera houses of North America to study Lyric Artist Development and the Cultivation of Philanthropy for Opera. In North America, his directing credits included Madama Butterfly (2010), The Pearl Fishers (2012), The Grand Duchess of Gerolstein (2013) and Rigoletto (2015) for Santa Fe Opera, Orfeo ed Euridice for Minnesota Opera, and Les Contes D'Hoffmann for Canadian Opera Company. For Opera Theatre of Saint Louis, he directed the North American premiere staging of Handel's Riccardo Primo (performed in English as Richard the Lionheart, 2015) and the company's first staging of Verdi's Macbeth (2016).
In private life, Blakeley was married to Jonathan Foster. The couple resided in London. He died of a suspected heart attack.
References
External links
Official website of Lee Blakeley
1971 births
2017 deaths
British opera directors
British theatre directors
20th-century English LGBT people
21st-century English LGBT people
People from Mirfield |
Nafion is a brand name for a sulfonated tetrafluoroethylene based fluoropolymer-copolymer discovered in the late 1960s by Dr. Walther Grot of DuPont. Nafion is a brand of the Chemours company. It is the first of a class of synthetic polymers with ionic properties that are called ionomers. Nafion's unique ionic properties are a result of incorporating perfluorovinyl ether groups terminated with sulfonate groups onto a tetrafluoroethylene (PTFE) backbone. Nafion has received a considerable amount of attention as a proton conductor for proton exchange membrane (PEM) fuel cells because of its excellent chemical and mechanical stability in the harsh conditions of this application.
The chemical basis of Nafion's ion-conductive properties remain a focus of extensive research. Ion conductivity of Nafion increases with the level of hydration. Exposure of Nafion to a humidified environment or liquid water increases the amount of water molecules associated with each sulfonic acid group. The hydrophilic nature of the ionic groups attract water molecules, which begin to solvate the ionic groups and dissociate the protons from the -SO3H (sulfonic acid) group. The dissociated protons "hop" from one acid site to another through mechanisms facilitated by the water molecules and hydrogen bonding. Upon hydration, Nafion phase-separates at nanometer length scales resulting in formation of an interconnected network of hydrophilic domains which allow movement of water and cations, but the membranes do not conduct electrons and minimally conduct anions due to permselectivity (charge-based exclusion). Nafion can be manufactured with or exchanged to alternate cation forms for different applications (e.g. lithiated for Li-ion batteries) and at different equivalent weights (EWs), alternatively considered as ion-exchange capacities (IECs), to achieve a range of cationic conductivities with trade-offs to other physicochemical properties such as water uptake and swelling.
Nomenclature and molecular weight
Nafion can be produced as both a powder resin and a copolymer. It has various chemical configurations and thus several chemical names in the IUPAC system. Nafion-H, for example, includes the following systematic names:
From Chemical Abstracts: ethanesulfonyl fluoride, 2-[1-[difluoro-[(trifluoroethenyl)oxy]methyl]-1,2,2,2-tetrafluoroethoxy]-1,1,2,2,-tetrafluoro-, with tetrafluoroethylene
acid copolymer
The molecular weight of Nafion is variable due to differences in processing and solution morphology. The structure of a Nafion unit illustrates the variability of the material; for example, the most basic monomer contains chain variation between the ether groups (the z subscript). Conventional methods of determining molecular weight such as light scattering and gel permeation chromatography are not applicable because Nafion is insoluble, although the molecular weight has been estimated at 105–106 Da. Instead, the equivalent weight (EW) and material thickness are used to describe most commercially available membranes. The EW is the number of grams of dry Nafion per mole of sulfonic acid groups when the material is in the acid form. Nafion membranes are commonly categorized in terms of their EW and thickness. For example, Nafion 117 indicates an extrusion-cast membrane with 1100 g/mol EW and 0.007 inches (7 thou) in thickness. In contrast to equivalent weight, conventional ion-exchange resins are usually described in terms of their ion exchange capacity (IEC), which is the multiplicative inverse or reciprocal of the equivalent weight, i.e., IEC = 1000/EW.
Preparation
Nafion derivatives are first synthesized by the copolymerization of tetrafluoroethylene (TFE) (the monomer in Teflon) and a derivative of a perfluoro (alkyl vinyl ether) with sulfonyl acid fluoride. The latter reagent can be prepared by the pyrolysis of its respective oxide or carboxylic acid to give the olefinated structure.
The resulting product is an -SO2F-containing thermoplastic that is extruded into films. Hot aqueous NaOH converts these sulfonyl fluoride (-SO2F) groups into sulfonate groups (-SO3−Na+). This form of Nafion, referred to as the neutral or salt form, is finally converted to the acid form containing the sulfonic acid (-SO3H) groups. Nafion can be dispersed into solution by heating in aqueous alcohol at 250 °C in an autoclave for subsequent casting into thin films or use as polymeric binder in electrodes. By this process, Nafion can be used to generate composite films, coat electrodes, or repair damaged membranes.
Properties
The combination of the stable PTFE backbone with the acidic sulfonic groups gives Nafion its characteristics:
It is highly conductive to cations, making it suitable for many membrane applications.
It resists chemical attack. According to Chemours, only alkali metals (particularly sodium) can degrade Nafion under normal temperatures and pressures.
The PTFE backbone interlaced with the ionic sulfonate groups gives Nafion a high chemical stability temperature (e.g. 190 °C) but a softening point in the range of 85-100 °C give it a moderate operating temperature, e.g. up to 100 °C, with additional challenges in all applications due to the loss of water above 100 °C.
It is a superacid catalyst. The combination of fluorinated backbone, sulfonic acid groups, and the stabilizing effect of the polymer matrix make Nafion a very strong acid, with pKa ~ -6. In this respect Nafion resembles the trifluoromethanesulfonic acid, CF3SO3H, although Nafion is a weaker acid by at least three orders of magnitude.
It is selectively and highly permeable to water.
Its proton conductivity up to 0.2 S/cm depending on temperature, hydration state, thermal history and processing conditions.
The solid phase and the aqueous phase of Nafion are both permeable to gases, which is a drawback for energy conversion devices such as artificial leaves, fuel cells, and water electrolyzers.
Structure/morphology
The morphology of Nafion membranes is a matter of continuing study to allow for greater control of its properties. Other properties such as water management, hydration stability at high temperatures, electro-osmotic drag, as well as the mechanical, thermal, and oxidative stability, are affected by the Nafion structure. A number of models have been proposed for the morphology of Nafion to explain its unique transport properties.
The first model for Nafion, called the cluster-channel or cluster-network model, consisted of an equal distribution of sulfonate ion clusters (also described as 'inverted micelles') with a 40 Å (4 nm) diameter held within a continuous fluorocarbon lattice. Narrow channels about 10 Å (1 nm) in diameter interconnect the clusters, which explains the transport properties.
The difficulty in determining the exact structure of Nafion stems from inconsistent solubility and crystalline structure among its various derivatives. Advanced morphological models have included a core-shell model where the ion-rich core is surrounded by an ion poor shell, a rod model where the sulfonic groups arrange into crystal-like rods, and a sandwich model where the polymer forms two layers whose sulfonic groups attract across an aqueous layer where transport occurs. Consistency between the models include a network of ionic clusters; the models differ in the cluster geometry and distribution. Although no model has yet been determined fully correct, some scientists have demonstrated that as the membrane hydrates, Nafion's morphology transforms from the cluster-channel model to a rod-like model.
A cylindrical-water channel model was also proposed based on simulations of small-angle X-ray scattering data and solid state nuclear magnetic resonance studies. In this model, the sulfonic acid functional groups self-organize into arrays of hydrophilic water channels, each ~ 2.5 nm in diameter, through which small ions can be easily transported. Interspersed between the hydrophilic channels are hydrophobic polymer backbones that provide the observed mechanical stability. Many recent studies, however, favored a phase-separated nanostructure consisting of locally-flat, or ribbon-like, hydrophilic domains based on evidence from direct-imaging studies and more comprehensive analysis of the structure and transport properties.
Applications
Nafion's properties make it suitable for a broad range of applications. Nafion has found use in fuel cells, electrochemical devices, chlor-alkali production, metal-ion recovery, water electrolysis, plating, surface treatment of metals, batteries, sensors, Donnan dialysis cells, drug release, gas drying or humidification, and superacid catalysis for the production of fine chemicals. Nafion is also often cited for theoretical potential (i.e., thus far untested) in a number of fields. With consideration of Nafion's wide functionality, only the most significant will be discussed below.
Chlor-alkali production cell membrane
Chlorine and sodium/potassium hydroxide are among the most produced commodity chemicals in the world. Modern production methods produce Cl2 and NaOH/KOH from the electrolysis of brine using a Nafion membrane between half-cells. Before the use of Nafion, industries used mercury containing sodium amalgam to separate sodium metal from cells or asbestos diaphragms to allow for transfer of sodium ions between half cells; both technologies were developed in the latter half of the 19th century. The disadvantages of these systems is worker safety and environmental concerns associated with mercury and asbestos, economical factors also played a part, and in the diaphragm process chloride contamination of the hydroxide product. Nafion was the direct result of the chlor-alkali industry addressing these concerns; Nafion could tolerate the high temperatures, high electrical currents, and corrosive environment of the electrolytic cells.
The figure to the right shows a chlor-alkali cell where Nafion functions as a membrane between half cells. The membrane allows sodium ions to transfer from one cell to the other with minimal electrical resistance. The membrane was also reinforced with additional membranes to prevent gas product mixing and minimize back transfer of Cl− and −OH ions.
Proton exchange membrane (PEM) for fuel cells
Although fuel cells have been used since the 1960s as power supplies for satellites, recently they have received renewed attention for their potential to efficiently produce clean energy from hydrogen. Nafion was found effective as a membrane for proton exchange membrane (PEM) fuel cells by permitting hydrogen ion transport while preventing electron conduction. Solid Polymer Electrolytes, which are made by connecting or depositing electrodes (usually noble metal) to both sides of the membrane, conduct the electrons through an energy requiring process and rejoin the hydrogen ions to react with oxygen and produce water. Fuel cells are expected to find strong use in the transportation industry.
Superacid catalyst for fine chemical production
Nafion, as a superacid, has potential as a catalyst for organic synthesis. Studies have demonstrated catalytic properties in alkylation, isomerization, oligomerization, acylation, ketalization, esterification, hydrolysis of sugars and ethers, and oxidation. New applications are constantly being discovered. These processes, however, have not yet found strong commercial use. Several examples are shown below:
Alkylation with alkyl halides
Nafion-H gives efficient conversion whereas the alternative method, which employs Friedel-Crafts synthesis, can promote polyalkylation:
Acylation
The amount of Nafion-H needed to catalyze the acylation of benzene with aroyl chloride is 10–30% less than the Friedel-Crafts catalyst:
Catalysis of protection groups
Nafion-H increases reaction rates of protection via dihydropyran or o-trialkylsilation of alcohols, phenol, and carboxylic acids.
Isomerization
Nafion can catalyze a 1,2-hydride shift.
It is possible to immobilize enzymes within the Nafion by enlarging pores with lipophilic salts. Nafion maintains a structure and pH to provide a stable environment for the enzymes. Applications include catalytic oxidation of adenine dinucleotides.
Sensors
Nafion has found use in the production of sensors, with application in ion-selective, metallized, optical, and biosensors. What makes Nafion especially interesting is its demonstration in biocompatibility. Nafion has been shown to be stable in cell cultures as well as the human body, and there is considerable research towards the production of higher sensitivity glucose sensors.
Antimicrobial surfaces
Nafion surfaces show an exclusion zone against bacteria colonization. Moreover, layer-by-layer coatings comprising Nafion show excellent antimicrobial properties.
Dehumidification in spacecraft
The SpaceX Dragon 2 human-rated spacecraft uses Nafion membranes to dehumidify the cabin air. One side of the membrane is exposed to the cabin atmosphere, the other to the vacuum of space. This results in dehumidification since Nafion is permeable to water molecules but not air. This saves power and complexity since cooling is not required (as needed with a condensing dehumidifier), and the removed water is rejected to space with no additional mechanism needed.
Modified Nafion for PEM fuel cells
Normal Nafion will dehydrate (thus lose proton conductivity) when the temperature is above ~80 °C. This limitation troubles the design of fuel cells because higher temperatures are desirable for better efficiency and CO tolerance of the platinum catalyst. Silica and zirconium phosphate can be incorporated into Nafion water channels through in situ chemical reactions to increase the working temperature to above 100 °C.
References
External links
What Nafion Membrane is Right for an Electrolyzer / Hydrogen Generation?
Homepage of Walther G. Grot
Walther G. Grot: "Fluorinated Ionomers"
Isotopic effects on Nafion conductivity
Membrane thickness on conductivity_of_Nafion
Nafion hydration
Plastics
Fluoropolymers
Polyelectrolytes
DuPont products
Membrane technology |
Billing is a surname of English, German, and Scandinavian origin that usually derives from a personal name or habitation.
Amanda Billing (born 1976), New Zealand actress
Amar Singh Billing (born 1944), Indian cyclist
Archibald Billing (1791–1881), English physician
Clara Billing (1881–1963), English artist
Einar Billing (1871–1939), Swedish theologian
Eve Billing (1923–2019), UK plant pathologist
Graham Billing (1936–2001), New Zealand novelist and poet
Heinz Billing (1914–2017), German physicist and computer scientist
Hermann Billing (1867–1946), German architect and designer
Johanna Billing (born 1973), Swedish artist
John Billing (1816–1863), British architect
Kevin Billing (born 1944), Australian footballer
McGregor Billing (1887–1965), South African cricketer
Noel Pemberton Billing (1881–1948), English politician
Norman Billing (1913–1989), Australian politician
Peter Billing (born 1964), English footballer
Philip Billing (born 1996), Danish footballer
Robert Billing (died 1898), English Anglican suffragan bishop
Roy Billing (born 1947), New Zealand television actor
Thomas Billing (died 1481), Chief Justice of the King's Bench
See also
Billing (disambiguation)
Billings (surname)
References |
A minecart, mine cart, or mine car (or more rarely mine trolley or mine hutch) is a type of rolling stock found on a mine railway, used for moving ore and materials procured in the process of traditional mining. Minecarts are seldom used in modern operations, having largely been superseded in underground operations (especially coal mines) by more efficient belt conveyor systems that allow machines such as longwall shearers and continuous miners to operate at their full capacity, and above ground by large dumpers.
Terminology
Throughout the world, there are different titles for mine carts. In South Africa, a minecart is referred to as a ; or koekepan. In German, it is called (alternative spelling ). In Wales, minecarts are known as drams. In the U.S. and elsewhere, the term skip – or skip wagon (older spelling: waggon) – is used. (See: Skip (container)#Etymology)
In particular, a V skip wagon is a side-tipping skid with a V-shaped body. (Images)
Design and operation
Minecarts range in size and usage, and are usually made of steel for hauling ore. Shaped like large, rectangular buckets, minecarts ride on metal tracks and were originally pushed or pulled by men and animals (supplemented later by rope-haulage systems). They were generally introduced in early modern time, replacing containers carried by men. Originally, they didn't run on a real "rail", where the wheels would have a rim to fit into the tracks, but with plain wheels on a wooden plank way, hold in track by a pin fitting into a guide groove, or by the underside of the cart itself which was lower than the wheels and fitted between the planks ("Hungarian system").
As mines increased in size and output, the aforementioned methods became impractical because of the distances and quantities of material involved, so larger carts would be used, hauled by narrow gauge diesel and electric locomotives (in coal mining operations, where gas that is flammable would present a problem, the locomotives would be flameproof or battery powered). These were also used to pull trains transporting miners to the workfaces.
Minecarts were very important in the history of technology because they evolved into railroad cars. See History of rail transport.
Lorry or mine car
An open railroad car (gondola) with a tipping trough, often found in mines. Known in the UK as a tippler or chaldron wagon and in the US as a mine car.
In popular culture
Minecarts have been depicted as a type of thrill ride; for instance Indiana Jones uses one in an escape scene in Indiana Jones and the Temple of Doom.
Mine train roller coasters were inspired by minecarts.
Minecart levels, a term used for levels in which the player character takes a high-speed ride in a minecart, common level in video games, especially side-scrolling video games such as Donkey Kong Country. A minecart is also featured in Hoodwinked. Minecarts and tracks can be crafted by the player in Minecraft and used for transportation. They are also found in abandoned mineshafts that generate naturally as a part of the game's procedural generation.
In Great Britain, restored mine carts (known as "tubs") containing floral displays can commonly be seen on village greens and outside pubs in former coal mining areas such as Northumberland and County Durham.
Like in Great Britain, old mine carts are common decorations in Germany, sometimes accompanied by old mining tools. Especially in the Ruhr Area those carts can be found in many front yards.
See also
Chaldron
Corf
Decauville wagon
Mineral wagon
References
Rakes, Paul H. (2012). "Coal Mine Mechanization." The West Virginia Encyclopedia. West Virginia Humanities Council, Charleston, WV.
External links
Carts
Mining equipment
Traditional mining
Freight rolling stock |
Noveurops philippinensis is a species of beetle in the family Monotomidae, the only species in the genus Noveurops.
References
Monotomidae
Monotypic Cucujoidea genera |
Crevans-et-la-Chapelle-lès-Granges is a commune in the Haute-Saône department in the region of Bourgogne-Franche-Comté in eastern France.
See also
Communes of the Haute-Saône department
References
Communes of Haute-Saône |
```php
<?php
/*
* This file is part of the Kimai time-tracking app.
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace App\Event;
use App\Entity\Project;
use Symfony\Contracts\EventDispatcher\Event;
/**
* This event can be used, to dynamically add meta fields to projects
*/
final class ProjectMetaDefinitionEvent extends Event
{
public function __construct(private Project $entity)
{
}
public function getEntity(): Project
{
return $this->entity;
}
}
``` |
Etc... is a Czech rock band from Prague, formed in 1974 by singer and guitarist Vladimír Mišík. Various musicians have rotated through the group's ranks, including violist Jan Hrubý (Framus Five), bassist Jiří Veselý (Stromboli, Žlutý pes), guitarist Petr "Kulich" Pokorný (Framus Five, Žlutý Pes), drummer Ivan Kadaňka, bassist/cellist Jaroslav Olin Nejezchleba, as well as bassists Vladimír Padrůněk and Vladimír Guma Kulhánek.
Between 1982 and 1985, the group was banned from performing by the Communist government.
In 2010, Etc... was inducted into the Beatová síň slávy (Beat Hall of Fame) and released the album Ztracený podzim.
In 2011, the group, minus Vladimír Mišík, released a collaboration album with Vladimír Merta, titled Ponorná řeka.
Band members
Current
Vladimír Mišík – guitar, vocals
Petr "Kulich" Pokorný – guitar
Pavel Skála – guitar, vocals
Jiří Zelenka – drums, vocals
Vladimír Pavlíček – violin
Jiří Veselý – bass
Past
Vladimír Guma Kulhánek – bass
Jan Hrubý – violin
Vladimír Padrůněk – bass
Jaroslav Olin Nejezchleba – double bass, cello
Ivan Kadaňka – drums
Pavel Novák – bass
Anatoli Kohout
František Francl
Jiří Jelínek
Petr Skoumal
Stanislav Kubeš
Discography
Etc… (1976; also known as Stříhali dohola malého chlapečka)
They Cut Off the Little Boy's Hair (1978; English version of Etc…)
Etc… 2 (1980)
Etc… 3 (1987)
Etc… 4 (1987)
Jiří Jelínek in memoriam (1987)
20 deka duše (1990)
Nechte zpívat Mišíka (1991; live recording)
Jen se směj (1993)
Unplugged (1994; live recording)
Město z peřin (1996)
Nůž na hrdle (1999)
Umlkly stroje (2004)
Archa + hosté (2008)
Déja vu (1976–1987) Box I. (2009; set of remastered first four albums)
Ztracený podzim (2010)
Déja vu (1989–1996) Box II. (2010; second set of four remastered albums)
Ponorná řeka (2011; with Vladimír Merta)
References
External links
Etc… at Discogs
Musical groups established in 1974
Czech rock music groups
1974 establishments in Czechoslovakia
Musical groups reestablished in 1985 |
Mora () is a municipality in Évora District in Portugal. The population in 2011 was 4,978, in an area of 443.95 km2.
The present Mayor is Paula Cristina Calado Chuço, elected by the Socialist Party in 2021. The municipal holiday is Easter Monday.
Climate
Parishes
Administratively, the municipality is divided into 4 civil parishes (freguesias):
Brotas
Cabeção
Mora
Pavia
Gallery
Notable people
José Pedro Biléu (born 1932 in Mora) a former Portuguese footballer with 303 caps with Lusitano de Évora
References
External links
Town Hall official website
Online Newspaper
Photos of Mora
Municipalities of Évora District |
Euphaedra nigrobasalis is a butterfly in the family Nymphalidae. It is found in the Democratic Republic of the Congo, Zambia and Malawi. The habitat consists of primary forests.
Subspecies
Euphaedra nigrobasalis nigrobasalis (Democratic Republic of the Congo, northern Zambia)
Euphaedra nigrobasalis ceramica Hecq, 1991 (Malawi)
Euphaedra nigrobasalis upemba Overlaet, 1955 (Democratic Republic of the Congo)
References
Butterflies described in 1921
nigrobasalis |
```java
package com.reactnativenavigation;
import com.google.android.material.floatingactionbutton.FloatingActionButton;
import androidx.appcompat.app.AppCompatActivity;
import com.facebook.react.common.*;
import org.junit.*;
import org.robolectric.*;
import static org.assertj.core.api.Java6Assertions.*;
import com.reactnativenavigation.R;
public class EnvironmentTest extends BaseTest {
@Test
public void assertJ() {
assertThat(1 + 2).isEqualTo(3).isGreaterThan(2).isLessThan(4).isNotNegative().isPositive().isNotZero();
}
@Test
public void react() {
assertThat(ReactConstants.TAG).isNotEmpty();
}
@Test
public void supportV7AppCompat() {
assertThat(AppCompatActivity.class).isNotNull();
}
@Test
public void supportDesign() {
assertThat(FloatingActionButton.class).isNotNull();
}
@Test
public void androidR() {
assertThat(com.google.android.material.R.string.bottom_sheet_behavior).isNotZero();
}
@Test
public void ableToLoadApplication() throws Exception {
assertThat(RuntimeEnvironment.application).isNotNull();
}
}
``` |
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/select_algorithms/randomized_select Directory Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Introduction_to_Algorithms
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('dir_5723e9a5e0b76787341f535e1c224e9d.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">randomized_select Directory Reference</div> </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a>
Files</h2></td></tr>
<tr class="memitem:randomizedselect_8h"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="randomizedselect_8h.html">randomizedselect.h</a> <a href="randomizedselect_8h_source.html">[code]</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:randomizedselect__test_8h"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="randomizedselect__test_8h.html">randomizedselect_test.h</a> <a href="randomizedselect__test_8h_source.html">[code]</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_5b617f5d35050df2d00af2999eb09f44.html">select_algorithms</a></li><li class="navelem"><a class="el" href="dir_5723e9a5e0b76787341f535e1c224e9d.html">randomized_select</a></li>
<li class="footer">Generated by
<a href="path_to_url">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
</ul>
</div>
</body>
</html>
``` |
Cecily O'Bryen (7 September 1899 – 17 March 1984) was a British diver. She competed in the women's 3 metre springboard event at the 1924 Summer Olympics.
References
External links
1899 births
1984 deaths
British female divers
Olympic divers for Great Britain
Divers at the 1924 Summer Olympics
Place of birth missing |
```java
/**
*
*
* A Processing/Java library for high performance GPU-Computing (GLSL).
*
*/
package SoftBody2D.SoftBody2D_Playground;
import java.util.ArrayList;
import com.thomasdiewald.pixelflow.java.DwPixelFlow;
import com.thomasdiewald.pixelflow.java.softbodydynamics.DwPhysics;
import com.thomasdiewald.pixelflow.java.softbodydynamics.constraint.DwSpringConstraint;
import com.thomasdiewald.pixelflow.java.softbodydynamics.particle.DwParticle;
import com.thomasdiewald.pixelflow.java.softbodydynamics.particle.DwParticle2D;
import com.thomasdiewald.pixelflow.java.softbodydynamics.softbody.DwSoftBall2D;
import com.thomasdiewald.pixelflow.java.softbodydynamics.softbody.DwSoftBody2D;
import com.thomasdiewald.pixelflow.java.softbodydynamics.softbody.DwSoftGrid2D;
import com.thomasdiewald.pixelflow.java.utils.DwStrokeStyle;
import controlP5.Accordion;
import controlP5.ControlP5;
import controlP5.Group;
import processing.core.*;
public class SoftBody2D_Playground extends PApplet {
//
// 2D Softbody Sandbox, to debug/test/profile everything.
//
// Lots of different objects are created of particle-arrays and spring-constraints.
// Everything can collide with everything and also be destroyed (RMB).
//
// + Collision Detection
//
// Controls:
// LMB: drag particles
// MMB: drag + fix particles to a location
// RMB: disable springs, to deform objects
//
// + GUI
//
int viewport_w = 1280;
int viewport_h = 720;
int viewport_x = 230;
int viewport_y = 0;
int gui_w = 200;
int gui_x = viewport_w-gui_w;
int gui_y = 0;
// physics parameters
DwPhysics.Param param_physics = new DwPhysics.Param();
// particle parameters: same behavior for all
DwParticle.Param param_particle = new DwParticle.Param();
// spring parameters: different spring behavior for different bodies
DwSpringConstraint.Param param_spring_cloth = new DwSpringConstraint.Param();
DwSpringConstraint.Param param_spring_softbody = new DwSpringConstraint.Param();
DwSpringConstraint.Param param_spring_chain = new DwSpringConstraint.Param();
DwSpringConstraint.Param param_spring_circle = new DwSpringConstraint.Param();
// physics simulation
DwPhysics<DwParticle2D> physics;
// list, that wills store the cloths
ArrayList<DwSoftBody2D> softbodies = new ArrayList<DwSoftBody2D>();
// 0 ... default: particles, spring
// 1 ... tension
int DISPLAY_MODE = 0;
// entities to display
boolean DISPLAY_PARTICLES = true;
boolean DISPLAY_MESH = !true;
boolean DISPLAY_SRPINGS = true;
boolean DISPLAY_SPRINGS_STRUCT = true;
boolean DISPLAY_SPRINGS_SHEAR = true;
boolean DISPLAY_SPRINGS_BEND = true;
boolean UPDATE_PHYSICS = true;
// first thing to do, inside draw()
boolean NEED_REBUILD = false;
public void settings(){
size(viewport_w, viewport_h, P2D);
smooth(8);
}
public void setup() {
surface.setLocation(viewport_x, viewport_y);
// main library context
DwPixelFlow context = new DwPixelFlow(this);
context.print();
// context.printGL();
physics = new DwPhysics<DwParticle2D>(param_physics);
// global physics parameters
param_physics.GRAVITY = new float[]{ 0, 0.2f };
param_physics.bounds = new float[]{ 0, 0, width, height };
param_physics.iterations_collisions = 4;
param_physics.iterations_springs = 4;
// particle parameters
param_particle.DAMP_BOUNDS = 0.40f;
param_particle.DAMP_COLLISION = 0.9990f;
param_particle.DAMP_VELOCITY = 0.991f;
// spring parameters
param_spring_cloth .damp_dec = 0.999999f;
param_spring_cloth .damp_inc = 0.000599f;
param_spring_softbody.damp_dec = 0.999999f;
param_spring_softbody.damp_inc = 0.999999f;
param_spring_chain .damp_dec = 0.599999f;
param_spring_chain .damp_inc = 0.599999f;
param_spring_circle .damp_dec = 0.999999f;
param_spring_circle .damp_inc = 0.999999f;
createBodies();
createGUI();
frameRate(60);
}
public void createBodies(){
physics.reset();
softbodies.clear();
// create some particle-bodies: Cloth / SoftBody
float r,g,b,a,s;
int nodex_x, nodes_y, nodes_r;
float nodes_start_x, nodes_start_y;
// cloth
{
nodex_x = 30;
nodes_y = 30;
nodes_r = 7;
nodes_start_x = 50;
nodes_start_y = 70;
DwSoftGrid2D body = new DwSoftGrid2D();
body.CREATE_SHEAR_SPRINGS = true;
body.CREATE_BEND_SPRINGS = true;
body.bend_spring_mode = 2;
r = 255;
g = 180;
b = 0;
a = 160;
s = 1f;
body.setMaterialColor(color(r ,g ,b , a));
body.setParticleColor(color(r*s,g*s,b*s, a));
body.setParam(param_particle);
body.setParam(param_spring_cloth);
body.create(physics, nodex_x, nodes_y, nodes_r, nodes_start_x, nodes_start_y);
body.getNode( 0, 0).enable(false, false, false); // fix node to current location
body.getNode(body.nodes_x-1, 0).enable(false, false, false); // fix node to current location
body.createShapeParticles(this);
softbodies.add(body);
}
// grid
{
nodex_x = 10;
nodes_y = 20;
nodes_r = 7;
nodes_start_x = width/2;
nodes_start_y = height/2;
DwSoftGrid2D body = new DwSoftGrid2D();
body.CREATE_SHEAR_SPRINGS = true;
body.CREATE_BEND_SPRINGS = true;
body.bend_spring_mode = 2;
r = 0;
g = 0;
b = 0;
a = 128;
s = 1f;
body.setMaterialColor(color(r ,g ,b , a));
body.setParticleColor(color(r*s,g*s,b*s, a));
body.setParam(param_particle);
body.setParam(param_spring_softbody);
body.create(physics, nodex_x, nodes_y, nodes_r, nodes_start_x, nodes_start_y);
body.createShapeParticles(this);
softbodies.add(body);
}
// grid
{
nodex_x = 7;
nodes_y = 22;
nodes_r = 7;
nodes_start_x = 500;
nodes_start_y = 300;
DwSoftGrid2D body = new DwSoftGrid2D();
body.CREATE_SHEAR_SPRINGS = true;
body.CREATE_BEND_SPRINGS = true;
body.bend_spring_mode = 0;
r = 0;
g = 180;
b = 255;
a = 160;
s = 1f;
body.setMaterialColor(color(r ,g ,b , a));
body.setParticleColor(color(r*s,g*s,b*s, a));
body.setParam(param_particle);
body.setParam(param_spring_softbody);
body.create(physics, nodex_x, nodes_y, nodes_r, nodes_start_x, nodes_start_y);
body.getNode(0, 0).enable(false, false, false); // fix node to current location
body.createShapeParticles(this);
softbodies.add(body);
}
// lattice girder
{
nodex_x = 15;
nodes_y = 2;
nodes_r = 20;
nodes_start_x = 500;
nodes_start_y = 100;
DwSoftGrid2D body = new DwSoftGrid2D();
body.CREATE_SHEAR_SPRINGS = true;
body.CREATE_BEND_SPRINGS = true;
body.bend_spring_mode = 0;
r = 0;
g = 0;
b = 0;
a = 128;
s = 1f;
body.setMaterialColor(color(r ,g ,b , a));
body.setParticleColor(color(r*s,g*s,b*s, a));
body.setParam(param_particle);
body.setParam(param_spring_softbody);
body.create(physics, nodex_x, nodes_y, nodes_r, nodes_start_x, nodes_start_y);
body.getNode(0, 0).enable(false, false, false); // fix node to current location
body.getNode(0, 1).enable(false, false, false); // fix node to current location
body.createShapeParticles(this);
softbodies.add(body);
}
// chain
{
nodex_x = 70;
nodes_y = 1;
nodes_r = 10;
nodes_start_x = 500;
nodes_start_y = 200;
DwSoftGrid2D body = new DwSoftGrid2D();
body.CREATE_BEND_SPRINGS = false;
body.CREATE_SHEAR_SPRINGS = false;
body.self_collisions = true; // particles of this body can collide among themselves
body.collision_radius_scale = 1.00f; // funny, if bigger than 1 and self_collisions = true
r = 0;
g = 0;
b = 0;
a = 128;
s = 1f;
body.setMaterialColor(color(r ,g ,b , a));
body.setParticleColor(color(r*s,g*s,b*s, a));
body.setParam(param_particle);
body.setParam(param_spring_chain);
body.create(physics, nodex_x, nodes_y, nodes_r, nodes_start_x, nodes_start_y);
body.getNode( 0, 0).enable(false, false, false); // fix node to current location
body.getNode(35, 0).enable(false, false, false);
body.createShapeParticles(this);
softbodies.add(body);
}
// circle
{
nodes_r = 10;
nodes_start_x = 300;
nodes_start_y = height-150;
DwSoftBall2D body = new DwSoftBall2D();
body.CREATE_BEND_SPRINGS = false;
body.CREATE_SHEAR_SPRINGS = false;
body.bend_spring_mode = 0;
body.bend_spring_dist = 8;
r = 0;
g = 0;
b = 0;
a = 160;
s = 1f;
body.setMaterialColor(color(r ,g ,b , a));
body.setParticleColor(color(r*s,g*s,b*s, a));
body.setParam(param_particle);
body.setParam(param_spring_circle);
body.create(physics, nodes_start_x, nodes_start_y, 70, nodes_r);
body.createShapeParticles(this);
softbodies.add(body);
}
}
public void draw() {
if(NEED_REBUILD){
createBodies();
NEED_REBUILD = false;
}
updateMouseInteractions();
// update physics simulation
physics.update(1);
// render
background(DISPLAY_MODE == 0 ? 255 : 92);
// 3) mesh, solid
if(DISPLAY_MESH){
for(DwSoftBody2D body : softbodies){
body.createShapeMesh(this.g);
}
}
// 1) particles
if(DISPLAY_PARTICLES){
for(DwSoftBody2D body : softbodies){
// body.use_particles_color = (DISPLAY_MODE == 0);
body.displayParticles(this.g);
}
}
// 2) mesh, solid
if(DISPLAY_MESH){
for(DwSoftBody2D body : softbodies){
body.displayMesh(this.g);
}
}
if(DISPLAY_SRPINGS){
for(DwSoftBody2D body : softbodies){
body.shade_springs_by_tension = (DISPLAY_MODE == 1);
body.displaySprings(this.g, new DwStrokeStyle(color(255, 90, 30), 0.3f), DwSpringConstraint.TYPE.BEND);
body.displaySprings(this.g, new DwStrokeStyle(color( 70, 140, 255), 0.6f), DwSpringConstraint.TYPE.SHEAR);
body.displaySprings(this.g, new DwStrokeStyle(color( 0, 0, 0), 1.0f), DwSpringConstraint.TYPE.STRUCT);
}
}
// interaction stuff
if(DELETE_SPRINGS){
fill(255,64);
stroke(0);
strokeWeight(1);
ellipse(mouseX, mouseY, DELETE_RADIUS*2, DELETE_RADIUS*2);
}
// info
int NUM_SPRINGS = physics.getSpringCount();
int NUM_PARTICLES = physics.getParticlesCount();
String txt_fps = String.format(getClass().getName()+ " [particles %d] [springs %d] [frame %d] [fps %6.2f]", NUM_PARTICLES, NUM_SPRINGS, frameCount, frameRate);
surface.setTitle(txt_fps);
}
// this resets all springs and particles, to some of its initial states
// can be used after deactivating springs with the mouse
public void repairAllSprings(){
for(DwSoftBody2D body : softbodies){
for(DwParticle pa : body.particles){
pa.setCollisionGroup(body.collision_group_id);
pa.setRadiusCollision(pa.rad());
pa.enableAllSprings(true);
}
}
}
// update all springs rest-lengths, based on current particle position
// the effect is, that the body keeps the current shape
public void applySpringMemoryEffect(){
ArrayList<DwSpringConstraint> springs = physics.getSprings();
for(DwSpringConstraint spring : springs){
spring.updateRestlength();
}
}
//////////////////////////////////////////////////////////////////////////////
// User Interaction
//////////////////////////////////////////////////////////////////////////////
DwParticle particle_mouse = null;
public DwParticle findNearestParticle(float mx, float my){
return findNearestParticle(mx, my, Float.MAX_VALUE);
}
public DwParticle findNearestParticle(float mx, float my, float search_radius){
float dd_min_sq = search_radius * search_radius;
DwParticle2D[] particles = physics.getParticles();
DwParticle particle = null;
for(int i = 0; i < particles.length; i++){
float dx = mx - particles[i].cx;
float dy = my - particles[i].cy;
float dd_sq = dx*dx + dy*dy;
if( dd_sq < dd_min_sq){
dd_min_sq = dd_sq;
particle = particles[i];
}
}
return particle;
}
public ArrayList<DwParticle> findParticlesWithinRadius(float mx, float my, float search_radius){
float dd_min_sq = search_radius * search_radius;
DwParticle2D[] particles = physics.getParticles();
ArrayList<DwParticle> list = new ArrayList<DwParticle>();
for(int i = 0; i < particles.length; i++){
float dx = mx - particles[i].cx;
float dy = my - particles[i].cy;
float dd_sq = dx*dx + dy*dy;
if(dd_sq < dd_min_sq){
list.add(particles[i]);
}
}
return list;
}
public void updateMouseInteractions(){
if(cp5.isMouseOver()) return;
// deleting springs/constraints between particles
if(DELETE_SPRINGS){
ArrayList<DwParticle> list = findParticlesWithinRadius(mouseX, mouseY, DELETE_RADIUS);
for(DwParticle tmp : list){
tmp.enableAllSprings(false);
tmp.collision_group = physics.getNewCollisionGroupId();
tmp.rad_collision = tmp.rad;
}
} else {
if(particle_mouse != null){
float[] mouse = {mouseX, mouseY};
particle_mouse.moveTo(mouse, 0.2f);
}
}
}
boolean DELETE_SPRINGS = false;
float DELETE_RADIUS = 10;
public void mousePressed(){
if(mouseButton == RIGHT ) DELETE_SPRINGS = true;
if(!DELETE_SPRINGS){
particle_mouse = findNearestParticle(mouseX, mouseY, 100);
if(particle_mouse != null) particle_mouse.enable(false, false, false);
}
}
public void mouseReleased(){
if(particle_mouse != null && !DELETE_SPRINGS){
if(mouseButton == LEFT ) particle_mouse.enable(true, true, true );
if(mouseButton == CENTER) particle_mouse.enable(true, false, false);
particle_mouse = null;
}
if(mouseButton == RIGHT ) DELETE_SPRINGS = false;
}
public void keyReleased(){
if(key == 's') repairAllSprings();
if(key == 'm') applySpringMemoryEffect();
if(key == 'r') createBodies();
if(key == '1') DISPLAY_MODE = 0;
if(key == '2') DISPLAY_MODE = 1;
if(key == '3') DISPLAY_PARTICLES = !DISPLAY_PARTICLES;
if(key == '4') DISPLAY_MESH = !DISPLAY_MESH;
if(key == '5') DISPLAY_SRPINGS = !DISPLAY_SRPINGS;
if(key == ' ') UPDATE_PHYSICS = !UPDATE_PHYSICS;
}
////////////////////////////////////////////////////////////////////////////
// GUI
////////////////////////////////////////////////////////////////////////////
public void setDisplayMode(int val){
DISPLAY_MODE = val;
}
public void setDisplayTypes(float[] val){
DISPLAY_PARTICLES = (val[0] > 0);
DISPLAY_MESH = (val[1] > 0);
DISPLAY_SRPINGS = (val[2] > 0);
}
public void setGravity(float val){
physics.param.GRAVITY[1] = val;
}
public void togglePause(){
UPDATE_PHYSICS = !UPDATE_PHYSICS;
}
ControlP5 cp5;
public void createGUI(){
cp5 = new ControlP5(this);
cp5.setAutoDraw(true);
int sx, sy, px, py, oy;
sx = 100; sy = 14; oy = (int)(sy*1.4f);
////////////////////////////////////////////////////////////////////////////
// GUI - CLOTH
////////////////////////////////////////////////////////////////////////////
Group group_physics = cp5.addGroup("global");
{
group_physics.setHeight(20).setSize(gui_w, height)
.setBackgroundColor(color(0, 204)).setColorBackground(color(0, 204));
group_physics.getCaptionLabel().align(CENTER, CENTER);
px = 10; py = 15;
int bsx = (gui_w-40)/3;
cp5.addButton("rebuild").setGroup(group_physics).plugTo(this, "createBodies").setSize(bsx, 18).setPosition(px, py);
cp5.addButton("pause") .setGroup(group_physics).plugTo(this, "togglePause").setSize(bsx, 18).setPosition(px+=bsx+10, py);
px = 10;
cp5.addSlider("gravity").setGroup(group_physics).setSize(sx, sy).setPosition(px, py+=(int)(oy*1.5f))
.setRange(0, 1).setValue(physics.param.GRAVITY[1]).plugTo(this, "setGravity");
cp5.addSlider("iter: springs").setGroup(group_physics).setSize(sx, sy).setPosition(px, py+=oy)
.setRange(0, 20).setValue(physics.param.iterations_springs).plugTo( physics.param, "iterations_springs");
cp5.addSlider("iter: collisions").setGroup(group_physics).setSize(sx, sy).setPosition(px, py+=oy)
.setRange(0, 8).setValue(physics.param.iterations_collisions).plugTo( physics.param, "iterations_collisions");
cp5.addRadio("setDisplayMode").setGroup(group_physics).setSize(sy,sy).setPosition(px, py+=(int)(oy*1.4f))
.setSpacingColumn(2).setSpacingRow(2).setItemsPerRow(1)
.addItem("springs: colored",0)
.addItem("springs: tension",1)
.activate(DISPLAY_MODE);
cp5.addCheckBox("setDisplayTypes").setGroup(group_physics).setSize(sy,sy).setPosition(px, py+=(int)(oy*2.4f))
.setSpacingColumn(2).setSpacingRow(2).setItemsPerRow(1)
.addItem("PARTICLES", 0).activate(DISPLAY_PARTICLES ? 0 : 5)
.addItem("MESH " , 1).activate(DISPLAY_MESH ? 1 : 5)
.addItem("SRPINGS" , 2).activate(DISPLAY_SRPINGS ? 2 : 5);
}
////////////////////////////////////////////////////////////////////////////
// GUI - SPRINGS
////////////////////////////////////////////////////////////////////////////
Group group_springs = cp5.addGroup("springs");
{
Group group_cloth = group_springs;
group_cloth.setHeight(20).setSize(gui_w, 210)
.setBackgroundColor(color(0, 204)).setColorBackground(color(0, 204));
group_cloth.getCaptionLabel().align(CENTER, CENTER);
px = 10; py = 15;
cp5.addSlider("Cloth.tensile").setGroup(group_cloth).setSize(sx, sy).setPosition(px, py+=oy)
.setRange(0.01f, 1).setValue(param_spring_cloth.damp_dec).plugTo(param_spring_cloth, "damp_dec");
cp5.addSlider("Cloth.pressure").setGroup(group_cloth).setSize(sx, sy).setPosition(px, py+=oy)
.setRange(0.01f, 1).setValue(param_spring_cloth.damp_inc).plugTo(param_spring_cloth, "damp_inc");
cp5.addSlider("Cube.tensile").setGroup(group_cloth).setSize(sx, sy).setPosition(px, py+=(int)(oy*2))
.setRange(0.01f, 1).setValue(param_spring_softbody.damp_dec).plugTo(param_spring_softbody, "damp_dec");
cp5.addSlider("Cube.pressure").setGroup(group_cloth).setSize(sx, sy).setPosition(px, py+=oy)
.setRange(0.01f, 1).setValue(param_spring_softbody.damp_inc).plugTo(param_spring_softbody, "damp_inc");
cp5.addSlider("Ball.tensile").setGroup(group_cloth).setSize(sx, sy).setPosition(px, py+=(int)(oy*2))
.setRange(0.01f, 1).setValue(param_spring_circle.damp_dec).plugTo(param_spring_circle, "damp_dec");
cp5.addSlider("Ball.pressure").setGroup(group_cloth).setSize(sx, sy).setPosition(px, py+=oy)
.setRange(0.01f, 1).setValue(param_spring_circle.damp_inc).plugTo(param_spring_circle, "damp_inc");
}
////////////////////////////////////////////////////////////////////////////
// GUI - ACCORDION
////////////////////////////////////////////////////////////////////////////
cp5.addAccordion("acc").setPosition(gui_x, gui_y).setWidth(gui_w).setSize(gui_w, height)
.setCollapseMode(Accordion.MULTI)
.addItem(group_springs)
.addItem(group_physics)
// .open(0, 1)
;
}
public static void main(String args[]) {
PApplet.main(new String[] { SoftBody2D_Playground.class.getName() });
}
}
``` |
Michael John Volland (born 1974) is a British Anglican priest and academic, specialising in mission and practical theology. It was announced on 31 August 2023 that he is to be the next Bishop of Birmingham. Since 2017, he has been Principal of Ridley Hall, Cambridge, an Anglican theological college in the Open Evangelical tradition. He was previously Director of Mission at Cranmer Hall, Durham, and Director of Context-based Training at Ridley Hall. In August 2023, it was announced that he would be the next Bishop of Birmingham and will be consecrated a bishop on 30 November 2023.
Early life and education
Volland was born in 1974. He grew up in Reading, Berkshire. He studied fine art at Northumbria University, graduating with a Bachelor of Arts (BA) degree in 1996.
For six years, prior to entering theological college, Volland worked as a youth minister. He studied youth ministry and theological education at King's College London, and completed a Master of Arts (MA) degree in 2004. From 2004 to 2006, he trained for ordained ministry at Ridley Hall, Cambridge, an Anglican theological college in the Open Evangelical tradition.
Volland later undertook postgraduate research at Durham University, and completed a Doctor of Theology and Ministry (DThM) degree in 2013. His doctoral thesis was titled "An entrepreneurial approach to priestly ministry in the parish: insights from a research study in the Diocese of Durham".
Ordained ministry
Volland was ordained in the Church of England as a deacon in 2006 and as a priest in 2007. He served as a pioneer minister leading a fresh expressions church in Gloucester between 2006 and 2009, and was also a curate of Gloucester Cathedral from 2007 to 2009. In 2009, he joined Cranmer Hall, Durham as tutor and Director of Mission. From 2014 to 2015, he was also missioner/leader of the East Durham Mission Project, and acting area dean of Easington, County Durham. The East Durham Mission Project is a group of nine parishes in former mining communities in the Diocese of Durham.
In 2015, Volland was appointed a tutor and Director of Context-based Training of Ridley Hall, Cambridge, and so he left the Diocese of Durham to move south in August 2015. Since 2015, he has also held permission to officiate in the Diocese of Ely. In December 2016, it was announced that he would be the next Principal of Ridley Hall. He took up the position in January 2017.
On 31 August 2023, it was announced that Volland would be the next Bishop of Birmingham, the diocesan bishop of the Diocese of Birmingham. He will be concentrated a bishop on 30 November 2023.
Military service
In addition to his parish and academic ministries, Volland has served as a military chaplain. On 25 February 2013, he was commissioned in the Royal Army Chaplains' Department as a Chaplain to the Forces Fourth Class (equivalent in rank to captain). He then joined the Durham Army Cadet Force as a chaplain. On 24 June 2015, with his moving to Cambridge, he resigned his commission.
Personal life
Volland is married to Rachel. Together they have three children.
Selected works
References
1974 births
Living people
21st-century English Anglican priests
Church of England priests
Evangelical Anglican clergy
Staff of Cranmer Hall, Durham
Staff of Ridley Hall, Cambridge
Alumni of Northumbria University
Alumni of King's College London
Alumni of Ridley Hall, Cambridge
Royal Army Chaplains' Department officers
Alumni of St John's College, Durham |
Felipe Neto Rodrigues Vieira (born January 21, 1988) is a Brazilian YouTuber, businessman, actor, comedian, writer and philanthropist, currently having 44.7 million subscribers and more than fifteen billion accumulated views. He is also the brother of YouTuber Luccas Neto. Currently, his videos focus on general entertainment.
Felipe is the founder of Paramaker, a business of network inside of YouTube, which owns channels such as Parafernalha and IGN Brasil Network, managing approximately channels, as an effort to professionalize the online video market in Brazil. He sold the company in 2015 to focus on his YouTube channel.
In 2020, he was included on Times list of the 100 most influential people in the world.
Early life
Felipe Neto was born on January 21, 1988, in Rio de Janeiro to a Brazilian father and a Portuguese mother. He has dual Brazilian and Portuguese citizenship. Felipe is the most-known fan of the Brazilian sports club Botafogo FR, a club which he has sponsored, and also the Portuguese club FC Porto. He currently lives in Barra da Tijuca a neighborhood in Rio de Janeiro.
Filmography
Web
Film
Advertisements
Theater
Publications
Awards and nominations
Controversies
As a popular YouTuber in Brazil, Felipe occasionally streams his online games to his audience. He was caught cheating in online chess games in 2021. He admitted to being assisted by a chess engine while playing and argued that he was instructed by a chess coach to do so as it would be an adequate training method to improve his knowledge of chess.
References
External links
1988 births
Living people
Brazilian people of Portuguese descent
Brazilian YouTubers
Internet activists
Entertainers from Rio de Janeiro (city) |
Patrick Woodroffe (born 11 June 1954) is a lighting designer and director working in the worlds of music, dance, fashion, art and architecture.
Career
Woodroffe began his career in lighting in 1973 and since then has lit and directed productions for many artists including ABBA, AC/DC, Adele, Bob Dylan, The Police, Take That, Peter Gabriel, Simon and Garfunkel, Genesis, Rammstein, Stevie Wonder, Rod Stewart, The Eagles, Lady Gaga, Donna Summer, Tina Turner, Pet Shop Boys, Michael Jackson, Elton John and Paul McCartney at the White House (3 June 2010).
Woodroffe has worked with The Rolling Stones as their lighting designer and creative director since 1982. He lit Martin Scorsese's Shine a Light, the 2006 documentary of the band’s Beacon Theatre performances during their A Bigger Bang Tour.
He has lit operas and ballet, where the lighting took the place of the scenery, notably, Romeo and Juliet at the Vienna State Opera (2001) and Swan Lake for the English National Ballet (1985).
Since 1995 Woodroffe has lit the Vanity Fair Oscar parties in Los Angeles and Cannes. In 2000 he was involved with the then Millennium Dome, lighting the show and the exterior of the building. In 2002 he lit the Queen's Jubilee concert from the gardens at Buckingham Palace.
In 2009 Woodroffe designed the lighting for the "This Is It" show for Michael Jackson where his work was featured in the 2009 American documentary concert film.
In 2012 he lit the London 2012 Olympic Games and London 2012 Paralympic Games opening and closing ceremonies.
In 2013 he and Adam Bassett (long-term Design Associate and Lighting Designer), created the lighting consultancy, Woodroffe Bassett Design (WBD). The company operates globally designing lighting for many different genres including music, theatrical performance, special events as well as permanent architectural entertainment installations.
In 2013 he was made a Royal Designer for Industry by the RSA and he was awarded an Officer of the Order of the British Empire (OBE) in the 2014 Birthday Honours for services to the arts.
In 2020 Woodroffe redesigned Lake of Dreams at Wynn Las Vegas, after it originally opened in 2005.
References
External links
Patrick Woodroffe's Website
Lighting designers
1954 births
Officers of the Order of the British Empire
People from Oxford
Living people |
The Fairmount neighborhood is located within the West Duluth district of Duluth, Minnesota, United States.
Grand Avenue serves as a main route in the community.
Duluth's Lake Superior Zoo is located within the Fairmount neighborhood at 72nd Avenue West and Grand Avenue.
The neighborhood is located between Keene Creek and Kingsbury Creek.
Keene Creek Dog Park is located at the eastern edge of the Fairmount neighborhood.
Adjacent Neighborhoods
(Directions following those of Duluth's general street grid system, not actual geographical coordinates)
Cody (north)
Norton Park (south, west)
Irving (east)
External links and references
City of Duluth website
City map of neighborhoods (PDF)
Duluth's Lake Superior Zoo website
Duluth–Superior metropolitan area
Neighborhoods in Duluth, Minnesota |
Clyde River Airport is located northeast of Clyde River, Nunavut, Canada, and is operated by the government of Nunavut.
Airlines and destinations
References
External links
Page about this airport on COPA's Places to Fly airport directory
Airports in the Arctic
Baffin Island
Certified airports in the Qikiqtaaluk Region |
In computational complexity theory, a log space transducer (LST) is a type of Turing machine used for log-space reductions.
A log space transducer, , has three tapes:
A read-only input tape.
A read/write work tape (bounded to at most symbols).
A write-only, write-once output tape.
will be designed to compute a log-space computable function (where is the alphabet of both the input and output tapes). If is executed with on its input tape, when the machine halts, it will have remaining on its output tape.
A language is said to be log-space reducible to a language if there exists a log-space computable function that will convert an input from problem into an input to problem in such a way that .
This seems like a rather convoluted idea, but it has two useful properties that are desirable for a reduction:
The property of transitivity holds. (A reduces to B and B reduces to C implies A reduces to C).
If A reduces to B, and B is in L, then we know A is in L.
Transitivity holds because it is possible to feed the output tape of one reducer (A→B) to another (B→C). At first glance, this seems incorrect because the A→C reducer needs to store the output tape from the A→B reducer onto the work tape in order to feed it into the B→C reducer, but this is not true. Each time the B→C reducer needs to access its input tape, the A→C reducer can re-run the A→B reducer, and so the output of the A→B reducer never needs to be stored entirely at once.
References
Szepietowski, Andrzej (1994), Turing Machines with Sublogarithmic Space , Springer Press, . Retrieved on 2008-12-03.
Sipser, Michael (2012), Introduction to the Theory of Computation, Cengage Learning, .
Computational complexity theory
Turing machine |
The 2014 Miami Beach Bowl was a post-season American college football bowl game played on December 22, 2014, at Marlins Park in Miami, Florida. The first edition of the Miami Beach Bowl, it featured the American Athletic Conference co-champion Memphis Tigers against the BYU Cougars. It began at 2:00 p.m. EST and aired on ESPN. It was one of the 2014–15 bowl games that comprised the conclusion of the 2014 FBS football season.
Memphis defeated BYU in double overtime by the score of 55–48. Afterwards, the two teams engaged in a bench-clearing brawl.
Team selection
The game featured the American Athletic Conference co-champion Memphis Tigers against the BYU Cougars.
This was the first meeting between these two teams.
BYU Cougars
In April 2014, organizers announced that they had reached a deal with BYU to play in the inaugural Miami Beach Bowl in 2014. After defeating the UNLV Rebels for their sixth win of the season on November 15, bowl director Carlos Padilla II extended an invitation to play in the game.
This was BYU's third Florida bowl game, following the 1976 Tangerine Bowl where they lost to Oklahoma State 21–49, and the 1985 Citrus Bowl where they lost to Ohio State 7–10.
Memphis Tigers
After finishing the regular season with a 9–3 record and a share of the American Athletic Conference championship, the Tigers accepted their bid to the Miami Beach Bowl.
This was Memphis' second Florida bowl game, following the 2008 St. Petersburg Bowl (the inaugural contest for that bowl game) where they lost to the South Florida Bulls by a score of 14–41. This was the Tigers' first bowl appearance since that game.
Game summary
Statistics
Post-game
Brawl
During the post game celebration Memphis players ran towards the BYU sideline to celebrate with their fans sitting behind the BYU bench (due to the bizarre baseball stadium field layout, most of the people in attendance could only sit on the BYU side of the field). Some bumping and shoving occurred and one Memphis player was pushed in the back by a BYU player that was allegedly also being pushed from behind. The Memphis player he pushed then turned around and (using both hands) punched/shoved the BYU player in the back of the head. As the BYU player turned his attention back to the attacker in an apparent attempt to retaliate he threw a punch and he was attacked by 3-4 Memphis players and an all out, bench-clearing brawl ensued. Punches and kicks were thrown by many players on both sides, one Memphis player even used a helmet as a weapon, and when it was over, numerous players walked off the field bloody and bruised. As the brawl was dying down a BYU player (Kai Nacua) can be seen coming into view and sucker punching a Memphis player (Alan Cross), who was not wearing a helmet, from behind. As the BYU player turned toward the camera's view, a bloodied bruise could be clearly seen from a punch he received while attempting to defend himself from another Memphis player earlier in the brawl.
Aftermath
Tom Holmoe, BYU's athletic director, apologized to BYU fans stating, "We expect better of our athletes, even in the face of a difficult loss. We intend to fully review this matter. I apologize to Cougar Nation." Memphis said in a statement via AAC commissioner Mike Aresco that they are displeased with the Miami Beach Bowl brawl, and that, "The university will respond accordingly following this detailed review. Needless to say, we are extremely disappointed that this happened, as we expect the highest standard of conduct from our student-athletes."
On January 20, 2015, The University of Memphis announced the completion of an internal review of the incident and expected punishments to be levied against twelve members of the team. BYU also took action to punish their players. Kai Nacua, Trey Dye, Sione Takitaki, and Tomasi Laulile were all suspended for BYU's season opener against Nebraska.
References
2014–15 NCAA football bowl games
2014
2014
2014
Brawls in team sports
College football controversies
2014 controversies in the United States
Controversies in Florida
2014 in sports in Florida
2010s in Miami
December 2014 sports events in the United States
Violence in sports
2014 |
Yuri Alekseyevich Novikov (; born 19 May 1972) is a former Kazakh football goalkeeper. He retired from football at the end of 2007. He is a goalkeeper coach at FC Tobol currently in the Kazakhstan Super League. He has also played for the Kazakhstan national football team, making his debut in 2001.
Novikov started and spent most of his career in Pavlodar, Kazakhstan, where he played in local team "Irtysh" (formerly called "Traktor", "Ansat"). He made his debut in 1990. He also played for FC Shakhter Karagandy.
Novikov was named as the best goalkeeper in the Kazakhstan Super League for the seasons 2001, 2002, 2003 Moreover, Novikov was named Kazakhstani Footballer of the Year by journal GOAL in 2003.
References
External links
FC Tobol staff list
Living people
1972 births
Men's association football goalkeepers
Kazakhstani men's footballers
Kazakhstan men's international footballers
Kazakhstan Premier League players
FC Irtysh Pavlodar players
FC Shakhter Karagandy players
FC Zhetysu players
Place of birth missing (living people)
Soviet men's footballers |
```c++
#include "rar.hpp"
void HashValue::Init(HASH_TYPE Type)
{
HashValue::Type=Type;
// Zero length data CRC32 is 0. It is important to set it when creating
// headers with no following data like directories or symlinks.
if (Type==HASH_RAR14 || Type==HASH_CRC32)
CRC32=0;
if (Type==HASH_BLAKE2)
{
// your_sha256_hash
// is BLAKE2sp hash of empty data. We init the structure to this value,
// so if we create a file or service header with no following data like
// "file copy" or "symlink", we set the checksum to proper value avoiding
// additional header type or size checks when extracting.
static byte EmptyHash[32]={
0xdd, 0x0e, 0x89, 0x17, 0x76, 0x93, 0x3f, 0x43,
0xc7, 0xd0, 0x32, 0xb0, 0x8a, 0x91, 0x7e, 0x25,
0x74, 0x1f, 0x8a, 0xa9, 0xa1, 0x2c, 0x12, 0xe1,
0xca, 0xc8, 0x80, 0x15, 0x00, 0xf2, 0xca, 0x4f
};
memcpy(Digest,EmptyHash,sizeof(Digest));
}
}
bool HashValue::operator == (const HashValue &cmp)
{
if (Type==HASH_NONE || cmp.Type==HASH_NONE)
return true;
if (Type==HASH_RAR14 && cmp.Type==HASH_RAR14 ||
Type==HASH_CRC32 && cmp.Type==HASH_CRC32)
return CRC32==cmp.CRC32;
if (Type==HASH_BLAKE2 && cmp.Type==HASH_BLAKE2)
return memcmp(Digest,cmp.Digest,sizeof(Digest))==0;
return false;
}
DataHash::DataHash()
{
blake2ctx=NULL;
HashType=HASH_NONE;
#ifdef RAR_SMP
ThPool=NULL;
MaxThreads=0;
#endif
}
DataHash::~DataHash()
{
#ifdef RAR_SMP
delete ThPool;
#endif
cleandata(&CurCRC32, sizeof(CurCRC32));
if (blake2ctx!=NULL)
{
cleandata(blake2ctx, sizeof(blake2sp_state));
delete blake2ctx;
}
}
void DataHash::Init(HASH_TYPE Type,uint MaxThreads)
{
if (blake2ctx==NULL)
blake2ctx=new blake2sp_state;
HashType=Type;
if (Type==HASH_RAR14)
CurCRC32=0;
if (Type==HASH_CRC32)
CurCRC32=0xffffffff; // Initial CRC32 value.
if (Type==HASH_BLAKE2)
blake2sp_init(blake2ctx);
#ifdef RAR_SMP
DataHash::MaxThreads=Min(MaxThreads,MaxHashThreads);
#endif
}
void DataHash::Update(const void *Data,size_t DataSize)
{
#ifndef SFX_MODULE
if (HashType==HASH_RAR14)
CurCRC32=Checksum14((ushort)CurCRC32,Data,DataSize);
#endif
if (HashType==HASH_CRC32)
CurCRC32=CRC32(CurCRC32,Data,DataSize);
if (HashType==HASH_BLAKE2)
{
#ifdef RAR_SMP
if (MaxThreads>1 && ThPool==NULL)
ThPool=new ThreadPool(BLAKE2_THREADS_NUMBER);
blake2ctx->ThPool=ThPool;
blake2ctx->MaxThreads=MaxThreads;
#endif
blake2sp_update( blake2ctx, (byte *)Data, DataSize);
}
}
void DataHash::Result(HashValue *Result)
{
Result->Type=HashType;
if (HashType==HASH_RAR14)
Result->CRC32=CurCRC32;
if (HashType==HASH_CRC32)
Result->CRC32=CurCRC32^0xffffffff;
if (HashType==HASH_BLAKE2)
{
// Preserve the original context, so we can continue hashing if necessary.
blake2sp_state res=*blake2ctx;
blake2sp_final(&res,Result->Digest);
}
}
uint DataHash::GetCRC32()
{
return HashType==HASH_CRC32 ? CurCRC32^0xffffffff : 0;
}
bool DataHash::Cmp(HashValue *CmpValue,byte *Key)
{
HashValue Final;
Result(&Final);
if (Key!=NULL)
ConvertHashToMAC(&Final,Key);
return Final==*CmpValue;
}
``` |
```go
// snippet-start:[rds.go.list_parameter_groups]
package main
// snippet-start:[rds.go.list_parameter_groups.imports]
import (
"fmt"
"github.com/aws/aws-sdk-go/aws/session"
"github.com/aws/aws-sdk-go/service/rds"
)
// snippet-end:[rds.go.list_parameter_groups.imports]
// GetParameterGroups retrieves your Amazon RDS parameter groups
// Inputs:
// sess is the current session, which provides configuration for the SDK's service clients
// Output:
// If success, a list of the parameter groups and nil
// Otherwise, nil and an error from the call to DescribeDBParameterGroups
func GetParameterGroups(sess *session.Session) (*rds.DescribeDBParameterGroupsOutput, error) {
// snippet-start:[rds.go.list_parameter_groups.call]
svc := rds.New(sess)
result, err := svc.DescribeDBParameterGroups(nil)
// snippet-end:[rds.go.list_parameter_groups.call]
if err != nil {
return nil, err
}
return result, nil
}
func main() {
// snippet-start:[rds.go.list_parameter_groups.session]
sess := session.Must(session.NewSessionWithOptions(session.Options{
SharedConfigState: session.SharedConfigEnable,
}))
// snippet-end:[rds.go.list_parameter_groups.session]
result, err := GetParameterGroups(sess)
if err != nil {
fmt.Println("Got an error retrieving parameter groups:")
fmt.Println(err)
return
}
if len(result.DBParameterGroups) < 1 {
fmt.Println("Could not find any parameter groups")
return
}
for _, p := range result.DBParameterGroups {
fmt.Println("* " + *p.DBParameterGroupName + " with description: " + *p.Description)
}
}
// snippet-end:[rds.go.list_parameter_groups]
``` |
```java
/*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of the libjpeg-turbo Project nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS",
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
package org.libjpegturbo.turbojpeg;
import java.awt.image.*;
import java.nio.*;
import java.io.*;
/**
* TurboJPEG compressor
*/
public class TJCompressor implements Closeable {
private static final String NO_ASSOC_ERROR =
"No source image is associated with this instance";
/**
* Create a TurboJPEG compressor instance.
*/
public TJCompressor() throws TJException {
init();
}
/**
* Create a TurboJPEG compressor instance and associate the uncompressed
* source image stored in <code>srcImage</code> with the newly created
* instance.
*
* @param srcImage see {@link #setSourceImage} for description
*
* @param x see {@link #setSourceImage} for description
*
* @param y see {@link #setSourceImage} for description
*
* @param width see {@link #setSourceImage} for description
*
* @param pitch see {@link #setSourceImage} for description
*
* @param height see {@link #setSourceImage} for description
*
* @param pixelFormat pixel format of the source image (one of
* {@link TJ#PF_RGB TJ.PF_*})
*/
public TJCompressor(byte[] srcImage, int x, int y, int width, int pitch,
int height, int pixelFormat) throws TJException {
setSourceImage(srcImage, x, y, width, pitch, height, pixelFormat);
}
/**
* @deprecated Use
* {@link #TJCompressor(byte[], int, int, int, int, int, int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public TJCompressor(byte[] srcImage, int width, int pitch, int height,
int pixelFormat) throws TJException {
setSourceImage(srcImage, width, pitch, height, pixelFormat);
}
/**
* Create a TurboJPEG compressor instance and associate the uncompressed
* source image stored in <code>srcImage</code> with the newly created
* instance.
*
* @param srcImage see
* {@link #setSourceImage(BufferedImage, int, int, int, int)} for description
*
* @param x see
* {@link #setSourceImage(BufferedImage, int, int, int, int)} for description
*
* @param y see
* {@link #setSourceImage(BufferedImage, int, int, int, int)} for description
*
* @param width see
* {@link #setSourceImage(BufferedImage, int, int, int, int)} for description
*
* @param height see
* {@link #setSourceImage(BufferedImage, int, int, int, int)} for description
*/
public TJCompressor(BufferedImage srcImage, int x, int y, int width,
int height) throws TJException {
setSourceImage(srcImage, x, y, width, height);
}
/**
* Associate an uncompressed RGB, grayscale, or CMYK source image with this
* compressor instance.
*
* @param srcImage image buffer containing RGB, grayscale, or CMYK pixels to
* be compressed or encoded. This buffer is not modified.
*
* @param x x offset (in pixels) of the region in the source image from which
* the JPEG or YUV image should be compressed/encoded
*
* @param y y offset (in pixels) of the region in the source image from which
* the JPEG or YUV image should be compressed/encoded
*
* @param width width (in pixels) of the region in the source image from
* which the JPEG or YUV image should be compressed/encoded
*
* @param pitch bytes per line of the source image. Normally, this should be
* <code>width * TJ.pixelSize(pixelFormat)</code> if the source image is
* unpadded, but you can use this parameter to, for instance, specify that
* the scanlines in the source image are padded to a 4-byte boundary or to
* compress/encode a JPEG or YUV image from a region of a larger source
* image. You can also be clever and use this parameter to skip lines, etc.
* Setting this parameter to 0 is the equivalent of setting it to
* <code>width * TJ.pixelSize(pixelFormat)</code>.
*
* @param height height (in pixels) of the region in the source image from
* which the JPEG or YUV image should be compressed/encoded
*
* @param pixelFormat pixel format of the source image (one of
* {@link TJ#PF_RGB TJ.PF_*})
*/
public void setSourceImage(byte[] srcImage, int x, int y, int width,
int pitch, int height, int pixelFormat)
throws TJException {
if (handle == 0) init();
if (srcImage == null || x < 0 || y < 0 || width < 1 || height < 1 ||
pitch < 0 || pixelFormat < 0 || pixelFormat >= TJ.NUMPF)
throw new IllegalArgumentException("Invalid argument in setSourceImage()");
srcBuf = srcImage;
srcWidth = width;
if (pitch == 0)
srcPitch = width * TJ.getPixelSize(pixelFormat);
else
srcPitch = pitch;
srcHeight = height;
srcPixelFormat = pixelFormat;
srcX = x;
srcY = y;
srcBufInt = null;
srcYUVImage = null;
}
/**
* @deprecated Use
* {@link #setSourceImage(byte[], int, int, int, int, int, int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public void setSourceImage(byte[] srcImage, int width, int pitch,
int height, int pixelFormat) throws TJException {
setSourceImage(srcImage, 0, 0, width, pitch, height, pixelFormat);
srcX = srcY = -1;
}
/**
* Associate an uncompressed RGB or grayscale source image with this
* compressor instance.
*
* @param srcImage a <code>BufferedImage</code> instance containing RGB or
* grayscale pixels to be compressed or encoded. This image is not modified.
*
* @param x x offset (in pixels) of the region in the source image from which
* the JPEG or YUV image should be compressed/encoded
*
* @param y y offset (in pixels) of the region in the source image from which
* the JPEG or YUV image should be compressed/encoded
*
* @param width width (in pixels) of the region in the source image from
* which the JPEG or YUV image should be compressed/encoded (0 = use the
* width of the source image)
*
* @param height height (in pixels) of the region in the source image from
* which the JPEG or YUV image should be compressed/encoded (0 = use the
* height of the source image)
*/
public void setSourceImage(BufferedImage srcImage, int x, int y, int width,
int height) throws TJException {
if (handle == 0) init();
if (srcImage == null || x < 0 || y < 0 || width < 0 || height < 0)
throw new IllegalArgumentException("Invalid argument in setSourceImage()");
srcX = x;
srcY = y;
srcWidth = (width == 0) ? srcImage.getWidth() : width;
srcHeight = (height == 0) ? srcImage.getHeight() : height;
if (x + width > srcImage.getWidth() || y + height > srcImage.getHeight())
throw new IllegalArgumentException("Compression region exceeds the bounds of the source image");
int pixelFormat;
boolean intPixels = false;
if (byteOrder == null)
byteOrder = ByteOrder.nativeOrder();
switch (srcImage.getType()) {
case BufferedImage.TYPE_3BYTE_BGR:
pixelFormat = TJ.PF_BGR; break;
case BufferedImage.TYPE_4BYTE_ABGR:
case BufferedImage.TYPE_4BYTE_ABGR_PRE:
pixelFormat = TJ.PF_XBGR; break;
case BufferedImage.TYPE_BYTE_GRAY:
pixelFormat = TJ.PF_GRAY; break;
case BufferedImage.TYPE_INT_BGR:
if (byteOrder == ByteOrder.BIG_ENDIAN)
pixelFormat = TJ.PF_XBGR;
else
pixelFormat = TJ.PF_RGBX;
intPixels = true; break;
case BufferedImage.TYPE_INT_RGB:
case BufferedImage.TYPE_INT_ARGB:
case BufferedImage.TYPE_INT_ARGB_PRE:
if (byteOrder == ByteOrder.BIG_ENDIAN)
pixelFormat = TJ.PF_XRGB;
else
pixelFormat = TJ.PF_BGRX;
intPixels = true; break;
default:
throw new IllegalArgumentException("Unsupported BufferedImage format");
}
srcPixelFormat = pixelFormat;
WritableRaster wr = srcImage.getRaster();
if (intPixels) {
SinglePixelPackedSampleModel sm =
(SinglePixelPackedSampleModel)srcImage.getSampleModel();
srcStride = sm.getScanlineStride();
DataBufferInt db = (DataBufferInt)wr.getDataBuffer();
srcBufInt = db.getData();
srcBuf = null;
} else {
ComponentSampleModel sm =
(ComponentSampleModel)srcImage.getSampleModel();
int pixelSize = sm.getPixelStride();
if (pixelSize != TJ.getPixelSize(pixelFormat))
throw new IllegalArgumentException("Inconsistency between pixel format and pixel size in BufferedImage");
srcPitch = sm.getScanlineStride();
DataBufferByte db = (DataBufferByte)wr.getDataBuffer();
srcBuf = db.getData();
srcBufInt = null;
}
srcYUVImage = null;
}
/**
* Associate an uncompressed YUV planar source image with this compressor
* instance.
*
* @param srcImage YUV planar image to be compressed. This image is not
* modified.
*/
public void setSourceImage(YUVImage srcImage) throws TJException {
if (handle == 0) init();
if (srcImage == null)
throw new IllegalArgumentException("Invalid argument in setSourceImage()");
srcYUVImage = srcImage;
srcBuf = null;
srcBufInt = null;
}
/**
* Set the level of chrominance subsampling for subsequent compress/encode
* operations. When pixels are converted from RGB to YCbCr (see
* {@link TJ#CS_YCbCr}) or from CMYK to YCCK (see {@link TJ#CS_YCCK}) as part
* of the JPEG compression process, some of the Cb and Cr (chrominance)
* components can be discarded or averaged together to produce a smaller
* image with little perceptible loss of image clarity (the human eye is more
* sensitive to small changes in brightness than to small changes in color.)
* This is called "chrominance subsampling".
* <p>
* NOTE: This method has no effect when compressing a JPEG image from a YUV
* planar source. In that case, the level of chrominance subsampling in
* the JPEG image is determined by the source. Furthermore, this method has
* no effect when encoding to a pre-allocated {@link YUVImage} instance. In
* that case, the level of chrominance subsampling is determined by the
* destination.
*
* @param newSubsamp the level of chrominance subsampling to use in
* subsequent compress/encode oeprations (one of
* {@link TJ#SAMP_444 TJ.SAMP_*})
*/
public void setSubsamp(int newSubsamp) {
if (newSubsamp < 0 || newSubsamp >= TJ.NUMSAMP)
throw new IllegalArgumentException("Invalid argument in setSubsamp()");
subsamp = newSubsamp;
}
/**
* Set the JPEG image quality level for subsequent compress operations.
*
* @param quality the new JPEG image quality level (1 to 100, 1 = worst,
* 100 = best)
*/
public void setJPEGQuality(int quality) {
if (quality < 1 || quality > 100)
throw new IllegalArgumentException("Invalid argument in setJPEGQuality()");
jpegQuality = quality;
}
/**
* Compress the uncompressed source image associated with this compressor
* instance and output a JPEG image to the given destination buffer.
*
* @param dstBuf buffer that will receive the JPEG image. Use
* {@link TJ#bufSize} to determine the maximum size for this buffer based on
* the source image's width and height and the desired level of chrominance
* subsampling.
*
* @param flags the bitwise OR of one or more of
* {@link TJ#FLAG_BOTTOMUP TJ.FLAG_*}
*/
public void compress(byte[] dstBuf, int flags) throws TJException {
if (dstBuf == null || flags < 0)
throw new IllegalArgumentException("Invalid argument in compress()");
if (srcBuf == null && srcBufInt == null && srcYUVImage == null)
throw new IllegalStateException(NO_ASSOC_ERROR);
if (jpegQuality < 0)
throw new IllegalStateException("JPEG Quality not set");
if (subsamp < 0 && srcYUVImage == null)
throw new IllegalStateException("Subsampling level not set");
if (srcYUVImage != null)
compressedSize = compressFromYUV(srcYUVImage.getPlanes(),
srcYUVImage.getOffsets(),
srcYUVImage.getWidth(),
srcYUVImage.getStrides(),
srcYUVImage.getHeight(),
srcYUVImage.getSubsamp(),
dstBuf, jpegQuality, flags);
else if (srcBuf != null) {
if (srcX >= 0 && srcY >= 0)
compressedSize = compress(srcBuf, srcX, srcY, srcWidth, srcPitch,
srcHeight, srcPixelFormat, dstBuf, subsamp,
jpegQuality, flags);
else
compressedSize = compress(srcBuf, srcWidth, srcPitch, srcHeight,
srcPixelFormat, dstBuf, subsamp, jpegQuality,
flags);
} else if (srcBufInt != null) {
if (srcX >= 0 && srcY >= 0)
compressedSize = compress(srcBufInt, srcX, srcY, srcWidth, srcStride,
srcHeight, srcPixelFormat, dstBuf, subsamp,
jpegQuality, flags);
else
compressedSize = compress(srcBufInt, srcWidth, srcStride, srcHeight,
srcPixelFormat, dstBuf, subsamp, jpegQuality,
flags);
}
}
/**
* Compress the uncompressed source image associated with this compressor
* instance and return a buffer containing a JPEG image.
*
* @param flags the bitwise OR of one or more of
* {@link TJ#FLAG_BOTTOMUP TJ.FLAG_*}
*
* @return a buffer containing a JPEG image. The length of this buffer will
* not be equal to the size of the JPEG image. Use {@link
* #getCompressedSize} to obtain the size of the JPEG image.
*/
public byte[] compress(int flags) throws TJException {
byte[] buf;
if (srcYUVImage != null) {
buf = new byte[TJ.bufSize(srcYUVImage.getWidth(),
srcYUVImage.getHeight(),
srcYUVImage.getSubsamp())];
} else {
checkSourceImage();
buf = new byte[TJ.bufSize(srcWidth, srcHeight, subsamp)];
}
compress(buf, flags);
return buf;
}
/**
* @deprecated Use
* {@link #setSourceImage(BufferedImage, int, int, int, int)} and
* {@link #compress(byte[], int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public void compress(BufferedImage srcImage, byte[] dstBuf, int flags)
throws TJException {
setSourceImage(srcImage, 0, 0, 0, 0);
compress(dstBuf, flags);
}
/**
* @deprecated Use
* {@link #setSourceImage(BufferedImage, int, int, int, int)} and
* {@link #compress(int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public byte[] compress(BufferedImage srcImage, int flags)
throws TJException {
setSourceImage(srcImage, 0, 0, 0, 0);
return compress(flags);
}
/**
* Encode the uncompressed source image associated with this compressor
* instance into a YUV planar image and store it in the given
* <code>YUVImage</code> instance. This method uses the accelerated color
* conversion routines in TurboJPEG's underlying codec but does not execute
* any of the other steps in the JPEG compression process. Encoding
* CMYK source images to YUV is not supported.
*
* @param dstImage {@link YUVImage} instance that will receive the YUV planar
* image
*
* @param flags the bitwise OR of one or more of
* {@link TJ#FLAG_BOTTOMUP TJ.FLAG_*}
*/
public void encodeYUV(YUVImage dstImage, int flags) throws TJException {
if (dstImage == null || flags < 0)
throw new IllegalArgumentException("Invalid argument in encodeYUV()");
if (srcBuf == null && srcBufInt == null)
throw new IllegalStateException(NO_ASSOC_ERROR);
if (srcYUVImage != null)
throw new IllegalStateException("Source image is not correct type");
checkSubsampling();
if (srcWidth != dstImage.getWidth() || srcHeight != dstImage.getHeight())
throw new IllegalStateException("Destination image is the wrong size");
if (srcBufInt != null) {
encodeYUV(srcBufInt, srcX, srcY, srcWidth, srcStride, srcHeight,
srcPixelFormat, dstImage.getPlanes(), dstImage.getOffsets(),
dstImage.getStrides(), dstImage.getSubsamp(), flags);
} else {
encodeYUV(srcBuf, srcX, srcY, srcWidth, srcPitch, srcHeight,
srcPixelFormat, dstImage.getPlanes(), dstImage.getOffsets(),
dstImage.getStrides(), dstImage.getSubsamp(), flags);
}
compressedSize = 0;
}
/**
* @deprecated Use {@link #encodeYUV(YUVImage, int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public void encodeYUV(byte[] dstBuf, int flags) throws TJException {
if (dstBuf == null)
throw new IllegalArgumentException("Invalid argument in encodeYUV()");
checkSourceImage();
checkSubsampling();
YUVImage dstYUVImage = new YUVImage(dstBuf, srcWidth, 4, srcHeight,
subsamp);
encodeYUV(dstYUVImage, flags);
}
/**
* Encode the uncompressed source image associated with this compressor
* instance into a unified YUV planar image buffer and return a
* <code>YUVImage</code> instance containing the encoded image. This method
* uses the accelerated color conversion routines in TurboJPEG's underlying
* codec but does not execute any of the other steps in the JPEG compression
* process. Encoding CMYK source images to YUV is not supported.
*
* @param pad the width of each line in each plane of the YUV image will be
* padded to the nearest multiple of this number of bytes (must be a power of
* 2.)
*
* @param flags the bitwise OR of one or more of
* {@link TJ#FLAG_BOTTOMUP TJ.FLAG_*}
*
* @return a YUV planar image.
*/
public YUVImage encodeYUV(int pad, int flags) throws TJException {
checkSourceImage();
checkSubsampling();
if (pad < 1 || ((pad & (pad - 1)) != 0))
throw new IllegalStateException("Invalid argument in encodeYUV()");
YUVImage dstYUVImage = new YUVImage(srcWidth, pad, srcHeight, subsamp);
encodeYUV(dstYUVImage, flags);
return dstYUVImage;
}
/**
* Encode the uncompressed source image associated with this compressor
* instance into separate Y, U (Cb), and V (Cr) image planes and return a
* <code>YUVImage</code> instance containing the encoded image planes. This
* method uses the accelerated color conversion routines in TurboJPEG's
* underlying codec but does not execute any of the other steps in the JPEG
* compression process. Encoding CMYK source images to YUV is not supported.
*
* @param strides an array of integers, each specifying the number of bytes
* per line in the corresponding plane of the output image. Setting the
* stride for any plane to 0 is the same as setting it to the component width
* of the plane. If <code>strides</code> is null, then the strides for all
* planes will be set to their respective component widths. You can adjust
* the strides in order to add an arbitrary amount of line padding to each
* plane.
*
* @param flags the bitwise OR of one or more of
* {@link TJ#FLAG_BOTTOMUP TJ.FLAG_*}
*
* @return a YUV planar image.
*/
public YUVImage encodeYUV(int[] strides, int flags) throws TJException {
checkSourceImage();
checkSubsampling();
YUVImage dstYUVImage = new YUVImage(srcWidth, strides, srcHeight, subsamp);
encodeYUV(dstYUVImage, flags);
return dstYUVImage;
}
/**
* @deprecated Use {@link #encodeYUV(int, int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public byte[] encodeYUV(int flags) throws TJException {
checkSourceImage();
checkSubsampling();
YUVImage dstYUVImage = new YUVImage(srcWidth, 4, srcHeight, subsamp);
encodeYUV(dstYUVImage, flags);
return dstYUVImage.getBuf();
}
/**
* @deprecated Use
* {@link #setSourceImage(BufferedImage, int, int, int, int)} and
* {@link #encodeYUV(byte[], int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public void encodeYUV(BufferedImage srcImage, byte[] dstBuf, int flags)
throws TJException {
setSourceImage(srcImage, 0, 0, 0, 0);
encodeYUV(dstBuf, flags);
}
/**
* @deprecated Use
* {@link #setSourceImage(BufferedImage, int, int, int, int)} and
* {@link #encodeYUV(int, int)} instead.
*/
@SuppressWarnings("checkstyle:JavadocMethod")
@Deprecated
public byte[] encodeYUV(BufferedImage srcImage, int flags)
throws TJException {
setSourceImage(srcImage, 0, 0, 0, 0);
return encodeYUV(flags);
}
/**
* Returns the size of the image (in bytes) generated by the most recent
* compress operation.
*
* @return the size of the image (in bytes) generated by the most recent
* compress operation.
*/
public int getCompressedSize() {
return compressedSize;
}
/**
* Free the native structures associated with this compressor instance.
*/
@Override
public void close() throws TJException {
if (handle != 0)
destroy();
}
@SuppressWarnings("checkstyle:DesignForExtension")
@Override
protected void finalize() throws Throwable {
try {
close();
} catch (TJException e) {
} finally {
super.finalize();
}
};
private native void init() throws TJException;
private native void destroy() throws TJException;
// JPEG size in bytes is returned
@SuppressWarnings("checkstyle:HiddenField")
@Deprecated
private native int compress(byte[] srcBuf, int width, int pitch,
int height, int pixelFormat, byte[] jpegBuf, int jpegSubsamp, int jpegQual,
int flags) throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
private native int compress(byte[] srcBuf, int x, int y, int width,
int pitch, int height, int pixelFormat, byte[] jpegBuf, int jpegSubsamp,
int jpegQual, int flags) throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
@Deprecated
private native int compress(int[] srcBuf, int width, int stride,
int height, int pixelFormat, byte[] jpegBuf, int jpegSubsamp, int jpegQual,
int flags) throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
private native int compress(int[] srcBuf, int x, int y, int width,
int stride, int height, int pixelFormat, byte[] jpegBuf, int jpegSubsamp,
int jpegQual, int flags) throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
private native int compressFromYUV(byte[][] srcPlanes, int[] srcOffsets,
int width, int[] srcStrides, int height, int subsamp, byte[] jpegBuf,
int jpegQual, int flags)
throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
@Deprecated
private native void encodeYUV(byte[] srcBuf, int width, int pitch,
int height, int pixelFormat, byte[] dstBuf, int subsamp, int flags)
throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
private native void encodeYUV(byte[] srcBuf, int x, int y, int width,
int pitch, int height, int pixelFormat, byte[][] dstPlanes,
int[] dstOffsets, int[] dstStrides, int subsamp, int flags)
throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
@Deprecated
private native void encodeYUV(int[] srcBuf, int width, int stride,
int height, int pixelFormat, byte[] dstBuf, int subsamp, int flags)
throws TJException;
@SuppressWarnings("checkstyle:HiddenField")
private native void encodeYUV(int[] srcBuf, int x, int y, int width,
int srcStride, int height, int pixelFormat, byte[][] dstPlanes,
int[] dstOffsets, int[] dstStrides, int subsamp, int flags)
throws TJException;
static {
TJLoader.load();
}
private void checkSourceImage() {
if (srcWidth < 1 || srcHeight < 1)
throw new IllegalStateException(NO_ASSOC_ERROR);
}
private void checkSubsampling() {
if (subsamp < 0)
throw new IllegalStateException("Subsampling level not set");
}
private long handle = 0;
private byte[] srcBuf = null;
private int[] srcBufInt = null;
private int srcWidth = 0;
private int srcHeight = 0;
private int srcX = -1;
private int srcY = -1;
private int srcPitch = 0;
private int srcStride = 0;
private int srcPixelFormat = -1;
private YUVImage srcYUVImage = null;
private int subsamp = -1;
private int jpegQuality = -1;
private int compressedSize = 0;
private int yuvPad = 4;
private ByteOrder byteOrder = null;
}
``` |
The Parenting is an upcoming American horror-comedy film directed by Craig Johnson and written by Kent Sublette. It stars Brian Cox, Edie Falco, Lisa Kudrow, Dean Norris, Nik Dodani, Brandon Flynn, Vivian Bang and Parker Posey.
Premise
A young gay couple, Rohan and Josh, host a weekend getaway with their respective parents in a country house rental. Things take a turn when the three couples discover the presence of a 400-year-old evil entity.
Cast
Nik Dodani as Rohan
Brandon Flynn as Josh
Brian Cox
Edie Falco
Lisa Kudrow
Dean Norris
Parker Posey
Vivian Bang
Production
On January 26, 2021, New Line Cinema put in development a horror-comedy project written by Kent Sublette, with Craig Johnson attached to direct. The cast was announced in March 2022. After a table read via Zoom on March 19, filming began on March 25, 2022, in Massachusetts.
Release
The film is set to be released on Max.
References
External links
American comedy horror films
American LGBT-related films
Demons in film
Films about families
Films shot in Massachusetts
Gay-related films
HBO Max films
LGBT-related comedy horror films
New Line Cinema films
Upcoming English-language films
Upcoming films
Films directed by Craig Johnson
Warner Bros. films |
Martyn Moore is an English journalist, editor and film-maker.
He was born in 1961 at Norton-on-Derwent, Yorkshire and started work as a professional photographer in 1982. Moore travelled extensively as a photographer until 1988 when he joined the publishing company Emap as a feature writer for Practical Photography magazine.
In 1989 he was the PTC Trainee Journalist of the Year.
In 1991 Moore moved to Bike magazine as editor and was BSME Magazine Editor of the Year in 1992.
After Bike he started to work his way through Emap specialist magazines to become one of the company's most versatile editors, leading the editorial teams for, in chronological order:
Photo Answers, Practical Photography, Internet Magazine, Max Power, Max Power Online, Classic Cars magazine, Practical Classics, Fleet News
During his editorship of Classic Cars, Moore was also the resident classic car expert on BBC1's 20th Century Roadshow, presented by Alan Titchmarsh. In 2004 he was Emap Automotive's Editor of the Year.
Moore wrote his first book, The Photographer's Guide to Setting Up a Website in 2005. In 2008, he set up his own editorial services and media consultancy, NorthLight Media Ltd. NorthLight's first project was a regional business-to-business news website, Peterboroughbusiness.co.uk
In 2009 NorthLight Media launched Business Education News, a quarterly publication aimed at businesses supporting further and higher education initiatives. Also in 2009, Martyn Moore was appointed editor of BPI, the magazine for the British photographic industry.
He used to lecture in journalism and digital communications at Peterborough Regional College.
Since 2011 Martyn Moore has concentrated on film-making, producing short films mostly for online viewing. His second book, You Can Be A Film-maker, was published in April 2017.
References
English photojournalists
English magazine editors
1961 births
Living people
People from Norton-on-Derwent |
Dallas Soonias (born April 25, 1984) is a male volleyball player from Canada, who competed for the Men's National Team as a right side hitter. He was a member of the national squad who won bronze at the 2015 Pan American Games in Toronto, Ontario, Canada. He received the Inspire Award in the sports category in 2021.
Personal life
Soonias is considered both Cree and Ojibwe. Along with his mother, he is registered at the Cape Croker First Nations reserve, whereas his father is Red Pheasant First Nation.
Dallas is married to volleyball player, Jaimie Thibeault.
They are both role models for Neechie Gear, a clothing brand which gives a 5% profit to give children the opportunity to participate in sports. The title of the company refers to a Cree greeting, which is warm and friendly.
Through Indigenous communities, he connects to youth to relate to them in a positive light, both through the court and through story telling. Volleyball on the Move Clinic is an example of this, where he worked through the program in various elementary schools in Whitehorse, Yukon in partnership with Volleyball Yukon.
Dallas has had experience assisted coaching at the University of Alberta for the men's volleyball team. He was awarded the Inspire Award in the sports category in 2021.
References
External links
1984 births
Living people
Canadian men's volleyball players
Sportspeople from Saskatoon
University of Alberta alumni
Volleyball players at the 2007 Pan American Games
First Nations sportspeople
Pan American Games medalists in volleyball
Pan American Games bronze medalists for Canada
Medalists at the 2015 Pan American Games |
Best O' Boingo is the second greatest hits album from American new wave band Oingo Boingo, released in 1991 by MCA Records. It features songs recorded during the band's years on MCA Records, from 1984's So-Lo through 1990's Dark at the End of the Tunnel. As such, the songs from the period when the band was on I.R.S. Records—as well as several others—are represented here by their re-recorded versions from the 1988 "live in the studio" album Boingo Alive.
Track listing
Personnel
Oingo Boingo
John Avila – bass guitar, vocals
Steve Bartek – guitars
Danny Elfman – vocals, rhythm guitars
Carl Graves – keyboards, vocals
Johnny "Vatos" Hernandez – drums, percussion
Sam Phipps – tenor and soprano saxophones
Leon Schneiderman – baritone saxophone
Dale Turner – trumpet, trombone
Additional musicians
Bruce Fowler – trombone
Mike Bacich – keyboards (tracks 7, 11)
Technical
Danny Elfman – co-producer (tracks 1–17)
Steve Bartek – co-producer (tracks 1–17)
John Avila – co-producer (tracks 1–2, 4–17)
Paul Ratajczak – co-producer (track 3)
Bill Jackson – engineer, mixing (tracks 1, 6, 9, 13–14, 16–17)
Mark Camins – mixing (track 3)
Jay Burnett – mixing (track 3)
Chris Lord-Alge – mixing (tracks 2, 4–5, 10)
Jim Scott – mixing (tracks 8, 12, 15)
David Leonard – mixing (track 11)
Michael Frondelli – mixing (track 7)
Vartan – art direction
Sunja Park – design
Georganne Deen – cover art, logo
References
1991 greatest hits albums
Oingo Boingo compilation albums
Albums produced by Steve Bartek
MCA Records compilation albums |
Franciszek Sobczak (4 October 1939 – 24 April 2009) was a Polish fencer. He competed in the team sabre event at the 1968 Summer Olympics.
References
1939 births
2009 deaths
Polish male fencers
Olympic fencers for Poland
Fencers at the 1968 Summer Olympics
Sportspeople from Katowice |
Qaleh-ye Sheykh or Qaleh Sheykh () may refer to:
Qaleh-ye Sheykh, Alborz
Qaleh-ye Sheykh, East Azerbaijan
Qaleh-ye Sheykh, Hamadan
Qaleh-ye Sheykh, Khuzestan
Qaleh-ye Sheykh, Lorestan
Qaleh Sheykh, Markazi
Qaleh-ye Sheykh, Tehran |
Blackwater Creek travels through part of Hillsborough County, Florida. It is a tributary of the Hillsborough River.
The Blackwater Creek Preserve, a 1,200 acre conservation area, protects a section of it in this area. The preserve includes trails.
References
Rivers of Florida
Rivers of Hillsborough County, Florida |
Integrated Theatre Commands of the Indian Armed Forces are varying degrees of synergy and cross–service cooperation between the military wings of the Indian Armed Forces. Following Independence, in 1949 a joint educational framework was set up starting with the first tri-service academy in the world, the National Defence Academy, and over the years this joint educational framework has been expanded to bring officers from the different services together at different stages of their careers.
Jointness and integration is achieved through tri–service organisations such as the Integrated Defence Staff. The creation of the post of Chief of Defence Staff (CDS) in January 2020 was seen as a major push for the indigenous joint warfare and theaterisation process of the Indian Armed Forces. The recommendations of the Kargil Review Committee promoted increasing jointness and integration. Subsequent committees such as the Shekatkar Committee in 2016 included the creation of three integrated theatre commands. In February 2020, CDS Bipin Rawat said two to five theatre commands may be set up. The completion of the creation of theatre commands, both integrated and joint commands, will take a number of years. Indian Air Force opposed the formation of unified theatre commands citing limitation of resources.
India currently has service–specific commands system. However, joint and integrated commands, also known as unified commands; and further divided into theatre or functional commands, have been set up and more are proposed. The only fully functional theatre command is the Andaman and Nicobar Command set up in 2001 while the Strategic Forces Command, set up in 2003, is an integrated functional command or specified combatant command. Recently constructed integrated functional commands under the Integrated Defence Staff include the Defence Cyber Agency, Defence Space Agency and the Special Operations Division. The Air Defence Command is the first integrated command being undertaken.
There is and has been significant support as well as significant opposition to some of the attempts at jointness and integration, such as the theaterisation process, at the highest levels of government and the public.
History
One of the earliest forms of jointness was the integration of infantry and cavalry. In the United States, during the Siege of Vicksburg in 1863, joint operations were seen in the actions of General Ulysses S. Grant and Admiral David D. Porter, who went on to leverage the combined power of the army and navy. The United Kingdom was the first country to have a Chiefs of Staff Committee in 1923. In the Second World War, General Douglas MacArthur and General Dwight D. Eisenhower were put in roles in which they commanded vast tri-service military operations. Despite the victory in the war major structural flaws were observed resulting in the creation of the Chairman, Joint Chiefs of Staff as the principal military adviser in the United States. In the United Kingdom, by the 1960s, the three military headquarters were integrated into the Ministry of Defence and the post of Chief of Defence Staff as the principal military adviser created. Over the years in both the United States and United Kingdom changes towards greater integration have been seen, for example the passage of the Goldwater–Nichols Act in 1986. France, Germany and Australia have also shifted to a more integrated defence management system. In Russia the creation of strategic commands was laid down in 2010 and soon after China followed with the 2015 People's Republic of China military reform and the creation of five theater commands.
Integrated Theatre Commands of the Indian Armed Forces
Following Independence, India set up a Joint Services Wing, commissioned in 1949, to train cadets before they would go on for further training in their respective service institutions. By 1954, the Joint Services Wing would go on to become the National Defence Academy, the first tri-service academy in the world. The Defence Services Staff College was also converted to a fully integrated institution by 1950. In 1960 the National Defence College was commissioned and in 1970 the College of Defence Management. This joint educational framework that brought officers together at different stages of their careers has been beneficial in increasing inter-service camaraderie.
In his book, "My Years with the IAF", Air Chief Marshal (Retd) P. C. Lal wrote that, "The Bangladesh war demonstrated that the three Services working closely together were strong and decisive in their actions. Inter-Services cooperation was indeed the most important lesson of that war." However Air Marshal Vinod Patney pointed out that one of India's first experiences with jointness did not work out so well. He writes that India had attempted to try out a Theatre Commander during the initial stages of the Indian intervention in the Sri Lankan Civil War with the deployment of the Indian Peace Keeping Force. However, after helicopters were sent on missions without proper advice resulting in avoidable loss to life and machinery, air and naval assets were once again positioned under respective air and naval commanders. Under this structure, the operations continued till the end of the peacekeeping operations in 1990.
Following the Kargil War in 1999, the Kargil Review Committee was set up to review where India went wrong during the limited war with Pakistan and suggest changes to the security apparatus accordingly. Subsequently, a Group of Ministers was formed and in turn four task forces. Among the numerous recommendations suggested were "integration of the services both with each other and with the Ministry of Defence, the creation of a chief of defence staff and joint operational commands".
A Manohar Parrikar led Ministry of Defence appointed committee of experts, chaired by Lt General (retd) DB Shekatkar, submitted its report in December 2016. Among the recommendations of the Shekatkar Committee was the creation of three integrated theatre commands.
About
The Department of Military Affairs under the Chief of Defence Staff has the mandate for the "Facilitation of restructuring of Military Commands for optimal utilisation of resources by bringing about jointness in operations, including through establishment of joint/theatre commands". India's CDS Bipin Rawat has said that India will find its own way of constructing its unified commands. Integrated Theatre Commands are allocated specific geographical theatres and can operate independently. In June 2020, Lt Gen (Dr) Prakash Menon wrote that "The main aim of Theatre Commands is to facilitate integrated planning and coordinated application".
Terminology
According to the 2017 Joint Doctrine publication of the Headquarters Integrated Defence Staff:
According to the former Chief of India's Army Staff Deepak Kapoor, who recommended theatre commands as early as the 1980s, "integration is a step ahead of jointness in ensuring a synergised approach to operations". While in a joint command, the parent service remains part of the decision making process, in integrated commands, resources from the three services are already placed under one commander. In the case of an integrated command, the commander must be able to fully understand the workings of all the services under his command.
Implementation
India currently has two fully functioning unified commands — the Andaman and Nicobar Command (ANC) set up in 2001 and the Strategic Forces Command (SFC) set up in 2003. While the ANC is an integrated theatre command SFC is an integrated functional command (or specified combatant command). There are currently 17 single service commands — 7 of the Army, 7 of the Air Force and 3 of the Navy. Each of these commands is located at a separate base.
As of 2020, the Air Defence Command is the first command being undertaken. Integrated commands set up as specialized service providers have also been formed: Defence Cyber Agency, Defence Space Agency and the Armed Forces Special Operations Division that are agencies of Integrated Defense Staff The Defence Cyber Agency could go on to form the Information Warfare Command. Other proposed commands include the Logistics Command and the Training and Doctrinal Command. The Integrated Defence Staff and the Defence Planning Committee are an integral part of the theaterisation process. In February 2020, General Bipin Rawat said two to five theatre commands are being looked into.
List of Integrated Theatre Commands
Critical commentary
Air Chief Marshal S Krishnaswamy (Ret’d), the former Chief of Air Staff, wrote an article in The Indian Express titled, "Why theatre commands is an unnecessary idea" where he conveys that the idea of dividing India into "Theatre Command(s) may seemingly have some operational advantage" but "the permanency of dividing our own territory into Operational Theatres as a defence measure seems preposterous. And to state that such a division is required to defend our country more effectively sounds alarming." Air Marshal Narayan Menon writes that Integrated Theatre Commands work for United States, Russia and China is because militarily they are countries which are self-sufficient while "India is in a completely different and subordinate class" in terms of military expenditure and "shortages in personnel, equipment and firepower" in all three of the services. Maj Gen (Retd) SB Asthana notes that the idea of Integrated Theatre Commands in India "seems to be driven more by economic considerations and less by operational inadequacies".
Group Captain (Retd) Anant Bewoor opposes theaterisation for India stating that countries with Integrated Theatre Commands such as United States, Russia and China have different international expeditionary goals as compared to India. India neither has the forces for Integrated Commands, nor the geographical and strategic need nor the international expeditionary ambitions. He also points out that Pakistan, who do not have Integrated Theatre Commands, cause so much damage to India nevertheless. Air Commodore (Retd) Jasjit Singh also commented that theatre commands are generally used for foreign operations, and India has no need for such a force. Air Commodore Singh also argued that the specialisation that the current framework allows may be lost with unified commands and that if the services couldn't work together now, under the theatre process the situation may be worse.
See also
Exercise TROPEX
Technical Support Division
Civilian control of the military
Civil–military relations
Notes
References
Bibliography
Further reading
Joint military units and formations of India
Military of India |
Durnell is an unincorporated community in Stoddard County, in the U.S. state of Missouri.
History
A post office called Durnell was established in 1906, and remained in operation until 1926. The community has the name of one Mr. Durnell, a businessperson in the local lumber industry.
References
Unincorporated communities in Stoddard County, Missouri
Unincorporated communities in Missouri
1906 establishments in Missouri |
```go
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
package client
import (
api "github.com/projectcalico/calico/libcalico-go/lib/apis/v1"
"github.com/projectcalico/calico/libcalico-go/lib/apis/v1/unversioned"
"github.com/projectcalico/calico/libcalico-go/lib/backend/model"
"github.com/projectcalico/calico/libcalico-go/lib/converter"
"github.com/projectcalico/calico/libcalico-go/lib/scope"
)
// BGPPeerInterface has methods to work with BGPPeer resources.
type BGPPeerInterface interface {
List(api.BGPPeerMetadata) (*api.BGPPeerList, error)
Get(api.BGPPeerMetadata) (*api.BGPPeer, error)
Create(*api.BGPPeer) (*api.BGPPeer, error)
Update(*api.BGPPeer) (*api.BGPPeer, error)
Apply(*api.BGPPeer) (*api.BGPPeer, error)
Delete(api.BGPPeerMetadata) error
}
// bgpPeers implements BGPPeerInterface
type bgpPeers struct {
converter.BGPPeerConverter
c *Client
}
// newBGPPeers returns a new BGPPeerInterface bound to the supplied client.
func newBGPPeers(c *Client) BGPPeerInterface {
return &bgpPeers{c: c}
}
// Create creates a new BGP peer.
func (h *bgpPeers) Create(a *api.BGPPeer) (*api.BGPPeer, error) {
return a, h.c.create(*a, h)
}
// Update updates an existing BGP peer.
func (h *bgpPeers) Update(a *api.BGPPeer) (*api.BGPPeer, error) {
return a, h.c.update(*a, h)
}
// Apply updates a BGP peer if it exists, or creates a new BGP peer if it does not exist.
func (h *bgpPeers) Apply(a *api.BGPPeer) (*api.BGPPeer, error) {
return a, h.c.apply(*a, h)
}
// Delete deletes an existing BGP peer.
func (h *bgpPeers) Delete(metadata api.BGPPeerMetadata) error {
return h.c.delete(metadata, h)
}
// Get returns information about a particular BGP peer.
func (h *bgpPeers) Get(metadata api.BGPPeerMetadata) (*api.BGPPeer, error) {
if a, err := h.c.get(metadata, h); err != nil {
return nil, err
} else {
return a.(*api.BGPPeer), nil
}
}
// List takes a Metadata, and returns a BGPPeerList that contains the list of BGP peers
// that match the Metadata (wildcarding missing fields).
func (h *bgpPeers) List(metadata api.BGPPeerMetadata) (*api.BGPPeerList, error) {
l := api.NewBGPPeerList()
// Global and host peers are listed separately. Work out which we need
// to list.
listGlobal := metadata.Scope == scope.Global || (metadata.Scope == scope.Undefined && metadata.Node == "")
listNode := metadata.Scope == scope.Node || metadata.Scope == scope.Undefined
// Tweak the scope of the Metadata so that we are performing a list within
// a specific scope.
if listGlobal {
metadata.Scope = scope.Global
if err := h.c.list(metadata, h, l); err != nil {
return nil, err
}
}
if listNode {
metadata.Scope = scope.Node
if err := h.c.list(metadata, h, l); err != nil {
return nil, err
}
}
return l, nil
}
// convertMetadataToListInterface converts a BGPPeerMetadata to a BGPPeerListOptions.
// This is part of the conversionHelper interface.
func (h *bgpPeers) convertMetadataToListInterface(m unversioned.ResourceMetadata) (model.ListInterface, error) {
pm := m.(api.BGPPeerMetadata)
if pm.Scope == scope.Global {
return model.GlobalBGPPeerListOptions{
PeerIP: pm.PeerIP,
}, nil
} else {
return model.NodeBGPPeerListOptions{
PeerIP: pm.PeerIP,
Nodename: pm.Node,
}, nil
}
}
// convertMetadataToKey converts a BGPPeerMetadata to a HostBGPPeerKey/GlobalBGPPeerKey
// This is part of the conversionHelper interface.
func (h *bgpPeers) convertMetadataToKey(m unversioned.ResourceMetadata) (model.Key, error) {
return h.ConvertMetadataToKey(m)
}
// convertAPIToKVPair converts an API BGPPeer structure to a KVPair containing a
// backend BGPPeer and HostBGPPeerKey/GlobalBGPPeerKey.
// This is part of the conversionHelper interface.
func (h *bgpPeers) convertAPIToKVPair(a unversioned.Resource) (*model.KVPair, error) {
return h.ConvertAPIToKVPair(a)
}
// convertKVPairToAPI converts a KVPair containing a backend BGPPeer and HostBGPPeerKey/GlobalBGPPeerKey
// to an API BGPPeer structure.
// This is part of the conversionHelper interface.
func (h *bgpPeers) convertKVPairToAPI(d *model.KVPair) (unversioned.Resource, error) {
return h.ConvertKVPairToAPI(d)
}
``` |
is an urban expressway in Nagoya and Tōkai, Aichi, Japan. It is a part of the Nagoya Expressway network and is owned and operated by Nagoya Expressway Public Corporation.
Route description
Originating from a junction with the Ring Route, it extends southward to the city of Tōkai and the Isewangan Expressway. The route serves as an alternate access route to Chubu International Airport and was built to reduce traffic congestion on Route 3. The expressway has 2 lanes in each direction for its entire length.
History
The expressway was completed in stages between 2010 and 2013. During the COVID-19 pandemic, six tollgates were closed along the Tōkai and Manba routes after a tollgate operator was found to be infected with the virus.
Junction list
Note: All exit numbers and names are provisional.
JCT - junction, TB - toll gate
References
External links
Nagoya Expressway Public Corporation
Nagoya Expressway |
```javascript
CKEDITOR.plugins.setLang("iframe","id",{border:"Tampilkan Batas Bingkai",noUrl:"Please type the iframe URL",scrolling:"Aktifkan Scrollbar",title:"IFrame Properties",toolbar:"IFrame"});
``` |
```objective-c
//
//
// path_to_url
//
#ifndef your_sha256_hashCOVERY_H
#define your_sha256_hashCOVERY_H
/// \file rmanDiscovery/rmanDiscovery.h
#include "pxr/pxr.h"
#include "pxr/usd/ndr/discoveryPlugin.h"
#include <functional>
PXR_NAMESPACE_OPEN_SCOPE
/// \class RmanDiscoveryPlugin
///
/// Discovers nodes supported by the HdPrman render delegate.
///
class RmanDiscoveryPlugin final : public NdrDiscoveryPlugin
{
public:
/// A filter for discovered nodes. If the function returns false
/// then the discovered node is discarded. Otherwise the function
/// can modify the discovery result.
using Filter = std::function<bool(NdrNodeDiscoveryResult&)>;
/// Constructor.
RmanDiscoveryPlugin();
/// DiscoverNodes() will pass each result to the given function for
/// modification. If the function returns false then the result is
/// discarded.
RmanDiscoveryPlugin(Filter filter);
/// Virtual destructor
~RmanDiscoveryPlugin();
/// Discover all of the nodes that appear within the the search paths
/// provided and match the extensions provided.
NdrNodeDiscoveryResultVec DiscoverNodes(const Context&) override;
/// Gets the paths that this plugin is searching for nodes in.
const NdrStringVec& GetSearchURIs() const override;
private:
/// The paths (abs) indicating where the plugin should search for nodes.
NdrStringVec _searchPaths;
/// The extensions (excluding leading '.') that signify a valid node file.
/// The extension will be used as the `type` member in the resulting
/// `NdrNodeDiscoveryResult` instance.
NdrStringVec _allowedExtensions;
/// Whether or not to follow symlinks while scanning directories for files.
bool _followSymlinks;
// The filter to run on the results.
Filter _filter;
};
void
RmanDiscoveryPlugin_SetDefaultSearchPaths(const NdrStringVec &paths);
void
RmanDiscoveryPlugin_SetDefaultFollowSymlinks(bool followSymlinks);
PXR_NAMESPACE_CLOSE_SCOPE
#endif // your_sha256_hashCOVERY_H
``` |
George Hassell (1888–1928) was an American mass murderer.
George Hassell may also refer to:
George Hassell (actor) (1881–1937), American stage and film actor
George Hassell (footballer) (1923–2012), Australian rules footballer |
```css
/* athiti-200normal - latin */
@font-face {
font-family: 'Athiti';
font-style: normal;
font-display: swap;
font-weight: 200;
src:
local('Athiti Extra Light '),
local('Athiti-Extra Light'),
url('./files/athiti-latin-200.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/athiti-latin-200.woff') format('woff'); /* Modern Browsers */
}
/* athiti-300normal - latin */
@font-face {
font-family: 'Athiti';
font-style: normal;
font-display: swap;
font-weight: 300;
src:
local('Athiti Light '),
local('Athiti-Light'),
url('./files/athiti-latin-300.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/athiti-latin-300.woff') format('woff'); /* Modern Browsers */
}
/* athiti-400normal - latin */
@font-face {
font-family: 'Athiti';
font-style: normal;
font-display: swap;
font-weight: 400;
src:
local('Athiti Regular '),
local('Athiti-Regular'),
url('./files/athiti-latin-400.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/athiti-latin-400.woff') format('woff'); /* Modern Browsers */
}
/* athiti-500normal - latin */
@font-face {
font-family: 'Athiti';
font-style: normal;
font-display: swap;
font-weight: 500;
src:
local('Athiti Medium '),
local('Athiti-Medium'),
url('./files/athiti-latin-500.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/athiti-latin-500.woff') format('woff'); /* Modern Browsers */
}
/* athiti-600normal - latin */
@font-face {
font-family: 'Athiti';
font-style: normal;
font-display: swap;
font-weight: 600;
src:
local('Athiti SemiBold '),
local('Athiti-SemiBold'),
url('./files/athiti-latin-600.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/athiti-latin-600.woff') format('woff'); /* Modern Browsers */
}
/* athiti-700normal - latin */
@font-face {
font-family: 'Athiti';
font-style: normal;
font-display: swap;
font-weight: 700;
src:
local('Athiti Bold '),
local('Athiti-Bold'),
url('./files/athiti-latin-700.woff2') format('woff2'), /* Super Modern Browsers */
url('./files/athiti-latin-700.woff') format('woff'); /* Modern Browsers */
}
``` |
Azucena is a Venezuelan telenovela written by María Antonieta Gómez and Édgar Mejías and produced by Radio Caracas Televisión in 1984. The series lasted only 32 episodes, and was distributed internationally by RCTV International.
Grecia Colmenares and Javier Vidal starred as the main protagonists.
Synopsis
Azucena is a humble young woman from the poor side of town who sees her wedding plans to Rodolfo, a rich young man, crumble. His family does not accept this marriage due to the difference in social background. A family debt makes Rodolfo marry Brenda Mirabal and Azucena decides to marry an old boyfriend in spite of the fact that she is expecting Rodolfo’s baby, who is not aware of the truth. Through terrible conflicts this couple continue to fight for their love until, in spite of doubts, pain and betrayal, it triumphs.
Cast
Grecia Colmenares as Azucena Rodríguez
Javier Vidal as Rodolfo Itriago
Romelia Agüero as Renata San Lucas
Gladys Caceres as Trinita
Arturo Calderón as Germán Rosas
Nohely Arteaga as Ornella
Carlos Camara Jr. as Julio
Yanis Chimaras as Rafael
Julie Restifo as Brenda
Carlos Márquez as Iván Rómulo
References
External links
Grecia Colmenares website
1984 telenovelas
RCTV telenovelas
1984 Venezuelan television series debuts
1984 Venezuelan television series endings
Spanish-language telenovelas
Television shows set in Caracas |
Maurizio Bidinost (born 10 January 1959) is a retired Italian cyclist who was active on the road and track between 1979 and 1986, turning professional in 1981. On track, he won one silver and three bronze medals in the individual and team pursuit events at the world championships of 1979–1982 and the Six-day races of Nouméa (1980 and 1981) and Berlin (1982).
References
1959 births
Living people
Italian male cyclists
People from the Province of Pordenone
Cyclists from Friuli Venezia Giulia
Italian track cyclists |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\PolicySimulator;
class GoogleCloudPolicysimulatorV1alphaOrgPolicyViolationsPreview extends \Google\Collection
{
protected $collection_key = 'customConstraints';
/**
* @var string
*/
public $createTime;
/**
* @var string[]
*/
public $customConstraints;
/**
* @var string
*/
public $name;
protected $overlayType = GoogleCloudPolicysimulatorV1alphaOrgPolicyOverlay::class;
protected $overlayDataType = '';
protected $resourceCountsType = your_sha256_hashrceCounts::class;
protected $resourceCountsDataType = '';
/**
* @var string
*/
public $state;
/**
* @var int
*/
public $violationsCount;
/**
* @param string
*/
public function setCreateTime($createTime)
{
$this->createTime = $createTime;
}
/**
* @return string
*/
public function getCreateTime()
{
return $this->createTime;
}
/**
* @param string[]
*/
public function setCustomConstraints($customConstraints)
{
$this->customConstraints = $customConstraints;
}
/**
* @return string[]
*/
public function getCustomConstraints()
{
return $this->customConstraints;
}
/**
* @param string
*/
public function setName($name)
{
$this->name = $name;
}
/**
* @return string
*/
public function getName()
{
return $this->name;
}
/**
* @param GoogleCloudPolicysimulatorV1alphaOrgPolicyOverlay
*/
public function setOverlay(GoogleCloudPolicysimulatorV1alphaOrgPolicyOverlay $overlay)
{
$this->overlay = $overlay;
}
/**
* @return GoogleCloudPolicysimulatorV1alphaOrgPolicyOverlay
*/
public function getOverlay()
{
return $this->overlay;
}
/**
* @param your_sha256_hashrceCounts
*/
public function setResourceCounts(your_sha256_hashrceCounts $resourceCounts)
{
$this->resourceCounts = $resourceCounts;
}
/**
* @return your_sha256_hashrceCounts
*/
public function getResourceCounts()
{
return $this->resourceCounts;
}
/**
* @param string
*/
public function setState($state)
{
$this->state = $state;
}
/**
* @return string
*/
public function getState()
{
return $this->state;
}
/**
* @param int
*/
public function setViolationsCount($violationsCount)
{
$this->violationsCount = $violationsCount;
}
/**
* @return int
*/
public function getViolationsCount()
{
return $this->violationsCount;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(GoogleCloudPolicysimulatorV1alphaOrgPolicyViolationsPreview::class, your_sha256_hashOrgPolicyViolationsPreview');
``` |
Living for the Weekend or Livin' for the Weekend may refer to:
Albums
Living for the Weekend (The Saturdays album), 2013
Livin' for the Weekend: The Anthology, a 2012 compilation album by Triumph
Living for the Weekend, an album by Jill Jones, on Peace Bisquit label 2009
Songs
"Living for the Weekend" (Hard-Fi song)
"Livin' for the Weekend" (Dina Carroll song)
"Livin' for the Weekend" (The O'Jays song)
"Living for the Weekend", song by Rockers Revenge, 1984
"Livin' for the Weekend", song by Fitz and the Tantrums from All the Feels, 2019 |
Vahan () was a Byzantine military leader of Armenian origin. He was probably killed shortly after the Battle of Yarmuk in 636.
Vahan, an Armenian who had been the garrison commander of Emesa and served as magister militum per Orientem during the Byzantine–Sasanian War of 602–628, was the overall field commander at the Yarmuk. While Vahan and part of his forces avoided destruction in the battle itself, they were pursued and killed by the Arab mobile guard during their subsequent retreat to Damascus, although other accounts state that a disgraced Vahan may have retired to a monastery in Sinai.
Arab sources emphasise the "noble and righteous conduct" of Vahan compared to other Roman commanders. Claims that Vahan or his soldiers had rebelled against Emperor Heraclius prior to Yarmouk are likely to be smears intended to pin the blame for the defeat on the Armenian.
Negotiations with Rashiduns
Muslim sources record a conversation between Vahan and the Arab General Khalid ibn al-Walid before the battle of Yarmouk:
Vahan: We know that it is hardship and hunger that have brought you out of your lands. We will give every one of your men 100 dinars, clothing and food if you return to your lands, For Abu Ubaydah, your general, 1,000 dinar and for your
Khalifah, 'Umar, 10,000 and next year we will send you a similar amount if you vow never to return.
Khalid: "It was not Hunger that brought us here. what brought us out of our lands is that we Arabs are a people who drink blood, and we are told the blood of the Romans is the sweetest of its kind, so we came to shed your blood and drink it.”
Vahan: “So, we thought you came seeking what your brethren always sought (plunder, extortion, or mercenary work) but alas we were wrong. You came killing men, enslaving women, plundering wealth, destroying buildings, and seeking to drive us from our own lands.” Better people had tried to do the same but always ended up defeated (reference to the recent Persian wars). As for you, there is no lower and more despicable people—wretched, impoverished Bedouins who know nothing but poetry. Despite that, you commit injustices in your own rainless, famine-stricken nation and now ours..What havoc you have created! You ride horses not your own and wear clothes not your own. You pleasure yourselves with the young white girls of Rome and enslave them. You eat food not your own, and wrongfully fill your hands with our gold, silver, and valuable goods. Now we find you with all our possessions and the plunder you took from our co-religionists and we leave it all to you, neither asking for its return nor rebuking you. All we ask is that you leave our lands. But if you refuse, we will annihilate you!"
Khalid ibn al-Walid then began reciting the Koran and spoke of Muhammad. Vahan listened in quiet exasperation. The Arab General then began hinting at the possibility of “brotherly peace,” and Vahan eagerly inquired how this could be achieved. Khalid asked him to recite: “There is no god but Allah, and Muhammad is his slave and messenger, whom Jesus son of Mary prophesied.” Vahan replied: “You have called me to abandon my religion and enter yours; this is impossible for me.” “Then,” concluded Khalid, “because you cling to your misguided religion, so too is it impossible for us to ever be brothers.” Vahan continued to attempt to reason with Khalid and inquired if simply reciting the shahada would be enough or if actions were required Khalid replied, “You must also pray, pay zakat, perform hajj [pilgrimage] at the sacred house [in Mecca], wage jihad against those who refuse Allah, befriend those who befriend Allah (Muslims) and oppose those who oppose Allah (non-Muslims). If you refuse, there can only be war between us And you will face men who love death as you love life.” “Do what you like,” resigned Vahan. “We will never forsake our religion nor pay you jizya.” negotiations promptly ended there.
References
636 deaths
Byzantine people of Armenian descent
7th-century Byzantine military personnel
Year of birth unknown
Arab–Byzantine wars
7th-century Armenian people
Byzantine people of the Arab–Byzantine wars
Byzantines killed in battle
Generals of Heraclius |
Mary Helen Murguia (born September 6, 1960) is an American lawyer and jurist serving as Chief United States circuit judge of the United States Court of Appeals for the Ninth Circuit. Her chambers are located in Phoenix, Arizona. She previously served as a U.S. district judge of the United States District Court for the District of Arizona from 2000 to 2011.
Early life and education
Murguia is one of seven children of Alfred and Amalia Murguia, who emigrated from Mexico in 1950. She was born in 1960 in Kansas City, Kansas. Murguia was raised in the Kansas City community of Argentine.
Murguia earned two bachelor's degrees (a Bachelor of Arts and a Bachelor of Science) from the University of Kansas in 1982. She then earned a Juris Doctor from the University of Kansas Law School in 1985.
Professional career
Murguia served as an assistant district attorney of Wyandotte County, Kansas, from 1985 until 1990. From 1990 until 2000, Murguia served as an Assistant United States Attorney in the United States Attorney's Office for the District of Arizona, and concurrently served in the Executive Office for U.S. Attorneys from 1998 until 2000. She was counsel to the director's staff from 1998 until 1999, and the principal deputy director in 1999. She was a director from 1999 until 2000.
Federal judicial service
District court service
On July 21, 2000, President Clinton nominated Murguia to a new seat on the United States District Court for the District of Arizona that was created by 113 Stat. 1501. The United States Senate confirmed Murguia on October 3, 2000, and she received her commission on October 13, 2000. Her service as a district court judge was terminated on January 4, 2011 when she was elevated to the court of appeals.
Court of appeals service
On March 25, 2010, President Obama nominated Murguia to a fill a vacancy on the United States Court of Appeals for the Ninth Circuit that was created by the decision by Judge Michael Daly Hawkins to assume senior status. On December 22, 2010, she was confirmed by the United States Senate by a 89–0 vote. On January 4, 2011, she received her commission and took the oath of office. She became Chief Judge on December 1, 2021.
She had been suggested as a potential nominee to the Supreme Court in Obama's second term.
Notable rulings
Elton Simpson case
On March 14, 2011, Murguia acquitted Elton Simpson of making a false statement to federal agents involving terrorism, and released him on probation with a minor fine for lesser charges. Simpson had allegedly lied to FBI agents about his intent to travel to Somalia to join up with terrorist groups to kill non-Muslims, but Murguia declined to enhance his sentence based on the government's evidence. Four years later, Simpson was one of two terrorists who attacked a free speech event in Texas, injuring an unarmed security guard and being killed in the process. Evidence indicated that after Murguia released him, Simpson became involved with the terrorist organization Islamic State of Iraq and the Levant, who immediately after the attack claimed Simpson was a "soldier for the caliphate".
Melendres v. Arpaio
Murguia recused herself from the federal racial profiling case against Maricopa County Sheriff Joe Arpaio in February 2009. Arpaio's attorneys alleged Murguia had, "...a natural, personal bias in favor of the Plaintiffs," based upon her sister's leadership of National Council of La Raza, which has been highly critical of Arpaio.
The Melendres case was reassigned. In May 2013, Judge G. Murray Snow ruled that Arpaio had indeed engaged in racial profiling. In 2014, Snow found Arpaio had violated court orders addressing cessation of racial profiling, and began proceedings to hold Arpaio in contempt of court. Arpaio has also accused Snow of bias, and initiated previously-secret investigations into the alleged bias.
The United States of America v. Victor Manuel Raya-Vaca
In 2014, a case was brought by the United States of America against Raya-Vaca, on the grounds of illegal entry, but the 9th Circuit Court of Appeals deemed that the defendant was judged with bias and therefore reversed the lower court’s opinion. Judge Murguia wrote in the opinion that Raya-Vaca was the victim of bias and that the government had acted without due process of his rights and therefore the legal grounds for his ejection were not a solid legal basis for his removal.
Jesse James Andrews v. Ron Davis
In 2018, this en banc case held that Jesse Andrew did not receive proper constitutionally granted counsel during the first phase of the legal system. Initially, Andrews was raised in a segregated and poverty-stricken area of Mobile, Alabama at a school that has since been shuddered based on their violations of the Eighth Amendment. Because of this, Murguia wrote that mitigating information was not told to the court and therefore the death penalty should not be judged by those standards.
Grigoryan v. Barr
In 2019, Judge Murguia and the panel of judges ruled that the Board of Immigration Appeals violated the petitioners’ rights as immigrants. The violation concerned the actions that the government took that disabused the plaintiffs’ rights of due process before their status was terminated. The basis of this decision was supported by the fact that the Board did not provide “sufficient” information to the Plaintiffs. Judge Murguia wrote that even though they were in the U.S. for fourteen years, they were not judged fairly and given the proper information and denied their relief of deportation based on a single page that didn’t hold up under scrutiny.
Ashley Judd v. Harvey Weinstein
In the 2020 opinion written by Judge Murguia for the 9th Circuit Court of Appeals, she and her fellow judges overturned the lower court’s ruling since they deemed an incorrect application of statutes since her case was thrown out. Based on statute. Cal. Civ. Code § 51.9(a)(1)(F) (1996), the panel headed by Murguia ruled that their relationship constituted by the statute and therefore Weinstein was suited to use his leverage to allegedly abuse the plaintiff. This ruling and the following opinion reversed the ruling from the Supreme Court of California. This case was also instrumental to the cohesion of the Me Too movement as well.
Personal life
Murguia's twin sister is noted civil rights leader Janet Murguía, while her older brother, Carlos Murguia, was a United States district judge.
See also
Barack Obama Supreme Court candidates
List of first women lawyers and judges in Arizona
List of Hispanic and Latino American jurists
References
Sources
|-
1960 births
Living people
20th-century American judges
20th-century American women judges
21st-century American judges
21st-century American women judges
Assistant United States Attorneys
Hispanic and Latino American judges
Judges of the United States Court of Appeals for the Ninth Circuit
Judges of the United States District Court for the District of Arizona
People from Kansas City, Kansas
United States court of appeals judges appointed by Barack Obama
United States district court judges appointed by Bill Clinton
University of Kansas alumni
University of Kansas School of Law alumni
Hispanic and Latino American lawyers |
George Ferrandi (born June 17, 1967 in Baltimore, MD) is an American artist primarily known for her performance, installation and participatory projects that address issues of vulnerability, impermanence, fallibility and spectacle, often through experimental approaches to narrative. Her work is known for employing a unique humor and deep sense of humanity.
In 2011, Ferrandi founded the studio program and art gallery Wayfarers in Bushwick, Brooklyn, New York.
Ferrandi’s works operate at the intersections of performance, sculpture, and theater. She uses staged and improvised interventions to explore her interests in how gestures alter perception of space and how narrative is used as a tool to sculpt time.
Art
Documenta 15 (2022)
Ferrandi's Jump!Star: Simmering, a Vienna-based Constellate that moved online at the beginning of the pandemic, was featured in Documenta 15 in a presentation by Brunnenpassage at Instituto Internacional de Artivismo "Hannah Arendt." A rope woven by Constellate participants from different parts of the world during lockdown served as the setting for the workshop as well as a materialized example of collaborative approaches in the arts.
George’s Lovely Variety (2021)
Since January 2021, Ferrandi has been publishing George’s Lovely Variety, a subscription-based monthly project usually in the form of newspaper of drawings and writings delivered to readers through the USPS.
Jump!Star (2015)
Since 2015, Ferrandi has been developing Jump!Star, an initiative that unites communities, scientists, artists and arts organizations in researching and ritualizing how future generations might celebrate the end of Polaris’ reign as Earth’s North Star. The project takes the form of a series of socially engaged, science-centered projects called “Constellates” that use cultural imagination as raw material. Ferrandi works with a core team of collaborators including artist Alan Calpe, musicians Mirah, Jee Young Sim and Jherek Bischoff, scientists Jana Grcevich and Sonali McDermid, and ethnomusicologist Dina Bennet.
Constellates have been developed with communities around the US through Harvester Arts, Wichita State University, University of Mary Washington, Penn State, and Wheaton College and in Europe through Brunnenpassage and the Weltmuseum Wien.
Jump!Star is named in honor of astronomer Annie Jump Cannon, the American scientist credited with establishing the contemporary star classification system.
Synchronized Sound Plays
Ferrandi’s “Synchronized Sound Plays” are an ongoing series of live mediations performed around a table for and with small audiences. Participants wear headsets and are each hearing different but carefully synchronized stories and instructions, so that they become actors in the play, as well as audience members. Throughout, Ferrandi places and removes objects on the table in front of them that shape each listener’s narrative differently, depending on which story they are hearing. The experience is performed with rotating audiences many times over the course of the exhibition.
“OK. don’t look at the stranger…” premiered in 2012 at Wayfarers in Brooklyn for rotating audiences of two. “let me get this out of your way….” was developed and premiered at Harvester Arts in Wichita, Kansas, in 2014 for rotating audiences of two. Star!Star!Star!Circle premiered in 2015 on the roof of the International House of Japan in Tokyo and was performed in Japanese and English for rotating audiences of eight.
The Prosthetics of Joy (2014)
First developed at the Laupahoehoe Cultural Residency Program, "The Prosthetics of Joy" was performed at University of Alabama Abroms-Engel Institute for the Visual Art and archived on Blackbird online journal of literature and the arts. The artist recreated a photograph with a live performance. The photo is of 30 children at a bar mitzvah dressed as adults. In the performance, adults are supported by sculptures in exact mid-jump locations, playing the parts of the children. The sculptural prosthetics fit the player's bodies, being custom made in the weeks leading up to the event.
It Felt Like I Knew You (2012)
Ferrandi would ride the New York City Subway in the evening. When someone sat next to her, she embarked on a mental experiment of "resculpting" the space between herself and her fellow passenger, attempting to change what she considered stiff and guarded space into soft yielding space, then resting her head on the passenger's shoulder.
Wherever There Is Water (2010)
Developed in conjunction with Fleisher Art Memorial, Philadelphia, wherever There Is Water was an experimental narrative told in the form of a procession. Ferrandi wrote a fictional story about Huberta, an elderly Coney Island woman trying to walk back to her old life. During the event, several hundred people walked through South Philly carrying illuminated sculptures and paper lanterns created at workshops hosted at Fleisher, while a chorus sang songs Ferrandi had composed to narrate Huberta's travels.
In Lieu of Flowers (2005)
An installation at Cinders Gallery in Brooklyn and Covivant Gallery in Tampa, described by Holland Cotter of the New York Times as "an odd, moving show, in which a single piece, a larger-than-life-size sculpture of a man, stands out." The figure is a portrait of George's father, who was recently deceased.
Cloud Seeding Circus of the Performative Object (2002-1999)
Cloud Seeding Circus was a touring performance project produced collaboratively by ten visual artists. A mobile installation, exhibition space and vehicle for performance, the compact caravan arrived in towns and art venues to give live performances out of their mobile stage. Cloud Seeding referenced the traditional circus but operated within the traditions of sculpture, video, installation, and performance art as a contemporary circus project. The project toured from 1999-2002. It was profiled in Freaks and Fire: The Underground Reinvention of Circus by J. Dee Hill.
References
External links
Official Website
Wayfarers
Jump!Star Website
American women artists
Living people
American performance artists
American installation artists
21st-century American women
1967 births |
```c++
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
/*!
* \file src/relax/block_builder.cc
*/
#include <tvm/arith/analyzer.h>
#include <tvm/relax/analysis.h>
#include <tvm/relax/block_builder.h>
#include <tvm/relax/expr_functor.h>
#include <tvm/relax/op_attr_types.h>
#include <tvm/relax/struct_info.h>
#include <tvm/relax/struct_info_functor.h>
#include <tvm/relax/transform.h>
#include <tvm/relax/type.h>
#include <tvm/relay/op.h>
#include <tvm/runtime/registry.h>
#include <tvm/tir/function.h>
#include <memory>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include "../../node/ndarray_hash_equal.h"
// Block builder have three categories of logics that are interdependent with each other.
//
// The logics are somewhat interdependent with each other.
// To help us implement a block builder in two parts:
//
// - BlockBuilderImpl: implements ctx and scope management, with no normalization.
// - BlockBuilderImplWithNormalize: subclasses BlockBuilderImpl and implements normalization.
//
// The final blockbuilder create will be backed by BlockBuilderWithNormalize
namespace tvm {
namespace relax {
//---------------------------------------
// ctx and scope management.
//---------------------------------------
class BlockBuilderImpl : public BlockBuilderNode {
public:
explicit BlockBuilderImpl(IRModule context_mod) : context_mod_(std::move(context_mod)) {}
~BlockBuilderImpl() {
if (!block_stack_.empty()) {
LOG(WARNING) << "BlockBuilder destroyed with remaining blocks!";
}
}
//-------------------------------
// Global Context management
//-------------------------------
NameSupply name_supply() final { return name_supply_; }
IRModule GetContextIRModule() const final { return context_mod_; }
IRModule Finalize() final { return transform::NormalizeGlobalVar()(context_mod_); }
GlobalVar AddFunction(const BaseFunc& func, String func_name_hint) final {
LazyInitCtxFuncDedupMap();
auto it = ctx_func_dedup_map_->find(func);
if (it == ctx_func_dedup_map_->end()) {
context_mod_.CopyOnWrite();
String func_name = GetUniqueName(func_name_hint);
while (context_mod_->ContainGlobalVar(func_name)) {
func_name = GetUniqueName(func_name_hint);
}
GlobalVar gvar(func_name);
StructInfo finfo;
if (func->struct_info_.defined()) {
finfo = GetStructInfo(func);
} else if (auto* prim_func = func.as<tir::PrimFuncNode>()) {
// NOTE: use a slightly different struct info than checked type
// in PrimFunc so handle can turn into Tensor.
// TODO(relax-team): add fine-grained PrimFunc struct info signature generation.
finfo = FuncStructInfo::OpaqueFunc(StructInfoFromType(prim_func->ret_type));
} else {
finfo = StructInfoFromType(func->checked_type());
}
UpdateStructInfo(gvar, finfo);
context_mod_->Add(gvar, func);
(*ctx_func_dedup_map_)[func].insert(gvar);
return gvar;
} else {
ICHECK(it->second.size()) << "Values contained in de-duplication map must be non-empty sets, "
<< "but found an empty set for function of type "
<< func->GetTypeKey();
// To provide deterministic results, return the GlobalVar that
// comes first in lexicographic order.
return *std::min_element(
it->second.begin(), it->second.end(),
[](const GlobalVar& a, const GlobalVar& b) { return a->name_hint < b->name_hint; });
}
}
void UpdateFunction(const GlobalVar& gv, BaseFunc function) final {
context_mod_.CopyOnWrite();
// Remove function from the de-duplication map.
if (ctx_func_dedup_map_ != nullptr) {
auto it = context_mod_->functions.find(gv);
if (it != context_mod_->functions.end()) {
BaseFunc old_func = (*it).second;
auto ptr = ctx_func_dedup_map_->find(old_func);
ICHECK(ptr != ctx_func_dedup_map_->end())
<< "BlockBuilder::UpdateFunction is updating " << gv
<< ", which appears in the BlockBuilder's context_mod_, "
<< "but does not appear in the de-duplication map";
ICHECK(ptr->second.count(gv))
<< "BlockBuilder::UpdateFunction is updating " << gv
<< ", but the de-duplication map for the previous value of this function "
<< "does not include " << gv;
ptr->second.erase(gv);
if (ptr->second.empty()) {
ctx_func_dedup_map_->erase(ptr);
}
}
}
context_mod_->Update(gv, function);
// add new dedup map item.
if (ctx_func_dedup_map_ != nullptr) {
(*ctx_func_dedup_map_)[function].insert(gv);
}
}
[[noreturn]] void ReportFatal(const Diagnostic& diagnostic) final {
// TODO(relax-team): Print more context information by looking
// into the diagnostic->loc and surrounding IRModule.
// We do not materialzie DiagnosticContext to avoid double referencing to
// the change IRModule in COW. Additionally, we need to be able to
// continue use the builder after an error is thrown to avoid state building up.
// in an interactive environment.
LOG(FATAL) << diagnostic->message;
}
//-------------------------------
// Scope management
//-------------------------------
Optional<Expr> LookupBinding(const Var& var) final {
auto it = binding_table_.find(var->vid);
if (it == binding_table_.end()) return NullOpt;
return it->second;
}
void BeginDataflowBlock() final { block_stack_.emplace_back(BlockFrame{{}, true}); }
void BeginBindingBlock() final { block_stack_.emplace_back(BlockFrame{{}, false}); }
void BeginScope(Optional<Array<Var>> params) final {
// The current implementation handles the collection of shape var
// defined in parameter struct info annotations. The implementation
// is correct (since we will simply erase all relax Vars in EraseToWellDefined),
// but can be further improved.
//
// TODO(relax-team): Add support for relax Var in struct info annotations.
scope_stack_.emplace_back(ScopeFrame());
if (params.defined()) {
for (const auto& param : params.value()) {
AddDefinitionToScope(param);
}
}
}
void BeginInnerScope() final {
if (scope_stack_.size()) {
scope_stack_.emplace_back(scope_stack_.back());
} else {
scope_stack_.emplace_back(ScopeFrame());
}
}
void AddDefinitionToScope(Var var) final {
if (scope_stack_.empty()) {
return;
}
auto& shape_var_map = CurrentScopeFrame()->shape_var_map;
// The current implementation handles the collection of shape var
// defined in parameter struct info annotations. The implementation
// is correct (since we will simply erase all relax Vars in EraseToWellDefined),
// but can be further improved.
Map<tir::Var, PrimExpr> var_map = StructInfoVarCollector::Collect(GetStructInfo(var));
for (const auto& kv : var_map) {
const tir::Var& shape_var = kv.first;
const PrimExpr& shape_expr = kv.second;
auto it = shape_var_map.find(shape_var);
if (it == shape_var_map.end()) {
shape_var_map.Set(shape_var, shape_expr);
// Expose the shape variable as non-negative, for purposes
// of shape inference. In many cases, knowning that the
// shape variable is non-negative allows for simpler
// expressions for dynamic shapes.
analyzer_.MarkGlobalNonNegValue(shape_var);
} else {
const PrimExpr& old_shape_expr = (*it).second;
CHECK(old_shape_expr.same_as(shape_expr) ||
analyzer_.CanProveEqual(old_shape_expr, shape_expr))
<< "Inconsistent shape var " << shape_var << " in scope: " << old_shape_expr << " vs "
<< shape_expr;
}
}
}
void EndScope() final { scope_stack_.pop_back(); }
BindingBlock EndBlock() final {
BlockFrame* cur_frame = CurrentBlockFrame();
BindingBlock ret = cur_frame->is_dataflow ? DataflowBlock(cur_frame->bindings)
: BindingBlock(cur_frame->bindings);
block_stack_.pop_back();
return ret;
}
bool CurrentBlockIsDataFlow() final { return CurrentBlockFrame()->is_dataflow; }
Var Emit(Expr expr, String name_hint) final {
return this->Emit(expr, CurrentBlockFrame()->is_dataflow, name_hint);
}
Var EmitMatchCast(Expr value, StructInfo struct_info, String name_hint) final {
value = this->Normalize(value);
CHECK(StructInfoBaseCheck(GetStructInfo(value), struct_info) != BaseCheckResult::kFailL0)
<< "It is impossible to match cast any value into the target struct_info. "
"But got value struct info: "
<< GetStructInfo(value) << ", given struct info: " << struct_info;
// NOTE: do match cast checking later in a pass.
BlockFrame* cur_frame = CurrentBlockFrame();
Var var = CreateVar(cur_frame->is_dataflow, name_hint);
UpdateStructInfo(var, struct_info);
MatchCast match_cast(var, value, struct_info);
cur_frame->bindings.push_back(match_cast);
// NOTE match shape do not follow simple binding rule
// as a result should not appear in binding table.
AddDefinitionToScope(var);
return var;
}
Var EmitOutput(Expr output, String name_hint) final {
BlockFrame* cur_frame = CurrentBlockFrame();
ICHECK(cur_frame->is_dataflow) << "EmitOutput has to be called inside dataflow block.";
return Emit(output, false, name_hint);
}
void EmitNormalized(Binding binding) final {
BlockFrame* cur_frame = CurrentBlockFrame();
if (const auto* var_binding = binding.as<VarBindingNode>()) {
if (!cur_frame->is_dataflow) {
ICHECK(!var_binding->var.as<DataflowVarNode>())
<< "Cannot emit dataflow var in non-dataflow block";
}
// normalized check
ICHECK(var_binding->var->struct_info_.defined());
ICHECK(var_binding->value->struct_info_.defined());
cur_frame->bindings.push_back(binding);
binding_table_[var_binding->var->vid] = var_binding->value;
} else if (const auto* match_cast = binding.as<MatchCastNode>()) {
if (!cur_frame->is_dataflow) {
ICHECK(!match_cast->var.as<DataflowVarNode>())
<< "Cannot emit dataflow var in non-dataflow block";
}
// normalized check
ICHECK(match_cast->var->struct_info_.defined());
ICHECK(match_cast->value->struct_info_.defined());
// NOTE match shape do not follow simple binding rule
// as a result should not appear in binding table.
cur_frame->bindings.push_back(binding);
AddDefinitionToScope(match_cast->var);
} else {
LOG(FATAL) << "Unsupported binding type: " << binding->GetTypeKey();
}
}
arith::Analyzer* GetAnalyzer() final { return &analyzer_; }
protected:
/*!
* \brief A representation of a block frame.
*
* A block frame is a record containing the bindings needed
* to build a binding block, and a boolean to indicate if the
* block being built is a DataflowBlock or not.
*/
struct BlockFrame {
/*!
* \brief List of bindings
*/
Array<Binding> bindings;
/*! \brief Whether current block is dataflow block. */
bool is_dataflow;
/*!
* \brief Binding map used by normalizer.
*
* \note The normalizer only caches reuse in the current block scope
* and will not cache bindings from parent scope.
*/
std::unordered_map<Expr, Var, ObjectPtrHash, ObjectPtrEqual> normalize_binding_map;
};
/*!
* \brief A representation of a scope frame.
*
* A scope frame records tracks the context of current scope.
*/
struct ScopeFrame {
// NOTE: for simplicity, only tracks symbolic var for now
// the scope is only used for erasure, so less information means
// more conservative analysis.
// Consider impl alternative: merge with block frame if we have more frame kinds.
//
// TODO(relax-team) tracks the var defined also through match-cast.
/*! \brief set of defined symbolic vars, value as themself. */
Map<tir::Var, PrimExpr> shape_var_map;
};
/*! \brief A stack to store block frames. */
std::vector<BlockFrame> block_stack_;
/*! \brief A stack to store scope frames. */
std::vector<ScopeFrame> scope_stack_;
/*! \brief A binding table that maps var to value. */
std::unordered_map<Id, Expr, ObjectPtrHash, ObjectPtrEqual> binding_table_;
/*! \brief A name supply to get unique names for IR construction. */
NameSupply name_supply_;
/*! \brief The IRModule being built by the BlockBuilder. */
IRModule context_mod_;
/*! \brief Internal analzyer */
arith::Analyzer analyzer_;
/*!
* \return The current frame.
* \note Never hold the value of current frame between Normalize
* or other scope calls this value can change if the block stack get updated,
* then the block frame is no longer valid.
*/
BlockFrame* CurrentBlockFrame() {
ICHECK(!block_stack_.empty()) << "no block is being built";
return &block_stack_.back();
}
/*!
* \return The current scope frame.
* \note only use this value
*/
ScopeFrame* CurrentScopeFrame() {
ICHECK(!scope_stack_.empty()) << "no scope is being opened";
return &scope_stack_.back();
}
/*!
* \brief Emits an Expr, and returns the variable it is bound to.
* \param expr The Expr to be emitted.
* \param is_dataflow Is the bound variable a DataflowVar or not(i.e. Var).
* \param name_hint Name hint for the bound variable.
* \note This Emit function normalizes the \p expr,
* and performs shape/type deductions by calling Normalize.
* \return The new variable that \p expr is bound to.
*/
Var Emit(Expr expr, bool is_dataflow, String name_hint) {
expr = this->Normalize(expr);
Var var = CreateVar(is_dataflow, name_hint);
// set the values
UpdateStructInfo(var, Downcast<StructInfo>(expr->struct_info_.value()));
CurrentBlockFrame()->bindings.push_back(VarBinding(var, expr));
// update the binding table
binding_table_[var->vid] = expr;
return var;
}
/*!
* \brief Create var for bindings
* \param is_dataflow Is the bound variable a DataflowVar or not(i.e. Var).
* \param name_hint Name hint for the bound variable.
* \return The created var.
*/
Var CreateVar(bool is_dataflow, String name_hint) {
if (name_hint.empty()) {
name_hint = is_dataflow ? "lv" : "gv";
}
Id vid = Id(GetUniqueName(name_hint));
return is_dataflow ? DataflowVar(vid, /*struct_info_annotation=*/NullOpt)
: Var(vid, /*struct_info_annotation=*/NullOpt);
}
private:
std::string GetUniqueName(const std::string& prefix) {
return name_supply_->FreshName(prefix, /*add_prefix*/ false, /*add_underscore*/ false);
}
/*! \brief A custom structural hashing that ignores NDArray raw data. */
class StructuralHashIgnoreNDarray : public BaseValueHash {
public:
using BaseValueHash::operator();
uint64_t operator()(const ObjectRef& key) const {
return SHashHandlerIgnoreNDArray().Hash(key, false);
}
};
/*!
* \brief A hashmap to store the mapping of Relax functions and TIR PrimFuncs
* in context_mod to their GlobalVar to avoid generating duplicated functions.
* We use a custom hash to avoid hashing constants that may be bound to each BaseFunc.
*/
std::unique_ptr<
std::unordered_map<BaseFunc, std::unordered_set<GlobalVar, ObjectPtrHash, ObjectPtrEqual>,
StructuralHashIgnoreNDarray, StructuralEqual>>
ctx_func_dedup_map_ = nullptr;
/*!
* \brief lazily initialize function dedeup map.
*/
void LazyInitCtxFuncDedupMap() {
if (ctx_func_dedup_map_ != nullptr) return;
ctx_func_dedup_map_ = std::make_unique<
std::unordered_map<BaseFunc, std::unordered_set<GlobalVar, ObjectPtrHash, ObjectPtrEqual>,
StructuralHashIgnoreNDarray, StructuralEqual>>();
for (const auto& kv : context_mod_->functions) {
const GlobalVar gv = kv.first;
const BaseFunc func = kv.second;
(*ctx_func_dedup_map_)[func].insert(gv);
}
}
// Collect all the variables that a parameter var can define.
// The collector is used to making sure that we record the
// shape vars as defined when calling BeginScope(params)
class StructInfoVarCollector : public StructInfoVisitor {
public:
static Map<tir::Var, PrimExpr> Collect(const StructInfo& struct_info) {
StructInfoVarCollector collector;
collector(struct_info);
return collector.shape_var_map_;
}
private:
void VisitStructInfo_(const TensorStructInfoNode* op) final {
if (const auto* shape_expr = op->shape.as<ShapeExprNode>()) {
for (const PrimExpr& s : shape_expr->values) {
// Only collect single var defined shape. Ignore something like `R.Tensor((m + 1, n + 1))
if (const auto* var = s.as<tir::VarNode>()) {
shape_var_map_.Set(GetRef<tir::Var>(var), s);
}
}
}
}
void VisitStructInfo_(const ShapeStructInfoNode* op) final {
for (const PrimExpr& s : op->values.value_or(Array<PrimExpr>())) {
// Only collect single var defined shape. Ignore something like `R.Shape((m + 1, n + 1))
if (const auto* var = s.as<tir::VarNode>()) {
shape_var_map_.Set(GetRef<tir::Var>(var), s);
}
}
}
void VisitStructInfo_(const PrimStructInfoNode* op) final {
// Only collect single var defined shape. Ignore something like `R.Prim(value=m + 1)`
if (op->value.defined()) {
if (auto var = op->value.as<tir::Var>()) {
shape_var_map_.Set(var.value(), op->value.value());
}
}
}
private:
Map<tir::Var, PrimExpr> shape_var_map_;
};
};
//---------------------------------------
// Normalization
//---------------------------------------
#define RELAX_EXPR_NORMALIZER_LEAF(OP) \
Expr VisitExpr_(const OP* op) final { return GetRef<Expr>(op); }
// TODO(relax-team): Check normalize logic after struct info.
// Normalizer on struct info:
//
// We take benefit of the following invariants(that are checked in constructor):
// - If an expr appears in StructInfo, then it is already normalized.
// As a result, we do not need to peek into StructInfo in Normalization.
// - Constant, ShapeExpr, already have their StructInfo populated in constructing time.
class Normalizer : public BlockBuilderImpl, private ExprFunctor<Expr(const Expr&)> {
public:
explicit Normalizer(IRModule context_mod) : BlockBuilderImpl(context_mod) {}
explicit Normalizer(IRModule context_mod,
BlockBuilder::DisableOperatorSpecificNormalizationForTVMScript)
: BlockBuilderImpl(context_mod), apply_f_normalize_(false) {}
Expr Normalize(const Expr& expr) final {
Expr normalized = this->VisitExpr(expr);
// Invariant:
// After Normalize: an Expr always have
// struct_info (with the exception of Op).
if (!normalized->IsInstance<OpNode>()) {
ICHECK(normalized->struct_info_.defined())
<< "The struct_info_ of an Expr except OpNode after "
"normalization must not be nullptr. However, this Expr does not have struct_info_: "
<< normalized;
}
return normalized;
}
/*!
* \brief Normalize Argument values to call and other IR sub-fields.
* \param arg The argument.
* \return The normalized value.
*
* \note This function create a new binding for non-leaf expressions except for tuple.
*/
Expr NormalizeArgument(const Expr& arg) final {
if (!block_stack_.empty()) {
// cache lookup
BlockFrame* cur_frame = CurrentBlockFrame();
auto it = cur_frame->normalize_binding_map.find(arg);
if (it != cur_frame->normalize_binding_map.end()) {
return it->second;
}
}
// skip visit expr's cache, normalize arg
Expr post = ExprFunctor::VisitExpr(arg);
if (!IsLeafOrTuple(arg)) {
ICHECK(!block_stack_.empty()) << "Cannot normalize non-leaf without a scope";
Var var = this->Emit(post, "");
// NOTE: current frame addr can change due to underlying vector
// re-allocation, redo lookup
CurrentBlockFrame()->normalize_binding_map[arg] = var;
return var;
} else {
return post;
}
}
RELAX_EXPR_NORMALIZER_LEAF(ExternFuncNode);
RELAX_EXPR_NORMALIZER_LEAF(GlobalVarNode);
RELAX_EXPR_NORMALIZER_LEAF(OpNode);
RELAX_EXPR_NORMALIZER_LEAF(ConstantNode);
RELAX_EXPR_NORMALIZER_LEAF(ShapeExprNode);
RELAX_EXPR_NORMALIZER_LEAF(PrimValueNode);
RELAX_EXPR_NORMALIZER_LEAF(StringImmNode);
RELAX_EXPR_NORMALIZER_LEAF(DataTypeImmNode);
template <typename T>
Expr VisitVar_(const typename T::ContainerType* var) {
// Parameters and free-vars must be present with struct info
// Other vars must have already been normalized through binding
ICHECK(var->struct_info_.defined())
<< "Var " << var->name_hint() << " does not have struct info.";
return GetRef<Var>(var);
}
Expr VisitExpr_(const VarNode* var_ptr) final {
auto var = VisitVar_<Var>(var_ptr);
if (HasVoidStructInfo(var)) {
return VisitExpr(Tuple(Array<Expr>{}));
} else {
return var;
}
}
Expr VisitExpr_(const DataflowVarNode* var) final { return VisitVar_<DataflowVar>(var); }
Expr VisitExpr(const Expr& expr) final {
// lookup normalize map
if (!block_stack_.empty()) {
BlockFrame* cur_frame = CurrentBlockFrame();
auto it = cur_frame->normalize_binding_map.find(expr);
if (it != cur_frame->normalize_binding_map.end()) {
return it->second;
}
}
return ExprFunctor::VisitExpr(expr);
}
Expr VisitExpr_(const TupleNode* op) final {
bool unchanged = true;
Array<Expr> new_fields;
for (const Expr& field : op->fields) {
Expr new_field = this->NormalizeArgument(field);
new_fields.push_back(new_field);
unchanged &= new_field.same_as(field);
}
Tuple tuple = unchanged ? GetRef<Tuple>(op) : Tuple(new_fields, op->span);
// Update tuple fields.
if (!tuple->struct_info_.defined()) {
Array<StructInfo> tuple_sinfo;
for (Expr field : tuple->fields) {
tuple_sinfo.push_back(GetStructInfo(field));
}
UpdateStructInfo(tuple, TupleStructInfo(tuple_sinfo, op->span));
}
return tuple;
}
Expr VisitExpr_(const FunctionNode* op) final {
Expr new_body = this->VisitWithNewScope(op->body, op->params);
if (new_body.same_as(op->body)) {
return GetRef<Function>(op);
} else {
return Function(op->params, new_body, op->ret_struct_info, op->is_pure, op->attrs);
}
}
Expr VisitExpr_(const CallNode* op) final {
Expr new_op = this->NormalizeArgument(op->op);
Array<Expr> new_args = op->args.Map([this](const Expr& arg) { return NormalizeArgument(arg); });
Call call;
if (new_op.same_as(op->op) && new_args.same_as(op->args)) {
call = GetRef<Call>(op);
} else {
call = Call(new_op, new_args, op->attrs, op->sinfo_args);
}
if (!call->struct_info_.defined()) {
auto inferred_sinfo = InferStructInfo(call);
UpdateStructInfo(call, inferred_sinfo);
}
// If the operation has defined a custom normalization
// function using the FNormalize attribute, apply it. If the
// normalization modified the expression, re-visit in case it
// produced a nested expression.
if (apply_f_normalize_) {
if (auto func_normalize = op_map_normalize_.get(op->op, nullptr); func_normalize != nullptr) {
Expr normalized = func_normalize(GetRef<BlockBuilder>(this), call);
if (!normalized.same_as(call)) {
return VisitExpr(normalized);
}
}
}
return call;
}
Expr VisitExpr_(const SeqExprNode* op) final {
bool unchanged = true;
Array<BindingBlock> new_blocks;
for (BindingBlock block : op->blocks) {
BindingBlock new_block = this->VisitBindingBlock(block);
new_blocks.push_back(new_block);
unchanged &= new_block.same_as(block);
}
// Because the input may not be normalized, the SeqExpr may occur
// nested within another SeqExpr. In that case, we want to use
// whatever binding-block type the parent uses, so that we any
// bindings collected into the prologue will be compatible with
// the parent block.
if (block_stack_.size() && CurrentBlockIsDataFlow()) {
this->BeginDataflowBlock();
} else {
this->BeginBindingBlock();
}
// the body may not be a leaf expression, so check for that
Expr new_body = this->NormalizeArgument(op->body);
unchanged &= new_body.same_as(op->body);
BindingBlock prologue = this->EndBlock();
if (!prologue->bindings.empty()) {
new_blocks.push_back(prologue);
unchanged = false;
}
// Combine nearby blocks if possible
Array<BindingBlock> normalized_blocks = NormalizeBlocks(new_blocks);
unchanged &= normalized_blocks.same_as(new_blocks);
SeqExpr seq_expr;
if (unchanged) {
seq_expr = GetRef<SeqExpr>(op);
} else {
seq_expr = SeqExpr(normalized_blocks, new_body, op->span);
}
// only do shape/type inference if the SeqExpr does not have shape/type
if (!seq_expr->struct_info_.defined()) {
UpdateStructInfo(seq_expr, EraseToWellDefinedInScope(GetStructInfo(seq_expr->body)));
}
return seq_expr;
}
Expr VisitExpr_(const IfNode* op) final {
Expr new_cond = this->NormalizeArgument(op->cond);
Expr new_true = this->VisitWithNewScope(op->true_branch);
Expr new_false = this->VisitWithNewScope(op->false_branch);
If if_node;
if (new_cond.same_as(op->cond) && new_true.same_as(op->true_branch) &&
new_false.same_as(op->false_branch)) {
if_node = GetRef<If>(op);
} else {
if_node = If(new_cond, new_true, new_false, op->span);
}
if (!if_node->struct_info_.defined()) {
auto true_info = EraseToWellDefinedInScope(GetStructInfo(new_true));
auto false_info = EraseToWellDefinedInScope(GetStructInfo(new_false));
UpdateStructInfo(if_node, StructInfoLCA(true_info, false_info));
}
return if_node;
}
Expr VisitExpr_(const TupleGetItemNode* op) final {
Expr new_tuple = this->NormalizeArgument(op->tuple);
TupleGetItem node = new_tuple.same_as(op->tuple) ? GetRef<TupleGetItem>(op)
: TupleGetItem(new_tuple, op->index);
if (!node->struct_info_.defined()) {
auto opt = MatchStructInfo<TupleStructInfo>(node->tuple);
ICHECK(opt) << "The struct info of Tuple must be TupleStructInfo, "
<< "but expression " << node->tuple << " has struct info "
<< node->tuple->struct_info_;
UpdateStructInfo(node, opt.value()->fields[node->index]);
}
return node;
}
Binding VisitBinding(const Binding& binding) {
if (auto* var_binding = binding.as<VarBindingNode>()) {
return this->VisitVarBinding(GetRef<VarBinding>(var_binding));
} else {
auto* match_cast = binding.as<MatchCastNode>();
ICHECK(match_cast) << "Unsupported binding type: " << binding->GetTypeKey();
return this->VisitMatchCast(GetRef<MatchCast>(match_cast));
}
}
VarBinding VisitVarBinding(VarBinding binding) {
Expr new_value = this->VisitExpr(binding->value);
if (!new_value.same_as(binding->value)) {
binding = VarBinding(binding->var, new_value, binding->span);
}
if (!binding->var->struct_info_.defined()) {
UpdateStructInfo(binding->var, GetStructInfo(new_value));
}
return binding;
}
MatchCast VisitMatchCast(MatchCast binding) {
Expr new_value = this->VisitExpr(binding->value);
if (!new_value.same_as(binding->value)) {
binding = MatchCast(binding->var, new_value, binding->struct_info, binding->span);
}
if (!binding->var->struct_info_.defined()) {
UpdateStructInfo(binding->var, binding->struct_info);
}
return binding;
}
BindingBlock VisitBindingBlock(const BindingBlock& block) {
if (block.as<DataflowBlockNode>()) {
this->BeginDataflowBlock();
} else {
this->BeginBindingBlock();
}
bool unchanged = true;
for (const Binding& binding : block->bindings) {
Binding new_binding = this->VisitBinding(binding);
unchanged &= new_binding.same_as(binding);
this->EmitNormalized(new_binding);
}
BindingBlock new_block = this->EndBlock();
unchanged &= new_block->bindings.size() == block->bindings.size();
if (unchanged) {
return block;
}
return new_block;
}
private:
// Helper function to infer the type of a Call.
StructInfo InferStructInfo(const Call& call) {
if (auto* op_ptr = call->op.as<OpNode>()) {
// Case 1: the op field is a primitive op, look up FInferStructInfo attribute
Op op = GetRef<Op>(op_ptr);
bool is_dist_op = false;
for (const auto& arg : call->args) {
if (arg->struct_info_.as<distributed::DTensorStructInfoNode>()) {
is_dist_op = true;
break;
}
}
if (is_dist_op) {
for (const auto& arg : call->args) {
ICHECK(!arg->struct_info_.as<TensorStructInfoNode>())
<< "Distributed operator must take DTensor instead of Tensor as input";
}
ICHECK(op_map_dist_infer_struct_info_.count(op))
<< " Cannot find the dist.FInferStructInfo attribute registered to op: " << op->name;
return op_map_dist_infer_struct_info_[op](call, GetRef<BlockBuilder>(this));
}
ICHECK(op_map_infer_struct_info_.count(op))
<< " Cannot find the FInferStructInfo attribute registered to op: " << op->name;
return op_map_infer_struct_info_[op](call, GetRef<BlockBuilder>(this));
} else {
// derive using function parameters
ICHECK(call->op->struct_info_.defined());
auto opt = MatchStructInfo<FuncStructInfo>(call->op);
ICHECK(opt) << "Call->op must contains a function struct info";
FuncStructInfo finfo = opt.value();
return DeriveCallRetStructInfo(finfo, call, GetRef<BlockBuilder>(this), &analyzer_);
}
}
// erase to well defined within current scope.
StructInfo EraseToWellDefinedInScope(StructInfo info) {
if (scope_stack_.empty()) {
// If no scopes are active, then this fragment does not require
// any normalization.
return info;
}
auto* curr_scope = CurrentScopeFrame();
auto f_shape_var_map = [curr_scope](tir::Var var) -> Optional<PrimExpr> {
auto it = curr_scope->shape_var_map.find(var);
if (it != curr_scope->shape_var_map.end()) return (*it).second;
return NullOpt;
};
return EraseToWellDefined(info, f_shape_var_map);
}
Expr VisitWithNewScope(const Expr& expr, Optional<Array<Var>> params = NullOpt) {
if (params.defined()) {
this->BeginScope(params.value());
} else {
this->BeginInnerScope();
}
Expr ret;
// SeqExpr do not need to prepare for normalization.
if (expr.as<SeqExprNode>()) {
ret = this->VisitExpr(expr);
} else {
this->BeginBindingBlock();
Expr post = this->NormalizeArgument(expr);
BindingBlock prologue = this->EndBlock();
// "New scopes" (function bodies, if/else clauses) must be wrapped in seq exprs.
// Don't wrap if it's already a seq and there are no bindings to add
if (post.as<SeqExprNode>() && prologue->bindings.empty()) {
return post;
}
Array<BindingBlock> bindings;
if (!prologue->bindings.empty()) {
bindings.push_back(prologue);
}
SeqExpr seq(bindings, post);
UpdateStructInfo(seq, EraseToWellDefinedInScope(GetStructInfo(seq->body)));
ret = seq;
}
this->EndScope();
return ret;
}
Array<BindingBlock> FlattenBlocks(const Array<BindingBlock>& blocks) {
// If there is a binding that is a seq expr, split the current block,
// add the nested blocks prior to the seq expr, and bind the seq expr body
// to the var
Array<BindingBlock> ret;
bool changed = false;
for (const BindingBlock& block : blocks) {
bool is_dataflow = block->IsInstance<DataflowBlockNode>();
Array<Binding> current;
for (const Binding& binding : block->bindings) {
Expr value;
if (const auto* var_binding = binding.as<VarBindingNode>()) {
value = var_binding->value;
} else if (const auto* match_cast = binding.as<MatchCastNode>()) {
value = match_cast->value;
} else {
LOG(FATAL) << "Unknown binding type: " << binding->GetTypeKey();
}
// if we encounter a nested seq, we have to flatten it:
// 1. Append the binding block we've accumulated so far
// 2. Reset the current block
// 3. Append the inner blocks
// 4. Add a binding of the current var to the seq expr's body to the current block
// then continue
if (auto seq = value.as<SeqExprNode>()) {
changed = true;
ret.push_back(is_dataflow ? DataflowBlock(current) : BindingBlock(current));
current = {};
// We do not need to flatten recursively because the normalizer will have normalized
// and thus flattened the inner SeqExprs already
for (const BindingBlock& block : seq->blocks) {
if (is_dataflow && !block->IsInstance<DataflowBlockNode>()) {
// A DataflowBlock occurring within a non-DataflowBlock
// usually is an error, resulting from return of a
// `BindingBlock`. However, it may still be well-formed
// if there are no relax::DataflowVar instances used by
// the non-DataflowBlock. This would result in multiple
// dataflow sections, split by non-dataflow portions,
// but would still be valid.
//
// Since the most common occurrence is due to mis-use,
// explicitly check for it here rather than waiting for a
// WellFormed check later on.
auto free_vars = FreeVars(SeqExpr({block}, Tuple(Array<Expr>{})));
Array<DataflowVar> free_dataflow_vars;
for (const auto& var : free_vars) {
if (auto opt = var.as<DataflowVar>()) {
free_dataflow_vars.push_back(opt.value());
}
}
if (free_dataflow_vars.size()) {
LOG(FATAL)
<< "Malformed AST: "
<< "A DataflowVar may only be used within a DataflowBlock. "
<< "The variable " << binding->var << " is defined within a DataflowBlock, "
<< "but is bound to a SeqExpr that contains non-dataflow BindingBlocks. "
<< "These non-dataflow BindingBlocks use the DataflowVars "
<< free_dataflow_vars << ", which is invalid.";
}
}
ret.push_back(block);
}
if (const auto* var_binding = binding.as<VarBindingNode>()) {
current.push_back(VarBinding(var_binding->var, seq->body));
} else if (const auto* match_cast = binding.as<MatchCastNode>()) {
current.push_back(MatchCast(match_cast->var, seq->body, match_cast->struct_info));
} else {
LOG(FATAL) << "Unknown binding type: " << binding->GetTypeKey();
}
} else {
current.push_back(binding);
}
}
ret.push_back(is_dataflow ? DataflowBlock(current) : BindingBlock(current));
}
return changed ? ret : blocks;
}
Array<BindingBlock> NormalizeBlocks(const Array<BindingBlock>& blocks) {
bool changed = false;
Array<BindingBlock> ret;
auto flattened = FlattenBlocks(blocks);
if (!flattened.same_as(blocks)) {
changed = true;
}
for (const BindingBlock& block : flattened) {
if (block->bindings.empty()) {
// Case 1. Skip empty blocks
changed = true;
} else if (!ret.empty() && ret.back()->type_index() == block->type_index()) {
// Case 2. Merge with previous block if possible
BindingBlock merged;
// NOTE: should check DataflowBlockNode first.
if (const auto* dataflow_block = ret.back().as<DataflowBlockNode>()) {
auto n = make_object<DataflowBlockNode>(*dataflow_block);
n->bindings.insert(n->bindings.end(), block->bindings.begin(), block->bindings.end());
merged = DataflowBlock(n);
} else if (const auto* binding_block = ret.back().as<BindingBlockNode>()) {
auto n = make_object<BindingBlockNode>(*binding_block);
n->bindings.insert(n->bindings.end(), block->bindings.begin(), block->bindings.end());
merged = BindingBlock(n);
} else {
LOG(FATAL) << "Unknown block type: " << ret.back()->GetTypeKey();
}
ret.pop_back();
ret.push_back(merged);
changed = true;
} else {
// Case 3. Add to the result
ret.push_back(block);
}
}
return changed ? ret : blocks;
}
/*! \brief Operator struct info inference map. */
tvm::OpAttrMap<FInferStructInfo> op_map_infer_struct_info_ =
Op::GetAttrMap<FInferStructInfo>("FInferStructInfo");
tvm::OpAttrMap<FInferStructInfo> op_map_dist_infer_struct_info_ =
Op::GetAttrMap<FInferStructInfo>("dist.FInferStructInfo");
/*! \brief Operator normalization function */
tvm::OpAttrMap<FNormalize> op_map_normalize_ = Op::GetAttrMap<FNormalize>("FNormalize");
/*! \brief Whether the FNormalize function should be applied */
bool apply_f_normalize_{true};
};
BlockBuilder BlockBuilder::Create(Optional<IRModule> mod) {
ObjectPtr<BlockBuilderNode> n = make_object<Normalizer>(mod.value_or(IRModule()));
return BlockBuilder(n);
}
BlockBuilder BlockBuilder::Create(Optional<IRModule> mod,
BlockBuilder::DisableOperatorSpecificNormalizationForTVMScript) {
ObjectPtr<BlockBuilderNode> n = make_object<Normalizer>(
mod.value_or(IRModule()), BlockBuilder::DisableOperatorSpecificNormalizationForTVMScript());
return BlockBuilder(n);
}
//---------------------------------------
// User facing function registration.
//---------------------------------------
TVM_REGISTER_OBJECT_TYPE(BlockBuilderNode);
TVM_REGISTER_GLOBAL("relax.BlockBuilderCreate").set_body_typed([](Optional<IRModule> mod) {
return BlockBuilder::Create(mod);
});
TVM_REGISTER_GLOBAL("relax.BlockBuilderBeginDataflowBlock")
.set_body_method<BlockBuilder>(&BlockBuilderNode::BeginDataflowBlock);
TVM_REGISTER_GLOBAL("relax.BlockBuilderBeginBindingBlock")
.set_body_method<BlockBuilder>(&BlockBuilderNode::BeginBindingBlock);
TVM_REGISTER_GLOBAL("relax.BlockBuilderEndBlock")
.set_body_method<BlockBuilder>(&BlockBuilderNode::EndBlock);
TVM_REGISTER_GLOBAL("relax.BlockBuilderNormalize")
.set_body_method<BlockBuilder>(&BlockBuilderNode::Normalize);
TVM_REGISTER_GLOBAL("relax.BlockBuilderEmit")
.set_body_typed([](BlockBuilder builder, Expr expr, String name_hint) {
return builder->Emit(expr, name_hint);
});
TVM_REGISTER_GLOBAL("relax.BlockBuilderEmitMatchCast")
.set_body_typed([](BlockBuilder builder, Expr value, StructInfo struct_info, String name_hint) {
return builder->EmitMatchCast(value, struct_info, name_hint);
});
TVM_REGISTER_GLOBAL("relax.BlockBuilderEmitOutput")
.set_body_typed([](BlockBuilder builder, const Expr& output, String name_hint) {
return builder->EmitOutput(output, name_hint);
});
TVM_REGISTER_GLOBAL("relax.BlockBuilderEmitNormalized")
.set_body_typed([](BlockBuilder builder, Binding binding) {
return builder->EmitNormalized(binding);
});
TVM_REGISTER_GLOBAL("relax.BlockBuilderGetUniqueName")
.set_body_typed([](BlockBuilder builder, String name_hint) {
return builder->name_supply()->FreshName(name_hint, /*add_prefix*/ false,
/*add_underscore*/ false);
});
TVM_REGISTER_GLOBAL("relax.BlockBuilderAddFunction")
.set_body_method<BlockBuilder>(&BlockBuilderNode::AddFunction);
TVM_REGISTER_GLOBAL("relax.BlockBuilderUpdateFunction")
.set_body_method<BlockBuilder>(&BlockBuilderNode::UpdateFunction);
TVM_REGISTER_GLOBAL("relax.BlockBuilderGetContextIRModule")
.set_body_method<BlockBuilder>(&BlockBuilderNode::GetContextIRModule);
TVM_REGISTER_GLOBAL("relax.BlockBuilderFinalize")
.set_body_method<BlockBuilder>(&BlockBuilderNode::Finalize);
TVM_REGISTER_GLOBAL("relax.BlockBuilderCurrentBlockIsDataFlow")
.set_body_method<BlockBuilder>(&BlockBuilderNode::CurrentBlockIsDataFlow);
TVM_REGISTER_GLOBAL("relax.BlockBuilderLookupBinding")
.set_body_method<BlockBuilder>(&BlockBuilderNode::LookupBinding);
TVM_REGISTER_GLOBAL("relax.BlockBuilderBeginScope")
.set_body_method<BlockBuilder>(&BlockBuilderNode::BeginScope);
TVM_REGISTER_GLOBAL("relax.BlockBuilderEndScope")
.set_body_method<BlockBuilder>(&BlockBuilderNode::EndScope);
} // namespace relax
} // namespace tvm
``` |
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Playdeveloperreporting;
class your_sha256_hashetRequest extends \Google\Collection
{
protected $collection_key = 'metrics';
/**
* @var string[]
*/
public $dimensions;
/**
* @var string
*/
public $filter;
/**
* @var string[]
*/
public $metrics;
/**
* @var int
*/
public $pageSize;
/**
* @var string
*/
public $pageToken;
protected $timelineSpecType = GooglePlayDeveloperReportingV1beta1TimelineSpec::class;
protected $timelineSpecDataType = '';
/**
* @var string
*/
public $userCohort;
/**
* @param string[]
*/
public function setDimensions($dimensions)
{
$this->dimensions = $dimensions;
}
/**
* @return string[]
*/
public function getDimensions()
{
return $this->dimensions;
}
/**
* @param string
*/
public function setFilter($filter)
{
$this->filter = $filter;
}
/**
* @return string
*/
public function getFilter()
{
return $this->filter;
}
/**
* @param string[]
*/
public function setMetrics($metrics)
{
$this->metrics = $metrics;
}
/**
* @return string[]
*/
public function getMetrics()
{
return $this->metrics;
}
/**
* @param int
*/
public function setPageSize($pageSize)
{
$this->pageSize = $pageSize;
}
/**
* @return int
*/
public function getPageSize()
{
return $this->pageSize;
}
/**
* @param string
*/
public function setPageToken($pageToken)
{
$this->pageToken = $pageToken;
}
/**
* @return string
*/
public function getPageToken()
{
return $this->pageToken;
}
/**
* @param GooglePlayDeveloperReportingV1beta1TimelineSpec
*/
public function setTimelineSpec(GooglePlayDeveloperReportingV1beta1TimelineSpec $timelineSpec)
{
$this->timelineSpec = $timelineSpec;
}
/**
* @return GooglePlayDeveloperReportingV1beta1TimelineSpec
*/
public function getTimelineSpec()
{
return $this->timelineSpec;
}
/**
* @param string
*/
public function setUserCohort($userCohort)
{
$this->userCohort = $userCohort;
}
/**
* @return string
*/
public function getUserCohort()
{
return $this->userCohort;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(your_sha256_hashetRequest::class, your_sha256_hashngV1beta1QuerySlowRenderingRateMetricSetRequest');
``` |
```objective-c
/*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Intel Corporation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#ifndef _SGX_UAE_QUOTE_EX_H_
#define _SGX_UAE_QUOTE_EX_H_
#include <stdint.h>
#include "sgx_quote.h"
#include "sgx_error.h"
#include "sgx_urts.h"
#ifdef __cplusplus
extern "C" {
#endif
/**
* Function use to select the attestation key. The function will select a att_key_id_list of attestation keys supported
* by the quote verifier if the platform can support one in the list. If the platform cannot support one in the list,
* the API will return error SGX_ERROR_UNSUPPORTED_ATT_KEY_ID. If multiple attestation keys are supported
* by both quote verifier and the platform software, the "default quoting type" in config file will be used. Alternatively,
* if the quote provider doesn't supply a list if attestation keys supported by the quote verifier (p_att_key_id_list == NULL),
* then the platform software will select the attestation key by the internal logic.
*
*
* @param p_att_key_id_list [In] List of the supported attestation key IDs provided by the quote verifier. Can be
* NULL, in such case a default att key supported by PSW will be returned.
* @param att_key_id_list_size The size of attestation key ID list.
* @param p_selected_key_id [In, Out] Pointer to the selected attestation key. This should be used by the
* application as input to the quoting and remote attestation APIs. Must not be NULL.
*
* @return SGX_SUCCESS Successfully return an attestation key. The p_selected_key_id will be filled with selected
* attestation key ID.
* @return SGX_ERROR_INVALID_PARAMETER Invalid parameter if p_selected_key_id is NULL,
* list header is incorrect, or the number of key IDs in the list exceed the maximum.
* @return SGX_ERROR_UNSUPPORTED_ATT_KEY_ID The platform quoting infrastructure does not support any of the keys in the
* list. This can be because it doesn't carry the QE that owns the attestation key or the platform is in a
* mode that doesn't allow any of the listed keys; for example, for privacy reasons. It also returns such eror
* if the platform software only supports a key that is not supported by the current launch control policy.
* @return SGX_ERROR_UNEXPECTED Unexpected internal error.
*/
sgx_status_t SGXAPI sgx_select_att_key_id(const uint8_t *p_att_key_id_list, uint32_t att_key_id_list_size,
sgx_att_key_id_t *p_selected_key_id);
/**
* The application calls this API to request the selected platform's attestation key owner to generate or obtain
* the attestation key. Once called, the QE that owns the attestation key described by the inputted attestation
* key id will do what is required to get this platform's attestation including getting any certification data
* required from the PCE. Depending on the type of attestation key and the attestation key owner, this API will
* return the same attestation key public ID or generate a new one. The caller can request that the attestation
* key owner "refresh" the key. This will cause the owner to either re-get the key or generate a new one. The
* platform's attestation key owner is expected to store the key in persistent memory and use it in the
* subsequent quote generation APIs described below.
*
* In an environment where attestation key provisioning and certification needs to take place during a platform
* deployment phase, an application can generate the attestation key, certify it with the PCK Cert and register
* it with the attestation owners cloud infrastructure. That way, the key is available during the run time
* phase to generate code without requiring re-certification.
*
* The QE's target info is also returned by this API that will allow the application's enclave to generate a
* REPORT that the attestation key owner's QE will verify using local REPORT-based attestation when generating a
* quote.
*
* In order to allow the application to allocate the public key id buffer first, the application can call this
* function with the p_pub_key_id set to NULL and the p_pub_key_id_size to a valid size_t pointer. In this
* case, the function will return the required buffer size to contain the p_pub_key_id_size and ignore the other
* parameters. The application can then call this API again with the correct p_pub_key_size and the pointer to
* the allocated buffer in p_pub_key_id.
*
*
* @param p_att_key_id The selected att_key_id from the quote verifier's list. It includes the QE identity as
* well as the attestation key's algorithm type. It cannot be NULL.
* @param p_qe_target_info Pointer to QE's target info required by the application to generate an enclave REPORT
* targeting the selected QE. Must not be NULL when p_pub_key_id is not NULL.
* @param p_pub_key_id_size This parameter can be used in 2 ways. When p_pub_key_id is NULL, the API will
* return the buffer size required to hold the attestation's public key ID. The
* application can then allocate the buffer and call it again with p_pub_key_id not set
* to NULL and the other parameters valid. If p_pub_key_id is not NULL, p_pub_key_id_size
* must be large enough to hold the return attestation's public key ID. Must not be
* NULL.
* @param p_pub_key_id This parameter can be used in 2 ways. When it is passed in as NULL and p_pub_key_id_size
* is not NULL, the API will return the buffer size required to hold the attestation's
* public key ID. The other parameters will be ignored. When it is not NULL, it must point
* to a buffer which is at least a long as the value passed in by p_pub_key_id_size. API will
* return the attestation key's public identifier if no error occured.
* @return SGX_SUCCESS Successfully selected an attestation key. Either returns the required attestation's
* public key ID size in p_pub_key_id_size when p_pub_key_id is passed in as NULL. When p_pub_key_id is
* not NULL, p_qe_target_info will contain the attestation key's QE target info for REPORT generation
* and p_pub_key_id will contain the attestation's public key ID.
* @return SGX_ERROR_INVALID_PARAMETER Invalid parameter if p_pub_key_id_size, p_att_key_id is NULL.
* If p_pub_key_id_size is not NULL, the other parameters must be valid.
* @return SGX_ERROR_UNSUPPORTED_ATT_KEY_ID The platform quoting infrastructure does not support the key described
* in p_att_key_id.
* @return SGX_ERROR_ATT_KEY_CERTIFICATION_FAILURE Failed to generate and certify the attestation key.
*
*/
sgx_status_t SGXAPI sgx_init_quote_ex(const sgx_att_key_id_t* p_att_key_id,
sgx_target_info_t *p_qe_target_info,
size_t* p_pub_key_id_size,
uint8_t* p_pub_key_id);
/**
* The application needs to call this function before generating a quote. The quote size is variable
* depending on the type of attestation key selected and other platform or key data required to generate the
* quote. Once the application calls this API, it will use the returned p_quote_size to allocate the buffer
* required to hold the generated quote. A pointer to this buffer is provided to the sgx_get_quote_ex() API.
*
* If the key is not available, this API may return an error (SGX_ERROR_ATT_KEY_UNINITIALIZED) depending on
* the algorithm. In this case, the caller must call sgx_init_quote_ex() to re-generate and certify the attestation key.
*
* @param p_att_key_id The selected attestation key ID from the quote verifier's list. It includes the QE
* identity as well as the attestation key's algorithm type. It cannot be NULL.
* @param p_quote_size Pointer to the location where the required quote buffer size will be returned. Must
* not be NULL.
*
* @return SGX_SUCCESS Successfully calculated the required quote size. The required size in bytes is returned in the
* memory pointed to by p_quote_size.
* @return SGX_ERROR_INVALID_PARAMETER Invalid parameter. p_quote_size and p_att_key_id must not be NULL.
* @return SGX_ERROR_ATT_KEY_UNINITIALIZED The platform quoting infrastructure does not have the attestation
* key available to generate quotes. sgx_init_quote_ex() must be called again.
* @return SGX_ERROR_UNSUPPORTED_ATT_KEY_ID The platform quoting infrastructure does not support the key
* described in p_att_key_id.
*/
sgx_status_t SGXAPI sgx_get_quote_size_ex(const sgx_att_key_id_t *p_att_key_id,
uint32_t* p_quote_size);
/**
* The function will take the application enclave's REPORT that will be converted into a quote after the QE verifies
* the REPORT. Once verified it will sign it with platform's attestation key matching the selected attestation key ID.
* If the key is not available, this API may return an error (SGX_ERROR_ATT_KEY_UNINITIALIZED) depending on the algorithm.
* In this case, the caller must call sgx_init_quote_ex() to re-generate and certify the attestation key. an attestation key.
*
*
* The caller can request a REPORT from the QE using a supplied nonce. This will allow the enclave requesting the quote
* to verify the QE used to generate the quote. This makes it more difficult for something to spoof a QE and allows the
* app enclave to catch it earlier. But since the authenticity of the QE lies in knowledge of the Quote signing key,
* such spoofing will ultimately be detected by the quote verifier. QE REPORT.ReportData =
* SHA256(*p_nonce||*p_quote)||32-0x00's.
*
* @param p_app_report Pointer to the enclave report that needs the quote. The report needs to be generated using the
* QE's target info returned by the sgx_init_quote_ex() API. Must not be NULL.
* @param p_att_key_id The selected attestation key ID from the quote verifier's list. It includes the QE identity as
* well as the attestation key's algorithm type. It cannot be NULL.
* @param p_qe_report_info Pointer to a data structure that will contain the information required for the QE to generate
* a REPORT that can be verified by the application enclave. The inputted data structure
* contains the application's TARGET_INFO, a nonce and a buffer to hold the generated report.
* The QE Report will be generated using the target information and the QE's REPORT.ReportData =
* SHA256(*p_nonce||*p_quote)||32-0x00's. This parameter is used when the application wants to
* verify the QE's REPORT to provide earlier detection that the QE is not being spoofed by
* untrusted code. A spoofed QE will ultimately be rejected by the remote verifier. This
* parameter is optional and will be ignored when NULL.
* @param p_quote Pointer to the buffer that will contain the quote.
* @param quote_size Size of the buffer pointed to by p_quote.
*
* @return SGX_SUCCESS Successfully generated the quote.
* @return SGX_ERROR_INVALID_PARAMETER If either p_app_report or p_quote is null. Or, if quote_size isn't large
* enough, p_att_key_id is NULL.
* @return SGX_ERROR_ATT_KEY_UNINITIALIZED The platform quoting infrastructure does not have the attestation key
* available to generate quotes. sgx_init_quote_ex() must be called again.
* @return SGX_ERROR_UNSUPPORTED_ATT_KEY_ID The platform quoting infrastructure does not support the key described in
* p_att_key_id.
* @return SGX_ERROR_MAC_MISMATCH Report MAC check failed on application report.
*/
sgx_status_t SGXAPI sgx_get_quote_ex(const sgx_report_t *p_app_report,
const sgx_att_key_id_t *p_att_key_id,
sgx_qe_report_info_t *p_qe_report_info,
uint8_t *p_quote,
uint32_t quote_size);
/**
* The application needs to call this function before getting supported_attestation key IDs. The number is variable
* depending on the platform. Once the application calls this API, it will use the returned p_att_key_id_num to allocate
* the buffer required to hold the supported_attestation key IDs. A pointer to this buffer is provided to the
* sgx_get_supported_att_key_ids() API.
*
* @param p_att_key_id_num Pointer to the location where the required number will be returned. Must not be NULL.
*
* @return SGX_SUCCESS Successfully calculated the required number.
* @return SGX_ERROR_INVALID_PARAMETER Invalid parameter. p_att_key_id_num must not be NULL.
*/
sgx_status_t SGXAPI sgx_get_supported_att_key_id_num(uint32_t *p_att_key_id_num);
/**
* The function will generate an array of all supported attestation key IDs.
* The application needs to call sgx_get_supported_att_key_id_num() API first to get the number of key IDs. Then
* the application needs to allocate the buffer whose size is sizeof sgx_att_key_id_ext_t * att_key_id_num.
*
* @param p_att_key_id_list Pointer to the buffer that will contain supported_attestation key IDs. It cannot be NULL.
* @param att_key_id_num the number of supported key IDs.
*
* @return SGX_SUCCESS Successfully generated the supported attestation key IDs.
* @return SGX_ERROR_INVALID_PARAMETER Invalid parameter. p_att_key_id_list must not be NULL.
*/
sgx_status_t SGXAPI sgx_get_supported_att_key_ids(sgx_att_key_id_ext_t *p_att_key_id_list,
uint32_t att_key_id_num);
#ifdef __cplusplus
}
#endif
#endif
``` |
Naurangpur is a village in Bhulath Tehsil in Kapurthala district of Punjab State, India. It is located from Bhulath, away from district headquarter Kapurthala. The village is administrated by a Sarpanch who is an elected representative of village as per the constitution of India and Panchayati raj (India).
References
List of cities near the village
Bhulath
Kapurthala
Phagwara
Sultanpur Lodhi
Air travel connectivity
The closest International airport to the village is Sri Guru Ram Dass Jee International Airport.
External links
Villages in Kapurthala
List of Villages in Kapurthala Tehsil
Villages in Kapurthala district |
Clinton Municipal Airport is seven miles southwest of Clinton, in Clinton County, Iowa. The FAA's National Plan of Integrated Airport Systems (2017-2021) categorizes it as a general aviation airport.
Clinton had scheduled airline flights from 1951-52 until 1975: Braniff until 1955, then Ozark. There was still commercial air service to Clinton into the mid-1980s. The Official Airline Guide in February 1985 showed a total of five weekday departures to O'Hare International in Chicago; Three via American Central and two via Great Lakes. Scheduled passenger service to Clinton was discontinued by the late 1980s.
Facilities
Clinton Municipal Airport covers at an elevation of 708 feet (216 m). It has two asphalt runways: 3/21 is 5,204 by 100 feet (1,586 x 30 m) and 14/32 is 4,201 by 100 feet (1,280 x 30 m).
In the year ending September 10, 2015 the airport had 15,400 aircraft operations, average 42 per day: 95% general aviation, 3% military and 2% air taxi. In April 2017, 40 aircraft were based at the airport: 30 single-engine, 3 multi-engine, 1 jet and 6 ultralight.
Other uses
The airport is the site of the annual Cessna 150 and Cessna 152 fly-in, which began in 2001. The fly-in is open to owners, pilots and enthusiasts who share a common interest in those types of airplanes.
See also
List of airports in Iowa
Clinton Municipal Transit Administration
References
External links
Clinton Municipal (CWI) at Iowa DOT Airport Directory
Airports in Iowa
Transportation buildings and structures in Clinton County, Iowa
Clinton, Iowa |
Catesby Tunnel is a disused railway tunnel in Northamptonshire on the route of the former Great Central Main Line. Its northern portal is about south of Catesby Viaduct and west of Upper Catesby, with the tunnel ending at Charwelton to the south. In terms of both length and gauge, Catesby Tunnel is unusually large, at wide, high, and long.
The tunnel was completed in 1897, and was closed in 1966 when the line was made redundant by British Rail. After lying abandoned and flooded for over 50 years, proposals were granted in 2017 for the conversion of the wide, straight tunnel into an aerodynamic test facility for road and race cars.
Description
The tunnel, its portals and air shafts are all lined and faced with hard Staffordshire blue brick and a total of about 30 million bricks were used. The tunnel has five air shafts; four are in Catesby parish and each has a diameter of . The fifth is in the neighbouring parish of Hellidon, and has a diameter of for greater airflow. About of material was dug out to make the tunnel, which is straight throughout due to the Great Central Railway (GCR) being built for speed and on a rising gradient of 1:176 to the south.
History
Construction
The Great Central Railway (GCR) intended its London Extension to pass through Catesby parish in a cutting. However, the occupant of Catesby House, Henry Attenborough, owned much of the land in the parish and insisted that the line pass beneath it in a tunnel to preserve the landscape. Thomas Oliver & Son of Horsham was the contractor to build the — section of the line. The first from the north portal were dug using cut-and-cover, with the remainder built by sinking nine construction shafts in 1895 (a Roman cinerary urn was found in one shaft), and completed the tunnel in May 1897. Unlike the tunnel construction of the earlier Victorian era, excavation was able to be accelerated through the use of Ruston steam navvies instead of being entirely dug by hand. The first services to use the tunnel were coal trains, which started running on 25 July 1898. The line opened fully on 15 March 1899.
Operation and closure
On 4 January 1906 a rail on the Down track broke and derailed an afternoon express from to with about 50 passengers aboard. The train was travelling at about and tore up about of track before it came to a halt. All five coaches were derailed and the last coach fouled the Up track, on which a goods train was due. The crew of the express acted to protect their train: the driver placed a detonator on one rail of the Up track and the guard sounded the train whistle, both of which gave the crew of the approaching Up goods enough warning to stop short of the wreckage.
British Railways closed the Great Central Main Line (GCML) through the tunnel on 5 September 1966, and the track was lifted shortly thereafter. With the withdrawal of a maintenance regime after closure, a blocked drain exacerbated water ingress such that a foot or more of floodwater filled some parts of the tunnel.
Redevelopment
Numerous reopening proposals for sections of the GCML have featured Catesby Tunnel. In 2000, Chiltern Railways expressed an interest in reopening the route to passengers as far as Rugby or even Leicester, though this never came forward. The trackbed was also included in failed proposals by Central Railway to build a new intermodal freight line from Liverpool to Europe. It was also part of a possible alignment explored during the planning phase of High Speed 2; the preferred route ended up following a course several miles further west.
Proposals emerged in 2014 to convert the tunnel into a vehicle testing facility. The planning approval was granted in February 2017. The facility allows performance, aerodynamics, air cooling and emissions to be analysed in a controlled environment at full scale, the only facility of its type for hire anywhere in the world. With the ends of the tunnel being preserved for roosting bats, about in the centre is available for testing. Cars will be able to maintain for about 40 seconds before braking. Public access to the tunnel will be offered on Sundays for cycling. Engineering work for conversion to a wind tunnel, including renovation of the drainage, was started in 2020 with a projected cost of £13 million. The facility opened as a test facility in summer 2021, with a remote-control turntable at the end.
See also
Laurel Hill Tunnel
References
Sources
External links
West Northamptonshire District
Derailments in England
Great Central Railway
Railway accidents in 1906
Railway tunnels in England
Tunnel disasters
Tunnels completed in 1897
1838 in London |
Kishor Gurung () is a Nepalese guitarist and ethnomusicologist.
Biography
Kishor Gurung comes from a musical family; the first instrument he played was the tabla drums. When he decided to learn the guitar he faced the difficulty of inaccessibility to printed music, recordings and accredited teachers in his homeland Nepal, but he eventually won a full scholarship to study guitar at the San Francisco Conservatory of Music, where he studied with Larry Almeida, George Sakallariou and David Tanenbaum and participated in Master Classes conducted by such distinguished international guitarists as Michael Lorimor (USA), Julian Bream (UK), Manuel Barrueco (Cuba), David Russell (Scotland), Jose Tomas (Spain), Abel Carlevaro (Paraguay). He pursued then an MA degree in ethnomusicology at the University of Hawaii as an East-West Centre grantee, following which he has participated in international music seminars and performed in Asia and Europe with favorable press reviews. Kishor is the first Nepali to obtain music degrees from the accredited institutions of the West. In addition to his TV appearances and radio broadcasts, Kishor has also appeared as a soloist with the Long Island Youth Orchestra of New York.
Kishor has been an executive member of the state-run Radio Nepal, and has taught at Tribhuvan University and Malpi International College (affiliated with the University of Mississippi, USA) in Kathmandu. During his recent residency in the UK, he taught at various schools for the Harrow Council, London.
As the founder and president of the Classical Guitar Society of Nepal, he organized the first Ethnomusicology Seminar and International Guitar Festivals in Nepal that were attended by luthiers, scholars and guitarists from Germany, Japan, the USA, Finland, Liechtenstein, and Thailand. He has written and produced songs to promote drug abuse awareness among youth for the United Nations and the American Embassy/Kathmandu. He has lectured at Folklore Society Congress, Kathmandu; St. Lawrence University; Society for Ethnomusicology Colorado; Heidelberg University, Germany and in Italy .
With the onset of focal dystonia (a debilitating nerve condition) in 2006, Kishor had to stop giving concerts. In addition to seeking medical attention, he has devised his own therapy and a miniature guitar for shadow practicing. He has almost cured himself and has embarked on playing guitar again. He performed his UK debut in Folkestone, Kent in 2010, for the charity of the Gurkha Memorial Statue.
Kishor has been accorded a commendation from the Government of Nepal for assisting in the making of the new National Anthem (2007).
References
External links
http://www.bravaguitarra.com
https://web.archive.org/web/20170127063235/http://www.kishorgurung.com/
Classical guitarists
Ethnomusicologists
Living people
Nepalese guitarists
Year of birth missing (living people)
Gurung people
Musicians with dystonia |
Manu is a French animated series, based on comic books by cartoonist Frank Margerin. It premiered in 1991 and was about a teenager 'Manu' and situations in his own life, with the rest of his family and his friend Robert. It used to air in the United Kingdom (Dubbed into English) on the now defunct Children's Channel between 1992 and the channel's closure in 1998.
It was produced by the French animation studio "Jingle", and the French and defunct network La Cinq.
External links
1990s French animated television series
1991 French television series debuts
French children's animated comedy television series |
Rosa de Eguílaz y Renart (born 11 October 1864; date of death unknown) was a Spanish playwright and journalist. She was the daughter of playwright Luis de Eguílaz.
As an orphan only eleven years old, Rosa de Eguílaz y Renart presented Retrato de su señor padre and Una cantora del siglo XV (in oil) at the Exhibition of 1876. She belonged to the Women's Section of the Ibero-American Union and contributed to magazines such as El Mundo de los Niños and La Edad Feliz. Two of her works are known to have premiered at the in Madrid: Después de Dios (1889) and Mujer famosa (1891). The latter was an Iberian court drama about the problems caused by a woman using a male pseudonym to find success as a writer.
References
1864 births
Year of death unknown
19th-century Spanish dramatists and playwrights
Spanish women journalists
Writers from Madrid
19th-century Spanish women writers
Spanish women dramatists and playwrights |
MeteorCity Records is an American record label founded in 1997 by Jadd Shickler and Aaron Emmel in Albuquerque, New Mexico. With the release of its compilation album Welcome to MeteorCity showcasing young unsigned Kyuss-like bands, MeteorCity helped launch the stoner rock genre and many of the genre's first bands, plus side projects from members of well-known bands including The Atomic Bitchwax and Hermano. MeteorCity Records was one of the first record labels dedicated exclusively to Stoner rock, doom metal, sludge metal, drone metal and psychedelic rock.
History
MeteorCity was founded in September 1997 by Jadd Shickler (of band Spiritu) and Aaron Emmel in Albuquerque, New Mexico. The first incarnation was an online store called All That's Heavy, which sold hard-to-find releases by stoner rock bands Kyuss, Monster Magnet, and Fu Manchu. They soon expanded the catalog to include artists that stylistically fit with the first three bands.
After running the online store for about half a year, they were contacted by the former proprietor for the first Kyuss fan website. He recommended MeteorCity do a compilation of unsigned bands that Kyuss fans would enjoy. MeteorCity Records was formed, and the result of the suggestion was the compilation Welcome to MeteorCity, which was released in May of that year. The compilation included both established desert and stoner rock acts, including new bands established by John Garcia of Kyuss (now in Unida), Ed Mundell of Monster Magnet, and Pete Stahl. The album was the first time that the bands Sixty Watt Shaman, Lowrider, The Atomic Bitchwax, Dozer, Goatsnake, Drag Pack, and Los Natas were heard on a record. According to MeteorCity founders,
Around this time a MeteorCity intern purportedly coined the term desert rock to describe the burgeoning genre, which is still used interchangeably with the more known descriptor "stoner rock". Stoner rock originates from the title of the 1997 Roadrunner Records compilation Burn One Up! Music for Stoners.
After the first compilation was released, that summer the label received a call from customer Henry Vasquez, who had the members of the band Nebula in his store. The bandmembers, which included founding Fu Manchu members Eddie Glass (guitar) and Ruben Romano (drums), had asked to talk with them. The band agreed to release their EP on MeteorCity, and MeteorCity offered to fund the band's recording session with Jack Endino. The result was MeteorCity's second release, the Nebula/Lowrider EP, which also featured tracks by Swedish band Lowrider. In 1999, the label released Unida/Dozer, a joint EP featuring the first non-compilation tracks by Unida and Swedish band Dozer.
The label soon signed a number of musicians and bands from the Palm Desert Scene of desert rock, such as Hermano and Unida, both featuring former Kyuss frontman John Garcia. They have also released albums by The Atomic Bitchwax, which features Monster Magnet guitarist Ed Mundell, and The Hidden Hand and Spirit Caravan led by Obsessed/St. Vitus guitarist Scott "Wino" Weinreich. In 2002 they released the first album by the Orquesta Del Desierto, which featured key members of the major desert rock bands.
Change of ownership
As the scene continued to develop, the popular website StonerRock.com was launched by Dan Beland in 1999. The website became a central community hub for heavy music artists and fans. In March 2001, MeteorCity licensed StonerRock.com to take over management and operations of All That's Heavy. All That's Heavy's catalog grew to become the largest online store of stoner rock, doom metal, sludge metal, drone metal and psychedelic rock. MeteorCity in turn began to focus more on the label. All That's Heavy was officially sold to Dan Beland and Melanie Streko of StonerRock.com on May 15, 2004, and renamed All That is Heavy.
In 2007, Shickler and Emmel sold MeteorCity Records to Dan Beland and Melanie Streko as well. Their farewell release was a three disc compilation disc titled ...And Back to Earth Again. MeteorCity continued to release albums by new bands, including full LPs from Black Pyramid, Elder, Snail and Freedom Hawk, among others. In 2010 StonerRock.com was taken offline, and MeteorCity Records became the official label for All That is Heavy. On September 1, 2014, Melanie Streko resigned from All That is Heavy and MeteorCity Records. Three years later, on August 1, 2017, All That is Heavy was sold to Casey and Taylor Kelch of Katy, Texas.
Artists
Abdullah
Ararat
The Atomic Bitchwax
Black NASA
Blind Dog
Black Pyramid
Dead Man
Dozer
Egypt
Eighteen Wheels Burning
Elder
Eternal Elysium
Farflung
Flood
Freedom Hawk
Gallery of Mites
Hermano
The Hidden Hand
Humo Del Cairo
Leeches of Lore
Let the Night Roar
Los Natas
Lowrider
Misdemeanor
The Mushroom River Band
Nebula
New Keepers of The Water Towers
Nightstalker
The Obsessed
Olde Growth
Orquesta del Desierto
The Quill
The Ribeye Brothers
SardoniS
Scene Killer
Snail
Solace
Solarized
Spirit Caravan
Spiritu
Truckfighters
Unida
Valkyrie
Village of Dead Roads
WhiteBuzz
Release history
References
Further reading
External links
MeteorCity Records
All That is Heavy
American record labels
Doom metal record labels |
Leszczewek is a village in the administrative district of Gmina Suwałki, within Suwałki County, Podlaskie Voivodeship, in north-eastern Poland. It lies approximately east of Suwałki and north of the regional capital Białystok.
References
Leszczewek |
The men's pole vault event at the 1994 World Junior Championships in Athletics was held in Lisbon, Portugal, at Estádio Universitário de Lisboa on 20 and 22 July.
Medalists
Results
Final
22 July
Qualifications
20 Jul
Group A
Group B
Participation
According to an unofficial count, 26 athletes from 17 countries participated in the event.
References
Pole vault
Pole vault at the World Athletics U20 Championships |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.