text
stringlengths 12
4.76M
| timestamp
stringlengths 26
26
| url
stringlengths 32
32
|
|---|---|---|
diff -r c3565a90b8c4 lib/freebl/blapi.h
--- a/lib/freebl/blapi.h Fri Jan 03 20:59:10 2014 +0100
+++ b/lib/freebl/blapi.h Tue Jan 07 12:11:36 2014 -0800
@@ -986,6 +986,38 @@
unsigned int *outputLen, unsigned int maxOutputLen,
const unsigned char *input, unsigned int inputLen);
+/******************************************/
+/*
+** ChaCha20+Poly1305 AEAD
+*/
+
+extern SECStatus
+ChaCha20Poly1305_InitContext(ChaCha20Poly1305Context *ctx,
+ const unsigned char *key, unsigned int keyLen,
+ unsigned int tagLen);
+
+extern ChaCha20Poly1305Context *
+ChaCha20Poly1305_CreateContext(const unsigned char *key, unsigned int keyLen,
+ unsigned int tagLen);
+
+extern void
+ChaCha20Poly1305_DestroyContext(ChaCha20Poly1305Context *ctx, PRBool freeit);
+
+extern SECStatus
+ChaCha20Poly1305_Seal(const ChaCha20Poly1305Context *ctx,
+ unsigned char *output, unsigned int *outputLen,
+ unsigned int maxOutputLen,
+ const unsigned char *input, unsigned int inputLen,
+ const unsigned char *nonce, unsigned int nonceLen,
+ const unsigned char *ad, unsigned int adLen);
+
+extern SECStatus
+ChaCha20Poly1305_Open(const ChaCha20Poly1305Context *ctx,
+ unsigned char *output, unsigned int *outputLen,
+ unsigned int maxOutputLen,
+ const unsigned char *input, unsigned int inputLen,
+ const unsigned char *nonce, unsigned int nonceLen,
+ const unsigned char *ad, unsigned int adLen);
/******************************************/
/*
diff -r c3565a90b8c4 lib/freebl/blapit.h
--- a/lib/freebl/blapit.h Fri Jan 03 20:59:10 2014 +0100
+++ b/lib/freebl/blapit.h Tue Jan 07 12:11:36 2014 -0800
@@ -222,6 +222,7 @@
struct SHA512ContextStr ;
struct AESKeyWrapContextStr ;
struct SEEDContextStr ;
+struct ChaCha20Poly1305ContextStr;
typedef struct DESContextStr DESContext;
typedef struct RC2ContextStr RC2Context;
@@ -240,6 +241,7 @@
typedef struct SHA512ContextStr SHA384Context;
typedef struct AESKeyWrapContextStr AESKeyWrapContext;
typedef struct SEEDContextStr SEEDContext;
+typedef struct ChaCha20Poly1305ContextStr ChaCha20Poly1305Context;
/***************************************************************************
** RSA Public and Private Key structures
diff -r c3565a90b8c4 lib/freebl/chacha20/chacha20.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/chacha20/chacha20.c Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,108 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/* Adopted from the public domain code in NaCl by djb. */
+
+#include <string.h>
+#include <stdio.h>
+
+#include "prtypes.h"
+#include "chacha20.h"
+
+#define ROTL32(v, n) (((v) << (n)) | ((v) >> (32 - (n))))
+#define ROTATE(v, c) ROTL32((v), (c))
+#define XOR(v, w) ((v) ^ (w))
+#define PLUS(x, y) ((x) + (y))
+
+#define U32TO8_LITTLE(p, v) \
+ { (p)[0] = ((v) ) & 0xff; (p)[1] = ((v) >> 8) & 0xff; \
+ (p)[2] = ((v) >> 16) & 0xff; (p)[3] = ((v) >> 24) & 0xff; }
+#define U8TO32_LITTLE(p) \
+ (((PRUint32)((p)[0]) ) | ((PRUint32)((p)[1]) << 8) | \
+ ((PRUint32)((p)[2]) << 16) | ((PRUint32)((p)[3]) << 24) )
+
+#define QUARTERROUND(a,b,c,d) \
+ x[a] = PLUS(x[a],x[b]); x[d] = ROTATE(XOR(x[d],x[a]),16); \
+ x[c] = PLUS(x[c],x[d]); x[b] = ROTATE(XOR(x[b],x[c]),12); \
+ x[a] = PLUS(x[a],x[b]); x[d] = ROTATE(XOR(x[d],x[a]), 8); \
+ x[c] = PLUS(x[c],x[d]); x[b] = ROTATE(XOR(x[b],x[c]), 7);
+
+static void ChaChaCore(unsigned char output[64], const PRUint32 input[16],
+ int num_rounds) {
+ PRUint32 x[16];
+ int i;
+
+ memcpy(x, input, sizeof(PRUint32) * 16);
+ for (i = num_rounds; i > 0; i -= 2) {
+ QUARTERROUND( 0, 4, 8,12)
+ QUARTERROUND( 1, 5, 9,13)
+ QUARTERROUND( 2, 6,10,14)
+ QUARTERROUND( 3, 7,11,15)
+ QUARTERROUND( 0, 5,10,15)
+ QUARTERROUND( 1, 6,11,12)
+ QUARTERROUND( 2, 7, 8,13)
+ QUARTERROUND( 3, 4, 9,14)
+ }
+
+ for (i = 0; i < 16; ++i) {
+ x[i] = PLUS(x[i], input[i]);
+ }
+ for (i = 0; i < 16; ++i) {
+ U32TO8_LITTLE(output + 4 * i, x[i]);
+ }
+}
+
+static const unsigned char sigma[16] = "expand 32-byte k";
+
+void ChaCha20XOR(unsigned char *out, const unsigned char *in, unsigned int inLen,
+ const unsigned char key[32], const unsigned char nonce[8],
+ uint64_t counter) {
+ unsigned char block[64];
+ PRUint32 input[16];
+ unsigned int u;
+ unsigned int i;
+
+ input[4] = U8TO32_LITTLE(key + 0);
+ input[5] = U8TO32_LITTLE(key + 4);
+ input[6] = U8TO32_LITTLE(key + 8);
+ input[7] = U8TO32_LITTLE(key + 12);
+
+ input[8] = U8TO32_LITTLE(key + 16);
+ input[9] = U8TO32_LITTLE(key + 20);
+ input[10] = U8TO32_LITTLE(key + 24);
+ input[11] = U8TO32_LITTLE(key + 28);
+
+ input[0] = U8TO32_LITTLE(sigma + 0);
+ input[1] = U8TO32_LITTLE(sigma + 4);
+ input[2] = U8TO32_LITTLE(sigma + 8);
+ input[3] = U8TO32_LITTLE(sigma + 12);
+
+ input[12] = (PRUint32)counter;
+ input[13] = (PRUint32)(counter >> 32);
+ input[14] = U8TO32_LITTLE(nonce + 0);
+ input[15] = U8TO32_LITTLE(nonce + 4);
+
+ while (inLen >= 64) {
+ ChaChaCore(block, input, 20);
+ for (i = 0; i < 64; i++) {
+ out[i] = in[i] ^ block[i];
+ }
+
+ input[12]++;
+ if (input[12] == 0) {
+ input[13]++;
+ }
+
+ inLen -= 64;
+ in += 64;
+ out += 64;
+ }
+
+ if (inLen > 0) {
+ ChaChaCore(block, input, 20);
+ for (i = 0; i < inLen; i++) {
+ out[i] = in[i] ^ block[i];
+ }
+ }
+}
diff -r c3565a90b8c4 lib/freebl/chacha20/chacha20.h
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/chacha20/chacha20.h Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,22 @@
+/*
+ * chacha20.h - header file for ChaCha20 implementation.
+ *
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+#ifndef FREEBL_CHACHA20_H_
+#define FREEBL_CHACHA20_H_
+
+#include <stdint.h>
+
+/* ChaCha20XOR encrypts |inLen| bytes from |in| with the given key and
+ * nonce and writes the result to |out|, which may be equal to |in|. The
+ * initial block counter is specified by |counter|. */
+extern void ChaCha20XOR(unsigned char *out,
+ const unsigned char *in, unsigned int inLen,
+ const unsigned char key[32],
+ const unsigned char nonce[8],
+ uint64_t counter);
+
+#endif /* FREEBL_CHACHA20_H_ */
diff -r c3565a90b8c4 lib/freebl/chacha20/chacha20_vec.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/chacha20/chacha20_vec.c Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,281 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/* This implementation is by Ted Krovetz and was submitted to SUPERCOP and
+ * marked as public domain. It was been altered to allow for non-aligned inputs
+ * and to allow the block counter to be passed in specifically. */
+
+#include <string.h>
+
+#include "chacha20.h"
+
+#ifndef CHACHA_RNDS
+#define CHACHA_RNDS 20 /* 8 (high speed), 20 (conservative), 12 (middle) */
+#endif
+
+/* Architecture-neutral way to specify 16-byte vector of ints */
+typedef unsigned vec __attribute__ ((vector_size (16)));
+
+/* This implementation is designed for Neon, SSE and AltiVec machines. The
+ * following specify how to do certain vector operations efficiently on
+ * each architecture, using intrinsics.
+ * This implementation supports parallel processing of multiple blocks,
+ * including potentially using general-purpose registers.
+ */
+#if __ARM_NEON__
+#include <arm_neon.h>
+#define GPR_TOO 1
+#define VBPI 2
+#define ONE (vec)vsetq_lane_u32(1,vdupq_n_u32(0),0)
+#define LOAD(m) (vec)(*((vec*)(m)))
+#define STORE(m,r) (*((vec*)(m))) = (r)
+#define ROTV1(x) (vec)vextq_u32((uint32x4_t)x,(uint32x4_t)x,1)
+#define ROTV2(x) (vec)vextq_u32((uint32x4_t)x,(uint32x4_t)x,2)
+#define ROTV3(x) (vec)vextq_u32((uint32x4_t)x,(uint32x4_t)x,3)
+#define ROTW16(x) (vec)vrev32q_u16((uint16x8_t)x)
+#if __clang__
+#define ROTW7(x) (x << ((vec){ 7, 7, 7, 7})) ^ (x >> ((vec){25,25,25,25}))
+#define ROTW8(x) (x << ((vec){ 8, 8, 8, 8})) ^ (x >> ((vec){24,24,24,24}))
+#define ROTW12(x) (x << ((vec){12,12,12,12})) ^ (x >> ((vec){20,20,20,20}))
+#else
+#define ROTW7(x) (vec)vsriq_n_u32(vshlq_n_u32((uint32x4_t)x,7),(uint32x4_t)x,25)
+#define ROTW8(x) (vec)vsriq_n_u32(vshlq_n_u32((uint32x4_t)x,8),(uint32x4_t)x,24)
+#define ROTW12(x) (vec)vsriq_n_u32(vshlq_n_u32((uint32x4_t)x,12),(uint32x4_t)x,20)
+#endif
+#elif __SSE2__
+#include <emmintrin.h>
+#define GPR_TOO 0
+#if __clang__
+#define VBPI 4
+#else
+#define VBPI 3
+#endif
+#define ONE (vec)_mm_set_epi32(0,0,0,1)
+#define LOAD(m) (vec)_mm_loadu_si128((__m128i*)(m))
+#define STORE(m,r) _mm_storeu_si128((__m128i*)(m), (__m128i) (r))
+#define ROTV1(x) (vec)_mm_shuffle_epi32((__m128i)x,_MM_SHUFFLE(0,3,2,1))
+#define ROTV2(x) (vec)_mm_shuffle_epi32((__m128i)x,_MM_SHUFFLE(1,0,3,2))
+#define ROTV3(x) (vec)_mm_shuffle_epi32((__m128i)x,_MM_SHUFFLE(2,1,0,3))
+#define ROTW7(x) (vec)(_mm_slli_epi32((__m128i)x, 7) ^ _mm_srli_epi32((__m128i)x,25))
+#define ROTW12(x) (vec)(_mm_slli_epi32((__m128i)x,12) ^ _mm_srli_epi32((__m128i)x,20))
+#if __SSSE3__
+#include <tmmintrin.h>
+#define ROTW8(x) (vec)_mm_shuffle_epi8((__m128i)x,_mm_set_epi8(14,13,12,15,10,9,8,11,6,5,4,7,2,1,0,3))
+#define ROTW16(x) (vec)_mm_shuffle_epi8((__m128i)x,_mm_set_epi8(13,12,15,14,9,8,11,10,5,4,7,6,1,0,3,2))
+#else
+#define ROTW8(x) (vec)(_mm_slli_epi32((__m128i)x, 8) ^ _mm_srli_epi32((__m128i)x,24))
+#define ROTW16(x) (vec)(_mm_slli_epi32((__m128i)x,16) ^ _mm_srli_epi32((__m128i)x,16))
+#endif
+#else
+#error -- Implementation supports only machines with neon or SSE2
+#endif
+
+#ifndef REVV_BE
+#define REVV_BE(x) (x)
+#endif
+
+#ifndef REVW_BE
+#define REVW_BE(x) (x)
+#endif
+
+#define BPI (VBPI + GPR_TOO) /* Blocks computed per loop iteration */
+
+#define DQROUND_VECTORS(a,b,c,d) \
+ a += b; d ^= a; d = ROTW16(d); \
+ c += d; b ^= c; b = ROTW12(b); \
+ a += b; d ^= a; d = ROTW8(d); \
+ c += d; b ^= c; b = ROTW7(b); \
+ b = ROTV1(b); c = ROTV2(c); d = ROTV3(d); \
+ a += b; d ^= a; d = ROTW16(d); \
+ c += d; b ^= c; b = ROTW12(b); \
+ a += b; d ^= a; d = ROTW8(d); \
+ c += d; b ^= c; b = ROTW7(b); \
+ b = ROTV3(b); c = ROTV2(c); d = ROTV1(d);
+
+#define QROUND_WORDS(a,b,c,d) \
+ a = a+b; d ^= a; d = d<<16 | d>>16; \
+ c = c+d; b ^= c; b = b<<12 | b>>20; \
+ a = a+b; d ^= a; d = d<< 8 | d>>24; \
+ c = c+d; b ^= c; b = b<< 7 | b>>25;
+
+#define WRITE_XOR(in, op, d, v0, v1, v2, v3) \
+ STORE(op + d + 0, LOAD(in + d + 0) ^ REVV_BE(v0)); \
+ STORE(op + d + 4, LOAD(in + d + 4) ^ REVV_BE(v1)); \
+ STORE(op + d + 8, LOAD(in + d + 8) ^ REVV_BE(v2)); \
+ STORE(op + d +12, LOAD(in + d +12) ^ REVV_BE(v3));
+
+void ChaCha20XOR(
+ unsigned char *out,
+ const unsigned char *in,
+ unsigned int inlen,
+ const unsigned char key[32],
+ const unsigned char nonce[8],
+ uint64_t counter)
+{
+ unsigned iters, i, *op=(unsigned *)out, *ip=(unsigned *)in, *kp;
+#if defined(__ARM_NEON__)
+ unsigned *np;
+#endif
+ vec s0, s1, s2, s3;
+#if !defined(__ARM_NEON__) && !defined(__SSE2__)
+ __attribute__ ((aligned (16))) unsigned key[8], nonce[4];
+#endif
+ __attribute__ ((aligned (16))) unsigned chacha_const[] =
+ {0x61707865,0x3320646E,0x79622D32,0x6B206574};
+#if defined(__ARM_NEON__) || defined(__SSE2__)
+ kp = (unsigned *)key;
+#else
+ ((vec *)key)[0] = REVV_BE(((vec *)key)[0]);
+ ((vec *)key)[1] = REVV_BE(((vec *)key)[1]);
+ nonce[0] = REVW_BE(((unsigned *)nonce)[0]);
+ nonce[1] = REVW_BE(((unsigned *)nonce)[1]);
+ nonce[2] = REVW_BE(((unsigned *)nonce)[2]);
+ nonce[3] = REVW_BE(((unsigned *)nonce)[3]);
+ kp = (unsigned *)key;
+ np = (unsigned *)nonce;
+#endif
+#if defined(__ARM_NEON__)
+ np = (unsigned*) nonce;
+#endif
+ s0 = LOAD(chacha_const);
+ s1 = LOAD(&((vec*)kp)[0]);
+ s2 = LOAD(&((vec*)kp)[1]);
+ s3 = (vec) {
+ counter & 0xffffffff,
+ counter >> 32,
+ ((uint32_t*)nonce)[0],
+ ((uint32_t*)nonce)[1]
+ };
+
+ for (iters = 0; iters < inlen/(BPI*64); iters++) {
+#if GPR_TOO
+ register unsigned x0, x1, x2, x3, x4, x5, x6, x7, x8,
+ x9, x10, x11, x12, x13, x14, x15;
+#endif
+#if VBPI > 2
+ vec v8,v9,v10,v11;
+#endif
+#if VBPI > 3
+ vec v12,v13,v14,v15;
+#endif
+
+ vec v0,v1,v2,v3,v4,v5,v6,v7;
+ v4 = v0 = s0; v5 = v1 = s1; v6 = v2 = s2; v3 = s3;
+ v7 = v3 + ONE;
+#if VBPI > 2
+ v8 = v4; v9 = v5; v10 = v6;
+ v11 = v7 + ONE;
+#endif
+#if VBPI > 3
+ v12 = v8; v13 = v9; v14 = v10;
+ v15 = v11 + ONE;
+#endif
+#if GPR_TOO
+ x0 = chacha_const[0]; x1 = chacha_const[1];
+ x2 = chacha_const[2]; x3 = chacha_const[3];
+ x4 = kp[0]; x5 = kp[1]; x6 = kp[2]; x7 = kp[3];
+ x8 = kp[4]; x9 = kp[5]; x10 = kp[6]; x11 = kp[7];
+ x12 = (counter & 0xffffffff)+BPI*iters+(BPI-1); x13 = counter >> 32;
+ x14 = np[0]; x15 = np[1];
+#endif
+ for (i = CHACHA_RNDS/2; i; i--) {
+ DQROUND_VECTORS(v0,v1,v2,v3)
+ DQROUND_VECTORS(v4,v5,v6,v7)
+#if VBPI > 2
+ DQROUND_VECTORS(v8,v9,v10,v11)
+#endif
+#if VBPI > 3
+ DQROUND_VECTORS(v12,v13,v14,v15)
+#endif
+#if GPR_TOO
+ QROUND_WORDS( x0, x4, x8,x12)
+ QROUND_WORDS( x1, x5, x9,x13)
+ QROUND_WORDS( x2, x6,x10,x14)
+ QROUND_WORDS( x3, x7,x11,x15)
+ QROUND_WORDS( x0, x5,x10,x15)
+ QROUND_WORDS( x1, x6,x11,x12)
+ QROUND_WORDS( x2, x7, x8,x13)
+ QROUND_WORDS( x3, x4, x9,x14)
+#endif
+ }
+
+ WRITE_XOR(ip, op, 0, v0+s0, v1+s1, v2+s2, v3+s3)
+ s3 += ONE;
+ WRITE_XOR(ip, op, 16, v4+s0, v5+s1, v6+s2, v7+s3)
+ s3 += ONE;
+#if VBPI > 2
+ WRITE_XOR(ip, op, 32, v8+s0, v9+s1, v10+s2, v11+s3)
+ s3 += ONE;
+#endif
+#if VBPI > 3
+ WRITE_XOR(ip, op, 48, v12+s0, v13+s1, v14+s2, v15+s3)
+ s3 += ONE;
+#endif
+ ip += VBPI*16;
+ op += VBPI*16;
+#if GPR_TOO
+ op[0] = REVW_BE(REVW_BE(ip[0]) ^ (x0 + chacha_const[0]));
+ op[1] = REVW_BE(REVW_BE(ip[1]) ^ (x1 + chacha_const[1]));
+ op[2] = REVW_BE(REVW_BE(ip[2]) ^ (x2 + chacha_const[2]));
+ op[3] = REVW_BE(REVW_BE(ip[3]) ^ (x3 + chacha_const[3]));
+ op[4] = REVW_BE(REVW_BE(ip[4]) ^ (x4 + kp[0]));
+ op[5] = REVW_BE(REVW_BE(ip[5]) ^ (x5 + kp[1]));
+ op[6] = REVW_BE(REVW_BE(ip[6]) ^ (x6 + kp[2]));
+ op[7] = REVW_BE(REVW_BE(ip[7]) ^ (x7 + kp[3]));
+ op[8] = REVW_BE(REVW_BE(ip[8]) ^ (x8 + kp[4]));
+ op[9] = REVW_BE(REVW_BE(ip[9]) ^ (x9 + kp[5]));
+ op[10] = REVW_BE(REVW_BE(ip[10]) ^ (x10 + kp[6]));
+ op[11] = REVW_BE(REVW_BE(ip[11]) ^ (x11 + kp[7]));
+ op[12] = REVW_BE(REVW_BE(ip[12]) ^ (x12 + (counter & 0xffffffff)+BPI*iters+(BPI-1)));
+ op[13] = REVW_BE(REVW_BE(ip[13]) ^ (x13 + (counter >> 32)));
+ op[14] = REVW_BE(REVW_BE(ip[14]) ^ (x14 + np[0]));
+ op[15] = REVW_BE(REVW_BE(ip[15]) ^ (x15 + np[1]));
+ s3 += ONE;
+ ip += 16;
+ op += 16;
+#endif
+ }
+
+ for (iters = inlen%(BPI*64)/64; iters != 0; iters--) {
+ vec v0 = s0, v1 = s1, v2 = s2, v3 = s3;
+ for (i = CHACHA_RNDS/2; i; i--) {
+ DQROUND_VECTORS(v0,v1,v2,v3);
+ }
+ WRITE_XOR(ip, op, 0, v0+s0, v1+s1, v2+s2, v3+s3)
+ s3 += ONE;
+ ip += 16;
+ op += 16;
+ }
+
+ inlen = inlen % 64;
+ if (inlen) {
+ __attribute__ ((aligned (16))) vec buf[4];
+ vec v0,v1,v2,v3;
+ v0 = s0; v1 = s1; v2 = s2; v3 = s3;
+ for (i = CHACHA_RNDS/2; i; i--) {
+ DQROUND_VECTORS(v0,v1,v2,v3);
+ }
+
+ if (inlen >= 16) {
+ STORE(op + 0, LOAD(ip + 0) ^ REVV_BE(v0 + s0));
+ if (inlen >= 32) {
+ STORE(op + 4, LOAD(ip + 4) ^ REVV_BE(v1 + s1));
+ if (inlen >= 48) {
+ STORE(op + 8, LOAD(ip + 8) ^ REVV_BE(v2 + s2));
+ buf[3] = REVV_BE(v3 + s3);
+ } else {
+ buf[2] = REVV_BE(v2 + s2);
+ }
+ } else {
+ buf[1] = REVV_BE(v1 + s1);
+ }
+ } else {
+ buf[0] = REVV_BE(v0 + s0);
+ }
+
+ for (i=inlen & ~15; i<inlen; i++) {
+ ((char *)op)[i] = ((char *)ip)[i] ^ ((char *)buf)[i];
+ }
+ }
+}
diff -r c3565a90b8c4 lib/freebl/chacha20poly1305.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/chacha20poly1305.c Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,169 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+#ifdef FREEBL_NO_DEPEND
+#include "stubs.h"
+#endif
+
+#include <string.h>
+#include <stdio.h>
+
+#include "seccomon.h"
+#include "secerr.h"
+#include "blapit.h"
+#include "poly1305/poly1305.h"
+#include "chacha20/chacha20.h"
+#include "chacha20poly1305.h"
+
+/* Poly1305Do writes the Poly1305 authenticator of the given additional data
+ * and ciphertext to |out|. */
+static void
+Poly1305Do(unsigned char *out,
+ const unsigned char *ad, unsigned int adLen,
+ const unsigned char *ciphertext, unsigned int ciphertextLen,
+ const unsigned char key[32])
+{
+ poly1305_state state;
+ unsigned int j;
+ unsigned char lengthBytes[8];
+ unsigned int i;
+
+ Poly1305Init(&state, key);
+ j = adLen;
+ for (i = 0; i < sizeof(lengthBytes); i++) {
+ lengthBytes[i] = j;
+ j >>= 8;
+ }
+ Poly1305Update(&state, ad, adLen);
+ Poly1305Update(&state, lengthBytes, sizeof(lengthBytes));
+ j = ciphertextLen;
+ for (i = 0; i < sizeof(lengthBytes); i++) {
+ lengthBytes[i] = j;
+ j >>= 8;
+ }
+ Poly1305Update(&state, ciphertext, ciphertextLen);
+ Poly1305Update(&state, lengthBytes, sizeof(lengthBytes));
+ Poly1305Finish(&state, out);
+}
+
+SECStatus
+ChaCha20Poly1305_InitContext(ChaCha20Poly1305Context *ctx,
+ const unsigned char *key, unsigned int keyLen,
+ unsigned int tagLen)
+{
+ if (keyLen != 32) {
+ PORT_SetError(SEC_ERROR_BAD_KEY);
+ return SECFailure;
+ }
+ if (tagLen == 0 || tagLen > 16) {
+ PORT_SetError(SEC_ERROR_INPUT_LEN);
+ return SECFailure;
+ }
+
+ memcpy(ctx->key, key, sizeof(ctx->key));
+ ctx->tagLen = tagLen;
+
+ return SECSuccess;
+}
+
+ChaCha20Poly1305Context *
+ChaCha20Poly1305_CreateContext(const unsigned char *key, unsigned int keyLen,
+ unsigned int tagLen)
+{
+ ChaCha20Poly1305Context *ctx;
+
+ ctx = PORT_New(ChaCha20Poly1305Context);
+ if (ctx == NULL) {
+ return NULL;
+ }
+
+ if (ChaCha20Poly1305_InitContext(ctx, key, keyLen, tagLen) != SECSuccess) {
+ PORT_Free(ctx);
+ ctx = NULL;
+ }
+
+ return ctx;
+}
+
+void
+ChaCha20Poly1305_DestroyContext(ChaCha20Poly1305Context *ctx, PRBool freeit)
+{
+ memset(ctx, 0, sizeof(*ctx));
+ if (freeit) {
+ PORT_Free(ctx);
+ }
+}
+
+SECStatus
+ChaCha20Poly1305_Seal(const ChaCha20Poly1305Context *ctx,
+ unsigned char *output, unsigned int *outputLen,
+ unsigned int maxOutputLen,
+ const unsigned char *input, unsigned int inputLen,
+ const unsigned char *nonce, unsigned int nonceLen,
+ const unsigned char *ad, unsigned int adLen)
+{
+ unsigned char block[64];
+ unsigned char tag[16];
+
+ if (nonceLen != 8) {
+ PORT_SetError(SEC_ERROR_INPUT_LEN);
+ return SECFailure;
+ }
+ *outputLen = inputLen + ctx->tagLen;
+ if (maxOutputLen < *outputLen) {
+ PORT_SetError(SEC_ERROR_OUTPUT_LEN);
+ return SECFailure;
+ }
+
+ memset(block, 0, sizeof(block));
+ // Generate a block of keystream. The first 32 bytes will be the poly1305
+ // key. The remainder of the block is discarded.
+ ChaCha20XOR(block, block, sizeof(block), ctx->key, nonce, 0);
+ ChaCha20XOR(output, input, inputLen, ctx->key, nonce, 1);
+
+ Poly1305Do(tag, ad, adLen, output, inputLen, block);
+ memcpy(output + inputLen, tag, ctx->tagLen);
+
+ return SECSuccess;
+}
+
+SECStatus
+ChaCha20Poly1305_Open(const ChaCha20Poly1305Context *ctx,
+ unsigned char *output, unsigned int *outputLen,
+ unsigned int maxOutputLen,
+ const unsigned char *input, unsigned int inputLen,
+ const unsigned char *nonce, unsigned int nonceLen,
+ const unsigned char *ad, unsigned int adLen)
+{
+ unsigned char block[64];
+ unsigned char tag[16];
+
+ if (nonceLen != 8) {
+ PORT_SetError(SEC_ERROR_INPUT_LEN);
+ return SECFailure;
+ }
+ if (inputLen < ctx->tagLen) {
+ PORT_SetError(SEC_ERROR_INPUT_LEN);
+ return SECFailure;
+ }
+ *outputLen = inputLen - ctx->tagLen;
+ if (maxOutputLen < *outputLen) {
+ PORT_SetError(SEC_ERROR_OUTPUT_LEN);
+ return SECFailure;
+ }
+
+ memset(block, 0, sizeof(block));
+ // Generate a block of keystream. The first 32 bytes will be the poly1305
+ // key. The remainder of the block is discarded.
+ ChaCha20XOR(block, block, sizeof(block), ctx->key, nonce, 0);
+ Poly1305Do(tag, ad, adLen, input, inputLen - ctx->tagLen, block);
+ if (NSS_SecureMemcmp(tag, &input[inputLen - ctx->tagLen], ctx->tagLen) != 0) {
+ PORT_SetError(SEC_ERROR_BAD_DATA);
+ return SECFailure;
+ }
+
+ ChaCha20XOR(output, input, inputLen - ctx->tagLen, ctx->key, nonce, 1);
+
+ return SECSuccess;
+}
diff -r c3565a90b8c4 lib/freebl/chacha20poly1305.h
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/chacha20poly1305.h Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,15 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+#ifndef _CHACHA20_POLY1305_H_
+#define _CHACHA20_POLY1305_H_ 1
+
+/* ChaCha20Poly1305ContextStr saves the key and tag length for a
+ * ChaCha20+Poly1305 AEAD operation. */
+struct ChaCha20Poly1305ContextStr {
+ unsigned char key[32];
+ unsigned char tagLen;
+};
+
+#endif /* _CHACHA20_POLY1305_H_ */
diff -r c3565a90b8c4 lib/freebl/poly1305/poly1305-donna-x64-sse2-incremental-source.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/poly1305/poly1305-donna-x64-sse2-incremental-source.c Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,623 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/* This implementation of poly1305 is by Andrew Moon
+ * (https://github.com/floodyberry/poly1305-donna) and released as public
+ * domain. It implements SIMD vectorization based on the algorithm described in
+ * http://cr.yp.to/papers.html#neoncrypto. Unrolled to 2 powers, i.e. 64 byte
+ * block size. */
+
+#include <emmintrin.h>
+#include <stdint.h>
+
+#include "poly1305.h"
+
+#define ALIGN(x) __attribute__((aligned(x)))
+#define INLINE inline
+#define U8TO64_LE(m) (*(uint64_t*)(m))
+#define U8TO32_LE(m) (*(uint32_t*)(m))
+#define U64TO8_LE(m,v) (*(uint64_t*)(m)) = v
+
+typedef __m128i xmmi;
+typedef unsigned __int128 uint128_t;
+
+static const uint32_t ALIGN(16) poly1305_x64_sse2_message_mask[4] = {(1 << 26) - 1, 0, (1 << 26) - 1, 0};
+static const uint32_t ALIGN(16) poly1305_x64_sse2_5[4] = {5, 0, 5, 0};
+static const uint32_t ALIGN(16) poly1305_x64_sse2_1shl128[4] = {(1 << 24), 0, (1 << 24), 0};
+
+static uint128_t INLINE
+add128(uint128_t a, uint128_t b) {
+ return a + b;
+}
+
+static uint128_t INLINE
+add128_64(uint128_t a, uint64_t b) {
+ return a + b;
+}
+
+static uint128_t INLINE
+mul64x64_128(uint64_t a, uint64_t b) {
+ return (uint128_t)a * b;
+}
+
+static uint64_t INLINE
+lo128(uint128_t a) {
+ return (uint64_t)a;
+}
+
+static uint64_t INLINE
+shr128(uint128_t v, const int shift) {
+ return (uint64_t)(v >> shift);
+}
+
+static uint64_t INLINE
+shr128_pair(uint64_t hi, uint64_t lo, const int shift) {
+ return (uint64_t)((((uint128_t)hi << 64) | lo) >> shift);
+}
+
+typedef struct poly1305_power_t {
+ union {
+ xmmi v;
+ uint64_t u[2];
+ uint32_t d[4];
+ } R20,R21,R22,R23,R24,S21,S22,S23,S24;
+} poly1305_power;
+
+typedef struct poly1305_state_internal_t {
+ poly1305_power P[2]; /* 288 bytes, top 32 bit halves unused = 144 bytes of free storage */
+ union {
+ xmmi H[5]; /* 80 bytes */
+ uint64_t HH[10];
+ };
+ /* uint64_t r0,r1,r2; [24 bytes] */
+ /* uint64_t pad0,pad1; [16 bytes] */
+ uint64_t started; /* 8 bytes */
+ uint64_t leftover; /* 8 bytes */
+ uint8_t buffer[64]; /* 64 bytes */
+} poly1305_state_internal; /* 448 bytes total + 63 bytes for alignment = 511 bytes raw */
+
+static poly1305_state_internal INLINE
+*poly1305_aligned_state(poly1305_state *state) {
+ return (poly1305_state_internal *)(((uint64_t)state + 63) & ~63);
+}
+
+/* copy 0-63 bytes */
+static void INLINE
+poly1305_block_copy(uint8_t *dst, const uint8_t *src, size_t bytes) {
+ size_t offset = src - dst;
+ if (bytes & 32) {
+ _mm_storeu_si128((xmmi *)(dst + 0), _mm_loadu_si128((xmmi *)(dst + offset + 0)));
+ _mm_storeu_si128((xmmi *)(dst + 16), _mm_loadu_si128((xmmi *)(dst + offset + 16)));
+ dst += 32;
+ }
+ if (bytes & 16) { _mm_storeu_si128((xmmi *)dst, _mm_loadu_si128((xmmi *)(dst + offset))); dst += 16; }
+ if (bytes & 8) { *(uint64_t *)dst = *(uint64_t *)(dst + offset); dst += 8; }
+ if (bytes & 4) { *(uint32_t *)dst = *(uint32_t *)(dst + offset); dst += 4; }
+ if (bytes & 2) { *(uint16_t *)dst = *(uint16_t *)(dst + offset); dst += 2; }
+ if (bytes & 1) { *( uint8_t *)dst = *( uint8_t *)(dst + offset); }
+}
+
+/* zero 0-15 bytes */
+static void INLINE
+poly1305_block_zero(uint8_t *dst, size_t bytes) {
+ if (bytes & 8) { *(uint64_t *)dst = 0; dst += 8; }
+ if (bytes & 4) { *(uint32_t *)dst = 0; dst += 4; }
+ if (bytes & 2) { *(uint16_t *)dst = 0; dst += 2; }
+ if (bytes & 1) { *( uint8_t *)dst = 0; }
+}
+
+static size_t INLINE
+poly1305_min(size_t a, size_t b) {
+ return (a < b) ? a : b;
+}
+
+void
+Poly1305Init(poly1305_state *state, const unsigned char key[32]) {
+ poly1305_state_internal *st = poly1305_aligned_state(state);
+ poly1305_power *p;
+ uint64_t r0,r1,r2;
+ uint64_t t0,t1;
+
+ /* clamp key */
+ t0 = U8TO64_LE(key + 0);
+ t1 = U8TO64_LE(key + 8);
+ r0 = t0 & 0xffc0fffffff; t0 >>= 44; t0 |= t1 << 20;
+ r1 = t0 & 0xfffffc0ffff; t1 >>= 24;
+ r2 = t1 & 0x00ffffffc0f;
+
+ /* store r in un-used space of st->P[1] */
+ p = &st->P[1];
+ p->R20.d[1] = (uint32_t)(r0 );
+ p->R20.d[3] = (uint32_t)(r0 >> 32);
+ p->R21.d[1] = (uint32_t)(r1 );
+ p->R21.d[3] = (uint32_t)(r1 >> 32);
+ p->R22.d[1] = (uint32_t)(r2 );
+ p->R22.d[3] = (uint32_t)(r2 >> 32);
+
+ /* store pad */
+ p->R23.d[1] = U8TO32_LE(key + 16);
+ p->R23.d[3] = U8TO32_LE(key + 20);
+ p->R24.d[1] = U8TO32_LE(key + 24);
+ p->R24.d[3] = U8TO32_LE(key + 28);
+
+ /* H = 0 */
+ st->H[0] = _mm_setzero_si128();
+ st->H[1] = _mm_setzero_si128();
+ st->H[2] = _mm_setzero_si128();
+ st->H[3] = _mm_setzero_si128();
+ st->H[4] = _mm_setzero_si128();
+
+ st->started = 0;
+ st->leftover = 0;
+}
+
+static void
+poly1305_first_block(poly1305_state_internal *st, const uint8_t *m) {
+ const xmmi MMASK = _mm_load_si128((xmmi *)poly1305_x64_sse2_message_mask);
+ const xmmi FIVE = _mm_load_si128((xmmi*)poly1305_x64_sse2_5);
+ const xmmi HIBIT = _mm_load_si128((xmmi*)poly1305_x64_sse2_1shl128);
+ xmmi T5,T6;
+ poly1305_power *p;
+ uint128_t d[3];
+ uint64_t r0,r1,r2;
+ uint64_t r20,r21,r22,s22;
+ uint64_t pad0,pad1;
+ uint64_t c;
+ uint64_t i;
+
+ /* pull out stored info */
+ p = &st->P[1];
+
+ r0 = ((uint64_t)p->R20.d[3] << 32) | (uint64_t)p->R20.d[1];
+ r1 = ((uint64_t)p->R21.d[3] << 32) | (uint64_t)p->R21.d[1];
+ r2 = ((uint64_t)p->R22.d[3] << 32) | (uint64_t)p->R22.d[1];
+ pad0 = ((uint64_t)p->R23.d[3] << 32) | (uint64_t)p->R23.d[1];
+ pad1 = ((uint64_t)p->R24.d[3] << 32) | (uint64_t)p->R24.d[1];
+
+ /* compute powers r^2,r^4 */
+ r20 = r0;
+ r21 = r1;
+ r22 = r2;
+ for (i = 0; i < 2; i++) {
+ s22 = r22 * (5 << 2);
+
+ d[0] = add128(mul64x64_128(r20, r20), mul64x64_128(r21 * 2, s22));
+ d[1] = add128(mul64x64_128(r22, s22), mul64x64_128(r20 * 2, r21));
+ d[2] = add128(mul64x64_128(r21, r21), mul64x64_128(r22 * 2, r20));
+
+ r20 = lo128(d[0]) & 0xfffffffffff; c = shr128(d[0], 44);
+ d[1] = add128_64(d[1], c); r21 = lo128(d[1]) & 0xfffffffffff; c = shr128(d[1], 44);
+ d[2] = add128_64(d[2], c); r22 = lo128(d[2]) & 0x3ffffffffff; c = shr128(d[2], 42);
+ r20 += c * 5; c = (r20 >> 44); r20 = r20 & 0xfffffffffff;
+ r21 += c;
+
+ p->R20.v = _mm_shuffle_epi32(_mm_cvtsi32_si128((uint32_t)( r20 ) & 0x3ffffff), _MM_SHUFFLE(1,0,1,0));
+ p->R21.v = _mm_shuffle_epi32(_mm_cvtsi32_si128((uint32_t)((r20 >> 26) | (r21 << 18)) & 0x3ffffff), _MM_SHUFFLE(1,0,1,0));
+ p->R22.v = _mm_shuffle_epi32(_mm_cvtsi32_si128((uint32_t)((r21 >> 8) ) & 0x3ffffff), _MM_SHUFFLE(1,0,1,0));
+ p->R23.v = _mm_shuffle_epi32(_mm_cvtsi32_si128((uint32_t)((r21 >> 34) | (r22 << 10)) & 0x3ffffff), _MM_SHUFFLE(1,0,1,0));
+ p->R24.v = _mm_shuffle_epi32(_mm_cvtsi32_si128((uint32_t)((r22 >> 16) ) ), _MM_SHUFFLE(1,0,1,0));
+ p->S21.v = _mm_mul_epu32(p->R21.v, FIVE);
+ p->S22.v = _mm_mul_epu32(p->R22.v, FIVE);
+ p->S23.v = _mm_mul_epu32(p->R23.v, FIVE);
+ p->S24.v = _mm_mul_epu32(p->R24.v, FIVE);
+ p--;
+ }
+
+ /* put saved info back */
+ p = &st->P[1];
+ p->R20.d[1] = (uint32_t)(r0 );
+ p->R20.d[3] = (uint32_t)(r0 >> 32);
+ p->R21.d[1] = (uint32_t)(r1 );
+ p->R21.d[3] = (uint32_t)(r1 >> 32);
+ p->R22.d[1] = (uint32_t)(r2 );
+ p->R22.d[3] = (uint32_t)(r2 >> 32);
+ p->R23.d[1] = (uint32_t)(pad0 );
+ p->R23.d[3] = (uint32_t)(pad0 >> 32);
+ p->R24.d[1] = (uint32_t)(pad1 );
+ p->R24.d[3] = (uint32_t)(pad1 >> 32);
+
+ /* H = [Mx,My] */
+ T5 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 0)), _mm_loadl_epi64((xmmi *)(m + 16)));
+ T6 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 8)), _mm_loadl_epi64((xmmi *)(m + 24)));
+ st->H[0] = _mm_and_si128(MMASK, T5);
+ st->H[1] = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ T5 = _mm_or_si128(_mm_srli_epi64(T5, 52), _mm_slli_epi64(T6, 12));
+ st->H[2] = _mm_and_si128(MMASK, T5);
+ st->H[3] = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ st->H[4] = _mm_or_si128(_mm_srli_epi64(T6, 40), HIBIT);
+}
+
+static void
+poly1305_blocks(poly1305_state_internal *st, const uint8_t *m, size_t bytes) {
+ const xmmi MMASK = _mm_load_si128((xmmi *)poly1305_x64_sse2_message_mask);
+ const xmmi FIVE = _mm_load_si128((xmmi*)poly1305_x64_sse2_5);
+ const xmmi HIBIT = _mm_load_si128((xmmi*)poly1305_x64_sse2_1shl128);
+
+ poly1305_power *p;
+ xmmi H0,H1,H2,H3,H4;
+ xmmi T0,T1,T2,T3,T4,T5,T6;
+ xmmi M0,M1,M2,M3,M4;
+ xmmi C1,C2;
+
+ H0 = st->H[0];
+ H1 = st->H[1];
+ H2 = st->H[2];
+ H3 = st->H[3];
+ H4 = st->H[4];
+
+ while (bytes >= 64) {
+ /* H *= [r^4,r^4] */
+ p = &st->P[0];
+ T0 = _mm_mul_epu32(H0, p->R20.v);
+ T1 = _mm_mul_epu32(H0, p->R21.v);
+ T2 = _mm_mul_epu32(H0, p->R22.v);
+ T3 = _mm_mul_epu32(H0, p->R23.v);
+ T4 = _mm_mul_epu32(H0, p->R24.v);
+ T5 = _mm_mul_epu32(H1, p->S24.v); T6 = _mm_mul_epu32(H1, p->R20.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H2, p->S23.v); T6 = _mm_mul_epu32(H2, p->S24.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H3, p->S22.v); T6 = _mm_mul_epu32(H3, p->S23.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H4, p->S21.v); T6 = _mm_mul_epu32(H4, p->S22.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H1, p->R21.v); T6 = _mm_mul_epu32(H1, p->R22.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H2, p->R20.v); T6 = _mm_mul_epu32(H2, p->R21.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H3, p->S24.v); T6 = _mm_mul_epu32(H3, p->R20.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H4, p->S23.v); T6 = _mm_mul_epu32(H4, p->S24.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H1, p->R23.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H2, p->R22.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H3, p->R21.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H4, p->R20.v); T4 = _mm_add_epi64(T4, T5);
+
+ /* H += [Mx,My]*[r^2,r^2] */
+ T5 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 0)), _mm_loadl_epi64((xmmi *)(m + 16)));
+ T6 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 8)), _mm_loadl_epi64((xmmi *)(m + 24)));
+ M0 = _mm_and_si128(MMASK, T5);
+ M1 = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ T5 = _mm_or_si128(_mm_srli_epi64(T5, 52), _mm_slli_epi64(T6, 12));
+ M2 = _mm_and_si128(MMASK, T5);
+ M3 = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ M4 = _mm_or_si128(_mm_srli_epi64(T6, 40), HIBIT);
+
+ p = &st->P[1];
+ T5 = _mm_mul_epu32(M0, p->R20.v); T6 = _mm_mul_epu32(M0, p->R21.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(M1, p->S24.v); T6 = _mm_mul_epu32(M1, p->R20.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(M2, p->S23.v); T6 = _mm_mul_epu32(M2, p->S24.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(M3, p->S22.v); T6 = _mm_mul_epu32(M3, p->S23.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(M4, p->S21.v); T6 = _mm_mul_epu32(M4, p->S22.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(M0, p->R22.v); T6 = _mm_mul_epu32(M0, p->R23.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(M1, p->R21.v); T6 = _mm_mul_epu32(M1, p->R22.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(M2, p->R20.v); T6 = _mm_mul_epu32(M2, p->R21.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(M3, p->S24.v); T6 = _mm_mul_epu32(M3, p->R20.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(M4, p->S23.v); T6 = _mm_mul_epu32(M4, p->S24.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(M0, p->R24.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(M1, p->R23.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(M2, p->R22.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(M3, p->R21.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(M4, p->R20.v); T4 = _mm_add_epi64(T4, T5);
+
+ /* H += [Mx,My] */
+ T5 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 32)), _mm_loadl_epi64((xmmi *)(m + 48)));
+ T6 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 40)), _mm_loadl_epi64((xmmi *)(m + 56)));
+ M0 = _mm_and_si128(MMASK, T5);
+ M1 = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ T5 = _mm_or_si128(_mm_srli_epi64(T5, 52), _mm_slli_epi64(T6, 12));
+ M2 = _mm_and_si128(MMASK, T5);
+ M3 = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ M4 = _mm_or_si128(_mm_srli_epi64(T6, 40), HIBIT);
+
+ T0 = _mm_add_epi64(T0, M0);
+ T1 = _mm_add_epi64(T1, M1);
+ T2 = _mm_add_epi64(T2, M2);
+ T3 = _mm_add_epi64(T3, M3);
+ T4 = _mm_add_epi64(T4, M4);
+
+ /* reduce */
+ C1 = _mm_srli_epi64(T0, 26); C2 = _mm_srli_epi64(T3, 26); T0 = _mm_and_si128(T0, MMASK); T3 = _mm_and_si128(T3, MMASK); T1 = _mm_add_epi64(T1, C1); T4 = _mm_add_epi64(T4, C2);
+ C1 = _mm_srli_epi64(T1, 26); C2 = _mm_srli_epi64(T4, 26); T1 = _mm_and_si128(T1, MMASK); T4 = _mm_and_si128(T4, MMASK); T2 = _mm_add_epi64(T2, C1); T0 = _mm_add_epi64(T0, _mm_mul_epu32(C2, FIVE));
+ C1 = _mm_srli_epi64(T2, 26); C2 = _mm_srli_epi64(T0, 26); T2 = _mm_and_si128(T2, MMASK); T0 = _mm_and_si128(T0, MMASK); T3 = _mm_add_epi64(T3, C1); T1 = _mm_add_epi64(T1, C2);
+ C1 = _mm_srli_epi64(T3, 26); T3 = _mm_and_si128(T3, MMASK); T4 = _mm_add_epi64(T4, C1);
+
+ /* H = (H*[r^4,r^4] + [Mx,My]*[r^2,r^2] + [Mx,My]) */
+ H0 = T0;
+ H1 = T1;
+ H2 = T2;
+ H3 = T3;
+ H4 = T4;
+
+ m += 64;
+ bytes -= 64;
+ }
+
+ st->H[0] = H0;
+ st->H[1] = H1;
+ st->H[2] = H2;
+ st->H[3] = H3;
+ st->H[4] = H4;
+}
+
+static size_t
+poly1305_combine(poly1305_state_internal *st, const uint8_t *m, size_t bytes) {
+ const xmmi MMASK = _mm_load_si128((xmmi *)poly1305_x64_sse2_message_mask);
+ const xmmi HIBIT = _mm_load_si128((xmmi*)poly1305_x64_sse2_1shl128);
+ const xmmi FIVE = _mm_load_si128((xmmi*)poly1305_x64_sse2_5);
+
+ poly1305_power *p;
+ xmmi H0,H1,H2,H3,H4;
+ xmmi M0,M1,M2,M3,M4;
+ xmmi T0,T1,T2,T3,T4,T5,T6;
+ xmmi C1,C2;
+
+ uint64_t r0,r1,r2;
+ uint64_t t0,t1,t2,t3,t4;
+ uint64_t c;
+ size_t consumed = 0;
+
+ H0 = st->H[0];
+ H1 = st->H[1];
+ H2 = st->H[2];
+ H3 = st->H[3];
+ H4 = st->H[4];
+
+ /* p = [r^2,r^2] */
+ p = &st->P[1];
+
+ if (bytes >= 32) {
+ /* H *= [r^2,r^2] */
+ T0 = _mm_mul_epu32(H0, p->R20.v);
+ T1 = _mm_mul_epu32(H0, p->R21.v);
+ T2 = _mm_mul_epu32(H0, p->R22.v);
+ T3 = _mm_mul_epu32(H0, p->R23.v);
+ T4 = _mm_mul_epu32(H0, p->R24.v);
+ T5 = _mm_mul_epu32(H1, p->S24.v); T6 = _mm_mul_epu32(H1, p->R20.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H2, p->S23.v); T6 = _mm_mul_epu32(H2, p->S24.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H3, p->S22.v); T6 = _mm_mul_epu32(H3, p->S23.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H4, p->S21.v); T6 = _mm_mul_epu32(H4, p->S22.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H1, p->R21.v); T6 = _mm_mul_epu32(H1, p->R22.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H2, p->R20.v); T6 = _mm_mul_epu32(H2, p->R21.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H3, p->S24.v); T6 = _mm_mul_epu32(H3, p->R20.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H4, p->S23.v); T6 = _mm_mul_epu32(H4, p->S24.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H1, p->R23.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H2, p->R22.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H3, p->R21.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H4, p->R20.v); T4 = _mm_add_epi64(T4, T5);
+
+ /* H += [Mx,My] */
+ T5 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 0)), _mm_loadl_epi64((xmmi *)(m + 16)));
+ T6 = _mm_unpacklo_epi64(_mm_loadl_epi64((xmmi *)(m + 8)), _mm_loadl_epi64((xmmi *)(m + 24)));
+ M0 = _mm_and_si128(MMASK, T5);
+ M1 = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ T5 = _mm_or_si128(_mm_srli_epi64(T5, 52), _mm_slli_epi64(T6, 12));
+ M2 = _mm_and_si128(MMASK, T5);
+ M3 = _mm_and_si128(MMASK, _mm_srli_epi64(T5, 26));
+ M4 = _mm_or_si128(_mm_srli_epi64(T6, 40), HIBIT);
+
+ T0 = _mm_add_epi64(T0, M0);
+ T1 = _mm_add_epi64(T1, M1);
+ T2 = _mm_add_epi64(T2, M2);
+ T3 = _mm_add_epi64(T3, M3);
+ T4 = _mm_add_epi64(T4, M4);
+
+ /* reduce */
+ C1 = _mm_srli_epi64(T0, 26); C2 = _mm_srli_epi64(T3, 26); T0 = _mm_and_si128(T0, MMASK); T3 = _mm_and_si128(T3, MMASK); T1 = _mm_add_epi64(T1, C1); T4 = _mm_add_epi64(T4, C2);
+ C1 = _mm_srli_epi64(T1, 26); C2 = _mm_srli_epi64(T4, 26); T1 = _mm_and_si128(T1, MMASK); T4 = _mm_and_si128(T4, MMASK); T2 = _mm_add_epi64(T2, C1); T0 = _mm_add_epi64(T0, _mm_mul_epu32(C2, FIVE));
+ C1 = _mm_srli_epi64(T2, 26); C2 = _mm_srli_epi64(T0, 26); T2 = _mm_and_si128(T2, MMASK); T0 = _mm_and_si128(T0, MMASK); T3 = _mm_add_epi64(T3, C1); T1 = _mm_add_epi64(T1, C2);
+ C1 = _mm_srli_epi64(T3, 26); T3 = _mm_and_si128(T3, MMASK); T4 = _mm_add_epi64(T4, C1);
+
+ /* H = (H*[r^2,r^2] + [Mx,My]) */
+ H0 = T0;
+ H1 = T1;
+ H2 = T2;
+ H3 = T3;
+ H4 = T4;
+
+ consumed = 32;
+ }
+
+ /* finalize, H *= [r^2,r] */
+ r0 = ((uint64_t)p->R20.d[3] << 32) | (uint64_t)p->R20.d[1];
+ r1 = ((uint64_t)p->R21.d[3] << 32) | (uint64_t)p->R21.d[1];
+ r2 = ((uint64_t)p->R22.d[3] << 32) | (uint64_t)p->R22.d[1];
+
+ p->R20.d[2] = (uint32_t)( r0 ) & 0x3ffffff;
+ p->R21.d[2] = (uint32_t)((r0 >> 26) | (r1 << 18)) & 0x3ffffff;
+ p->R22.d[2] = (uint32_t)((r1 >> 8) ) & 0x3ffffff;
+ p->R23.d[2] = (uint32_t)((r1 >> 34) | (r2 << 10)) & 0x3ffffff;
+ p->R24.d[2] = (uint32_t)((r2 >> 16) ) ;
+ p->S21.d[2] = p->R21.d[2] * 5;
+ p->S22.d[2] = p->R22.d[2] * 5;
+ p->S23.d[2] = p->R23.d[2] * 5;
+ p->S24.d[2] = p->R24.d[2] * 5;
+
+ /* H *= [r^2,r] */
+ T0 = _mm_mul_epu32(H0, p->R20.v);
+ T1 = _mm_mul_epu32(H0, p->R21.v);
+ T2 = _mm_mul_epu32(H0, p->R22.v);
+ T3 = _mm_mul_epu32(H0, p->R23.v);
+ T4 = _mm_mul_epu32(H0, p->R24.v);
+ T5 = _mm_mul_epu32(H1, p->S24.v); T6 = _mm_mul_epu32(H1, p->R20.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H2, p->S23.v); T6 = _mm_mul_epu32(H2, p->S24.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H3, p->S22.v); T6 = _mm_mul_epu32(H3, p->S23.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H4, p->S21.v); T6 = _mm_mul_epu32(H4, p->S22.v); T0 = _mm_add_epi64(T0, T5); T1 = _mm_add_epi64(T1, T6);
+ T5 = _mm_mul_epu32(H1, p->R21.v); T6 = _mm_mul_epu32(H1, p->R22.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H2, p->R20.v); T6 = _mm_mul_epu32(H2, p->R21.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H3, p->S24.v); T6 = _mm_mul_epu32(H3, p->R20.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H4, p->S23.v); T6 = _mm_mul_epu32(H4, p->S24.v); T2 = _mm_add_epi64(T2, T5); T3 = _mm_add_epi64(T3, T6);
+ T5 = _mm_mul_epu32(H1, p->R23.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H2, p->R22.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H3, p->R21.v); T4 = _mm_add_epi64(T4, T5);
+ T5 = _mm_mul_epu32(H4, p->R20.v); T4 = _mm_add_epi64(T4, T5);
+
+ C1 = _mm_srli_epi64(T0, 26); C2 = _mm_srli_epi64(T3, 26); T0 = _mm_and_si128(T0, MMASK); T3 = _mm_and_si128(T3, MMASK); T1 = _mm_add_epi64(T1, C1); T4 = _mm_add_epi64(T4, C2);
+ C1 = _mm_srli_epi64(T1, 26); C2 = _mm_srli_epi64(T4, 26); T1 = _mm_and_si128(T1, MMASK); T4 = _mm_and_si128(T4, MMASK); T2 = _mm_add_epi64(T2, C1); T0 = _mm_add_epi64(T0, _mm_mul_epu32(C2, FIVE));
+ C1 = _mm_srli_epi64(T2, 26); C2 = _mm_srli_epi64(T0, 26); T2 = _mm_and_si128(T2, MMASK); T0 = _mm_and_si128(T0, MMASK); T3 = _mm_add_epi64(T3, C1); T1 = _mm_add_epi64(T1, C2);
+ C1 = _mm_srli_epi64(T3, 26); T3 = _mm_and_si128(T3, MMASK); T4 = _mm_add_epi64(T4, C1);
+
+ /* H = H[0]+H[1] */
+ H0 = _mm_add_epi64(T0, _mm_srli_si128(T0, 8));
+ H1 = _mm_add_epi64(T1, _mm_srli_si128(T1, 8));
+ H2 = _mm_add_epi64(T2, _mm_srli_si128(T2, 8));
+ H3 = _mm_add_epi64(T3, _mm_srli_si128(T3, 8));
+ H4 = _mm_add_epi64(T4, _mm_srli_si128(T4, 8));
+
+ t0 = _mm_cvtsi128_si32(H0) ; c = (t0 >> 26); t0 &= 0x3ffffff;
+ t1 = _mm_cvtsi128_si32(H1) + c; c = (t1 >> 26); t1 &= 0x3ffffff;
+ t2 = _mm_cvtsi128_si32(H2) + c; c = (t2 >> 26); t2 &= 0x3ffffff;
+ t3 = _mm_cvtsi128_si32(H3) + c; c = (t3 >> 26); t3 &= 0x3ffffff;
+ t4 = _mm_cvtsi128_si32(H4) + c; c = (t4 >> 26); t4 &= 0x3ffffff;
+ t0 = t0 + (c * 5); c = (t0 >> 26); t0 &= 0x3ffffff;
+ t1 = t1 + c;
+
+ st->HH[0] = ((t0 ) | (t1 << 26) ) & 0xfffffffffffull;
+ st->HH[1] = ((t1 >> 18) | (t2 << 8) | (t3 << 34)) & 0xfffffffffffull;
+ st->HH[2] = ((t3 >> 10) | (t4 << 16) ) & 0x3ffffffffffull;
+
+ return consumed;
+}
+
+void
+Poly1305Update(poly1305_state *state, const unsigned char *m, size_t bytes) {
+ poly1305_state_internal *st = poly1305_aligned_state(state);
+ size_t want;
+
+ /* need at least 32 initial bytes to start the accelerated branch */
+ if (!st->started) {
+ if ((st->leftover == 0) && (bytes > 32)) {
+ poly1305_first_block(st, m);
+ m += 32;
+ bytes -= 32;
+ } else {
+ want = poly1305_min(32 - st->leftover, bytes);
+ poly1305_block_copy(st->buffer + st->leftover, m, want);
+ bytes -= want;
+ m += want;
+ st->leftover += want;
+ if ((st->leftover < 32) || (bytes == 0))
+ return;
+ poly1305_first_block(st, st->buffer);
+ st->leftover = 0;
+ }
+ st->started = 1;
+ }
+
+ /* handle leftover */
+ if (st->leftover) {
+ want = poly1305_min(64 - st->leftover, bytes);
+ poly1305_block_copy(st->buffer + st->leftover, m, want);
+ bytes -= want;
+ m += want;
+ st->leftover += want;
+ if (st->leftover < 64)
+ return;
+ poly1305_blocks(st, st->buffer, 64);
+ st->leftover = 0;
+ }
+
+ /* process 64 byte blocks */
+ if (bytes >= 64) {
+ want = (bytes & ~63);
+ poly1305_blocks(st, m, want);
+ m += want;
+ bytes -= want;
+ }
+
+ if (bytes) {
+ poly1305_block_copy(st->buffer + st->leftover, m, bytes);
+ st->leftover += bytes;
+ }
+}
+
+void
+Poly1305Finish(poly1305_state *state, unsigned char mac[16]) {
+ poly1305_state_internal *st = poly1305_aligned_state(state);
+ size_t leftover = st->leftover;
+ uint8_t *m = st->buffer;
+ uint128_t d[3];
+ uint64_t h0,h1,h2;
+ uint64_t t0,t1;
+ uint64_t g0,g1,g2,c,nc;
+ uint64_t r0,r1,r2,s1,s2;
+ poly1305_power *p;
+
+ if (st->started) {
+ size_t consumed = poly1305_combine(st, m, leftover);
+ leftover -= consumed;
+ m += consumed;
+ }
+
+ /* st->HH will either be 0 or have the combined result */
+ h0 = st->HH[0];
+ h1 = st->HH[1];
+ h2 = st->HH[2];
+
+ p = &st->P[1];
+ r0 = ((uint64_t)p->R20.d[3] << 32) | (uint64_t)p->R20.d[1];
+ r1 = ((uint64_t)p->R21.d[3] << 32) | (uint64_t)p->R21.d[1];
+ r2 = ((uint64_t)p->R22.d[3] << 32) | (uint64_t)p->R22.d[1];
+ s1 = r1 * (5 << 2);
+ s2 = r2 * (5 << 2);
+
+ if (leftover < 16)
+ goto poly1305_donna_atmost15bytes;
+
+poly1305_donna_atleast16bytes:
+ t0 = U8TO64_LE(m + 0);
+ t1 = U8TO64_LE(m + 8);
+ h0 += t0 & 0xfffffffffff;
+ t0 = shr128_pair(t1, t0, 44);
+ h1 += t0 & 0xfffffffffff;
+ h2 += (t1 >> 24) | ((uint64_t)1 << 40);
+
+poly1305_donna_mul:
+ d[0] = add128(add128(mul64x64_128(h0, r0), mul64x64_128(h1, s2)), mul64x64_128(h2, s1));
+ d[1] = add128(add128(mul64x64_128(h0, r1), mul64x64_128(h1, r0)), mul64x64_128(h2, s2));
+ d[2] = add128(add128(mul64x64_128(h0, r2), mul64x64_128(h1, r1)), mul64x64_128(h2, r0));
+ h0 = lo128(d[0]) & 0xfffffffffff; c = shr128(d[0], 44);
+ d[1] = add128_64(d[1], c); h1 = lo128(d[1]) & 0xfffffffffff; c = shr128(d[1], 44);
+ d[2] = add128_64(d[2], c); h2 = lo128(d[2]) & 0x3ffffffffff; c = shr128(d[2], 42);
+ h0 += c * 5;
+
+ m += 16;
+ leftover -= 16;
+ if (leftover >= 16) goto poly1305_donna_atleast16bytes;
+
+ /* final bytes */
+poly1305_donna_atmost15bytes:
+ if (!leftover) goto poly1305_donna_finish;
+
+ m[leftover++] = 1;
+ poly1305_block_zero(m + leftover, 16 - leftover);
+ leftover = 16;
+
+ t0 = U8TO64_LE(m+0);
+ t1 = U8TO64_LE(m+8);
+ h0 += t0 & 0xfffffffffff; t0 = shr128_pair(t1, t0, 44);
+ h1 += t0 & 0xfffffffffff;
+ h2 += (t1 >> 24);
+
+ goto poly1305_donna_mul;
+
+poly1305_donna_finish:
+ c = (h0 >> 44); h0 &= 0xfffffffffff;
+ h1 += c; c = (h1 >> 44); h1 &= 0xfffffffffff;
+ h2 += c; c = (h2 >> 42); h2 &= 0x3ffffffffff;
+ h0 += c * 5;
+
+ g0 = h0 + 5; c = (g0 >> 44); g0 &= 0xfffffffffff;
+ g1 = h1 + c; c = (g1 >> 44); g1 &= 0xfffffffffff;
+ g2 = h2 + c - ((uint64_t)1 << 42);
+
+ c = (g2 >> 63) - 1;
+ nc = ~c;
+ h0 = (h0 & nc) | (g0 & c);
+ h1 = (h1 & nc) | (g1 & c);
+ h2 = (h2 & nc) | (g2 & c);
+
+ /* pad */
+ t0 = ((uint64_t)p->R23.d[3] << 32) | (uint64_t)p->R23.d[1];
+ t1 = ((uint64_t)p->R24.d[3] << 32) | (uint64_t)p->R24.d[1];
+ h0 += (t0 & 0xfffffffffff) ; c = (h0 >> 44); h0 &= 0xfffffffffff; t0 = shr128_pair(t1, t0, 44);
+ h1 += (t0 & 0xfffffffffff) + c; c = (h1 >> 44); h1 &= 0xfffffffffff; t1 = (t1 >> 24);
+ h2 += (t1 ) + c;
+
+ U64TO8_LE(mac + 0, ((h0 ) | (h1 << 44)));
+ U64TO8_LE(mac + 8, ((h1 >> 20) | (h2 << 24)));
+}
diff -r c3565a90b8c4 lib/freebl/poly1305/poly1305.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/poly1305/poly1305.c Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,254 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+/* This implementation of poly1305 is by Andrew Moon
+ * (https://github.com/floodyberry/poly1305-donna) and released as public
+ * domain. */
+
+#include <string.h>
+#include <stdint.h>
+
+#include "poly1305.h"
+
+#if defined(NSS_X86) || defined(NSS_X64)
+/* We can assume little-endian. */
+static uint32_t U8TO32_LE(const unsigned char *m) {
+ uint32_t r;
+ memcpy(&r, m, sizeof(r));
+ return r;
+}
+
+static void U32TO8_LE(unsigned char *m, uint32_t v) {
+ memcpy(m, &v, sizeof(v));
+}
+#else
+static uint32_t U8TO32_LE(const unsigned char *m) {
+ return (uint32_t)m[0] |
+ (uint32_t)m[1] << 8 |
+ (uint32_t)m[2] << 16 |
+ (uint32_t)m[3] << 24;
+}
+
+static void U32TO8_LE(unsigned char *m, uint32_t v) {
+ m[0] = v;
+ m[1] = v >> 8;
+ m[2] = v >> 16;
+ m[3] = v >> 24;
+}
+#endif
+
+static uint64_t
+mul32x32_64(uint32_t a, uint32_t b) {
+ return (uint64_t)a * b;
+}
+
+struct poly1305_state_st {
+ uint32_t r0,r1,r2,r3,r4;
+ uint32_t s1,s2,s3,s4;
+ uint32_t h0,h1,h2,h3,h4;
+ unsigned char buf[16];
+ unsigned int buf_used;
+ unsigned char key[16];
+};
+
+/* update updates |state| given some amount of input data. This function may
+ * only be called with a |len| that is not a multiple of 16 at the end of the
+ * data. Otherwise the input must be buffered into 16 byte blocks. */
+static void update(struct poly1305_state_st *state, const unsigned char *in,
+ size_t len) {
+ uint32_t t0,t1,t2,t3;
+ uint64_t t[5];
+ uint32_t b;
+ uint64_t c;
+ size_t j;
+ unsigned char mp[16];
+
+ if (len < 16)
+ goto poly1305_donna_atmost15bytes;
+
+poly1305_donna_16bytes:
+ t0 = U8TO32_LE(in);
+ t1 = U8TO32_LE(in+4);
+ t2 = U8TO32_LE(in+8);
+ t3 = U8TO32_LE(in+12);
+
+ in += 16;
+ len -= 16;
+
+ state->h0 += t0 & 0x3ffffff;
+ state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff;
+ state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff;
+ state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff;
+ state->h4 += (t3 >> 8) | (1 << 24);
+
+poly1305_donna_mul:
+ t[0] = mul32x32_64(state->h0,state->r0) +
+ mul32x32_64(state->h1,state->s4) +
+ mul32x32_64(state->h2,state->s3) +
+ mul32x32_64(state->h3,state->s2) +
+ mul32x32_64(state->h4,state->s1);
+ t[1] = mul32x32_64(state->h0,state->r1) +
+ mul32x32_64(state->h1,state->r0) +
+ mul32x32_64(state->h2,state->s4) +
+ mul32x32_64(state->h3,state->s3) +
+ mul32x32_64(state->h4,state->s2);
+ t[2] = mul32x32_64(state->h0,state->r2) +
+ mul32x32_64(state->h1,state->r1) +
+ mul32x32_64(state->h2,state->r0) +
+ mul32x32_64(state->h3,state->s4) +
+ mul32x32_64(state->h4,state->s3);
+ t[3] = mul32x32_64(state->h0,state->r3) +
+ mul32x32_64(state->h1,state->r2) +
+ mul32x32_64(state->h2,state->r1) +
+ mul32x32_64(state->h3,state->r0) +
+ mul32x32_64(state->h4,state->s4);
+ t[4] = mul32x32_64(state->h0,state->r4) +
+ mul32x32_64(state->h1,state->r3) +
+ mul32x32_64(state->h2,state->r2) +
+ mul32x32_64(state->h3,state->r1) +
+ mul32x32_64(state->h4,state->r0);
+
+ state->h0 = (uint32_t)t[0] & 0x3ffffff; c = (t[0] >> 26);
+ t[1] += c; state->h1 = (uint32_t)t[1] & 0x3ffffff; b = (uint32_t)(t[1] >> 26);
+ t[2] += b; state->h2 = (uint32_t)t[2] & 0x3ffffff; b = (uint32_t)(t[2] >> 26);
+ t[3] += b; state->h3 = (uint32_t)t[3] & 0x3ffffff; b = (uint32_t)(t[3] >> 26);
+ t[4] += b; state->h4 = (uint32_t)t[4] & 0x3ffffff; b = (uint32_t)(t[4] >> 26);
+ state->h0 += b * 5;
+
+ if (len >= 16)
+ goto poly1305_donna_16bytes;
+
+ /* final bytes */
+poly1305_donna_atmost15bytes:
+ if (!len)
+ return;
+
+ for (j = 0; j < len; j++)
+ mp[j] = in[j];
+ mp[j++] = 1;
+ for (; j < 16; j++)
+ mp[j] = 0;
+ len = 0;
+
+ t0 = U8TO32_LE(mp+0);
+ t1 = U8TO32_LE(mp+4);
+ t2 = U8TO32_LE(mp+8);
+ t3 = U8TO32_LE(mp+12);
+
+ state->h0 += t0 & 0x3ffffff;
+ state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff;
+ state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff;
+ state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff;
+ state->h4 += (t3 >> 8);
+
+ goto poly1305_donna_mul;
+}
+
+void Poly1305Init(poly1305_state *statep, const unsigned char key[32]) {
+ struct poly1305_state_st *state = (struct poly1305_state_st*) statep;
+ uint32_t t0,t1,t2,t3;
+
+ t0 = U8TO32_LE(key+0);
+ t1 = U8TO32_LE(key+4);
+ t2 = U8TO32_LE(key+8);
+ t3 = U8TO32_LE(key+12);
+
+ /* precompute multipliers */
+ state->r0 = t0 & 0x3ffffff; t0 >>= 26; t0 |= t1 << 6;
+ state->r1 = t0 & 0x3ffff03; t1 >>= 20; t1 |= t2 << 12;
+ state->r2 = t1 & 0x3ffc0ff; t2 >>= 14; t2 |= t3 << 18;
+ state->r3 = t2 & 0x3f03fff; t3 >>= 8;
+ state->r4 = t3 & 0x00fffff;
+
+ state->s1 = state->r1 * 5;
+ state->s2 = state->r2 * 5;
+ state->s3 = state->r3 * 5;
+ state->s4 = state->r4 * 5;
+
+ /* init state */
+ state->h0 = 0;
+ state->h1 = 0;
+ state->h2 = 0;
+ state->h3 = 0;
+ state->h4 = 0;
+
+ state->buf_used = 0;
+ memcpy(state->key, key + 16, sizeof(state->key));
+}
+
+void Poly1305Update(poly1305_state *statep, const unsigned char *in,
+ size_t in_len) {
+ unsigned int i;
+ struct poly1305_state_st *state = (struct poly1305_state_st*) statep;
+
+ if (state->buf_used) {
+ unsigned int todo = 16 - state->buf_used;
+ if (todo > in_len)
+ todo = in_len;
+ for (i = 0; i < todo; i++)
+ state->buf[state->buf_used + i] = in[i];
+ state->buf_used += todo;
+ in_len -= todo;
+ in += todo;
+
+ if (state->buf_used == 16) {
+ update(state, state->buf, 16);
+ state->buf_used = 0;
+ }
+ }
+
+ if (in_len >= 16) {
+ size_t todo = in_len & ~0xf;
+ update(state, in, todo);
+ in += todo;
+ in_len &= 0xf;
+ }
+
+ if (in_len) {
+ for (i = 0; i < in_len; i++)
+ state->buf[i] = in[i];
+ state->buf_used = in_len;
+ }
+}
+
+void Poly1305Finish(poly1305_state *statep, unsigned char mac[16]) {
+ struct poly1305_state_st *state = (struct poly1305_state_st*) statep;
+ uint64_t f0,f1,f2,f3;
+ uint32_t g0,g1,g2,g3,g4;
+ uint32_t b, nb;
+
+ if (state->buf_used)
+ update(state, state->buf, state->buf_used);
+
+ b = state->h0 >> 26; state->h0 = state->h0 & 0x3ffffff;
+ state->h1 += b; b = state->h1 >> 26; state->h1 = state->h1 & 0x3ffffff;
+ state->h2 += b; b = state->h2 >> 26; state->h2 = state->h2 & 0x3ffffff;
+ state->h3 += b; b = state->h3 >> 26; state->h3 = state->h3 & 0x3ffffff;
+ state->h4 += b; b = state->h4 >> 26; state->h4 = state->h4 & 0x3ffffff;
+ state->h0 += b * 5;
+
+ g0 = state->h0 + 5; b = g0 >> 26; g0 &= 0x3ffffff;
+ g1 = state->h1 + b; b = g1 >> 26; g1 &= 0x3ffffff;
+ g2 = state->h2 + b; b = g2 >> 26; g2 &= 0x3ffffff;
+ g3 = state->h3 + b; b = g3 >> 26; g3 &= 0x3ffffff;
+ g4 = state->h4 + b - (1 << 26);
+
+ b = (g4 >> 31) - 1;
+ nb = ~b;
+ state->h0 = (state->h0 & nb) | (g0 & b);
+ state->h1 = (state->h1 & nb) | (g1 & b);
+ state->h2 = (state->h2 & nb) | (g2 & b);
+ state->h3 = (state->h3 & nb) | (g3 & b);
+ state->h4 = (state->h4 & nb) | (g4 & b);
+
+ f0 = ((state->h0 ) | (state->h1 << 26)) + (uint64_t)U8TO32_LE(&state->key[0]);
+ f1 = ((state->h1 >> 6) | (state->h2 << 20)) + (uint64_t)U8TO32_LE(&state->key[4]);
+ f2 = ((state->h2 >> 12) | (state->h3 << 14)) + (uint64_t)U8TO32_LE(&state->key[8]);
+ f3 = ((state->h3 >> 18) | (state->h4 << 8)) + (uint64_t)U8TO32_LE(&state->key[12]);
+
+ U32TO8_LE(&mac[ 0], (uint32_t)f0); f1 += (f0 >> 32);
+ U32TO8_LE(&mac[ 4], (uint32_t)f1); f2 += (f1 >> 32);
+ U32TO8_LE(&mac[ 8], (uint32_t)f2); f3 += (f2 >> 32);
+ U32TO8_LE(&mac[12], (uint32_t)f3);
+}
diff -r c3565a90b8c4 lib/freebl/poly1305/poly1305.h
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lib/freebl/poly1305/poly1305.h Tue Jan 07 12:11:36 2014 -0800
@@ -0,0 +1,31 @@
+/*
+ * poly1305.h - header file for Poly1305 implementation.
+ *
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
+
+#ifndef FREEBL_POLY1305_H_
+#define FREEBL_POLY1305_H_
+
+typedef unsigned char poly1305_state[512];
+
+/* Poly1305Init sets up |state| so that it can be used to calculate an
+ * authentication tag with the one-time key |key|. Note that |key| is a
+ * one-time key and therefore there is no `reset' method because that would
+ * enable several messages to be authenticated with the same key. */
+extern void Poly1305Init(poly1305_state* state,
+ const unsigned char key[32]);
+
+/* Poly1305Update processes |in_len| bytes from |in|. It can be called zero or
+ * more times after poly1305_init. */
+extern void Poly1305Update(poly1305_state* state,
+ const unsigned char *in,
+ size_t inLen);
+
+/* Poly1305Finish completes the poly1305 calculation and writes a 16 byte
+ * authentication tag to |mac|. */
+extern void Poly1305Finish(poly1305_state* state,
+ unsigned char mac[16]);
+
+#endif /* FREEBL_POLY1305_H_ */
diff -r c3565a90b8c4 lib/pk11wrap/pk11mech.c
--- a/lib/pk11wrap/pk11mech.c Fri Jan 03 20:59:10 2014 +0100
+++ b/lib/pk11wrap/pk11mech.c Tue Jan 07 12:11:36 2014 -0800
@@ -152,6 +152,8 @@
return CKM_SEED_CBC;
case CKK_CAMELLIA:
return CKM_CAMELLIA_CBC;
+ case CKK_NSS_CHACHA20:
+ return CKM_NSS_CHACHA20_POLY1305;
case CKK_AES:
return CKM_AES_CBC;
case CKK_DES:
@@ -219,6 +221,8 @@
case CKM_CAMELLIA_CBC_PAD:
case CKM_CAMELLIA_KEY_GEN:
return CKK_CAMELLIA;
+ case CKM_NSS_CHACHA20_POLY1305:
+ return CKK_NSS_CHACHA20;
case CKM_AES_ECB:
case CKM_AES_CBC:
case CKM_AES_CCM:
@@ -429,6 +433,8 @@
case CKM_CAMELLIA_CBC_PAD:
case CKM_CAMELLIA_KEY_GEN:
return CKM_CAMELLIA_KEY_GEN;
+ case CKM_NSS_CHACHA20_POLY1305:
+ return CKM_NSS_CHACHA20_KEY_GEN;
case CKM_AES_ECB:
case CKM_AES_CBC:
case CKM_AES_CCM:
diff -r c3565a90b8c4 lib/softoken/pkcs11.c
--- a/lib/softoken/pkcs11.c Fri Jan 03 20:59:10 2014 +0100
+++ b/lib/softoken/pkcs11.c Tue Jan 07 12:11:36 2014 -0800
@@ -368,6 +368,9 @@
{CKM_SEED_MAC, {16, 16, CKF_SN_VR}, PR_TRUE},
{CKM_SEED_MAC_GENERAL, {16, 16, CKF_SN_VR}, PR_TRUE},
{CKM_SEED_CBC_PAD, {16, 16, CKF_EN_DE_WR_UN}, PR_TRUE},
+ /* ------------------------- ChaCha20 Operations ---------------------- */
+ {CKM_NSS_CHACHA20_KEY_GEN, {32, 32, CKF_GENERATE}, PR_TRUE},
+ {CKM_NSS_CHACHA20_POLY1305,{32, 32, CKF_EN_DE}, PR_TRUE},
/* ------------------------- Hashing Operations ----------------------- */
{CKM_MD2, {0, 0, CKF_DIGEST}, PR_FALSE},
{CKM_MD2_HMAC, {1, 128, CKF_SN_VR}, PR_TRUE},
diff -r c3565a90b8c4 lib/softoken/pkcs11c.c
--- a/lib/softoken/pkcs11c.c Fri Jan 03 20:59:10 2014 +0100
+++ b/lib/softoken/pkcs11c.c Tue Jan 07 12:11:36 2014 -0800
@@ -632,6 +632,97 @@
return rv;
}
+static SFTKChaCha20Poly1305Info *
+sftk_ChaCha20Poly1305_CreateContext(const unsigned char *key,
+ unsigned int keyLen,
+ const CK_NSS_AEAD_PARAMS* params)
+{
+ SFTKChaCha20Poly1305Info *ctx;
+
+ if (params->ulIvLen != sizeof(ctx->nonce)) {
+ PORT_SetError(SEC_ERROR_INPUT_LEN);
+ return NULL;
+ }
+
+ ctx = PORT_New(SFTKChaCha20Poly1305Info);
+ if (ctx == NULL) {
+ return NULL;
+ }
+
+ if (ChaCha20Poly1305_InitContext(&ctx->freeblCtx, key, keyLen,
+ params->ulTagLen) != SECSuccess) {
+ PORT_Free(ctx);
+ return NULL;
+ }
+
+ memcpy(ctx->nonce, params->pIv, sizeof(ctx->nonce));
+
+ if (params->ulAADLen > sizeof(ctx->ad)) {
+ /* Need to allocate an overflow buffer for the additional data. */
+ ctx->adOverflow = (unsigned char *)PORT_Alloc(params->ulAADLen);
+ if (!ctx->adOverflow) {
+ PORT_Free(ctx);
+ return NULL;
+ }
+ memcpy(ctx->adOverflow, params->pAAD, params->ulAADLen);
+ } else {
+ ctx->adOverflow = NULL;
+ memcpy(ctx->ad, params->pAAD, params->ulAADLen);
+ }
+ ctx->adLen = params->ulAADLen;
+
+ return ctx;
+}
+
+static void
+sftk_ChaCha20Poly1305_DestroyContext(SFTKChaCha20Poly1305Info *ctx,
+ PRBool freeit)
+{
+ ChaCha20Poly1305_DestroyContext(&ctx->freeblCtx, PR_FALSE);
+ if (ctx->adOverflow != NULL) {
+ PORT_Free(ctx->adOverflow);
+ ctx->adOverflow = NULL;
+ }
+ ctx->adLen = 0;
+ if (freeit) {
+ PORT_Free(ctx);
+ }
+}
+
+static SECStatus
+sftk_ChaCha20Poly1305_Encrypt(const SFTKChaCha20Poly1305Info *ctx,
+ unsigned char *output, unsigned int *outputLen,
+ unsigned int maxOutputLen,
+ const unsigned char *input, unsigned int inputLen)
+{
+ const unsigned char *ad = ctx->adOverflow;
+
+ if (ad == NULL) {
+ ad = ctx->ad;
+ }
+
+ return ChaCha20Poly1305_Seal(&ctx->freeblCtx, output, outputLen,
+ maxOutputLen, input, inputLen, ctx->nonce,
+ sizeof(ctx->nonce), ad, ctx->adLen);
+}
+
+static SECStatus
+sftk_ChaCha20Poly1305_Decrypt(const SFTKChaCha20Poly1305Info *ctx,
+ unsigned char *output, unsigned int *outputLen,
+ unsigned int maxOutputLen,
+ const unsigned char *input, unsigned int inputLen)
+{
+ const unsigned char *ad = ctx->adOverflow;
+
+ if (ad == NULL) {
+ ad = ctx->ad;
+ }
+
+ return ChaCha20Poly1305_Open(&ctx->freeblCtx, output, outputLen,
+ maxOutputLen, input, inputLen, ctx->nonce,
+ sizeof(ctx->nonce), ad, ctx->adLen);
+}
+
/** NSC_CryptInit initializes an encryption/Decryption operation.
*
* Always called by NSC_EncryptInit, NSC_DecryptInit, NSC_WrapKey,NSC_UnwrapKey.
@@ -1027,6 +1118,35 @@
context->destroy = (SFTKDestroy) AES_DestroyContext;
break;
+ case CKM_NSS_CHACHA20_POLY1305:
+ if (pMechanism->ulParameterLen != sizeof(CK_NSS_AEAD_PARAMS)) {
+ crv = CKR_MECHANISM_PARAM_INVALID;
+ break;
+ }
+ context->multi = PR_FALSE;
+ if (key_type != CKK_NSS_CHACHA20) {
+ crv = CKR_KEY_TYPE_INCONSISTENT;
+ break;
+ }
+ att = sftk_FindAttribute(key,CKA_VALUE);
+ if (att == NULL) {
+ crv = CKR_KEY_HANDLE_INVALID;
+ break;
+ }
+ context->cipherInfo = sftk_ChaCha20Poly1305_CreateContext(
+ (unsigned char*) att->attrib.pValue, att->attrib.ulValueLen,
+ (CK_NSS_AEAD_PARAMS*) pMechanism->pParameter);
+ sftk_FreeAttribute(att);
+ if (context->cipherInfo == NULL) {
+ crv = sftk_MapCryptError(PORT_GetError());
+ break;
+ }
+ context->update = (SFTKCipher) (isEncrypt ?
+ sftk_ChaCha20Poly1305_Encrypt :
+ sftk_ChaCha20Poly1305_Decrypt);
+ context->destroy = (SFTKDestroy) sftk_ChaCha20Poly1305_DestroyContext;
+ break;
+
case CKM_NETSCAPE_AES_KEY_WRAP_PAD:
context->doPad = PR_TRUE;
/* fall thru */
@@ -3601,6 +3721,10 @@
*key_type = CKK_AES;
if (*key_length == 0) crv = CKR_TEMPLATE_INCOMPLETE;
break;
+ case CKM_NSS_CHACHA20_KEY_GEN:
+ *key_type = CKK_NSS_CHACHA20;
+ if (*key_length == 0) crv = CKR_TEMPLATE_INCOMPLETE;
+ break;
default:
PORT_Assert(0);
crv = CKR_MECHANISM_INVALID;
@@ -3846,6 +3970,7 @@
case CKM_SEED_KEY_GEN:
case CKM_CAMELLIA_KEY_GEN:
case CKM_AES_KEY_GEN:
+ case CKM_NSS_CHACHA20_KEY_GEN:
#if NSS_SOFTOKEN_DOES_RC5
case CKM_RC5_KEY_GEN:
#endif
diff -r c3565a90b8c4 lib/softoken/pkcs11i.h
--- a/lib/softoken/pkcs11i.h Fri Jan 03 20:59:10 2014 +0100
+++ b/lib/softoken/pkcs11i.h Tue Jan 07 12:11:36 2014 -0800
@@ -14,6 +14,7 @@
#include "pkcs11t.h"
#include "sftkdbt.h"
+#include "chacha20poly1305.h"
#include "hasht.h"
/*
@@ -104,6 +105,7 @@
typedef struct SFTKOAEPEncryptInfoStr SFTKOAEPEncryptInfo;
typedef struct SFTKOAEPDecryptInfoStr SFTKOAEPDecryptInfo;
typedef struct SFTKSSLMACInfoStr SFTKSSLMACInfo;
+typedef struct SFTKChaCha20Poly1305InfoStr SFTKChaCha20Poly1305Info;
typedef struct SFTKItemTemplateStr SFTKItemTemplate;
/* define function pointer typdefs for pointer tables */
@@ -399,6 +401,16 @@
unsigned int keySize;
};
+/* SFTKChaCha20Poly1305Info saves the key, tag length, nonce, and additional
+ * data for a ChaCha20+Poly1305 AEAD operation. */
+struct SFTKChaCha20Poly1305InfoStr {
+ ChaCha20Poly1305Context freeblCtx;
+ unsigned char nonce[8];
+ unsigned char ad[16];
+ unsigned char *adOverflow;
+ unsigned int adLen;
+};
+
/*
* Template based on SECItems, suitable for passing as arrays
*/
diff -r c3565a90b8c4 lib/util/pkcs11n.h
--- a/lib/util/pkcs11n.h Fri Jan 03 20:59:10 2014 +0100
+++ b/lib/util/pkcs11n.h Tue Jan 07 12:11:36 2014 -0800
@@ -51,6 +51,8 @@
#define CKK_NSS_JPAKE_ROUND1 (CKK_NSS + 2)
#define CKK_NSS_JPAKE_ROUND2 (CKK_NSS + 3)
+#define CKK_NSS_CHACHA20 (CKK_NSS + 4)
+
/*
* NSS-defined certificate types
*
@@ -214,6 +216,9 @@
#define CKM_NSS_TLS_KEY_AND_MAC_DERIVE_SHA256 (CKM_NSS + 23)
#define CKM_NSS_TLS_MASTER_KEY_DERIVE_DH_SHA256 (CKM_NSS + 24)
+#define CKM_NSS_CHACHA20_KEY_GEN (CKM_NSS + 25)
+#define CKM_NSS_CHACHA20_POLY1305 (CKM_NSS + 26)
+
/*
* HISTORICAL:
* Do not attempt to use these. They are only used by NETSCAPE's internal
@@ -281,6 +286,14 @@
CK_ULONG ulHeaderLen; /* in */
} CK_NSS_MAC_CONSTANT_TIME_PARAMS;
+typedef struct CK_NSS_AEAD_PARAMS {
+ CK_BYTE_PTR pIv; /* This is the nonce. */
+ CK_ULONG ulIvLen;
+ CK_BYTE_PTR pAAD;
+ CK_ULONG ulAADLen;
+ CK_ULONG ulTagLen;
+} CK_NSS_AEAD_PARAMS;
+
/*
* NSS-defined return values
*
|
2024-01-23T01:26:36.242652
|
https://example.com/article/1488
|
Media Reform – The solution to an industry in crisis?
The Federal Government’s bill for media reform that abolishes the longstanding 'reach' and 'two-out-of-three' rules has opened the doors for a swag of mergers and aquisitions as media owners consider their options.
The amended legislation passed the Senate on September 14 with 31 votes to 27 after a deal made with Senator Nick Xenophon secured an innovation package to assist regional and small publishers.
But critics of the reforms have argued these changes do nothing to solve the financial woes of an Australian media sector whose economic model is collapsing.
Major Changes
The Broadcasting Services Act 1992 was created before the widespread use of the internet but print, radio and television are no longer the only source of news.
In today’s digital age people are accessing news in more ways and on mobile devices. The changes are designed to reflect this.
Previously, under the two-out-of-three rule a single person or company could not control more than two media platforms. For example, they could control television and print but not radio. This allowed for diversity within the media region.
After the amendment a single person or company can control all three forms of traditional media within a radio licence area. This means that there is potential for only one media voice in any given area.
Labor and the Greens opposed scrapping the 'two out of three' rule, arguing it would lead to a higher concentration of media ownership.
A similar concern exists in relation to 75 per cent rule. Before the amendment a single person or company could only control a broadcast licence that reached 75 per cent of the Australian population.
Now a single person or company can control television licences that cover the entire Australian population. The concern here is that so called 'local' news will actually be produced in regional centers and will not properly cover local news and issues.
It took longer to gain the support of Nick Xenophon, who pushed for a more rounded package to support regional and smaller publishers, and which seemed to be gaining support until it stalled ahead of a Senate debate.
With the government pushing ahead with the media reforms, the proposal made by Nick Xenophon was accepted and the amendment to the bill was made.
There are three parts to the Xenophon package:
The establishment of a one-off Regional and Small Publishers Innovation Fund involving $16.7 million worth of grants a year over three years, from the 2018/19 financial year, totalling $50 million. This will be overseen by the Australian Communications and Media Authority with input from bodies such as the Press Council.
Two hundred cadetships will be available for funding over two years, with 100 cadetships available each year. Eligible organisations would be able to apply for a wage subsidy or grant of up to $40,000 per cadet.
Thirty university journalism scholarships per year will be made available over two years commencing in 2018/19, with each scholarship valued at $40,000 and able to be expended on related expenses including tuition fees and accommodation costs. An additional 60 regional journalism scholarships will be available to encourage journalism in regional areas.
Innovation or Band Aid?
Rudi Maxwell, editor of the Koori Mail, the largest Indigenous owned and focused newspaper in Australia said the cadetship program would mean that they could employ and train another young journalist.
“I think the deal will help some regional and remote media organisations," she said.
"But I don’t know that - and this doesn’t apply to us - in the circumstances where you have a large corporation able to control commercial TV, radio and print, that a smaller independent media organisations being supported to employ a cadet is going to make an enormous difference.”
With ongoing cuts to jobs in the journalism sector including at Fairfax, News Corp and the ABC, there is concern that the newly trained journalists will not have jobs once the government subsidy runs out.
The Conversation editor Misha Ketchell said the cadetships will provide a "valuable opportunity" for young journalists.
"What happens after that is anyone's guess. The media world is changing so quickly, only the deluded would pretend to know what is coming next.”
In an interview with ABC Radio, Greens leader Richard Di Natale argued that there is no point training cadets if there are no jobs for them.
The Elephant in the Room
However, the main problem facing Australian media companies is the disintegration of their advertising-based business mode, as US tech giants Google and Facebook gobble up advertising market share.
That is a huge amount that is taken from media companies in the Australian context and, as has already been seen, when cost-cutting is required the jobs of journalists are the first to go.
The Media, Entertainment and Arts Alliance, the journalist's union estimates that, since 2011 more than 2000 journalism jobs have been lost.
According to journalist Ben Eltham, the Australian Competition Consumer Commission inquiry into the impact of the new digital environment on the media – forced on the government by minority parties to secure the media ownership changes - should have preceded the discussions on media reform, but did not.
But the bill does nothing to address the basic and insoluble problem that is destroying the Australian commercial media: the disappearance of advertising, their primary source of income.
The bill won’t achieve any of the aims advanced for it by Communications Minister, such as propping up the sustainability of big media companies. It can’t do that, because ownership is not the main problem facing the Australian media.
So, Australia has a new set of reforms that do not address the main problem facing the country's media industry.
It is hoped that the current Senate inquiry into the future of journalism, which will release its final report on December 7, will shine some light on a potential solution, but until the issues related to loss of advertising revenue are faced, it is doubtful that a way forward will be found.
|
2023-09-25T01:26:36.242652
|
https://example.com/article/4513
|
A-League transfers for 2015–16 season
This is a list of Australian football transfers for the 2015–16 A-League. Only moves featuring at least one A-League club are listed.
Clubs were able to sign players at any time, but many transfers will only officially go through on 1 June because the majority of player contracts finish on 31 May.
Transfers
All players without a flag are Australian. Clubs without a flag are clubs participating in the A-League.
Pre-season
Mid-season
References
Category:A-League transfers
transfers
Category:Football transfers summer 2015
Category:Football transfers winter 2015–16
|
2023-09-09T01:26:36.242652
|
https://example.com/article/5455
|
Let’s get something out of the way before we start. The Mass Effect franchise ending? IT DOES NOT EXIST AND WE SHALL NEVER SPEAK OF IT AGAIN. Somewhere in an alternate universe, Garrus and Tali are having cocktails on a beach, while Jack teaches junior biotics how to swear, is all I’m saying.*
*Other people like Chuck Wendig and Brit Mandelo have had things to say about Bioware’s failure to stick the dismount of an otherwise brilliantly-written RPG series. So let’s leave it there.
But that’s not what I want to talk about today. What I want to talk about is how—provided one plays as Commander Jane rather than Commander John—the Mass Effect series normalises the idea of the Woman Hero.
You may have noticed that Woman Hero is my term of choice here, rather than Heroine. Whether we like it or not, heroine is still a word that embodies connotations which differ in many and manifest ways from hero. Gothic and romance novels have heroines. Thrillers and action stories have heroes: if these also have heroines, the heroine almost always takes second stage to the hero. Where the heroine has pride of place, she’s (again, almost always) intimately connected to, or in some way (emotionally, intellectually, or politically) dependent upon, a hero, whose actions and reactions are either vital to her as a character, or to the resolution of plot and theme. The reverse is much less true, and much less often true (once one might have said Not at all true), when the Hero stands centre stage. The Hero does not depend: his actions are not contingent actions.
Heroine is a word with a history. That history carries with it a metric crapton(ne) of implications, a bunch of which place heroine in opposition or in contrast to hero.
Commander Jane Shepard is not merely our protagonist and player-avatar in the Mass Effect franchise. She’s an ???? in practically the original Greek sense: a warrior of outstanding (legendary, potentially superhuman) achievements. Moreover, since Shepard’s interactions with other characters remain substantially the same regardless of whether one is a John or a Jane, it’s established that Commander Jane Shepard isn’t remarkable because she’s a woman. She’s extraordinary because she’s Shepard. This is reinforced by the ubiquity of other female characters who possess a wide array of competences: Gunnery Chief Ashley Williams, asari archaeologist/information broker Liara T’Soni, quarian engineer Tali’Zorah vas Neema, Doctor Chakwas, Miranda Lawson, the asari Justicar Samara, and human weapon of mass destruction Jack (“Subject Zero”). And although the visible people of the human Alliance’s high command trend male, Mass Effect‘s galaxy at large is populated with a multitude of interesting women, both human and alien.
And Shepard.
Marie Brennan wrote something pertinent to this disquisition at SF Novelists, not so long ago. In “The Effect She Can Have,” concerning another Bioware property, Dragon Age 2, Brennan says:
“It took me a while, though, to figure out that there was something else going on in my reaction—something beyond appreciation of the clever structural game the writers were playing. She. … [I]t allows you to experience the novelty of a woman being the most important damn person in the world.”
The most important damn person in the world.
There’s one scene in particular in Mass Effect 3 where that’s hammered home with a vengeance. How often is the “most famous officer” referred to with a female pronoun?
Dr. Liara T’Soni: Shepard was also a deadly tactical fighter. Most enemies never saw her coming. She was a soldier, and a leader—one who made peace where she could. And it was a privilege to know her.
The dialogue will be different depending on the game one plays. But the sentiment is the same. Commander Jane Shepard isn’t an extraordinary woman. She’s simply extraordinary. Full stop. No qualifiers. When one considers the amount of crap extraordinary people who are also women have directed at them even today—the likes of Hilary Clinton and Angela Merkel in the political realm,** household names like Lady Gaga, writers like Toni Morrison—this is immensely validating.***
**Whatever one thinks of their politics, there’s no escaping the fact that achieving their present positions took extraordinary drive.
***In researching this post, I discovered that Canada’s first female Major-General was appointed in 1994, while in 1995, Norway appointed the first ever female commander of a submarine. And as of 2005, the British forces have permitted female soldiers to enter the new Special Reconnaissance Regiment—which is the only Special Forces regiment in Britain to recruit women. Speaking of extraordinary.
In “The Effect She Can Have,” Brennan goes on to mention the dislocating effect of “having people speak in such monumental terms about this woman. About any woman… [A] male character can inspire such loyalty in their followers, or scare a room full of people just by walking in”—but as she notes, the female equivalent of this power fantasy remains a (slightly shocking) novelty.
Whatever the Mass Effect franchise’s gender-related worldbuilding flaws (there are male gaze issues with the presentation of the “matriarchal” asari as a species, although these are less pronounced in the final analysis than I feared they would be—and rather less pronounced than many television series which have featured female aliens: I’m looking at you, Torchwood and Doctor Who—and the presentation of the female krogan in Mass Effect 3 as more rational and less warlike than the males is not necessarily the best of all possible decisions that could be made), the manner in which it assumes (on grounds of gender, at least) an equal-opportunity future (and peoples its background across the three instalments with human women and men of all orientations: I confess, I did a little chair-dance when I realised there were romance options in ME3 that only worked for characters attracted to the same sex) is a choice that remains radical in its implications.
The manner in which it presents the Woman Hero as normal, as a character, and as a choice, in the case of Commander Jane Shepard, also remains radical. Playing as Commander John Shepard, I found myself annoyed at how predictable the hero’s development—and dialogue—could be. Playing as Commander Jane…
It was refreshing, and satisfying, and disorienting all at once. But the arc of the story is the same. Merely by removing the emphasis from the Woman part of heroine to the Hero part—in creating a Woman Hero who is extraordinary as a Hero, rather than as a Woman—Bioware made the experience innovative and fresh.
Perhaps in another generation or three, the Woman Hero will be as Normal (and annoying) as the square-jawed Hero himself. But right now?
Right now, I find Commander Jane Shepard delightful.
Follow Liz Bourke’s feminist SFF column Sleeps With Monsters here.
Image by DeviantArt user DazUki
Liz Bourke also appreciates the fact that several of the romance options in the Mass Effect franchise involved smart characters. Competence is sexy and brains are hot.
|
2024-03-12T01:26:36.242652
|
https://example.com/article/7717
|
You may have noticed that
always using the midpoint of the interval generated some pretty long numbers.
My computations weren't too hard, because I was making intelligent use
of my calculator. But
there were times when it was pretty obvious that I could have used better,
and easier, x-values,
and still gotten the same answer. If you're working with a calculator
that doesn't allow for the symbolic calculations of the polynomial for
a given value of x,
then choosing x-values
with fewer decimal places could be especially handy. So let's find
the polynomial's zero again, but this time we'll go to the trouble
of picking our the x-values,
instead of just mindlessly always using the midpoint.
Okay, now I'm too high
again, but I'm getting pretty close. Lemme edge down a bit:
x =
1.2994: y = 0.000129009...x
= 1.2993: y = –0.001502678...
Finally! I've managed to
bracket the zero between two x-values
that have the same first three decimal places. That's all the accuracy
I need, so I'm done.
x
= 1.299
As you can see, by picking
your own x-values,
you can simplify and shorten your computations. But you do have to pay
attention to what you're doing, or you could end up picking lots of fairly
useless values and taking nearly as long as you would by using the midpoint
process. Either way, though, numerically approximating zeroes isn't terribly
complicated; it's just long and tedious.
If you don't have a graphing
calculator, just a regular calculator, you may have to do a little more
preliminary work on your own (if they don't tell you "look between
here and here for the zero"), but the general process will still
be the same.
The first thing I have
to do is figure out the general area of the zero. Without a graph and
without limits being given to me, I'll have to use what
I know of polynomials
to judge the values I get. I'll try a few values in the vicinity of
the origin:
x =
0: y = –9.1(I'm
below the axis)x
= 1: y = –8.8(The
graph is coming back up toward the axis)x
= 3: y = –10(The
graph is heading back down; I may be moving the wrong way)x
= 5: y = –137.6(Oh,
yeah, this has got to be the wrong direction; I'll head negative)x
= –1:
y = –9.2(This
is about the same as where I started)x
= –2:
y = –2.5(The
graph is heading back up toward the axis)x
= –3:
y = 36(The
polynomial is finally positive)
Bingo! I've found a sign
change, so the zero is somewhere between x
= –3
and x
= –2.
Also, the polynomial is above the axis at the lower x-value,
so I know the graph goes down as it crosses the axis. Then a negative
y-value
will mean that my x-value
was too high, and a positive y-value
will mean that my x-value
was too low. This will tell me in which direction I need to move.
Since y
= –2.5 (at
x
= –2)
is a lot closer to zero than is y
= 36 (at x
= –3),
the zero must be a lot closer to x
= –2,
so I'll test some values in the tenths:
The sign change tells me
that the zero is bracketed by –2.14 and
–2.13,
with the polynomial being closer to the axis at –2.13.
I'll test values in the thousandths:
x =
–2.133:
y = –0.02469719...(I've
already crossed the axis, so I need to back up)x
= –2.134:
y = –0.003837470...(Still
negative, so I need to back up a little more)x
= –2.135:
y = 0.0170576798...(The
polynomial is back above the axis)
Now I have the zero bracketed
between –2.135 and
–2.134,
numbers that have the same first two decimal places, so I'm done.
x
= –2.13
If you're writing a computer
program or graphing-calculator
program to find
numerical approximations, use the midpoint process: it's mindless and
rote, which is what you need for an automated process like a program.
If your text specifies the method you should use, you should stick with
that. Otherwise, use whichever method you prefer. Just allow yourself
some time, and be sure to write down your steps carefully. About the only
problem you can really have with this process would come from copying
down a number wrong. As long as you're neat and don't rush, you should
do fine.
|
2023-08-21T01:26:36.242652
|
https://example.com/article/1336
|
581 N.W.2d 794 (1998)
229 Mich. App. 431
ANN ARBOR TENANTS UNION, Plaintiff-Appellee and Cross-Appellant,
v.
ANN ARBOR YMCA, a Michigan non-profit corporation, Defendant-Appellant and Cross-Appellee, and
City of Ann Arbor, a Michigan municipal corporation, Defendant.
Docket No. 201565.
Court of Appeals of Michigan.
Submitted April 14, 1998, at Grand Rapids.
Decided April 28, 1998, at 9:10 a.m.
Released for Publication July 29, 1998.
*795 Rose, Weber & Pappas by Jonathan G. Weber and Jonathan I. Rose, Ann Arbor, for Plaintiff-Appellee and Cross-Appellant.
Butzel Long by Robert B. Foster and John H. Dudley, Jr., for Ann Arbor YMCA.
Before GAGE, P.J., and FITZGERALD and SMOLENSKI, JJ.
SMOLENSKI, Judge.
This case involves the question whether the legal relationship between the Ann Arbor YMCA and those to whom the YMCA rents rooms in its facility is one of landlord-tenant or one of hotel-guest. The trial court held that the relationship is one of landlord-tenant and that the statutes that apply to landlords are applicable to the YMCA.[1] We hold that the legal relationship between the YMCA and its occupants is one of "hotel" and "guest" under Michigan law governing hotels, inns, and public lodging houses and that the trial court clearly erred in determining that a landlord-tenant relationship exists.[2]*796 We further hold that the statutes that apply to landlords are inapplicable to the YMCA.
I
The Ann Arbor YMCA is a nonprofit, community-based membership organization that was founded in 1894, is affiliated with the national YMCA, and serves Washtenaw County. The Ann Arbor YMCA has four principal operationsfitness and recreation, child care and preschool, camping, and residenceall of which share the same building. The building has "common areas" on the first floor, including the front desk and main lobby, a lounge, a room that includes an eating area and vending machines, and public restrooms. Consistent with its stated "mission"[3] to provide affordable living accommodations, the Ann Arbor YMCA for many years has had a residence section consisting of single-occupancy rooms for persons of low and moderate incomes. Many of the individuals who occupy the rooms suffer from various mental, emotional, or physical disorders and problems and are referred from human service agencies in the community. These agencies often pay for or guarantee payment for a room at the YMCA and provide various services for the individuals they refer. The YMCA also provides various kinds of assistance to the individuals, including counseling, finding employment, and obtaining additional resources from community organizations.
Each floor in the YMCA's residence section is similar to a dormitory, with communal bathroom facilities at one end of the hall containing several showers, sinks, urinals, and toilets to be used by the occupants of the floor. Each room is occupied by one person and is furnished by the YMCA with a single bed, a closet, a desk, and a chair. The YMCA provides each resident with linen services (sheets and towels), mandatory daily or weekly housekeeping service, and utilities. None of the rooms have bathroom facilities or facilities for maintaining food or preparing meals. The storage of personal belongings or food in the rooms and the use of alcohol or illegal drugs is specifically prohibited. The rooms have no telephones. A house telephone is provided on each floor for incoming calls, and a pay phone is provided on each floor for outgoing calls. The YMCA provides a wake-up service by means of a buzzer in the rooms. Each resident is given a key to his room but is required to leave the room key at the front desk when leaving the building. The YMCA retains keys to each room and specifically reserves the right to enter the rooms for purposes of security, inspection, and maintenance. One floor of the residence section is reserved exclusively for women and the other floors are reserved exclusively for men. Visitation on a guest floor by a nonguest is prohibited as is visitation on an opposite-sex floor by a guest. Residents are permitted to see visitors in a lounge area on the first floor during scheduled hours.
Each person who desires to rent a room at the YMCA does so by registering for a room at the front desk of the YMCA.[4] Although the guest policy requires a security deposit for guests who pay by the month, apparently as a matter of practice no security deposits are collected. On admission, the individual signs a written agreement with the YMCA. The written agreement refers to each person *797 who desires to rent a room as the "guest" and specifically states that the YMCA is a "hotel" as defined in M.C.L. § 427.1 et seq.; M.S.A. § 18.321 et seq.[5] The agreement and its accompanying "guest policy" state that the guest's right to occupy a room shall always be on a day-to-day basis, but that reduced weekly or monthly rates may be obtained.[6] Payment is required in advance; however, the YMCA issues to a guest a pro-rata refund for any period for which payment has been made in advance but was not used because the guest vacated the room. In the agreement each guest also acknowledges that "he or she is not a tenant but a licensee on a day-to-day basis, and that Guest has no property or possessory interest in the room being rented to Guest." The agreement and policy further provide that the YMCA has the right to terminate a guest's occupancy and ask the guest to leave at any time and without any reason and that if the guest does not do so voluntarily within twenty-four hours upon request, the YMCA may lock the guest out of the room without further notice.
In 1988, the city of Ann Arbor determined that additional low-income, single-room-occupancy housing was needed in the community. Accordingly, the city of Ann Arbor and the YMCA entered into an agreement whereby the YMCA agreed to add sixty-three additional single-occupancy rooms and to refurbish the existing thirty-seven rooms (for a total of one hundred rooms) and the city agreed to guaranty a construction loan to the YMCA for the project. The sixty-three rooms would be added by constructing three new floors on top of the YMCA's existing residential wing. The city and the YMCA agreed that the YMCA would operate the project in accordance with the YMCA's then-existing guidelines for its thirty-seven rooms, "as a single room occupancy residence for persons whose income is insufficient to allow them otherwise to afford safe and sanitary housing within the City of Ann Arbor." The project was completed in early 1991, but by May 1993 the YMCA defaulted on its construction loan, apparently because of insufficient revenues from the room rentals. Ultimately, the city paid the defaulted loan, and the YMCA and the city entered into a new management agreement in April 1995 regarding the YMCA's operation of the one hundred rooms. The 1995 agreement provided that the YMCA would continue to manage and operate the residence program "in accordance with its program guidelines, rules and regulations." The agreement provided that the YMCA would "continue to use its best efforts to refer residents to appropriate social agencies, including, but not limited to, mental health services, job skill and job placement services and assistance in finding permanent affordable housing. "(Emphasis added.) In a provision entitled "Rental Rate Limitation," the agreement stated:
The Y shall make available for rent on a monthly basis not less than eighty (80) of the units in the Residence Program at a rate not to exceed seventy-five (75%) percent of the fair market rent for an efficiency unit (zero bedrooms) established from time to time for the City by the U.S. Department of Housing and Urban Development (HUD). The above rental rate limitation shall not apply to twenty (20) of the units, and may only be increased beyond the above HUD guidelines with respect to the remaining eighty (80) units with the permission of the City. The Y may establish differentiated rental rates on a daily and weekly basis and if so, must establish reasonable policies regarding a resident's right to the appropriate rental rate.
The Ann Arbor Tenants Union sought a judicial declaration that the relationship of the YMCA to its residents is one of landlord and tenant and that the YMCA is therefore subject to the several statutes governing that relationship. The YMCA argued that the nature of its facility containing single-occupancy rooms is that of a hotel or public lodging house offering transitional shelter to its "guests" and that it is not subject to the *798 statutes applicable to landlords and tenants. The distinction between a guest and a tenant is significant whereby a guest is not entitled to notice of termination and can be the subject of self-help eviction, including a lockout, by the proprietor, while a tenant has protection against such measures. See M.C.L. § 600.2918; M.S.A. § 27A.2918, and see, generally, 2 Powell on Real Property, § 16.02[3][ii], p. 16-29; 40 Am.Jur.2d, Hotels, Motels, and Restaurants, § 68, p. 946; 49 Am.Jur.2d, Landlord and Tenant, § 2, pp. 49-50 and §§ 231-238, pp. 224-230; 52A CJS, Landlord and Tenant, § 752, p. 79. See also Poroznoff v. Alberti, 161 N.J.Super. 414, 419-423, 391 A.2d 984 (1978), aff'd. 168 N.J.Super. 140, 401 A.2d 1124 (1979), and cases cited therein.
Following the parties' cross-motions for summary disposition, the trial court determined that the YMCA is not a "hotel" and its residents are not "guests." The trial court held that the legal relationship between the YMCA and its residents is one of landlord-tenant and that the YMCA is subject to the statutes that apply to landlords and tenants.[7] We disagree with the trial court that the legal relationship of the YMCA and its residents is a landlord-tenant relationship and we hold that the relationship is one of hotel and guest.
II
In determining that a landlord-tenant relationship exists between the YMCA and its residents, the trial court was guided in large part by its examination of the 1995 agreement between the YMCA and the city of Ann Arbor, the YMCA's agreement and guest policy with its residents, and the relationship between the YMCA and its occupants. The court concluded that under the 1995 agreement with the city, the YMCA was obligated to provide rental housing for low and moderate income residents and that at least eighty percent of such housing must be provided on a monthly basis. The court further concluded that the YMCA operated in such a manner, rather than as a transient overnight or short-stay facility. We conclude that the trial court's determinations were erroneous.[8]
The legal relationship established by the renting of a room generally depends on the intention of the parties, gathered from the terms of the parties' contract, and interpreted in light of surrounding facts and circumstances. 40 Am.Jur.2d, Hotels, Motels, and Restaurants, § 14, p. 910; 49 Am.Jur.2d, Landlord and Tenant, § 21, p. 64; Powell, § 16.02[3][ii], p. 16-29; 1 Restatement Property, 2d, Landlord and Tenant, § 1.2, p. 10. The character of the relationship is ordinarily a question of law and fact. Id. Although the 1995 agreement between the city and the YMCA makes reference to the operation of a "residence program" and the provision of "housing," this does not operate as an admission that the YMCA is providing "rental housing" that gives rise to a landlord-tenant relationship. To be binding on the YMCA, such a statement must be made by a party or the party's attorney during the course of a trial and must be a distinct, formal admission solemnly made for the express purpose of dispensing with proof of a particular fact. Macke Laundry Service Co. v. Overgaard, 173 Mich.App. 250, 253, 433 N.W.2d 813 (1988). Even if it were an admission, an admission regarding a point of law is not binding on a court. Id. Elsewhere, the 1995 agreement specifically provides that the operation of the YMCA's units will be in accordance with the YMCA's existing guidelines, rules, and regulations for single-occupancy rooms and further provides that the YMCA will assist its residents in finding permanent housing. At the time of the agreement, as at the time of the proceedings in this case, the YMCA offered its rooms on a day-to-day basis, although discounted rates could be obtained for longer stays, and it did not offer permanent rental housing. That the purpose of the agreement is to provide short-term or transitional accommodations is evidenced by the inclusion in the *799 agreement of the provision that the YMCA will assist its residents in finding permanent housing.
We agree with the YMCA that it is not obligated under the paragraph entitled "Rental Rate Limitation" to provide at least eighty percent of its units as monthly rentals. Reading the eighty-room-requirement in context and guided by the stated intentions of the parties who signed the 1995 agreement, we conclude that the language in that paragraph refers to a limitation on the amount of rent that the YMCA may charge its occupants who stay a month, and does not serve to obligate the YMCA to provide monthly rental housing in at least eighty percent of its units. Affidavits submitted by the YMCA, which were unrebutted by the tenant's union, state that the purpose of the provision was to assure that those individuals who stayed at the YMCA for a month or longer would be charged a monthly room rate equivalent to seventy-five percent of the fair market rent level for a single-room occupancy unit as defined by HUD and was not intended to result in any change in the YMCA's traditional rental practices and procedures. The YMCA attested that it has never rented eighty percent of its rooms on a monthly basis. The city of Ann Arbor additionally attested that the eighty-room requirement originally was the basis for the rent structure for the rooms at the YMCA, but further attested that the rationale was no longer of any effect.
Finding nothing in the 1995 agreement between the YMCA and the city to dictate a result here, we now must determine whether the requisite elements of a landlord-tenant relationship are otherwise present in this case.
III
In Grant v. Detroit Ass'n of Women's Clubs, 443 Mich. 596, 605, n. 6, 505 N.W.2d 254 (1993), the Michigan Supreme Court set forth the essential characteristics for a landlord-tenant relationship:
It is generally held that, in order that the relation of landlord and tenant may exist, there must be present all the necessary elements of the relation, which include permission or consent on the part of the landlord to occupancy by the tenant, subordination of the landlord's title and rights on the part of the tenant, a reversion in the landlord, the creation of an estate in the tenant, the transfer of possession and control of the premises to him, and, generally speaking, a contract, either express or implied, between the parties. [Emphasis added.]
See 51C CJS, Landlord and Tenant, § 1, p. 32.[9]
The essential characteristics of a landlord-tenant relationship are not present in the relationship between the YMCA and its guests. The contract between the YMCA and its guests does not contain language evidencing an intent to form a landlord-tenant relationship. It is uncontested that the YMCA consents to the occupancy of its rooms; however, the consent is highly qualified and is limited to a guest's right to occupy a room on a day-to-day basis. Although there may be an agreed-upon duration of a guest's stay, it is a conditional agreement, with the YMCA specifically reserving the right to ask a guest to leave a room at any time. Also, the guest is free to leave at any time and is refunded any unused portion of payment that has been made in advance. In contrast, in a lease situation, a tenant's abandonment of the premises before the end of the term does not extinguish the tenant's obligation to pay the rent for the duration of the contracted-for stay and the tenant is liable for rent that accrues until the premises are rerented or the term expires. 2 Cameron, Michigan Real Property Law (ICLE, *800 1993), Landlord and Tenant, §§ 20.57, 20.58, p. 929. Further, in the contract between the instant parties, the YMCA expressly retains, rather than subordinates, its rights. As in De Bruyn Produce Co. v. Romero, 202 Mich.App. 92, 101, 508 N.W.2d 150 (1993), there is no language conveying a possessory interest in specific, designated property or providing for an occupant's exclusive use and possession of any property. Rather, the guest explicitly acknowledges that "he or she is not a tenant but a licensee on a day-to-day basis, and that Guest has no property or possessory interest in the room being rented to Guest."
It is this latter characteristic of exclusive possession and control of the premisesone that lies in the character of the possessionthat is the fundamental criteria in distinguishing between a tenant and a guest. 49 Am.Jur.2d, Landlord and Tenant, §§ 21, 22, pp. 64-65; Powell, § 16.02[3][ii], pp. 16-28 to 16-29; Restatement, § 1.2, p. 10 and Reporter's Note, pp. 12-13. See Buck v. Del City Apartments, Inc., 431 P.2d 360, 363 (Okla., 1967). A tenant has exclusive legal possession and control of the premises against the owner for the term of his leasehold, whereas a guest is a mere licensee and only has a right to use of the premises he occupies, subject to the proprietor's retention of control and right of access. Buck, supra; Poroznoff, supra, 161 N.J.Super. at 419-421, 391 A.2d 984; Green v. Watson, 224 Cal.App.2d 184, 36 Cal.Rptr. 362 (1964); 49 Am.Jur.2d, Landlord and Tenant, §§ 21, 22, pp. 64-65. In Grant, supra at 608, 505 N.W.2d 254, where the Michigan Supreme Court found that a tenancy existed, the Court specifically determined that there had been a transfer of possession and control by the defendant landlord to the plaintiff and that the plaintiff's occupation of the apartment was exclusive of the defendant. Here, although an occupant of the YMCA must be assigned a room for the occupant's exclusive use, the occupant's right to occupy it is subject to the YMCA's retention of control and right of access to the room, i.e., control over visitation in the room, control over storage of food and personal belongings in the room, retention of keys to the room, and retention of right of access to the room for such purposes as housekeeping and maintenance. See 40 Am.Jur.2d, Hotels, Motels, and Restaurants, § 61. In the instant case, the residents of the YMCA simply do not have the requisite exclusive possession and control of their premises during the period of their occupancy to give rise to a tenancy.
Our decision is buttressed by several cases that have examined room-rental situations to determine whether the essential characteristics of a landlord-tenant relationship are present.[10] In making that determination, these cases have examined various factors, including: whether the place holds itself out to be a "hotel" and accords its occupants the status of "guest"; whether there is a guest register; whether the occupant has a permanent residence elsewhere; whether there is a lease, either written or oral, and what rights and duties it spells out; whether the length of the stay is for an agreed-upon or definite duration, how long the stay is, and what the purpose of the stay is; whether rent is paid daily, weekly, or monthly; what services are provided, such as linens, housekeeping, heat, and electricity; whether the occupied premises include cooking or bathing facilities; what kind of furnishings are in the premises and to whom *801 they belong; and whether the proprietor's employees retain keys and access to the room. One's status as a guest is generally not affected by the fact that another pays for his accommodations. 40 Am.Jur.2d, Hotels, Motels, and Restaurants, § 24, p. 917. See, e.g., Bourque v. Morris, 190 Conn. 364, 460 A.2d 1251 (1983).[11]
Although the trial court in the instant case seemingly placed great weight on the fact that many of the YMCA's residents have a week-to-week or month-to-month duration of stay, the fact that a person who has been received as a guest remains for a considerable time or makes a special contract for the accommodations at a fixed rate per week or per month does not necessarily operate to terminate the relationship of hotel and guest. 40 Am.Jur.2d, Hotels, Motels, and Restaurants, § 26, pp. 918-919; Layton v. Seward Corp., 320 Mich. 418, 31 N.W.2d 678 (1948), Buck, supra, 431 P.2d at 364. The length of a person's stay and the rate or method of payment are merely evidentiary and not controlling. 40 Am.Jur.2d, Hotels, Motels, and Restaurants, §§ 22, 23.
Michigan has relatively few reported cases where the issue at hand has been examined. In Layton, supra at 420-421, 31 N.W.2d 678, the plaintiff, who was a jockey, and his wife occupied a room at the Seward Hotel in Detroit for four months during the riding season and paid rent by the month. The Michigan Supreme Court noted the following circumstances as criteria in the determination whether the plaintiff was a guest or a tenant of the hotel: there was no lease or definite term of tenancy, the place held itself out as a hotel and its occupants as guests, and only one room was occupied rather than a suite of rooms. Id. at 424, 31 N.W.2d 678. The Court concluded that the plaintiff was a guest of the hotel. Id. at 425, 31 N.W.2d 678. In reaching that conclusion, the Court noted that one's status as a guest is determined by a consideration of all the circumstances and the fact that payment for accommodations is made at a fixed rate per week or month is only one of the considerations. Id. at 424, 31 N.W.2d 678. See also Brams v. Briggs, 272 Mich. 38, 43, 260 N.W. 785 (1935) (a person is a lodger as opposed to a tenant where, although the person's stay is of a permanent nature and at a fixed rate, the person merely has use of his room, and the hotel management retains general control over the room and provides maid service).
In a case specifically involving a YMCA, the district court of New Jersey held that the relationship between a YMCA and its residents is that of hotel and guest. Poroznoff, supra, 161 N.J.Super. at 419-423, 391 A.2d 984. The court determined that where a YMCA, among other things, holds itself out as a place where sleeping accommodations are available to transient or permanent guests, maintains a contract or understanding with its residents that the relationship is one of an innkeeper and guest, and is intended to be occupied as a hotel, then it is a "hotel" and its occupants are "guests." Id. at 417-421, 391 A.2d 984. The court noted the traditional distinction, "held in the majority of other jurisdictions," between a "guest" and a "tenant"the distinction being the right of a tenant to exclusive legal possession and control and the right of a guest to mere use of the premises. Id. at 419-421, 391 A.2d 984. The district court held, and the superior appellate court affirmed, that a week-to-week resident of the YMCA did not *802 have the requisite possession and control of his room and was therefore not a tenant, despite the fact that the room was his only residence. Id. at 419-423, 391 A.2d 984; 168 N.J.Super. at 141-142, 401 A.2d 1124. Accordingly, the YMCA was not required to submit to statutory landlord-tenant procedures in evicting its residents. Id.
We believe that the holding in Poroznoff, supra, is equally applicable in the instant case. Most of the factors in this case are indicative of a hotel-guest relationship, not one of landlord and tenant. The facts indicate that the YMCA does hold itself out as a "hotel" pursuant to M.C.L. § 427.1; M.S.A. § 18.321, accords its residents the status of "guest," and provides accommodations on a daily basis, although longer stays may be arranged at a discounted rate. Although there may be an agreed-upon duration of a stay, the guest is free to leave at any time and is refunded the unused portion of any advance payment. In the guest agreement, the YMCA specifically reserves the right to terminate a guest's occupancy at any time and without any reason. The YMCA provides the furnishings in a room and provides traditional hotel amenities such as linens and housekeeping service. The rooms are not equipped with cooking or bathing facilities. The residents are prohibited from storing food or personal belongings in their rooms and specifically acknowledge that they have no possessory interest in their rooms. Visitation on the residents' floor and in the rooms is restricted by the YMCA. The residents are required to leave their room keys at the front desk when they leave the building, and the YMCA retains keys and access to the rooms. Upon examining the relationship between the parties, we conclude that the above factors provide compelling evidence that a hotel-guest, rather than a landlord-tenant, relationship exists between the parties.
IV
We therefore hold that despite the fact that the instant YMCA increased the capacity of its accommodations at the behest of and as financially supported by the City of Ann Arbor to provide additional single-occupancy rooms for low-income people, despite the fact that many occupants of the YMCA may stay on a month-to-month basis and receive discounted rates, despite the fact that payments for some of the rooms may be made or guaranteed by social agencies on behalf of occupants, and despite the fact that for some of the occupants the YMCA is their only residence, there is no relationship of landlord and tenant between the YMCA and its occupants because all the essential characteristics of such a relationshipespecially that of exclusive possession and controldo not exist. Grant, supra; Layton, supra; Poroznoff, supra. To hold otherwise would create an intolerable burden on the YMCA in its efforts to provide inexpensive temporary lodging for the very people it undertakes to serve, with a likely result being that those people would, in the end, be without accommodations. There being no landlord-tenant relationship, we also hold that the YMCA is not subject to those statutes that apply to landlords.
Because the remainder of the parties' issues are contingent on a determination by this Court that a landlord-tenant relationship exists in this case, we decline to address those issues.
Reversed.
NOTES
[1] The trial court held that the YMCA is subject to the provisions of the Truth in Renting Act, M.C.L. § 554.631 et seq.; M.S.A. § 26.1138(31) et seq., the landlord-tenant relationship act, M.C.L. § 554.601 et seq.; M.S.A. § 26.1138(1) et seq., and the forcible entry and detainer act, also referred to as the antilockout statute, M.C.L. § 600.2918; M.S.A. § 27A.2918. The trial court specifically declined to determine whether the YMCA had violated the Consumer Protection Act, M.C.L. § 445.901 et seq.; M.S.A. § 19.418(1) et seq.
[2] A "hotel" is defined by statute as a "building or structure kept, used, maintained as, or held out to the public to be an inn, hotel, or public lodging house," and does not include bed and breakfast establishments. M.C.L. § 427.1(b); M.S.A. § 18.321(b). For the purposes of this opinion, our use of the term "hotel" will thus be broadly construed to include the terms "inn" and "lodging houses," although we recognize that various authorities may distinguish among them. Similarly, guests, lodgers, and roomers will be referred to collectively in this opinion as "guests."
[3] In its 1995-96 annual catalogue, the Ann Arbor YMCA states its mission as follows:
"The Ann Arbor YMCA is a non-profit, independent, community-based membership organization that serves primarily youth, families and adults of Washtenaw County. It encourages fellowship, develops character and intellectual and physical skills, recreational activities and affordable living accommodations."
[4] In its opinion, the trial court noted that the YMCA requires each prospective resident to fill out a two-part "residential application form." The first part is primarily identification data, including employment and personal references; the second part, which is entitled "extended stay," requires detailed information about the applicant's medical, criminal, and military background and provides space for approval of weekly and monthly rental rates. When a room becomes available, an interview is conducted with the applicant covering the applicant's source of income, the desired length of stay, whether the applicant has an assigned social services case, and the rules and regulations of the YMCA.
[5] See n. 2, supra.
[6] As of January 17, 1996, fifty-eight of the one hundred rooms at the YMCA were being rented at a weekly rate and thirty-six rooms were being rented at a monthly rate. In an affidavit dated August 28, 1995, the YMCA stated that the median length of stay for a guest is thirty-one days.
[7] See n. 1, supra.
[8] We note that our review of the trial court's declaratory relief is de novo on the record. De-Bruyn Produce Co. v. Romero, 202 Mich.App. 92, 98, 508 N.W.2d 150 (1993). We will not reverse the trial court's findings of fact unless they are clearly erroneous.
[9] We note that the landlord-tenant relationship act, which generally regulates security deposits, defines "tenant" as any "person who occupies a rental unit for residential purposes with the landlord's consent for an agreed upon consideration." M.C.L. § 554.601(d); M.S.A. § 26.1138(1)(d). The definition is quite broad and would arguably apply here to regulate security deposits if the YMCA required them. However, the YMCA apparently does not require security deposits of its occupants. Therefore, in determining whether a landlord-tenant relationship is present in this case, we are guided by various authorities that have set forth and examined the fundamental characteristics of such a relationship.
[10] In addition to the cases discussed in the text of our decision, see Francis v. Trinidad Motel, 261 N.J.Super. 252, 618 A.2d 873 (1993) (individual who stayed in a hotel room for over two months, where he paid rent on a weekly basis and claimed it as his sole residence, was a "guest" and not a "tenant"); Bourque v. Morris, 190 Conn. 364, 460 A.2d 1251 (1983) (no landlord-tenant relationship where person stayed in a hotel room that had no toilet, cooking, or bathing facilities, even though person stayed for three months and rent was paid on weekly basis by city because the person was a welfare recipient); Buck, supra (occupant who had no other residence, who stayed for 1-1/2 months, and who paid on a weekly basis was a guest where the place held itself out as a motel, there was a registration area, accommodations were on a daily basis, and maid service was available); Sawyer v. Congress Square Hotel Co., 157 Me. Ill, 170 A.2d 645 (1961) (where furnishings were the property of the hotel, the hotel provided linens, cleaning service, heat, and electricity, and the hotel employees retained keys and access to a room, there was a hotel-guest relationship despite the fact that stay was a long one and that payment for a room was made on a weekly or monthly basis).
[11] In Universal Motor Lodges, Inc. v. Seignious, 146 Misc.2d 395, 550 N.Y.S.2d 800 (N.Y.Just.Ct., 1990), the court found a month-to-month tenancy where a "homeless person" had resided for over two years in a motel room that was paid for by the Department of Social Services and where accommodations were provided only to homeless public assistance recipients and not to the general public. In finding that the person was not a "transient," the court in Seignious was guided by various statutes in New York that define a transient as someone who resides for a period of ninety days or less. Id. at 395-397, 550 N.Y.S.2d 800. See also Mann v. 125 E 50th St. Corp., 124 Misc.2d 115, 475 N.Y.S.2d 777 (N.Y.City Civ.Ct., 1984), where under New York statute a tenant includes a resident, other than a transient, of a hotel who stays for thirty days or longer. Michigan does not have comparable statutes that define "tenant" by the length of a person's stay. Moreover, although social service agencies do guarantee payment for many of the residents at the YMCA in the present case, we are unaware of any residents who have stayed there for over two years. Further, the YMCA's accommodations are held out to the general public. The circumstances attendant to the New York cases are unlike those in the instant case.
|
2024-07-21T01:26:36.242652
|
https://example.com/article/1860
|
Q:
v-for doesn't output anything even though data is returned from the GET
Creating a VUE 2 app using NUXT. My async method returns data fine. But, for some reason my v-for doesn't produce any html markup.
The test data, as returned by my node.js api, via postman, is...
{
"status": true,
"message": [
{
"rating": [],
"_id": "5e113ce50d41592e38976e45",
"title": "Book 2",
"description": "This is amazon book2",
"photo": "https://amazon-clone-v1-rg.s3.amazonaws.com/xxxxx",
"stockQuantity": 14,
"price": 33,
"__v": 0
},
{
"rating": [],
"_id": "5e113cf00d41592e38976e46",
"title": "Book 1",
"description": "This is amazon book 1",
"photo": "https://amazon-clone-v1-rg.s3.us-east-2.amazonaws.com/xxxxx",
"stockQuantity": 14,
"price": 25,
"__v": 0
}
]
}
Here's my code...
<template>
<main>
<div class="a-spacing-large">
<div class="container-fluid browsing-history">
<div class="row">
<div class="col-sm-8 col-8">
<h1 class="a-size-large a-spacing-none a-text-normal">All Products</h1>
<div class="a-spacing-large"></div>
<!-- Button -->
<a href="#" class="a-button-buy-again">Add a new product</a>
<a href="#" class="a-button-history margin-right-10">Add a new category</a>
<a href="#" class="a-button-history margin-right-10">Add a new owner</a>
</div>
<!-- Listing page -->
</div>
</div>
</div>
<div class="a-spacing-large"></div>
<div class="container-fluid browsing-history">
<div class="row">
<div
v-for="(product, index) in products"
:key="product._id"
class="col-xl-2 col-lg-2 col-md-3 col-sm-6 col-6 br bb"
>
<div class="history-box">
<!-- Product image -->
<a href="#" class="a-link-normal">
<img :src="product.photo" class="img-fluid" />
</a>
<!-- Product title -->
<div class="a-spacing-top-base asin-title">
<span class="a-text-normal">
<div class="pl3n-sc-truncated">{{product.title}}</div>
</span>
</div>
<!-- Product rating -->
<div class="a-row">
<a href="#">
<i class="fas fa-star"></i>
<i class="fas fa-star"></i>
<i class="fas fa-star"></i>
<i class="fas fa-star"></i>
<i class="fas fa-star"></i>
</a>
<span class="a-letter-space"></span>
<span class="a-color-tertiary a-size-small asin-reviews">(1732)</span>
</div>
<!-- Product price -->
<div class="a-row">
<span class="a-size-base a-color-price">
<span class="pl3n-sc-price">${{product.price}}</span>
</span>
</div>
</div>
<!-- Product Buttons -->
<div class="a-row">
<a href="#" class="a-button-history margin-right-10">Update</a>
<a href="#" class="a-button-history margin-right-10">Delete</a>
</div>
</div>
</div>
</div>
</main>
</template>
<script>
export default {
async asyncData({ $axios }) {
try {
let response = await $axios.$get("http://localhost:3000/api/products");
console.log(response);
return {
products: response.products
};
} catch (err) {
console.log("error in code: " + err);
}
}
};
</script>
I even tried a very simple v-for loop like this, but it also returned no data...
<ul>
<li v-for="(product, index) in products">{{product.title}}</li>
</ul>
Any suggestions would be appreciated. Thanks!
A:
In your front-end you should return {products: response.message} because the field called message have yours "products" list.
or
In your API back-end should be use products instead of message to return your "product" list then you could be used as you mentioned.
|
2023-12-23T01:26:36.242652
|
https://example.com/article/2174
|
package entities
import (
"io"
"net/url"
"os"
"time"
"github.com/containers/image/v5/types"
"github.com/containers/podman/v2/libpod/define"
"github.com/containers/podman/v2/pkg/specgen"
"github.com/cri-o/ocicni/pkg/ocicni"
)
// ContainerRunlabelOptions are the options to execute container-runlabel.
type ContainerRunlabelOptions struct {
// Authfile - path to an authentication file.
Authfile string
// CertDir - path to a directory containing TLS certifications and
// keys.
CertDir string
// Credentials - `user:password` to use when pulling an image.
Credentials string
// Display - do not execute but print the command.
Display bool
// Replace - replace an existing container with a new one from the
// image.
Replace bool
// Name - use this name when executing the runlabel container.
Name string
// Optional1 - fist optional parameter for install.
Optional1 string
// Optional2 - second optional parameter for install.
Optional2 string
// Optional3 - third optional parameter for install.
Optional3 string
// Pull - pull the specified image if it's not in the local storage.
Pull bool
// Quiet - suppress output when pulling images.
Quiet bool
// SignaturePolicy - path to a signature-policy file.
SignaturePolicy string
// SkipTLSVerify - skip HTTPS and certificate verifications when
// contacting registries.
SkipTLSVerify types.OptionalBool
}
// ContainerRunlabelReport contains the results from executing container-runlabel.
type ContainerRunlabelReport struct {
}
type WaitOptions struct {
Condition define.ContainerStatus
Interval time.Duration
Latest bool
}
type WaitReport struct {
Id string //nolint
Error error
ExitCode int32
}
type BoolReport struct {
Value bool
}
// StringSliceReport wraps a string slice.
type StringSliceReport struct {
Value []string
}
type PauseUnPauseOptions struct {
All bool
}
type PauseUnpauseReport struct {
Err error
Id string //nolint
}
type StopOptions struct {
All bool
CIDFiles []string
Ignore bool
Latest bool
Timeout *uint
}
type StopReport struct {
Err error
Id string //nolint
}
type TopOptions struct {
// CLI flags.
ListDescriptors bool
Latest bool
// Options for the API.
Descriptors []string
NameOrID string
}
type KillOptions struct {
All bool
Latest bool
Signal string
}
type KillReport struct {
Err error
Id string //nolint
}
type RestartOptions struct {
All bool
Latest bool
Running bool
Timeout *uint
}
type RestartReport struct {
Err error
Id string //nolint
}
type RmOptions struct {
All bool
CIDFiles []string
Force bool
Ignore bool
Latest bool
Storage bool
Volumes bool
}
type RmReport struct {
Err error
Id string //nolint
}
type ContainerInspectReport struct {
*define.InspectContainerData
}
type CommitOptions struct {
Author string
Changes []string
Format string
ImageName string
IncludeVolumes bool
Message string
Pause bool
Quiet bool
Writer io.Writer
}
type CommitReport struct {
Id string //nolint
}
type ContainerExportOptions struct {
Output string
}
type CheckpointOptions struct {
All bool
Export string
IgnoreRootFS bool
Keep bool
Latest bool
LeaveRunning bool
TCPEstablished bool
}
type CheckpointReport struct {
Err error
Id string //nolint
}
type RestoreOptions struct {
All bool
IgnoreRootFS bool
IgnoreStaticIP bool
IgnoreStaticMAC bool
Import string
Keep bool
Latest bool
Name string
TCPEstablished bool
}
type RestoreReport struct {
Err error
Id string //nolint
}
type ContainerCreateReport struct {
Id string //nolint
}
// AttachOptions describes the cli and other values
// needed to perform an attach
type AttachOptions struct {
DetachKeys string
Latest bool
NoStdin bool
SigProxy bool
Stdin *os.File
Stdout *os.File
Stderr *os.File
}
// ContainerLogsOptions describes the options to extract container logs.
type ContainerLogsOptions struct {
// Show extra details provided to the logs.
Details bool
// Follow the log output.
Follow bool
// Display logs for the latest container only. Ignored on the remote client.
Latest bool
// Show container names in the output.
Names bool
// Show logs since this timestamp.
Since time.Time
// Number of lines to display at the end of the output.
Tail int64
// Show timestamps in the logs.
Timestamps bool
// Write the logs to Writer.
Writer io.Writer
}
// ExecOptions describes the cli values to exec into
// a container
type ExecOptions struct {
Cmd []string
DetachKeys string
Envs map[string]string
Interactive bool
Latest bool
PreserveFDs uint
Privileged bool
Tty bool
User string
WorkDir string
}
// ContainerStartOptions describes the val from the
// CLI needed to start a container
type ContainerStartOptions struct {
Attach bool
DetachKeys string
Interactive bool
Latest bool
SigProxy bool
Stdout *os.File
Stderr *os.File
Stdin *os.File
}
// ContainerStartReport describes the response from starting
// containers from the cli
type ContainerStartReport struct {
Id string //nolint
RawInput string
Err error
ExitCode int
}
// ContainerListOptions describes the CLI options
// for listing containers
type ContainerListOptions struct {
All bool
Filters map[string][]string
Format string
Last int
Latest bool
Namespace bool
Pod bool
Quiet bool
Size bool
Sort string
Storage bool
Sync bool
Watch uint
}
// ContainerRunOptions describes the options needed
// to run a container from the CLI
type ContainerRunOptions struct {
Detach bool
DetachKeys string
ErrorStream *os.File
InputStream *os.File
OutputStream *os.File
PreserveFDs uint
Rm bool
SigProxy bool
Spec *specgen.SpecGenerator
}
// ContainerRunReport describes the results of running
// a container
type ContainerRunReport struct {
ExitCode int
Id string //nolint
}
// ContainerCleanupOptions are the CLI values for the
// cleanup command
type ContainerCleanupOptions struct {
All bool
Exec string
Latest bool
Remove bool
RemoveImage bool
}
// ContainerCleanupReport describes the response from a
// container cleanup
type ContainerCleanupReport struct {
CleanErr error
Id string //nolint
RmErr error
RmiErr error
}
// ContainerInitOptions describes input options
// for the container init cli
type ContainerInitOptions struct {
All bool
Latest bool
}
// ContainerInitReport describes the results of a
// container init
type ContainerInitReport struct {
Err error
Id string //nolint
}
//ContainerMountOptions describes the input values for mounting containers
// in the CLI
type ContainerMountOptions struct {
All bool
Format string
Latest bool
NoTruncate bool
}
// ContainerUnmountOptions are the options from the cli for unmounting
type ContainerUnmountOptions struct {
All bool
Force bool
Latest bool
}
// ContainerMountReport describes the response from container mount
type ContainerMountReport struct {
Err error
Id string //nolint
Name string
Path string
}
// ContainerUnmountReport describes the response from umounting a container
type ContainerUnmountReport struct {
Err error
Id string //nolint
}
// ContainerPruneOptions describes the options needed
// to prune a container from the CLI
type ContainerPruneOptions struct {
Filters url.Values `json:"filters" schema:"filters"`
}
// ContainerPruneReport describes the results after pruning the
// stopped containers.
type ContainerPruneReport struct {
ID map[string]int64
Err map[string]error
}
// ContainerPortOptions describes the options to obtain
// port information on containers
type ContainerPortOptions struct {
All bool
Latest bool
}
// ContainerPortReport describes the output needed for
// the CLI to output ports
type ContainerPortReport struct {
Id string //nolint
Ports []ocicni.PortMapping
}
// ContainerCpOptions describes input options for cp
type ContainerCpOptions struct {
Pause bool
Extract bool
}
// ContainerCpReport describes the output from a cp operation
type ContainerCpReport struct {
}
// ContainerStatsOptions describes input options for getting
// stats on containers
type ContainerStatsOptions struct {
// Operate on the latest known container. Only supported for local
// clients.
Latest bool
// Stream stats.
Stream bool
}
// ContainerStatsReport is used for streaming container stats.
type ContainerStatsReport struct {
// Error from reading stats.
Error error
// Results, set when there is no error.
Stats []define.ContainerStats
}
|
2023-08-02T01:26:36.242652
|
https://example.com/article/5786
|
/* This file was generated by upbc (the upb compiler) from the input
* file:
*
* gogoproto/gogo.proto
*
* Do not edit -- your changes will be discarded when the file is
* regenerated. */
#include <stddef.h>
#include "upb/msg.h"
#include "gogoproto/gogo.upb.h"
#include "google/protobuf/descriptor.upb.h"
#include "upb/port_def.inc"
#include "upb/port_undef.inc"
|
2023-08-11T01:26:36.242652
|
https://example.com/article/4671
|
WTB: Really, really beaten up Nikon F
I'm looking for a very worn Nikon F (or possibly F2) to use as a prop for a folio I'm currently shooting. It is supposed to belong to a war photographer, so should look like it has been dragged all over south-east asia - brassy, scratched and dented. It doesn't need to work, but should look complete and have a finder. You'd think it would be easy to find a junk F, but almost all of the hundreds of Fs on eBay are pristine/rare/overpriced and while KEH has a few options in a more realistic price range they might still be too nice for my needs. Does anyone have anything sitting in their junk box that might do? Lens not necessary, but if you have a broken 50 that fits that would be a bonus.
I live in Australia so be aware that this will probably involve overseas postage and PayPal.
If you have a suitable relic please PM me, or email paulewins(at)optusnet(dot)com(dot)au
|
2023-10-07T01:26:36.242652
|
https://example.com/article/9172
|
Venezuelan President Hugo Chavez has threatened to stop selling oil to European countries if they apply a new ruling on illegal immigrants that has been condemned by human rights groups.
European Union lawmakers ruled on Wednesday (local time) that illegal immigrants can be detained for up to 18 months and face a re-entry ban of up to five years.
"We can't just stand by with our arms crossed," Mr Chavez said at an event to celebrate his OPEC country's oil supplies to South America.
The socialist ally of Cuba also warned he could review the investment of European Union nations that apply the measure.
He did not elaborate.
Mr Chavez has regularly issued conditional threats to halt crude shipments from Venezuela, one of the world's largest exporters of oil, although he has never followed through on a move that would hurt supplies at a time of record prices.
- Reuters
|
2024-04-02T01:26:36.242652
|
https://example.com/article/4948
|
NF-kappaB/p65 antagonizes Nrf2-ARE pathway by depriving CBP from Nrf2 and facilitating recruitment of HDAC3 to MafK.
Constitutively activated NF-kappaB occurs in many inflammatory and tumor tissues. Does it interfere with anti-inflammatory or anti-tumor signaling pathway? Here, we report that NF-kappaB p65 subunit repressed the Nrf2-antioxidant response element (ARE) pathway at transcriptional level. In the cells where NF-kappaB and Nrf2 were simultaneously activated, p65 unidirectionally antagonized the transcriptional activity of Nrf2. In the p65-overexpressing cells, the ARE-dependent expression of heme oxygenase-1 was strongly suppressed. However, p65 inhibited the ARE-driven gene transcription in a way that was independent of its own transcriptional activity. Two mechanisms were found to coordinate the p65-mediated repression of ARE: (1) p65 selectively deprives CREB binding protein (CBP) from Nrf2 by competitive interaction with the CH1-KIX domain of CBP, which results in inactivation of Nrf2. The inactivation depends on PKA catalytic subunit-mediated phosphorylation of p65 at S276. (2) p65 promotes recruitment of histone deacetylase 3 (HDAC3), the corepressor, to ARE by facilitating the interaction of HDAC3 with either CBP or MafK, leading to local histone hypoacetylation. This investigation revealed the participation of NF-kappaB p65 in the negative regulation of Nrf2-ARE signaling, and might provide a new insight into a possible role of NF-kappaB in suppressing the expression of anti-inflammatory or anti-tumor genes.
|
2024-06-13T01:26:36.242652
|
https://example.com/article/9004
|
// Copyright 2018 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "services/audio/loopback_stream.h"
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <memory>
#include "base/bind.h"
#include "base/containers/unique_ptr_adapters.h"
#include "base/memory/scoped_refptr.h"
#include "base/test/task_environment.h"
#include "base/unguessable_token.h"
#include "media/base/audio_parameters.h"
#include "media/base/audio_timestamp_helper.h"
#include "media/base/channel_layout.h"
#include "mojo/public/cpp/bindings/pending_receiver.h"
#include "mojo/public/cpp/bindings/pending_remote.h"
#include "mojo/public/cpp/bindings/receiver.h"
#include "mojo/public/cpp/bindings/remote.h"
#include "services/audio/loopback_coordinator.h"
#include "services/audio/loopback_group_member.h"
#include "services/audio/test/fake_consumer.h"
#include "services/audio/test/fake_loopback_group_member.h"
#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"
using testing::_;
using testing::Mock;
using testing::NiceMock;
using testing::StrictMock;
namespace audio {
namespace {
// Volume settings for the FakeLoopbackGroupMember (source) and LoopbackStream.
constexpr double kSnoopVolume = 0.25;
constexpr double kLoopbackVolume = 0.5;
// Piano key frequencies.
constexpr double kMiddleAFreq = 440;
constexpr double kMiddleCFreq = 261.626;
// Audio buffer duration.
constexpr base::TimeDelta kBufferDuration =
base::TimeDelta::FromMilliseconds(10);
// Local audio output delay.
constexpr base::TimeDelta kDelayUntilOutput =
base::TimeDelta::FromMilliseconds(20);
// The amount of audio signal to record each time PumpAudioAndTakeNewRecording()
// is called.
constexpr base::TimeDelta kTestRecordingDuration =
base::TimeDelta::FromMilliseconds(250);
const media::AudioParameters& GetLoopbackStreamParams() {
// 48 kHz, 2-channel audio, with 10 ms buffers.
static const media::AudioParameters params(
media::AudioParameters::AUDIO_PCM_LOW_LATENCY,
media::CHANNEL_LAYOUT_STEREO, 48000, 480);
return params;
}
class MockClientAndObserver : public media::mojom::AudioInputStreamClient,
public media::mojom::AudioInputStreamObserver {
public:
MockClientAndObserver() = default;
~MockClientAndObserver() override = default;
void Bind(mojo::PendingReceiver<media::mojom::AudioInputStreamClient>
client_receiver,
mojo::PendingReceiver<media::mojom::AudioInputStreamObserver>
observer_receiver) {
client_receiver_.Bind(std::move(client_receiver));
observer_receiver_.Bind(std::move(observer_receiver));
}
void CloseClientBinding() { client_receiver_.reset(); }
void CloseObserverBinding() { observer_receiver_.reset(); }
MOCK_METHOD0(OnError, void());
MOCK_METHOD0(DidStartRecording, void());
void OnMutedStateChanged(bool) override { NOTREACHED(); }
private:
mojo::Receiver<media::mojom::AudioInputStreamClient> client_receiver_{this};
mojo::Receiver<media::mojom::AudioInputStreamObserver> observer_receiver_{
this};
};
// Subclass of FakeConsumer that adapts the SyncWriter interface to allow the
// tests to record and analyze the audio data from the LoopbackStream.
class FakeSyncWriter : public FakeConsumer, public InputController::SyncWriter {
public:
FakeSyncWriter(int channels, int sample_rate)
: FakeConsumer(channels, sample_rate) {}
~FakeSyncWriter() override = default;
void Clear() {
FakeConsumer::Clear();
last_capture_time_ = base::TimeTicks();
}
// media::AudioInputController::SyncWriter implementation.
void Write(const media::AudioBus* data,
double volume,
bool key_pressed,
base::TimeTicks capture_time) final {
FakeConsumer::Consume(*data);
// Capture times should be monotonically increasing.
if (!last_capture_time_.is_null()) {
CHECK_LT(last_capture_time_, capture_time);
}
last_capture_time_ = capture_time;
}
void Close() final {}
base::TimeTicks last_capture_time_;
};
class LoopbackStreamTest : public testing::Test {
public:
LoopbackStreamTest() : group_id_(base::UnguessableToken::Create()) {}
~LoopbackStreamTest() override = default;
void TearDown() override {
stream_ = nullptr;
for (const auto& source : sources_) {
coordinator_.UnregisterMember(group_id_, source.get());
}
sources_.clear();
task_environment_.FastForwardUntilNoTasksRemain();
}
MockClientAndObserver* client() { return &client_; }
LoopbackStream* stream() { return stream_.get(); }
FakeSyncWriter* consumer() { return consumer_; }
void RunMojoTasks() { task_environment_.RunUntilIdle(); }
FakeLoopbackGroupMember* AddSource(int channels, int sample_rate) {
sources_.emplace_back(std::make_unique<FakeLoopbackGroupMember>(
media::AudioParameters(media::AudioParameters::AUDIO_PCM_LOW_LATENCY,
media::GuessChannelLayout(channels), sample_rate,
(sample_rate * kBufferDuration) /
base::TimeDelta::FromSeconds(1))));
coordinator_.RegisterMember(group_id_, sources_.back().get());
return sources_.back().get();
}
void RemoveSource(FakeLoopbackGroupMember* source) {
const auto it = std::find_if(sources_.begin(), sources_.end(),
base::MatchesUniquePtr(source));
if (it != sources_.end()) {
coordinator_.UnregisterMember(group_id_, source);
sources_.erase(it);
}
}
void CreateLoopbackStream() {
CHECK(!stream_);
mojo::PendingRemote<media::mojom::AudioInputStreamClient> client;
mojo::PendingRemote<media::mojom::AudioInputStreamObserver> observer;
client_.Bind(client.InitWithNewPipeAndPassReceiver(),
observer.InitWithNewPipeAndPassReceiver());
stream_ = std::make_unique<LoopbackStream>(
base::BindOnce([](media::mojom::ReadOnlyAudioDataPipePtr pipe) {
EXPECT_TRUE(pipe->shared_memory.IsValid());
EXPECT_TRUE(pipe->socket.is_valid());
}),
base::BindOnce([](LoopbackStreamTest* self,
LoopbackStream* stream) { self->stream_ = nullptr; },
this),
task_environment_.GetMainThreadTaskRunner(),
remote_input_stream_.BindNewPipeAndPassReceiver(), std::move(client),
std::move(observer), GetLoopbackStreamParams(),
// The following argument is the |shared_memory_count|, which does not
// matter because the SyncWriter will be overridden with FakeSyncWriter
// below.
1, &coordinator_, group_id_);
// Override the clock used by the LoopbackStream so that everything is
// single-threaded and synchronized with the driving code in these tests.
stream_->set_clock_for_testing(task_environment_.GetMockTickClock());
// Redirect the output of the LoopbackStream to a FakeSyncWriter.
// LoopbackStream takes ownership of the FakeSyncWriter.
auto consumer = std::make_unique<FakeSyncWriter>(
GetLoopbackStreamParams().channels(),
GetLoopbackStreamParams().sample_rate());
CHECK(!consumer_);
consumer_ = consumer.get();
stream_->set_sync_writer_for_testing(std::move(consumer));
// Set the volume for the LoopbackStream.
remote_input_stream_->SetVolume(kLoopbackVolume);
// Allow all pending mojo tasks for all of the above to run and propagate
// state.
RunMojoTasks();
ASSERT_TRUE(remote_input_stream_);
}
void StartLoopbackRecording() {
ASSERT_EQ(0, consumer_->GetRecordedFrameCount());
remote_input_stream_->Record();
RunMojoTasks();
}
void SetLoopbackVolume(double volume) {
remote_input_stream_->SetVolume(volume);
RunMojoTasks();
}
void PumpAudioAndTakeNewRecording() {
consumer_->Clear();
const int min_frames_to_record = media::AudioTimestampHelper::TimeToFrames(
kTestRecordingDuration, GetLoopbackStreamParams().sample_rate());
do {
// Render audio meant for local output at some point in the near
// future.
const base::TimeTicks output_timestamp =
task_environment_.NowTicks() + kDelayUntilOutput;
for (const auto& source : sources_) {
source->RenderMoreAudio(output_timestamp);
}
// Move the task runner forward, which will cause the FlowNetwork's
// delayed tasks to run, which will generate output for the consumer.
task_environment_.FastForwardBy(kBufferDuration);
} while (consumer_->GetRecordedFrameCount() < min_frames_to_record);
}
void CloseInputStreamPtr() {
remote_input_stream_.reset();
RunMojoTasks();
}
private:
base::test::TaskEnvironment task_environment_{
base::test::TaskEnvironment::TimeSource::MOCK_TIME};
LoopbackCoordinator coordinator_;
const base::UnguessableToken group_id_;
std::vector<std::unique_ptr<FakeLoopbackGroupMember>> sources_;
NiceMock<MockClientAndObserver> client_;
std::unique_ptr<LoopbackStream> stream_;
FakeSyncWriter* consumer_ = nullptr; // Owned by |stream_|.
mojo::Remote<media::mojom::AudioInputStream> remote_input_stream_;
DISALLOW_COPY_AND_ASSIGN(LoopbackStreamTest);
};
TEST_F(LoopbackStreamTest, ShutsDownStreamWhenInterfacePtrIsClosed) {
CreateLoopbackStream();
EXPECT_CALL(*client(), DidStartRecording());
StartLoopbackRecording();
PumpAudioAndTakeNewRecording();
EXPECT_CALL(*client(), OnError());
CloseInputStreamPtr();
EXPECT_FALSE(stream());
Mock::VerifyAndClearExpectations(client());
}
TEST_F(LoopbackStreamTest, ShutsDownStreamWhenClientBindingIsClosed) {
CreateLoopbackStream();
EXPECT_CALL(*client(), DidStartRecording());
StartLoopbackRecording();
PumpAudioAndTakeNewRecording();
// Note: Expect no call to client::OnError() because it is the client binding
// that is being closed and causing the error.
EXPECT_CALL(*client(), OnError()).Times(0);
client()->CloseClientBinding();
RunMojoTasks();
EXPECT_FALSE(stream());
Mock::VerifyAndClearExpectations(client());
}
TEST_F(LoopbackStreamTest, ShutsDownStreamWhenObserverBindingIsClosed) {
CreateLoopbackStream();
EXPECT_CALL(*client(), DidStartRecording());
StartLoopbackRecording();
PumpAudioAndTakeNewRecording();
EXPECT_CALL(*client(), OnError());
client()->CloseObserverBinding();
RunMojoTasks();
EXPECT_FALSE(stream());
Mock::VerifyAndClearExpectations(client());
}
TEST_F(LoopbackStreamTest, ProducesSilenceWhenNoMembersArePresent) {
CreateLoopbackStream();
EXPECT_CALL(*client(), DidStartRecording());
StartLoopbackRecording();
PumpAudioAndTakeNewRecording();
for (int ch = 0; ch < GetLoopbackStreamParams().channels(); ++ch) {
SCOPED_TRACE(testing::Message() << "ch=" << ch);
EXPECT_TRUE(consumer()->IsSilent(ch));
}
}
// Syntatic sugar to confirm a tone exists and its amplitude matches
// expectations.
#define EXPECT_TONE(ch, frequency, expected_amplitude) \
{ \
SCOPED_TRACE(testing::Message() << "ch=" << ch); \
const double amplitude = consumer()->ComputeAmplitudeAt( \
ch, frequency, consumer()->GetRecordedFrameCount()); \
VLOG(1) << "For ch=" << ch << ", amplitude at frequency=" << frequency \
<< " is " << amplitude; \
EXPECT_NEAR(expected_amplitude, amplitude, 0.01); \
}
TEST_F(LoopbackStreamTest, ProducesAudioFromASingleSource) {
FakeLoopbackGroupMember* const source =
AddSource(1, 48000); // Monaural, 48 kHz.
source->SetChannelTone(0, kMiddleAFreq);
source->SetVolume(kSnoopVolume);
CreateLoopbackStream();
EXPECT_CALL(*client(), DidStartRecording());
StartLoopbackRecording();
PumpAudioAndTakeNewRecording();
// Expect to have recorded middle-A in all of the loopback stream's channels.
for (int ch = 0; ch < GetLoopbackStreamParams().channels(); ++ch) {
EXPECT_TONE(ch, kMiddleAFreq, kSnoopVolume * kLoopbackVolume);
}
}
TEST_F(LoopbackStreamTest, ProducesAudioFromTwoSources) {
// Start the first source (of a middle-A note) before creating the loopback
// stream.
const int channels = GetLoopbackStreamParams().channels();
FakeLoopbackGroupMember* const source1 = AddSource(channels, 48000);
source1->SetChannelTone(0, kMiddleAFreq);
source1->SetVolume(kSnoopVolume);
CreateLoopbackStream();
EXPECT_CALL(*client(), DidStartRecording());
StartLoopbackRecording();
PumpAudioAndTakeNewRecording();
// Start the second source (of a middle-C note) while the loopback stream is
// running. The second source has a different sample rate than the first.
FakeLoopbackGroupMember* const source2 = AddSource(channels, 44100);
source2->SetChannelTone(1, kMiddleCFreq);
source2->SetVolume(kSnoopVolume);
PumpAudioAndTakeNewRecording();
// Expect to have recorded both middle-A and middle-C in all of the loopback
// stream's channels.
EXPECT_TONE(0, kMiddleAFreq, kSnoopVolume * kLoopbackVolume);
EXPECT_TONE(1, kMiddleCFreq, kSnoopVolume * kLoopbackVolume);
// Switch the channels containig the tone in both sources, and expect to see
// the tones have switched channels in the loopback output.
source1->SetChannelTone(0, 0.0);
source1->SetChannelTone(1, kMiddleAFreq);
source2->SetChannelTone(0, kMiddleCFreq);
source2->SetChannelTone(1, 0.0);
PumpAudioAndTakeNewRecording();
EXPECT_TONE(1, kMiddleAFreq, kSnoopVolume * kLoopbackVolume);
EXPECT_TONE(0, kMiddleCFreq, kSnoopVolume * kLoopbackVolume);
}
TEST_F(LoopbackStreamTest, AudioChangesVolume) {
FakeLoopbackGroupMember* const source =
AddSource(1, 48000); // Monaural, 48 kHz.
source->SetChannelTone(0, kMiddleAFreq);
source->SetVolume(kSnoopVolume);
CreateLoopbackStream();
StartLoopbackRecording();
PumpAudioAndTakeNewRecording();
// Record and check the amplitude at the default volume settings.
double expected_amplitude = kSnoopVolume * kLoopbackVolume;
for (int ch = 0; ch < GetLoopbackStreamParams().channels(); ++ch) {
EXPECT_TONE(ch, kMiddleAFreq, expected_amplitude);
}
// Double the volume of the source and expect the output to have also doubled.
source->SetVolume(kSnoopVolume * 2);
PumpAudioAndTakeNewRecording();
expected_amplitude *= 2;
for (int ch = 0; ch < GetLoopbackStreamParams().channels(); ++ch) {
EXPECT_TONE(ch, kMiddleAFreq, expected_amplitude);
}
// Drop the LoopbackStream volume by 1/3 and expect the output to also have
// dropped by 1/3.
SetLoopbackVolume(kLoopbackVolume / 3);
PumpAudioAndTakeNewRecording();
expected_amplitude /= 3;
for (int ch = 0; ch < GetLoopbackStreamParams().channels(); ++ch) {
EXPECT_TONE(ch, kMiddleAFreq, expected_amplitude);
}
}
} // namespace
} // namespace audio
|
2024-03-21T01:26:36.242652
|
https://example.com/article/2072
|
Sauerkraut sauce recipe
Method:Squeeze sauerkraut, pour over boiling broth or water and stew in the covered pan for 1,5 hour. Add sugar (you can add vinegar on your taste), salt and bring to boil. Pound butter with flour and stir in the sauce, bring to boil. Serve to fried poultry.
|
2023-12-24T01:26:36.242652
|
https://example.com/article/8520
|
Interleukin-2, soluble interleukin-2-receptor, neopterin, L-tryptophan and beta 2-microglobulin levels in CSF and serum of patients with relapsing-remitting or chronic-progressive multiple sclerosis.
Cerebrospinal fluid (CSF) and serum levels of interleukin-2 (IL-2), soluble IL-2 receptors (sIL-2R), neopterin, L-tryptophan (L-TRP) and beta 2-microglobulin (beta 2-M) were measured in 31 untreated multiple sclerosis patients in acute exacerbation and 27 normal controls. Twenty-six patients showed the relapsing-remitting type of disease (RRMS); 5 had a chronic-progressive course (CPMS). No changes in serum IL-2 and sIL-2R were found between RRMS patients and controls, whereas serum and CSF levels as well as the CSF/serum ratio of neopterin were significantly elevated in the RRMS group. IL-2 was not detectable in CSF of patients or controls and sIL-2R levels were at the level of the lower detection (LD) sensitivity of the ELISA method. Four of 23 RRMS patients versus 1 of 25 controls showed CSF sIL-2R levels above the LD sensitivity, indicating a trend towards elevation in acute relapse. No difference was found in serum and CSF L-TRP and beta 2-M of patients and controls. In CSF of RRMS patients neopterin and L-TRP correlated negatively, reflecting the interferon-gamma mediated activation of macrophages in acute relapse. A significant positive correlation (Spearman rank 0.57, P = 0.001) between serum IL-2 levels and duration of acute relapse (mean 30 days) warrants further evaluation.
|
2023-12-11T01:26:36.242652
|
https://example.com/article/8976
|
### -*-Makefile-*-
# Copyright (c) 2018 Bluespec, Inc. All Rights Reserved
# ================================================================
# Regression: run all ISA tests relevant for the chosen simulator
# ----------------
# Choose a prefix for the simulation executable dir
ARCH ?= RV32IMU
# ARCH ?= RV32ACIMSU
# ARCH ?= RV64IMU
# ARCH ?= RV64ACIMSU
# ----------------
# Choose a simulation engine
SIM ?= Bluesim
# SIM ?= iverilog
# SIM ?= verilator
# ----------------
# Optionally choose an architecture explicitly,
# overriding the simulation executable path
OPTARCH ?=
# ----------------
SIM_DIR = ../builds/$(ARCH)_$(SIM)
# ================================================================
.PHONY: test
test:
@echo "Running regressions; saving logs in Logs/"
./Run_regression.py \
$(SIM_DIR)/exe_HW_sim \
./isa ./Logs $(OPTARCH)
@echo "Finished running regressions; saved logs in Logs/"
# ================================================================
.PHONY: clean
clean:
rm *~
.PHONY: full_clean
full_clean:
rm -r -f *~ Logs *.log
|
2024-06-28T01:26:36.242652
|
https://example.com/article/9734
|
Q:
How should I define interfaces of documents when using Typescript and Mongodb?
Consider a simple user collection:
// db.ts
export interface User {
_id: mongodb.ObjectId;
username: string;
password: string;
somethingElse: string;
}
// user.ts
import {User} from "../db"
router.get("/:id", async (req, res) => {
const id = req.params.id;
// user._id is a mongodb.Object.
const user: User = await db.getUser(id);
res.send(user);
});
// index.ts
// code that will runs on browser
import {User} from "../../db"
$.get('/user/...').done((user: User) => {
// user._id is string.
console.log(user._id);
});
It works perfectly until I want to use this interface in client codes. Because the _id of user becomes a hex string when tranmitted as json from server. If I set _id to be mongodb.ObjectId | string, the behavior gets wierd.
A:
You can try to separate them in a smart way :
interface User {
username: string;
password: string;
somethingElse: string;
}
export interface UserJSON extends User {
_id : string
}
export interface UserDB extends User {
_id : mongodb.ObjectId
}
and later take either UserJSON ( client ) or UserDB ( server-side ).
|
2023-09-01T01:26:36.242652
|
https://example.com/article/9263
|
Pyrroloquinoline quinone biosynthesis in Escherichia coli through expression of the Gluconobacter oxydans pqqABCDE gene cluster.
We have expressed the pqqABCDE gene cluster from Gluconobacter oxydans, which is involved in pyrroloquinoline quinone (PQQ) biosynthesis, in Escherichia coli, resulting in PQQ accumulation in the medium. Since the gene cluster does not include the tldD gene needed for PQQ production, this result suggests that the E. coli tldD gene, which shows high homology to the G. oxydans tldD gene, carries out that function. The synthesis of PQQ activated d-glucose dehydrogenase in E. coli and the growth of the recombinant was improved. In an attempt to increase the production of PQQ, which acts as a vitamin or growth factor, we transformed E. coli with various recombinant plasmids, resulting in the overproduction of the PQQ synthesis enzymes and, consequently, PQQ accumulation--up to 6 mM--in the medium. This yield is 21.5-fold higher than that obtained in previous studies.
|
2024-07-07T01:26:36.242652
|
https://example.com/article/6460
|
DITMAS PARK – It took three months, but finally Pickles the Dog, has been found. But wait, there’s more! Pickles brought along a friend, Violet, who had been missing since 2016!
Today Pickles returned home to his family and Violet is safe at Sean Casey Animal Rescue, where she was being fostered from when she went missing.
“Our family is over the moon and so joyful that Pickles is finally back home!” Pickles’ human mom Jasmin Cruz said. “To find out that he was found with Violet was truly surprising! I was so happy to know that he was not alone and they kept each other going strong.”
Here’s what happened. Pickles, a 7-year-old white/black Australian Cattle Dog/ Border Collie Mix, was adopted from Thailand by a Ditmas Park family a few years back. In Thailand, he was a street dog. In Ditmas Park, he went missing in August. Pickles was on a walk with a human from Wag!, a dog-walking service, when he ran off.
His family in Ditmas Park, along with Wag!, had been searching for him all this time, taking to social media and placing 13,600 posters throughout several neighborhoods.
Wag! set up a tip hotline that received 44 tips, organizing multiple search parties, and initiating pet amber alerts including over 14,700 robocalls through Lost My Doggie. In the three months, Pickles was spotted in various spots across the borough, going as far as Gerritsen Beach.
In the end, it took professionals to track Pickles down. Wag! hired Carmen Brothers, a professional tracker from Virginia, and Teddy Henn, a professional trapper from Long Island, to track Pickles and trap him. Brothers tracked Pickles after numerous tips and by placing cameras at the train station behind Brooklyn College, and the following day, Henn trapped the dogs using some really good food.
“We are delighted that the search for Pickles has ended happily,” a spokesperson for Wag! said. “Following an extensive search that included deploying a professional dog tracker who set up cameras and humane traps at locations where Pickles had been sighted, we secured him on Tuesday, Nov. 27, and reunited Pickles with his pet parents. He is healthy and safe.”
“We can’t thank enough our dedicated team and all parties involved in this search for their ongoing diligence and working around the clock to bring Pickles home.”
In his adventure, Pickles came across Violet. Violet is a foster dog who had been missing since November 2016, when she shook off her harness and ran from Cortelyou and East 17th Street running south toward Dorchester Road.
“To me, this is the most amazing story. They found each other just in time for the holidays,” said Elisa Flash, the editor of the Lost and Found Pets in Brooklyn Facebook page that helps reunite lost pets with their owners.
According to Flash, Pickles had gained some weight, which means that either somebody was feeding him or he knew where to find food.
Flash also stressed the importance of microchips (both dogs were microchipped), saying, “Having a pet with a registered microchip can help to ensure their safe and timely return to their family.”
“This can make the difference between returning to their family or being adopted by another family if not chipped and brought to a shelter. New York State has a mandated three-day hold. If the animal has not been claimed by then, a new home can be found.”
“This is a surreal moment for all of us,” Flash said, “who have worked endlessly to see to it that Pickles was found and reunited with his family.”
Now, the big question is: will Pickles’ family adopt Violet?
“Sean Casey Rescue is picking up where they left off to train and socialize Violet. At the moment, we are in a one bedroom with a 7 week old and Pickles, but we are planning on moving soon and hopefully make room,” Cruz said. “We are in close contact with the Rescue and will be aligning with them.”
This was UPDATED at 6:25 a.m. on Nov. 29 to include quotes from Jasmin Cruz.
|
2023-10-07T01:26:36.242652
|
https://example.com/article/1507
|
Deborah Washington of Fayetteville, North Carolina is suing AlliedBarton Security Services, a company which provides security guards for Cumberland County Hospital, for placing her son A’Darrin Washington, 30, into a taxi cab where he was found dead when he arrived home, reports Courthouse News.
A’Darrin, who died on Nov. 22, 2011, suffered with Hodgkin’s lymphoma and had reportedly been a patient at Cumberland County Hospital for 10 years.
On Nov. 14, 2011, one week before his death, A’Darrin was admitted to the hospital and misdiagnosed as suffering from bacterial pneumonia. Subsequent tests revealed that he had fungal pneumonia and had been receiving the wrong medication.
Hospital staff noted that he was “uncooperative,” and “refused to talk or move,” and instead of determining why A’Darrin was unresponsive, a nurse called a security guard to remove him from his hospital bed to the lobby, and from there he was removed from his wheelchair and placed in the taxi cab.
Read more from Washington’s lawsuit via Courtroom News:
“(A) nurse called for security to escort Mr. Washington from his hospital bed to the lobby for discharge because Mr. Washington was allegedly ‘uncooperative’ and ‘refusing to talk or move,’” the complaint states.
“Upon information and belief, prior to his discharge, Mr. Washington was extremely weak and ill and in pain and had sought not to be discharged before he became unresponsive.
“When Mr. Washington became unresponsive he was unable to talk or move.
“Mr. Washington was unresponsive due to the fact that he was dying.”
Two security officers took him to the lobby, lifted him from his wheelchair into the taxi and secured him with a seat-belt while he was unresponsive, according to the complaint.
At least two members of the hospital staff “expressed concerns” about Washington, and the taxi driver was concerned that he was already dead, the mom claims.
Nonetheless, the security workers loaded him into the taxi, and even crossed his legs for him, the mother says. Her son was unconscious during the 45-minute trip home, where his mom and family received him “unresponsive and cold to the touch,” according to the lawsuit.
His mom claims she suffered severe distress when her son’s body was left in the taxi in the front yard for four hours, while police investigated.
She seeks compensatory and punitive damages for negligence, wrongful death and negligent infliction of emotional distress.
Washington claims that A’Darrin was then left in the taxi cab for an additional 4 hours in front of her home while the police investigated.
Neither Cumberland County Hospital nor AlliedBarton Security Services have released a statement.
|
2024-03-08T01:26:36.242652
|
https://example.com/article/9424
|
/* voc 2.1.0 [2019/11/01]. Bootstrapping compiler for address size 8, alignment 8. xrtspaSF */
#ifndef Strings__h
#define Strings__h
#include "SYSTEM.h"
import void Strings_Append (CHAR *extra, ADDRESS extra__len, CHAR *dest, ADDRESS dest__len);
import void Strings_Cap (CHAR *s, ADDRESS s__len);
import void Strings_Delete (CHAR *s, ADDRESS s__len, INT16 pos, INT16 n);
import void Strings_Extract (CHAR *source, ADDRESS source__len, INT16 pos, INT16 n, CHAR *dest, ADDRESS dest__len);
import void Strings_Insert (CHAR *source, ADDRESS source__len, INT16 pos, CHAR *dest, ADDRESS dest__len);
import INT16 Strings_Length (CHAR *s, ADDRESS s__len);
import BOOLEAN Strings_Match (CHAR *string, ADDRESS string__len, CHAR *pattern, ADDRESS pattern__len);
import INT16 Strings_Pos (CHAR *pattern, ADDRESS pattern__len, CHAR *s, ADDRESS s__len, INT16 pos);
import void Strings_Replace (CHAR *source, ADDRESS source__len, INT16 pos, CHAR *dest, ADDRESS dest__len);
import void Strings_StrToLongReal (CHAR *s, ADDRESS s__len, LONGREAL *r);
import void Strings_StrToReal (CHAR *s, ADDRESS s__len, REAL *r);
import void *Strings__init(void);
#endif // Strings
|
2024-07-18T01:26:36.242652
|
https://example.com/article/5641
|
Dr. James Sharp, DVM
Veterinarian
Education: Michigan State University
Dr. James Sharp began his career after graduation from Michigan State University in 1971. His areas of special interest are dentistry, laser surgery, ultrasonography and ear canal disease. Management responsibilities include medical and surgical care, boarding and grooming services. Dr. Sharp acquires over 100 hours of continuing education a year to maintain high quality hospital services and to stay on the leading edge of medicine and current knowledge.
|
2024-04-03T01:26:36.242652
|
https://example.com/article/2573
|
Personal value preferences, group identifications, and cultural practices of Palestinian Israelis working in close contact with Jewish Israelis.
The present study investigates the connection between personal value preferences, group identifications, and cultural practices among Palestinian Israelis working in close contact with the Jewish population in Israel. One hundred twenty-two Palestinian Israelis participated in the study. The participants were employed in different professional positions in the Tel Aviv Metropolitan area and were recruited to the study using the snowball technique. A stronger national identification was associated with a higher preference for the security and conformity values, and a lower preference for the humility values. A stronger ethnic identification was associated with a lower preference for the security, power, and stimulation values. Group identifications mediated the connection between personal value preferences and cultural practices. A longer time working in close contact with the majority group and less frequent visits home were associated with a greater adherence to the majority group's cultural practices but not with adherence to the ethnic group's practices and not with the group identifications.
|
2024-01-29T01:26:36.242652
|
https://example.com/article/1334
|
News
Existing only in the digital sphere but currently worth a fortune, it is the virtual currency that has gone mainstream in recent weeks.
However, it has emerged that the production of bitcoins uses so much energy it threatens to seriously harm the planet.
In recent months investors have flocked to the currency that exists only in cyberspace and is traded directly from person to person.
But its very success has led to fears about the environmental impact of the bitcoin phenomenon.
The process by which the currency is produced in the digital world – known as mining – uses an enormous amount of energy, much of it coming from the carbon fuels that cause the most pollution.
Total electricity use in bitcoin mining has increased by 30pc in the past month, according to accounting firm PwC.
Bitcoin mining now consumes more electricity than 159 countries, including Ireland and most countries in Africa.
Alex de Vries, an analyst at PwC, who started the Digiconomist blog to show the potential pitfalls in cryptocurrency, said: “The energy consumption is insane. If we start using this on a global scale, it will kill the planet.”
One major producer, Bitmain Technologies Ltd, runs a server farm in Erdors, Inner Mongolia, housed inside eight 100m-long metal warehouses, with about 25,000 computers dedicated to solving the encrypted calculations that generate each bitcoin.
The entire operation runs on electricity produced with coal, as do a growing number of cryptocurrency ‘mines’ popping up in China.
The global industry’s use of power is thought to equal that required for three million US homes, topping the individual consumption of 159 countries, according to the Digiconomist Bitcoin Energy Consumption Index.
As more bitcoin is created, the difficulty rate of token-generating calculations increases, as does the need for electricity.
Christopher Chapman, a London-based analyst at Citigroup Inc, said: “This has become a dirty thing to produce.”
Bitcoin was devised by an unknown individual or group under the name Satoshi Nakamoto as a system that awards virtual coins for solving complex puzzles and uses an encrypted digital ledger to track all the work and every transaction.
Prices have surged more than 2,000pc in the past year on some exchanges and touched a record of more than $17,900 (€15,200) on Friday. But according to a recent study of the industry by experts at Cambridge University, China – which gets about 60pc of its electricity from coal – is the biggest operator of computer ‘mines’ and probably accounts for about a quarter of all the power used to create cryptocurrencies.
About 58pc of the world’s large cryptocurrency mining pools were located in China, followed by the US at 16pc, the study found.
Bitcoin server farms in provinces such as Xinjiang, Inner Mongolia and Heilongjian are heavily reliant upon coal-generated electricity.
Estimates of how much electricity goes into making cryptocurrencies vary widely – from the output of one large nuclear reactor to the consumption of the entire population of Denmark.
Analysts agree that the industry’s power use is expanding rapidly – especially after a price rally that made bitcoin almost four times more valuable than just three months ago.
Some analysts dismiss claims of bitcoin’s environmental impact as alarmist, noting even the highest estimates of demand account for only about 0.1pc of the total power that the world uses.
|
2024-07-11T01:26:36.242652
|
https://example.com/article/1330
|
:noname
." Type 'help' for detailed information" cr
; DIAG-initializer
" /" find-device
new-device
" memory" device-name
\ 12230 encode-int " reg" property
external
: open true ;
: close ;
\ claim ( phys size align -- base )
\ release ( phys size -- )
finish-device
new-device
" cpus" device-name
1 " #address-cells" int-property
0 " #size-cells" int-property
external
: open true ;
: close ;
: decode-unit parse-hex ;
finish-device
: make-openable ( path )
find-dev if
begin ?dup while
\ install trivial open and close methods
dup active-package! is-open
parent
repeat
then
;
: preopen ( chosen-str node-path )
2dup make-openable
" /chosen" find-device
open-dev ?dup if
encode-int 2swap property
else
2drop
then
;
:noname
set-defaults
; SYSTEM-initializer
\ preopen device nodes (and store the ihandles under /chosen)
:noname
" memory" " /memory" preopen
" mmu" " /cpus/@0" preopen
" stdout" " /builtin/console" preopen
" stdin" " /builtin/console" preopen
device-end
; SYSTEM-initializer
\ use the tty interface if available
:noname
" /builtin/console" find-dev if drop
" /builtin/console" " input-device" $setenv
" /builtin/console" " output-device" $setenv
then
; SYSTEM-initializer
:noname
" keyboard" input
; CONSOLE-IN-initializer
dev /
\ node suitable for non-PCI devices
new-device
" unix" device-name
0 encode-int " #address-cells" property
0 encode-int " #size-cells" property
external
: open true ;
: close ;
\ block device node
new-device
" block" device-name
" unix-block" device-type
1 " #address-cells" int-property
0 " #size-cells" int-property
external
: open true ;
: close ;
: decode-unit parse-hex ;
\ testnode
\ new-device
\ " kappa" device-name
\
\ 1 encode-int " reg" property
\ external
\ : open true ;
\ : close ;
\ finish-device
finish-device
finish-device
dev /aliases
" /unix/block/disk" encode-string " hd" property
device-end
|
2023-11-29T01:26:36.242652
|
https://example.com/article/7095
|
/* arch/arm/mach-msm/smd_rpcrouter.c
*
* Copyright (C) 2007 Google, Inc.
* Copyright (c) 2007-2012, The Linux Foundation. All rights reserved.
* Author: San Mehat <san@android.com>
*
* This software is licensed under the terms of the GNU General Public
* License version 2, as published by the Free Software Foundation, and
* may be copied, distributed, and modified under those terms.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
*/
/* TODO: handle cases where smd_write() will tempfail due to full fifo */
/* TODO: thread priority? schedule a work to bump it? */
/* TODO: maybe make server_list_lock a mutex */
/* TODO: pool fragments to avoid kmalloc/kfree churn */
#include <linux/slab.h>
#include <linux/module.h>
#include <linux/kernel.h>
#include <linux/string.h>
#include <linux/errno.h>
#include <linux/cdev.h>
#include <linux/init.h>
#include <linux/device.h>
#include <linux/types.h>
#include <linux/delay.h>
#include <linux/fs.h>
#include <linux/err.h>
#include <linux/sched.h>
#include <linux/poll.h>
#include <linux/wakelock.h>
#include <asm/uaccess.h>
#include <asm/byteorder.h>
#include <linux/platform_device.h>
#include <linux/uaccess.h>
#include <linux/debugfs.h>
#include <linux/reboot.h>
#include <asm/byteorder.h>
#include <mach/msm_smd.h>
#include <mach/smem_log.h>
#include <mach/subsystem_notif.h>
#include "smd_rpcrouter.h"
#include "modem_notifier.h"
#include "smd_rpc_sym.h"
#include "smd_private.h"
enum {
SMEM_LOG = 1U << 0,
RTR_DBG = 1U << 1,
R2R_MSG = 1U << 2,
R2R_RAW = 1U << 3,
RPC_MSG = 1U << 4,
NTFY_MSG = 1U << 5,
RAW_PMR = 1U << 6,
RAW_PMW = 1U << 7,
R2R_RAW_HDR = 1U << 8,
};
static int msm_rpc_connect_timeout_ms;
module_param_named(connect_timeout, msm_rpc_connect_timeout_ms,
int, S_IRUGO | S_IWUSR | S_IWGRP);
static int smd_rpcrouter_debug_mask;
module_param_named(debug_mask, smd_rpcrouter_debug_mask,
int, S_IRUGO | S_IWUSR | S_IWGRP);
#define DIAG(x...) printk(KERN_ERR "[RR] ERROR " x)
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
#define D(x...) do { \
if (smd_rpcrouter_debug_mask & RTR_DBG) \
printk(KERN_ERR x); \
} while (0)
#define RR(x...) do { \
if (smd_rpcrouter_debug_mask & R2R_MSG) \
printk(KERN_ERR "[RR] "x); \
} while (0)
#define RAW(x...) do { \
if (smd_rpcrouter_debug_mask & R2R_RAW) \
printk(KERN_ERR "[RAW] "x); \
} while (0)
#define RAW_HDR(x...) do { \
if (smd_rpcrouter_debug_mask & R2R_RAW_HDR) \
printk(KERN_ERR "[HDR] "x); \
} while (0)
#define RAW_PMR(x...) do { \
if (smd_rpcrouter_debug_mask & RAW_PMR) \
printk(KERN_ERR "[PMR] "x); \
} while (0)
#define RAW_PMR_NOMASK(x...) do { \
printk(KERN_ERR "[PMR] "x); \
} while (0)
#define RAW_PMW(x...) do { \
if (smd_rpcrouter_debug_mask & RAW_PMW) \
printk(KERN_ERR "[PMW] "x); \
} while (0)
#define RAW_PMW_NOMASK(x...) do { \
printk(KERN_ERR "[PMW] "x); \
} while (0)
#define IO(x...) do { \
if (smd_rpcrouter_debug_mask & RPC_MSG) \
printk(KERN_ERR "[RPC] "x); \
} while (0)
#define NTFY(x...) do { \
if (smd_rpcrouter_debug_mask & NTFY_MSG) \
printk(KERN_ERR "[NOTIFY] "x); \
} while (0)
#else
#define D(x...) do { } while (0)
#define RR(x...) do { } while (0)
#define RAW(x...) do { } while (0)
#define RAW_HDR(x...) do { } while (0)
#define RAW_PMR(x...) do { } while (0)
#define RAW_PMR_NO_MASK(x...) do { } while (0)
#define RAW_PMW(x...) do { } while (0)
#define RAW_PMW_NO_MASK(x...) do { } while (0)
#define IO(x...) do { } while (0)
#define NTFY(x...) do { } while (0)
#endif
static LIST_HEAD(local_endpoints);
static LIST_HEAD(remote_endpoints);
static LIST_HEAD(server_list);
static wait_queue_head_t newserver_wait;
static wait_queue_head_t subsystem_restart_wait;
static DEFINE_SPINLOCK(local_endpoints_lock);
static DEFINE_SPINLOCK(remote_endpoints_lock);
static DEFINE_SPINLOCK(server_list_lock);
static LIST_HEAD(rpc_board_dev_list);
static DEFINE_SPINLOCK(rpc_board_dev_list_lock);
static struct workqueue_struct *rpcrouter_workqueue;
static atomic_t next_xid = ATOMIC_INIT(1);
static atomic_t pm_mid = ATOMIC_INIT(1);
static void do_read_data(struct work_struct *work);
static void do_create_pdevs(struct work_struct *work);
static void do_create_rpcrouter_pdev(struct work_struct *work);
static int msm_rpcrouter_close(void);
static DECLARE_WORK(work_create_pdevs, do_create_pdevs);
static DECLARE_WORK(work_create_rpcrouter_pdev, do_create_rpcrouter_pdev);
#define RR_STATE_IDLE 0
#define RR_STATE_HEADER 1
#define RR_STATE_BODY 2
#define RR_STATE_ERROR 3
/* State for remote ep following restart */
#define RESTART_QUOTA_ABORT 1
struct rr_context {
struct rr_packet *pkt;
uint8_t *ptr;
uint32_t state; /* current assembly state */
uint32_t count; /* bytes needed in this state */
};
struct rr_context the_rr_context;
struct rpc_board_dev_info {
struct list_head list;
struct rpc_board_dev *dev;
};
static struct platform_device rpcrouter_pdev = {
.name = "oncrpc_router",
.id = -1,
};
struct rpcrouter_xprt_info {
struct list_head list;
struct rpcrouter_xprt *xprt;
int remote_pid;
uint32_t initialized;
wait_queue_head_t read_wait;
struct wake_lock wakelock;
spinlock_t lock;
uint32_t need_len;
struct work_struct read_data;
struct workqueue_struct *workqueue;
int abort_data_read;
unsigned char r2r_buf[RPCROUTER_MSGSIZE_MAX];
};
static LIST_HEAD(xprt_info_list);
static DEFINE_MUTEX(xprt_info_list_lock);
DECLARE_COMPLETION(rpc_remote_router_up);
static atomic_t pending_close_count = ATOMIC_INIT(0);
static int msm_rpc_reboot_call(struct notifier_block *this,
unsigned long code, void *_cmd)
{
switch (code) {
case SYS_RESTART:
case SYS_HALT:
case SYS_POWER_OFF:
msm_rpcrouter_close();
break;
}
return NOTIFY_DONE;
}
static struct notifier_block msm_rpc_reboot_notifier = {
.notifier_call = msm_rpc_reboot_call,
.priority = 100
};
/*
* Search for transport (xprt) that matches the provided PID.
*
* Note: The calling function must ensure that the mutex
* xprt_info_list_lock is locked when this function
* is called.
*
* @remote_pid Remote PID for the transport
*
* @returns Pointer to transport or NULL if not found
*/
static struct rpcrouter_xprt_info *rpcrouter_get_xprt_info(uint32_t remote_pid)
{
struct rpcrouter_xprt_info *xprt_info;
list_for_each_entry(xprt_info, &xprt_info_list, list) {
if (xprt_info->remote_pid == remote_pid)
return xprt_info;
}
return NULL;
}
static int rpcrouter_send_control_msg(struct rpcrouter_xprt_info *xprt_info,
union rr_control_msg *msg)
{
struct rr_header hdr;
unsigned long flags = 0;
int need;
if (xprt_info->remote_pid == RPCROUTER_PID_LOCAL)
return 0;
if (!(msg->cmd == RPCROUTER_CTRL_CMD_HELLO) &&
!xprt_info->initialized) {
printk(KERN_ERR "rpcrouter_send_control_msg(): Warning, "
"router not initialized\n");
return -EINVAL;
}
hdr.version = RPCROUTER_VERSION;
hdr.type = msg->cmd;
hdr.src_pid = RPCROUTER_PID_LOCAL;
hdr.src_cid = RPCROUTER_ROUTER_ADDRESS;
hdr.confirm_rx = 0;
hdr.size = sizeof(*msg);
hdr.dst_pid = xprt_info->remote_pid;
hdr.dst_cid = RPCROUTER_ROUTER_ADDRESS;
/* TODO: what if channel is full? */
need = sizeof(hdr) + hdr.size;
spin_lock_irqsave(&xprt_info->lock, flags);
while (xprt_info->xprt->write_avail() < need) {
spin_unlock_irqrestore(&xprt_info->lock, flags);
msleep(250);
spin_lock_irqsave(&xprt_info->lock, flags);
}
xprt_info->xprt->write(&hdr, sizeof(hdr), HEADER);
xprt_info->xprt->write(msg, hdr.size, PAYLOAD);
spin_unlock_irqrestore(&xprt_info->lock, flags);
return 0;
}
static void modem_reset_cleanup(struct rpcrouter_xprt_info *xprt_info)
{
struct msm_rpc_endpoint *ept;
struct rr_remote_endpoint *r_ept;
struct rr_packet *pkt, *tmp_pkt;
struct rr_fragment *frag, *next;
struct msm_rpc_reply *reply, *reply_tmp;
unsigned long flags;
if (!xprt_info) {
pr_err("%s: Invalid xprt_info\n", __func__);
return;
}
spin_lock_irqsave(&local_endpoints_lock, flags);
/* remove all partial packets received */
list_for_each_entry(ept, &local_endpoints, list) {
RR("%s EPT DST PID %x, remote_pid:%d\n", __func__,
ept->dst_pid, xprt_info->remote_pid);
if (xprt_info->remote_pid != ept->dst_pid)
continue;
D("calling teardown cb %p\n", ept->cb_restart_teardown);
if (ept->cb_restart_teardown)
ept->cb_restart_teardown(ept->client_data);
ept->do_setup_notif = 1;
/* remove replies */
spin_lock(&ept->reply_q_lock);
list_for_each_entry_safe(reply, reply_tmp,
&ept->reply_pend_q, list) {
list_del(&reply->list);
kfree(reply);
}
list_for_each_entry_safe(reply, reply_tmp,
&ept->reply_avail_q, list) {
list_del(&reply->list);
kfree(reply);
}
ept->reply_cnt = 0;
spin_unlock(&ept->reply_q_lock);
/* Set restart state for local ep */
RR("EPT:0x%p, State %d RESTART_PEND_NTFY_SVR "
"PROG:0x%08x VERS:0x%08x\n",
ept, ept->restart_state,
be32_to_cpu(ept->dst_prog),
be32_to_cpu(ept->dst_vers));
spin_lock(&ept->restart_lock);
ept->restart_state = RESTART_PEND_NTFY_SVR;
/* remove incomplete packets */
spin_lock(&ept->incomplete_lock);
list_for_each_entry_safe(pkt, tmp_pkt,
&ept->incomplete, list) {
list_del(&pkt->list);
frag = pkt->first;
while (frag != NULL) {
next = frag->next;
kfree(frag);
frag = next;
}
kfree(pkt);
}
spin_unlock(&ept->incomplete_lock);
/* remove all completed packets waiting to be read */
spin_lock(&ept->read_q_lock);
list_for_each_entry_safe(pkt, tmp_pkt, &ept->read_q,
list) {
list_del(&pkt->list);
frag = pkt->first;
while (frag != NULL) {
next = frag->next;
kfree(frag);
frag = next;
}
kfree(pkt);
}
spin_unlock(&ept->read_q_lock);
spin_unlock(&ept->restart_lock);
wake_up(&ept->wait_q);
}
spin_unlock_irqrestore(&local_endpoints_lock, flags);
/* Unblock endpoints waiting for quota ack*/
spin_lock_irqsave(&remote_endpoints_lock, flags);
list_for_each_entry(r_ept, &remote_endpoints, list) {
spin_lock(&r_ept->quota_lock);
r_ept->quota_restart_state = RESTART_QUOTA_ABORT;
RR("Set STATE_PENDING PID:0x%08x CID:0x%08x \n", r_ept->pid,
r_ept->cid);
spin_unlock(&r_ept->quota_lock);
wake_up(&r_ept->quota_wait);
}
spin_unlock_irqrestore(&remote_endpoints_lock, flags);
}
static void modem_reset_startup(struct rpcrouter_xprt_info *xprt_info)
{
struct msm_rpc_endpoint *ept;
unsigned long flags;
spin_lock_irqsave(&local_endpoints_lock, flags);
/* notify all endpoints that we are coming back up */
list_for_each_entry(ept, &local_endpoints, list) {
RR("%s EPT DST PID %x, remote_pid:%d\n", __func__,
ept->dst_pid, xprt_info->remote_pid);
if (xprt_info->remote_pid != ept->dst_pid)
continue;
D("calling setup cb %d:%p\n", ept->do_setup_notif,
ept->cb_restart_setup);
if (ept->do_setup_notif && ept->cb_restart_setup)
ept->cb_restart_setup(ept->client_data);
ept->do_setup_notif = 0;
}
spin_unlock_irqrestore(&local_endpoints_lock, flags);
}
/*
* Blocks and waits for endpoint if a reset is in progress.
*
* @returns
* ENETRESET Reset is in progress and a notification needed
* ERESTARTSYS Signal occurred
* 0 Reset is not in progress
*/
static int wait_for_restart_and_notify(struct msm_rpc_endpoint *ept)
{
unsigned long flags;
int ret = 0;
DEFINE_WAIT(__wait);
for (;;) {
prepare_to_wait(&ept->restart_wait, &__wait,
TASK_INTERRUPTIBLE);
spin_lock_irqsave(&ept->restart_lock, flags);
if (ept->restart_state == RESTART_NORMAL) {
spin_unlock_irqrestore(&ept->restart_lock, flags);
break;
} else if (ept->restart_state & RESTART_PEND_NTFY) {
ept->restart_state &= ~RESTART_PEND_NTFY;
spin_unlock_irqrestore(&ept->restart_lock, flags);
ret = -ENETRESET;
break;
}
if (signal_pending(current) &&
((!(ept->flags & MSM_RPC_UNINTERRUPTIBLE)))) {
spin_unlock_irqrestore(&ept->restart_lock, flags);
ret = -ERESTARTSYS;
break;
}
spin_unlock_irqrestore(&ept->restart_lock, flags);
schedule();
}
finish_wait(&ept->restart_wait, &__wait);
return ret;
}
static struct rr_server *rpcrouter_create_server(uint32_t pid,
uint32_t cid,
uint32_t prog,
uint32_t ver)
{
struct rr_server *server;
unsigned long flags;
int rc;
server = kmalloc(sizeof(struct rr_server), GFP_KERNEL);
if (!server)
return ERR_PTR(-ENOMEM);
memset(server, 0, sizeof(struct rr_server));
server->pid = pid;
server->cid = cid;
server->prog = prog;
server->vers = ver;
spin_lock_irqsave(&server_list_lock, flags);
list_add_tail(&server->list, &server_list);
spin_unlock_irqrestore(&server_list_lock, flags);
rc = msm_rpcrouter_create_server_cdev(server);
if (rc < 0)
goto out_fail;
return server;
out_fail:
spin_lock_irqsave(&server_list_lock, flags);
list_del(&server->list);
spin_unlock_irqrestore(&server_list_lock, flags);
kfree(server);
return ERR_PTR(rc);
}
static void rpcrouter_destroy_server(struct rr_server *server)
{
unsigned long flags;
spin_lock_irqsave(&server_list_lock, flags);
list_del(&server->list);
spin_unlock_irqrestore(&server_list_lock, flags);
device_destroy(msm_rpcrouter_class, server->device_number);
kfree(server);
}
int msm_rpc_add_board_dev(struct rpc_board_dev *devices, int num)
{
unsigned long flags;
struct rpc_board_dev_info *board_info;
int i;
for (i = 0; i < num; i++) {
board_info = kzalloc(sizeof(struct rpc_board_dev_info),
GFP_KERNEL);
if (!board_info)
return -ENOMEM;
board_info->dev = &devices[i];
D("%s: adding program %x\n", __func__, board_info->dev->prog);
spin_lock_irqsave(&rpc_board_dev_list_lock, flags);
list_add_tail(&board_info->list, &rpc_board_dev_list);
spin_unlock_irqrestore(&rpc_board_dev_list_lock, flags);
}
return 0;
}
EXPORT_SYMBOL(msm_rpc_add_board_dev);
static void rpcrouter_register_board_dev(struct rr_server *server)
{
struct rpc_board_dev_info *board_info;
unsigned long flags;
int rc;
spin_lock_irqsave(&rpc_board_dev_list_lock, flags);
list_for_each_entry(board_info, &rpc_board_dev_list, list) {
if (server->prog == board_info->dev->prog) {
D("%s: registering device %x\n",
__func__, board_info->dev->prog);
list_del(&board_info->list);
spin_unlock_irqrestore(&rpc_board_dev_list_lock, flags);
rc = platform_device_register(&board_info->dev->pdev);
if (rc)
pr_err("%s: board dev register failed %d\n",
__func__, rc);
kfree(board_info);
return;
}
}
spin_unlock_irqrestore(&rpc_board_dev_list_lock, flags);
}
static struct rr_server *rpcrouter_lookup_server(uint32_t prog, uint32_t ver)
{
struct rr_server *server;
unsigned long flags;
spin_lock_irqsave(&server_list_lock, flags);
list_for_each_entry(server, &server_list, list) {
if (server->prog == prog
&& server->vers == ver) {
spin_unlock_irqrestore(&server_list_lock, flags);
return server;
}
}
spin_unlock_irqrestore(&server_list_lock, flags);
return NULL;
}
static struct rr_server *rpcrouter_lookup_server_by_dev(dev_t dev)
{
struct rr_server *server;
unsigned long flags;
spin_lock_irqsave(&server_list_lock, flags);
list_for_each_entry(server, &server_list, list) {
if (server->device_number == dev) {
spin_unlock_irqrestore(&server_list_lock, flags);
return server;
}
}
spin_unlock_irqrestore(&server_list_lock, flags);
return NULL;
}
struct msm_rpc_endpoint *msm_rpcrouter_create_local_endpoint(dev_t dev)
{
struct msm_rpc_endpoint *ept;
unsigned long flags;
ept = kmalloc(sizeof(struct msm_rpc_endpoint), GFP_KERNEL);
if (!ept)
return NULL;
memset(ept, 0, sizeof(struct msm_rpc_endpoint));
ept->cid = (uint32_t) ept;
ept->pid = RPCROUTER_PID_LOCAL;
ept->dev = dev;
if ((dev != msm_rpcrouter_devno) && (dev != MKDEV(0, 0))) {
struct rr_server *srv;
/*
* This is a userspace client which opened
* a program/ver devicenode. Bind the client
* to that destination
*/
srv = rpcrouter_lookup_server_by_dev(dev);
/* TODO: bug? really? */
BUG_ON(!srv);
ept->dst_pid = srv->pid;
ept->dst_cid = srv->cid;
ept->dst_prog = cpu_to_be32(srv->prog);
ept->dst_vers = cpu_to_be32(srv->vers);
} else {
/* mark not connected */
ept->dst_pid = 0xffffffff;
}
init_waitqueue_head(&ept->wait_q);
INIT_LIST_HEAD(&ept->read_q);
spin_lock_init(&ept->read_q_lock);
INIT_LIST_HEAD(&ept->reply_avail_q);
INIT_LIST_HEAD(&ept->reply_pend_q);
spin_lock_init(&ept->reply_q_lock);
spin_lock_init(&ept->restart_lock);
init_waitqueue_head(&ept->restart_wait);
ept->restart_state = RESTART_NORMAL;
wake_lock_init(&ept->read_q_wake_lock, WAKE_LOCK_SUSPEND, "rpc_read");
wake_lock_init(&ept->reply_q_wake_lock, WAKE_LOCK_SUSPEND, "rpc_reply");
INIT_LIST_HEAD(&ept->incomplete);
spin_lock_init(&ept->incomplete_lock);
spin_lock_irqsave(&local_endpoints_lock, flags);
list_add_tail(&ept->list, &local_endpoints);
spin_unlock_irqrestore(&local_endpoints_lock, flags);
return ept;
}
int msm_rpcrouter_destroy_local_endpoint(struct msm_rpc_endpoint *ept)
{
int rc;
union rr_control_msg msg;
struct msm_rpc_reply *reply, *reply_tmp;
unsigned long flags;
struct rpcrouter_xprt_info *xprt_info;
/* Endpoint with dst_pid = 0xffffffff corresponds to that of
** router port. So don't send a REMOVE CLIENT message while
** destroying it.*/
spin_lock_irqsave(&local_endpoints_lock, flags);
list_del(&ept->list);
spin_unlock_irqrestore(&local_endpoints_lock, flags);
if (ept->dst_pid != 0xffffffff) {
msg.cmd = RPCROUTER_CTRL_CMD_REMOVE_CLIENT;
msg.cli.pid = ept->pid;
msg.cli.cid = ept->cid;
RR("x REMOVE_CLIENT id=%d:%08x\n", ept->pid, ept->cid);
mutex_lock(&xprt_info_list_lock);
list_for_each_entry(xprt_info, &xprt_info_list, list) {
rc = rpcrouter_send_control_msg(xprt_info, &msg);
if (rc < 0) {
mutex_unlock(&xprt_info_list_lock);
return rc;
}
}
mutex_unlock(&xprt_info_list_lock);
}
/* Free replies */
spin_lock_irqsave(&ept->reply_q_lock, flags);
list_for_each_entry_safe(reply, reply_tmp, &ept->reply_pend_q, list) {
list_del(&reply->list);
kfree(reply);
}
list_for_each_entry_safe(reply, reply_tmp, &ept->reply_avail_q, list) {
list_del(&reply->list);
kfree(reply);
}
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
wake_lock_destroy(&ept->read_q_wake_lock);
wake_lock_destroy(&ept->reply_q_wake_lock);
kfree(ept);
return 0;
}
static int rpcrouter_create_remote_endpoint(uint32_t pid, uint32_t cid)
{
struct rr_remote_endpoint *new_c;
unsigned long flags;
new_c = kmalloc(sizeof(struct rr_remote_endpoint), GFP_KERNEL);
if (!new_c)
return -ENOMEM;
memset(new_c, 0, sizeof(struct rr_remote_endpoint));
new_c->cid = cid;
new_c->pid = pid;
init_waitqueue_head(&new_c->quota_wait);
spin_lock_init(&new_c->quota_lock);
spin_lock_irqsave(&remote_endpoints_lock, flags);
list_add_tail(&new_c->list, &remote_endpoints);
new_c->quota_restart_state = RESTART_NORMAL;
spin_unlock_irqrestore(&remote_endpoints_lock, flags);
return 0;
}
static struct msm_rpc_endpoint *rpcrouter_lookup_local_endpoint(uint32_t cid)
{
struct msm_rpc_endpoint *ept;
list_for_each_entry(ept, &local_endpoints, list) {
if (ept->cid == cid)
return ept;
}
return NULL;
}
static struct rr_remote_endpoint *rpcrouter_lookup_remote_endpoint(uint32_t pid,
uint32_t cid)
{
struct rr_remote_endpoint *ept;
unsigned long flags;
spin_lock_irqsave(&remote_endpoints_lock, flags);
list_for_each_entry(ept, &remote_endpoints, list) {
if ((ept->pid == pid) && (ept->cid == cid)) {
spin_unlock_irqrestore(&remote_endpoints_lock, flags);
return ept;
}
}
spin_unlock_irqrestore(&remote_endpoints_lock, flags);
return NULL;
}
static void handle_server_restart(struct rr_server *server,
uint32_t pid, uint32_t cid,
uint32_t prog, uint32_t vers)
{
struct rr_remote_endpoint *r_ept;
struct msm_rpc_endpoint *ept;
unsigned long flags;
r_ept = rpcrouter_lookup_remote_endpoint(pid, cid);
if (r_ept && (r_ept->quota_restart_state !=
RESTART_NORMAL)) {
spin_lock_irqsave(&r_ept->quota_lock, flags);
r_ept->tx_quota_cntr = 0;
r_ept->quota_restart_state =
RESTART_NORMAL;
spin_unlock_irqrestore(&r_ept->quota_lock, flags);
D(KERN_INFO "rpcrouter: Remote EPT Reset %0x\n",
(unsigned int)r_ept);
wake_up(&r_ept->quota_wait);
}
spin_lock_irqsave(&local_endpoints_lock, flags);
list_for_each_entry(ept, &local_endpoints, list) {
if ((be32_to_cpu(ept->dst_prog) == prog) &&
(be32_to_cpu(ept->dst_vers) == vers) &&
(ept->restart_state & RESTART_PEND_SVR)) {
spin_lock(&ept->restart_lock);
ept->restart_state &= ~RESTART_PEND_SVR;
spin_unlock(&ept->restart_lock);
D("rpcrouter: Local EPT Reset %08x:%08x \n",
prog, vers);
wake_up(&ept->restart_wait);
wake_up(&ept->wait_q);
}
}
spin_unlock_irqrestore(&local_endpoints_lock, flags);
}
static int process_control_msg(struct rpcrouter_xprt_info *xprt_info,
union rr_control_msg *msg, int len)
{
union rr_control_msg ctl;
struct rr_server *server;
struct rr_remote_endpoint *r_ept;
int rc = 0;
unsigned long flags;
static int first = 1;
if (len != sizeof(*msg)) {
RR(KERN_ERR "rpcrouter: r2r msg size %d != %d\n",
len, sizeof(*msg));
return -EINVAL;
}
switch (msg->cmd) {
case RPCROUTER_CTRL_CMD_HELLO:
RR("o HELLO PID %d\n", xprt_info->remote_pid);
memset(&ctl, 0, sizeof(ctl));
ctl.cmd = RPCROUTER_CTRL_CMD_HELLO;
rpcrouter_send_control_msg(xprt_info, &ctl);
xprt_info->initialized = 1;
/* Send list of servers one at a time */
ctl.cmd = RPCROUTER_CTRL_CMD_NEW_SERVER;
/* TODO: long time to hold a spinlock... */
spin_lock_irqsave(&server_list_lock, flags);
list_for_each_entry(server, &server_list, list) {
if (server->pid != RPCROUTER_PID_LOCAL)
continue;
ctl.srv.pid = server->pid;
ctl.srv.cid = server->cid;
ctl.srv.prog = server->prog;
ctl.srv.vers = server->vers;
RR("x NEW_SERVER id=%d:%08x prog=%08x:%08x\n",
server->pid, server->cid,
server->prog, server->vers);
rpcrouter_send_control_msg(xprt_info, &ctl);
}
spin_unlock_irqrestore(&server_list_lock, flags);
if (first) {
first = 0;
queue_work(rpcrouter_workqueue,
&work_create_rpcrouter_pdev);
}
break;
case RPCROUTER_CTRL_CMD_RESUME_TX:
RR("o RESUME_TX id=%d:%08x\n", msg->cli.pid, msg->cli.cid);
r_ept = rpcrouter_lookup_remote_endpoint(msg->cli.pid,
msg->cli.cid);
if (!r_ept) {
printk(KERN_ERR
"rpcrouter: Unable to resume client\n");
break;
}
spin_lock_irqsave(&r_ept->quota_lock, flags);
r_ept->tx_quota_cntr = 0;
spin_unlock_irqrestore(&r_ept->quota_lock, flags);
wake_up(&r_ept->quota_wait);
break;
case RPCROUTER_CTRL_CMD_NEW_SERVER:
if (msg->srv.vers == 0) {
pr_err(
"rpcrouter: Server create rejected, version = 0, "
"program = %08x\n", msg->srv.prog);
break;
}
RR("o NEW_SERVER id=%d:%08x prog=%08x:%08x\n",
msg->srv.pid, msg->srv.cid, msg->srv.prog, msg->srv.vers);
server = rpcrouter_lookup_server(msg->srv.prog, msg->srv.vers);
if (!server) {
server = rpcrouter_create_server(
msg->srv.pid, msg->srv.cid,
msg->srv.prog, msg->srv.vers);
if (!server)
return -ENOMEM;
/*
* XXX: Verify that its okay to add the
* client to our remote client list
* if we get a NEW_SERVER notification
*/
if (!rpcrouter_lookup_remote_endpoint(msg->srv.pid,
msg->srv.cid)) {
rc = rpcrouter_create_remote_endpoint(
msg->srv.pid, msg->srv.cid);
if (rc < 0)
printk(KERN_ERR
"rpcrouter:Client create"
"error (%d)\n", rc);
}
rpcrouter_register_board_dev(server);
schedule_work(&work_create_pdevs);
wake_up(&newserver_wait);
} else {
if ((server->pid == msg->srv.pid) &&
(server->cid == msg->srv.cid)) {
handle_server_restart(server,
msg->srv.pid,
msg->srv.cid,
msg->srv.prog,
msg->srv.vers);
} else {
server->pid = msg->srv.pid;
server->cid = msg->srv.cid;
}
}
break;
case RPCROUTER_CTRL_CMD_REMOVE_SERVER:
RR("o REMOVE_SERVER prog=%08x:%d\n",
msg->srv.prog, msg->srv.vers);
server = rpcrouter_lookup_server(msg->srv.prog, msg->srv.vers);
if (server)
rpcrouter_destroy_server(server);
break;
case RPCROUTER_CTRL_CMD_REMOVE_CLIENT:
RR("o REMOVE_CLIENT id=%d:%08x\n", msg->cli.pid, msg->cli.cid);
if (msg->cli.pid == RPCROUTER_PID_LOCAL) {
printk(KERN_ERR
"rpcrouter: Denying remote removal of "
"local client\n");
break;
}
r_ept = rpcrouter_lookup_remote_endpoint(msg->cli.pid,
msg->cli.cid);
if (r_ept) {
spin_lock_irqsave(&remote_endpoints_lock, flags);
list_del(&r_ept->list);
spin_unlock_irqrestore(&remote_endpoints_lock, flags);
kfree(r_ept);
}
/* Notify local clients of this event */
printk(KERN_ERR "rpcrouter: LOCAL NOTIFICATION NOT IMP\n");
rc = -ENOSYS;
break;
case RPCROUTER_CTRL_CMD_PING:
/* No action needed for ping messages received */
RR("o PING\n");
break;
default:
RR("o UNKNOWN(%08x)\n", msg->cmd);
rc = -ENOSYS;
}
return rc;
}
static void do_create_rpcrouter_pdev(struct work_struct *work)
{
D("%s: modem rpc router up\n", __func__);
platform_device_register(&rpcrouter_pdev);
complete_all(&rpc_remote_router_up);
}
static void do_create_pdevs(struct work_struct *work)
{
unsigned long flags;
struct rr_server *server;
/* TODO: race if destroyed while being registered */
spin_lock_irqsave(&server_list_lock, flags);
list_for_each_entry(server, &server_list, list) {
if (server->pid != RPCROUTER_PID_LOCAL) {
if (server->pdev_name[0] == 0) {
sprintf(server->pdev_name, "rs%.8x",
server->prog);
spin_unlock_irqrestore(&server_list_lock,
flags);
msm_rpcrouter_create_server_pdev(server);
schedule_work(&work_create_pdevs);
return;
}
}
}
spin_unlock_irqrestore(&server_list_lock, flags);
}
static void *rr_malloc(unsigned sz)
{
void *ptr = kmalloc(sz, GFP_KERNEL);
if (ptr)
return ptr;
printk(KERN_ERR "rpcrouter: kmalloc of %d failed, retrying...\n", sz);
do {
ptr = kmalloc(sz, GFP_KERNEL);
} while (!ptr);
return ptr;
}
static int rr_read(struct rpcrouter_xprt_info *xprt_info,
void *data, uint32_t len)
{
int rc;
unsigned long flags;
while (!xprt_info->abort_data_read) {
spin_lock_irqsave(&xprt_info->lock, flags);
if (xprt_info->xprt->read_avail() >= len) {
rc = xprt_info->xprt->read(data, len);
spin_unlock_irqrestore(&xprt_info->lock, flags);
if (rc == len && !xprt_info->abort_data_read)
return 0;
else
return -EIO;
}
xprt_info->need_len = len;
wake_unlock(&xprt_info->wakelock);
spin_unlock_irqrestore(&xprt_info->lock, flags);
wait_event(xprt_info->read_wait,
xprt_info->xprt->read_avail() >= len
|| xprt_info->abort_data_read);
}
return -EIO;
}
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
static char *type_to_str(int i)
{
switch (i) {
case RPCROUTER_CTRL_CMD_DATA:
return "data ";
case RPCROUTER_CTRL_CMD_HELLO:
return "hello ";
case RPCROUTER_CTRL_CMD_BYE:
return "bye ";
case RPCROUTER_CTRL_CMD_NEW_SERVER:
return "new_srvr";
case RPCROUTER_CTRL_CMD_REMOVE_SERVER:
return "rmv_srvr";
case RPCROUTER_CTRL_CMD_REMOVE_CLIENT:
return "rmv_clnt";
case RPCROUTER_CTRL_CMD_RESUME_TX:
return "resum_tx";
case RPCROUTER_CTRL_CMD_EXIT:
return "cmd_exit";
default:
return "invalid";
}
}
#endif
static void do_read_data(struct work_struct *work)
{
struct rr_header hdr;
struct rr_packet *pkt;
struct rr_fragment *frag;
struct msm_rpc_endpoint *ept;
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
struct rpc_request_hdr *rq;
#endif
uint32_t pm, mid;
unsigned long flags;
struct rpcrouter_xprt_info *xprt_info =
container_of(work,
struct rpcrouter_xprt_info,
read_data);
if (rr_read(xprt_info, &hdr, sizeof(hdr)))
goto fail_io;
RR("- ver=%d type=%d src=%d:%08x crx=%d siz=%d dst=%d:%08x\n",
hdr.version, hdr.type, hdr.src_pid, hdr.src_cid,
hdr.confirm_rx, hdr.size, hdr.dst_pid, hdr.dst_cid);
RAW_HDR("[r rr_h] "
"ver=%i,type=%s,src_pid=%08x,src_cid=%08x,"
"confirm_rx=%i,size=%3i,dst_pid=%08x,dst_cid=%08x\n",
hdr.version, type_to_str(hdr.type), hdr.src_pid, hdr.src_cid,
hdr.confirm_rx, hdr.size, hdr.dst_pid, hdr.dst_cid);
if (hdr.version != RPCROUTER_VERSION) {
DIAG("version %d != %d\n", hdr.version, RPCROUTER_VERSION);
goto fail_data;
}
if (hdr.size > RPCROUTER_MSGSIZE_MAX) {
DIAG("msg size %d > max %d\n", hdr.size, RPCROUTER_MSGSIZE_MAX);
goto fail_data;
}
if (hdr.dst_cid == RPCROUTER_ROUTER_ADDRESS) {
if (xprt_info->remote_pid == -1) {
xprt_info->remote_pid = hdr.src_pid;
/* do restart notification */
modem_reset_startup(xprt_info);
}
if (rr_read(xprt_info, xprt_info->r2r_buf, hdr.size))
goto fail_io;
process_control_msg(xprt_info,
(void *) xprt_info->r2r_buf, hdr.size);
goto done;
}
if (hdr.size < sizeof(pm)) {
DIAG("runt packet (no pacmark)\n");
goto fail_data;
}
if (rr_read(xprt_info, &pm, sizeof(pm)))
goto fail_io;
hdr.size -= sizeof(pm);
frag = rr_malloc(sizeof(*frag));
frag->next = NULL;
frag->length = hdr.size;
if (rr_read(xprt_info, frag->data, hdr.size)) {
kfree(frag);
goto fail_io;
}
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
if ((smd_rpcrouter_debug_mask & RAW_PMR) &&
((pm >> 30 & 0x1) || (pm >> 31 & 0x1))) {
uint32_t xid = 0;
if (pm >> 30 & 0x1) {
rq = (struct rpc_request_hdr *) frag->data;
xid = ntohl(rq->xid);
}
if ((pm >> 31 & 0x1) || (pm >> 30 & 0x1))
RAW_PMR_NOMASK("xid:0x%03x first=%i,last=%i,mid=%3i,"
"len=%3i,dst_cid=%08x\n",
xid,
pm >> 30 & 0x1,
pm >> 31 & 0x1,
pm >> 16 & 0xFF,
pm & 0xFFFF, hdr.dst_cid);
}
if (smd_rpcrouter_debug_mask & SMEM_LOG) {
rq = (struct rpc_request_hdr *) frag->data;
if (rq->xid == 0)
smem_log_event(SMEM_LOG_PROC_ID_APPS |
RPC_ROUTER_LOG_EVENT_MID_READ,
PACMARK_MID(pm),
hdr.dst_cid,
hdr.src_cid);
else
smem_log_event(SMEM_LOG_PROC_ID_APPS |
RPC_ROUTER_LOG_EVENT_MSG_READ,
ntohl(rq->xid),
hdr.dst_cid,
hdr.src_cid);
}
#endif
spin_lock_irqsave(&local_endpoints_lock, flags);
ept = rpcrouter_lookup_local_endpoint(hdr.dst_cid);
if (!ept) {
spin_unlock_irqrestore(&local_endpoints_lock, flags);
DIAG("no local ept for cid %08x\n", hdr.dst_cid);
kfree(frag);
goto done;
}
/* See if there is already a partial packet that matches our mid
* and if so, append this fragment to that packet.
*/
mid = PACMARK_MID(pm);
spin_lock(&ept->incomplete_lock);
list_for_each_entry(pkt, &ept->incomplete, list) {
if (pkt->mid == mid) {
pkt->last->next = frag;
pkt->last = frag;
pkt->length += frag->length;
if (PACMARK_LAST(pm)) {
list_del(&pkt->list);
spin_unlock(&ept->incomplete_lock);
goto packet_complete;
}
spin_unlock(&ept->incomplete_lock);
spin_unlock_irqrestore(&local_endpoints_lock, flags);
goto done;
}
}
spin_unlock(&ept->incomplete_lock);
spin_unlock_irqrestore(&local_endpoints_lock, flags);
/* This mid is new -- create a packet for it, and put it on
* the incomplete list if this fragment is not a last fragment,
* otherwise put it on the read queue.
*/
pkt = rr_malloc(sizeof(struct rr_packet));
pkt->first = frag;
pkt->last = frag;
memcpy(&pkt->hdr, &hdr, sizeof(hdr));
pkt->mid = mid;
pkt->length = frag->length;
spin_lock_irqsave(&local_endpoints_lock, flags);
ept = rpcrouter_lookup_local_endpoint(hdr.dst_cid);
if (!ept) {
spin_unlock_irqrestore(&local_endpoints_lock, flags);
DIAG("no local ept for cid %08x\n", hdr.dst_cid);
kfree(frag);
kfree(pkt);
goto done;
}
if (!PACMARK_LAST(pm)) {
spin_lock(&ept->incomplete_lock);
list_add_tail(&pkt->list, &ept->incomplete);
spin_unlock(&ept->incomplete_lock);
spin_unlock_irqrestore(&local_endpoints_lock, flags);
goto done;
}
packet_complete:
spin_lock(&ept->read_q_lock);
D("%s: take read lock on ept %p\n", __func__, ept);
wake_lock(&ept->read_q_wake_lock);
list_add_tail(&pkt->list, &ept->read_q);
wake_up(&ept->wait_q);
spin_unlock(&ept->read_q_lock);
spin_unlock_irqrestore(&local_endpoints_lock, flags);
done:
if (hdr.confirm_rx) {
union rr_control_msg msg;
msg.cmd = RPCROUTER_CTRL_CMD_RESUME_TX;
msg.cli.pid = hdr.dst_pid;
msg.cli.cid = hdr.dst_cid;
RR("x RESUME_TX id=%d:%08x\n", msg.cli.pid, msg.cli.cid);
rpcrouter_send_control_msg(xprt_info, &msg);
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
if (smd_rpcrouter_debug_mask & SMEM_LOG)
smem_log_event(SMEM_LOG_PROC_ID_APPS |
RPC_ROUTER_LOG_EVENT_MSG_CFM_SNT,
RPCROUTER_PID_LOCAL,
hdr.dst_cid,
hdr.src_cid);
#endif
}
/* don't requeue if we should be shutting down */
if (!xprt_info->abort_data_read) {
queue_work(xprt_info->workqueue, &xprt_info->read_data);
return;
}
D("rpc_router terminating for '%s'\n",
xprt_info->xprt->name);
fail_io:
fail_data:
D(KERN_ERR "rpc_router has died for '%s'\n",
xprt_info->xprt->name);
}
void msm_rpc_setup_req(struct rpc_request_hdr *hdr, uint32_t prog,
uint32_t vers, uint32_t proc)
{
memset(hdr, 0, sizeof(struct rpc_request_hdr));
hdr->xid = cpu_to_be32(atomic_add_return(1, &next_xid));
hdr->rpc_vers = cpu_to_be32(2);
hdr->prog = cpu_to_be32(prog);
hdr->vers = cpu_to_be32(vers);
hdr->procedure = cpu_to_be32(proc);
}
EXPORT_SYMBOL(msm_rpc_setup_req);
struct msm_rpc_endpoint *msm_rpc_open(void)
{
struct msm_rpc_endpoint *ept;
ept = msm_rpcrouter_create_local_endpoint(MKDEV(0, 0));
if (ept == NULL)
return ERR_PTR(-ENOMEM);
return ept;
}
void msm_rpc_read_wakeup(struct msm_rpc_endpoint *ept)
{
ept->forced_wakeup = 1;
wake_up(&ept->wait_q);
}
int msm_rpc_close(struct msm_rpc_endpoint *ept)
{
if (!ept)
return -EINVAL;
return msm_rpcrouter_destroy_local_endpoint(ept);
}
EXPORT_SYMBOL(msm_rpc_close);
static int msm_rpc_write_pkt(
struct rr_header *hdr,
struct msm_rpc_endpoint *ept,
struct rr_remote_endpoint *r_ept,
void *buffer,
int count,
int first,
int last,
uint32_t mid
)
{
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
struct rpc_request_hdr *rq = buffer;
uint32_t event_id;
#endif
uint32_t pacmark;
unsigned long flags = 0;
int rc;
struct rpcrouter_xprt_info *xprt_info;
int needed;
DEFINE_WAIT(__wait);
/* Create routing header */
hdr->type = RPCROUTER_CTRL_CMD_DATA;
hdr->version = RPCROUTER_VERSION;
hdr->src_pid = ept->pid;
hdr->src_cid = ept->cid;
hdr->confirm_rx = 0;
hdr->size = count + sizeof(uint32_t);
rc = wait_for_restart_and_notify(ept);
if (rc)
return rc;
if (r_ept) {
for (;;) {
prepare_to_wait(&r_ept->quota_wait, &__wait,
TASK_INTERRUPTIBLE);
spin_lock_irqsave(&r_ept->quota_lock, flags);
if ((r_ept->tx_quota_cntr <
RPCROUTER_DEFAULT_RX_QUOTA) ||
(r_ept->quota_restart_state != RESTART_NORMAL))
break;
if (signal_pending(current) &&
(!(ept->flags & MSM_RPC_UNINTERRUPTIBLE)))
break;
spin_unlock_irqrestore(&r_ept->quota_lock, flags);
schedule();
}
finish_wait(&r_ept->quota_wait, &__wait);
if (r_ept->quota_restart_state != RESTART_NORMAL) {
spin_lock(&ept->restart_lock);
ept->restart_state &= ~RESTART_PEND_NTFY;
spin_unlock(&ept->restart_lock);
spin_unlock_irqrestore(&r_ept->quota_lock, flags);
return -ENETRESET;
}
if (signal_pending(current) &&
(!(ept->flags & MSM_RPC_UNINTERRUPTIBLE))) {
spin_unlock_irqrestore(&r_ept->quota_lock, flags);
return -ERESTARTSYS;
}
r_ept->tx_quota_cntr++;
if (r_ept->tx_quota_cntr == RPCROUTER_DEFAULT_RX_QUOTA) {
hdr->confirm_rx = 1;
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
if (smd_rpcrouter_debug_mask & SMEM_LOG) {
event_id = (rq->xid == 0) ?
RPC_ROUTER_LOG_EVENT_MID_CFM_REQ :
RPC_ROUTER_LOG_EVENT_MSG_CFM_REQ;
smem_log_event(SMEM_LOG_PROC_ID_APPS | event_id,
hdr->dst_pid,
hdr->dst_cid,
hdr->src_cid);
}
#endif
}
}
pacmark = PACMARK(count, mid, first, last);
if (r_ept)
spin_unlock_irqrestore(&r_ept->quota_lock, flags);
mutex_lock(&xprt_info_list_lock);
xprt_info = rpcrouter_get_xprt_info(hdr->dst_pid);
if (!xprt_info) {
mutex_unlock(&xprt_info_list_lock);
return -ENETRESET;
}
spin_lock_irqsave(&xprt_info->lock, flags);
mutex_unlock(&xprt_info_list_lock);
spin_lock(&ept->restart_lock);
if (ept->restart_state != RESTART_NORMAL) {
ept->restart_state &= ~RESTART_PEND_NTFY;
spin_unlock(&ept->restart_lock);
spin_unlock_irqrestore(&xprt_info->lock, flags);
return -ENETRESET;
}
needed = sizeof(*hdr) + hdr->size;
while ((ept->restart_state == RESTART_NORMAL) &&
(xprt_info->xprt->write_avail() < needed)) {
spin_unlock(&ept->restart_lock);
spin_unlock_irqrestore(&xprt_info->lock, flags);
msleep(250);
/* refresh xprt pointer to ensure that it hasn't
* been deleted since our last retrieval */
mutex_lock(&xprt_info_list_lock);
xprt_info = rpcrouter_get_xprt_info(hdr->dst_pid);
if (!xprt_info) {
mutex_unlock(&xprt_info_list_lock);
return -ENETRESET;
}
spin_lock_irqsave(&xprt_info->lock, flags);
mutex_unlock(&xprt_info_list_lock);
spin_lock(&ept->restart_lock);
}
if (ept->restart_state != RESTART_NORMAL) {
ept->restart_state &= ~RESTART_PEND_NTFY;
spin_unlock(&ept->restart_lock);
spin_unlock_irqrestore(&xprt_info->lock, flags);
return -ENETRESET;
}
/* TODO: deal with full fifo */
xprt_info->xprt->write(hdr, sizeof(*hdr), HEADER);
RAW_HDR("[w rr_h] "
"ver=%i,type=%s,src_pid=%08x,src_cid=%08x,"
"confirm_rx=%i,size=%3i,dst_pid=%08x,dst_cid=%08x\n",
hdr->version, type_to_str(hdr->type),
hdr->src_pid, hdr->src_cid,
hdr->confirm_rx, hdr->size, hdr->dst_pid, hdr->dst_cid);
xprt_info->xprt->write(&pacmark, sizeof(pacmark), PACKMARK);
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
if ((smd_rpcrouter_debug_mask & RAW_PMW) &&
((pacmark >> 30 & 0x1) || (pacmark >> 31 & 0x1))) {
uint32_t xid = 0;
if (pacmark >> 30 & 0x1)
xid = ntohl(rq->xid);
if ((pacmark >> 31 & 0x1) || (pacmark >> 30 & 0x1))
RAW_PMW_NOMASK("xid:0x%03x first=%i,last=%i,mid=%3i,"
"len=%3i,src_cid=%x\n",
xid,
pacmark >> 30 & 0x1,
pacmark >> 31 & 0x1,
pacmark >> 16 & 0xFF,
pacmark & 0xFFFF, hdr->src_cid);
}
#endif
xprt_info->xprt->write(buffer, count, PAYLOAD);
spin_unlock(&ept->restart_lock);
spin_unlock_irqrestore(&xprt_info->lock, flags);
#if defined(CONFIG_MSM_ONCRPCROUTER_DEBUG)
if (smd_rpcrouter_debug_mask & SMEM_LOG) {
if (rq->xid == 0)
smem_log_event(SMEM_LOG_PROC_ID_APPS |
RPC_ROUTER_LOG_EVENT_MID_WRITTEN,
PACMARK_MID(pacmark),
hdr->dst_cid,
hdr->src_cid);
else
smem_log_event(SMEM_LOG_PROC_ID_APPS |
RPC_ROUTER_LOG_EVENT_MSG_WRITTEN,
ntohl(rq->xid),
hdr->dst_cid,
hdr->src_cid);
}
#endif
return needed;
}
static struct msm_rpc_reply *get_pend_reply(struct msm_rpc_endpoint *ept,
uint32_t xid)
{
unsigned long flags;
struct msm_rpc_reply *reply;
spin_lock_irqsave(&ept->reply_q_lock, flags);
list_for_each_entry(reply, &ept->reply_pend_q, list) {
if (reply->xid == xid) {
list_del(&reply->list);
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
return reply;
}
}
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
return NULL;
}
void get_requesting_client(struct msm_rpc_endpoint *ept, uint32_t xid,
struct msm_rpc_client_info *clnt_info)
{
unsigned long flags;
struct msm_rpc_reply *reply;
if (!clnt_info)
return;
spin_lock_irqsave(&ept->reply_q_lock, flags);
list_for_each_entry(reply, &ept->reply_pend_q, list) {
if (reply->xid == xid) {
clnt_info->pid = reply->pid;
clnt_info->cid = reply->cid;
clnt_info->prog = reply->prog;
clnt_info->vers = reply->vers;
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
return;
}
}
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
return;
}
static void set_avail_reply(struct msm_rpc_endpoint *ept,
struct msm_rpc_reply *reply)
{
unsigned long flags;
spin_lock_irqsave(&ept->reply_q_lock, flags);
list_add_tail(&reply->list, &ept->reply_avail_q);
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
}
static struct msm_rpc_reply *get_avail_reply(struct msm_rpc_endpoint *ept)
{
struct msm_rpc_reply *reply;
unsigned long flags;
if (list_empty(&ept->reply_avail_q)) {
if (ept->reply_cnt >= RPCROUTER_PEND_REPLIES_MAX) {
printk(KERN_ERR
"exceeding max replies of %d \n",
RPCROUTER_PEND_REPLIES_MAX);
return 0;
}
reply = kmalloc(sizeof(struct msm_rpc_reply), GFP_KERNEL);
if (!reply)
return 0;
D("Adding reply 0x%08x \n", (unsigned int)reply);
memset(reply, 0, sizeof(struct msm_rpc_reply));
spin_lock_irqsave(&ept->reply_q_lock, flags);
ept->reply_cnt++;
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
} else {
spin_lock_irqsave(&ept->reply_q_lock, flags);
reply = list_first_entry(&ept->reply_avail_q,
struct msm_rpc_reply,
list);
list_del(&reply->list);
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
}
return reply;
}
static void set_pend_reply(struct msm_rpc_endpoint *ept,
struct msm_rpc_reply *reply)
{
unsigned long flags;
spin_lock_irqsave(&ept->reply_q_lock, flags);
D("%s: take reply lock on ept %p\n", __func__, ept);
wake_lock(&ept->reply_q_wake_lock);
list_add_tail(&reply->list, &ept->reply_pend_q);
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
}
int msm_rpc_write(struct msm_rpc_endpoint *ept, void *buffer, int count)
{
struct rr_header hdr;
struct rpc_request_hdr *rq = buffer;
struct rr_remote_endpoint *r_ept;
struct msm_rpc_reply *reply = NULL;
int max_tx;
int tx_cnt;
char *tx_buf;
int rc;
int first_pkt = 1;
uint32_t mid;
unsigned long flags;
/* snoop the RPC packet and enforce permissions */
/* has to have at least the xid and type fields */
if (count < (sizeof(uint32_t) * 2)) {
printk(KERN_ERR "rr_write: rejecting runt packet\n");
return -EINVAL;
}
if (rq->type == 0) {
/* RPC CALL */
if (count < (sizeof(uint32_t) * 6)) {
printk(KERN_ERR
"rr_write: rejecting runt call packet\n");
return -EINVAL;
}
if (ept->dst_pid == 0xffffffff) {
printk(KERN_ERR "rr_write: not connected\n");
return -ENOTCONN;
}
if ((ept->dst_prog != rq->prog) ||
((be32_to_cpu(ept->dst_vers) & 0x0fff0000) !=
(be32_to_cpu(rq->vers) & 0x0fff0000))) {
printk(KERN_ERR
"rr_write: cannot write to %08x:%08x "
"(bound to %08x:%08x)\n",
be32_to_cpu(rq->prog), be32_to_cpu(rq->vers),
be32_to_cpu(ept->dst_prog),
be32_to_cpu(ept->dst_vers));
return -EINVAL;
}
hdr.dst_pid = ept->dst_pid;
hdr.dst_cid = ept->dst_cid;
IO("CALL to %08x:%d @ %d:%08x (%d bytes)\n",
be32_to_cpu(rq->prog), be32_to_cpu(rq->vers),
ept->dst_pid, ept->dst_cid, count);
} else {
/* RPC REPLY */
reply = get_pend_reply(ept, rq->xid);
if (!reply) {
printk(KERN_ERR
"rr_write: rejecting, reply not found \n");
return -EINVAL;
}
hdr.dst_pid = reply->pid;
hdr.dst_cid = reply->cid;
IO("REPLY to xid=%d @ %d:%08x (%d bytes)\n",
be32_to_cpu(rq->xid), hdr.dst_pid, hdr.dst_cid, count);
}
r_ept = rpcrouter_lookup_remote_endpoint(hdr.dst_pid, hdr.dst_cid);
if ((!r_ept) && (hdr.dst_pid != RPCROUTER_PID_LOCAL)) {
printk(KERN_ERR
"msm_rpc_write(): No route to ept "
"[PID %x CID %x]\n", hdr.dst_pid, hdr.dst_cid);
count = -EHOSTUNREACH;
goto write_release_lock;
}
tx_cnt = count;
tx_buf = buffer;
mid = atomic_add_return(1, &pm_mid) & 0xFF;
/* The modem's router can only take 500 bytes of data. The
first 8 bytes it uses on the modem side for addressing,
the next 4 bytes are for the pacmark header. */
max_tx = RPCROUTER_MSGSIZE_MAX - 8 - sizeof(uint32_t);
IO("Writing %d bytes, max pkt size is %d\n",
tx_cnt, max_tx);
while (tx_cnt > 0) {
if (tx_cnt > max_tx) {
rc = msm_rpc_write_pkt(&hdr, ept, r_ept,
tx_buf, max_tx,
first_pkt, 0, mid);
if (rc < 0) {
count = rc;
goto write_release_lock;
}
IO("Wrote %d bytes First %d, Last 0 mid %d\n",
rc, first_pkt, mid);
tx_cnt -= max_tx;
tx_buf += max_tx;
} else {
rc = msm_rpc_write_pkt(&hdr, ept, r_ept,
tx_buf, tx_cnt,
first_pkt, 1, mid);
if (rc < 0) {
count = rc;
goto write_release_lock;
}
IO("Wrote %d bytes First %d Last 1 mid %d\n",
rc, first_pkt, mid);
break;
}
first_pkt = 0;
}
write_release_lock:
/* if reply, release wakelock after writing to the transport */
if (rq->type != 0) {
/* Upon failure, add reply tag to the pending list.
** Else add reply tag to the avail/free list. */
if (count < 0)
set_pend_reply(ept, reply);
else
set_avail_reply(ept, reply);
spin_lock_irqsave(&ept->reply_q_lock, flags);
if (list_empty(&ept->reply_pend_q)) {
D("%s: release reply lock on ept %p\n", __func__, ept);
wake_unlock(&ept->reply_q_wake_lock);
}
spin_unlock_irqrestore(&ept->reply_q_lock, flags);
}
return count;
}
EXPORT_SYMBOL(msm_rpc_write);
/*
* NOTE: It is the responsibility of the caller to kfree buffer
*/
int msm_rpc_read(struct msm_rpc_endpoint *ept, void **buffer,
unsigned user_len, long timeout)
{
struct rr_fragment *frag, *next;
char *buf;
int rc;
rc = __msm_rpc_read(ept, &frag, user_len, timeout);
if (rc <= 0)
return rc;
/* single-fragment messages conveniently can be
* returned as-is (the buffer is at the front)
*/
if (frag->next == 0) {
*buffer = (void*) frag;
return rc;
}
/* multi-fragment messages, we have to do it the
* hard way, which is rather disgusting right now
*/
buf = rr_malloc(rc);
*buffer = buf;
while (frag != NULL) {
memcpy(buf, frag->data, frag->length);
next = frag->next;
buf += frag->length;
kfree(frag);
frag = next;
}
return rc;
}
EXPORT_SYMBOL(msm_rpc_read);
int msm_rpc_call(struct msm_rpc_endpoint *ept, uint32_t proc,
void *_request, int request_size,
long timeout)
{
return msm_rpc_call_reply(ept, proc,
_request, request_size,
NULL, 0, timeout);
}
EXPORT_SYMBOL(msm_rpc_call);
int msm_rpc_call_reply(struct msm_rpc_endpoint *ept, uint32_t proc,
void *_request, int request_size,
void *_reply, int reply_size,
long timeout)
{
struct rpc_request_hdr *req = _request;
struct rpc_reply_hdr *reply;
int rc;
if (request_size < sizeof(*req))
return -ETOOSMALL;
if (ept->dst_pid == 0xffffffff)
return -ENOTCONN;
memset(req, 0, sizeof(*req));
req->xid = cpu_to_be32(atomic_add_return(1, &next_xid));
req->rpc_vers = cpu_to_be32(2);
req->prog = ept->dst_prog;
req->vers = ept->dst_vers;
req->procedure = cpu_to_be32(proc);
rc = msm_rpc_write(ept, req, request_size);
if (rc < 0)
return rc;
for (;;) {
rc = msm_rpc_read(ept, (void*) &reply, -1, timeout);
if (rc < 0)
return rc;
if (rc < (3 * sizeof(uint32_t))) {
rc = -EIO;
break;
}
/* we should not get CALL packets -- ignore them */
if (reply->type == 0) {
kfree(reply);
continue;
}
/* If an earlier call timed out, we could get the (no
* longer wanted) reply for it. Ignore replies that
* we don't expect
*/
if (reply->xid != req->xid) {
kfree(reply);
continue;
}
if (reply->reply_stat != 0) {
rc = -EPERM;
break;
}
if (reply->data.acc_hdr.accept_stat != 0) {
rc = -EINVAL;
break;
}
if (_reply == NULL) {
rc = 0;
break;
}
if (rc > reply_size) {
rc = -ENOMEM;
} else {
memcpy(_reply, reply, rc);
}
break;
}
kfree(reply);
return rc;
}
EXPORT_SYMBOL(msm_rpc_call_reply);
static inline int ept_packet_available(struct msm_rpc_endpoint *ept)
{
unsigned long flags;
int ret;
spin_lock_irqsave(&ept->read_q_lock, flags);
ret = !list_empty(&ept->read_q);
spin_unlock_irqrestore(&ept->read_q_lock, flags);
return ret;
}
int __msm_rpc_read(struct msm_rpc_endpoint *ept,
struct rr_fragment **frag_ret,
unsigned len, long timeout)
{
struct rr_packet *pkt;
struct rpc_request_hdr *rq;
struct msm_rpc_reply *reply;
unsigned long flags;
int rc;
rc = wait_for_restart_and_notify(ept);
if (rc)
return rc;
IO("READ on ept %p\n", ept);
if (ept->flags & MSM_RPC_UNINTERRUPTIBLE) {
if (timeout < 0) {
wait_event(ept->wait_q, (ept_packet_available(ept) ||
ept->forced_wakeup ||
ept->restart_state));
if (!msm_rpc_clear_netreset(ept))
return -ENETRESET;
} else {
rc = wait_event_timeout(
ept->wait_q,
(ept_packet_available(ept) ||
ept->forced_wakeup ||
ept->restart_state),
timeout);
if (!msm_rpc_clear_netreset(ept))
return -ENETRESET;
if (rc == 0)
return -ETIMEDOUT;
}
} else {
if (timeout < 0) {
rc = wait_event_interruptible(
ept->wait_q, (ept_packet_available(ept) ||
ept->forced_wakeup ||
ept->restart_state));
if (!msm_rpc_clear_netreset(ept))
return -ENETRESET;
if (rc < 0)
return rc;
} else {
rc = wait_event_interruptible_timeout(
ept->wait_q,
(ept_packet_available(ept) ||
ept->forced_wakeup ||
ept->restart_state),
timeout);
if (!msm_rpc_clear_netreset(ept))
return -ENETRESET;
if (rc == 0)
return -ETIMEDOUT;
}
}
if (ept->forced_wakeup) {
ept->forced_wakeup = 0;
return 0;
}
spin_lock_irqsave(&ept->read_q_lock, flags);
if (list_empty(&ept->read_q)) {
spin_unlock_irqrestore(&ept->read_q_lock, flags);
return -EAGAIN;
}
pkt = list_first_entry(&ept->read_q, struct rr_packet, list);
if (pkt->length > len) {
spin_unlock_irqrestore(&ept->read_q_lock, flags);
return -ETOOSMALL;
}
list_del(&pkt->list);
spin_unlock_irqrestore(&ept->read_q_lock, flags);
rc = pkt->length;
*frag_ret = pkt->first;
rq = (void*) pkt->first->data;
if ((rc >= (sizeof(uint32_t) * 3)) && (rq->type == 0)) {
/* RPC CALL */
reply = get_avail_reply(ept);
if (!reply) {
rc = -ENOMEM;
goto read_release_lock;
}
reply->cid = pkt->hdr.src_cid;
reply->pid = pkt->hdr.src_pid;
reply->xid = rq->xid;
reply->prog = rq->prog;
reply->vers = rq->vers;
set_pend_reply(ept, reply);
}
kfree(pkt);
IO("READ on ept %p (%d bytes)\n", ept, rc);
read_release_lock:
/* release read wakelock after taking reply wakelock */
spin_lock_irqsave(&ept->read_q_lock, flags);
if (list_empty(&ept->read_q)) {
D("%s: release read lock on ept %p\n", __func__, ept);
wake_unlock(&ept->read_q_wake_lock);
}
spin_unlock_irqrestore(&ept->read_q_lock, flags);
return rc;
}
int msm_rpc_is_compatible_version(uint32_t server_version,
uint32_t client_version)
{
if ((server_version & RPC_VERSION_MODE_MASK) !=
(client_version & RPC_VERSION_MODE_MASK))
return 0;
if (server_version & RPC_VERSION_MODE_MASK)
return server_version == client_version;
return ((server_version & RPC_VERSION_MAJOR_MASK) ==
(client_version & RPC_VERSION_MAJOR_MASK)) &&
((server_version & RPC_VERSION_MINOR_MASK) >=
(client_version & RPC_VERSION_MINOR_MASK));
}
EXPORT_SYMBOL(msm_rpc_is_compatible_version);
static struct rr_server *msm_rpc_get_server(uint32_t prog, uint32_t vers,
uint32_t accept_compatible,
uint32_t *found_prog)
{
struct rr_server *server;
unsigned long flags;
if (found_prog == NULL)
return NULL;
*found_prog = 0;
spin_lock_irqsave(&server_list_lock, flags);
list_for_each_entry(server, &server_list, list) {
if (server->prog == prog) {
*found_prog = 1;
spin_unlock_irqrestore(&server_list_lock, flags);
if (accept_compatible) {
if (msm_rpc_is_compatible_version(server->vers,
vers)) {
return server;
} else {
return NULL;
}
} else if (server->vers == vers) {
return server;
} else
return NULL;
}
}
spin_unlock_irqrestore(&server_list_lock, flags);
return NULL;
}
static struct msm_rpc_endpoint *__msm_rpc_connect(uint32_t prog, uint32_t vers,
uint32_t accept_compatible,
unsigned flags)
{
struct msm_rpc_endpoint *ept;
struct rr_server *server;
uint32_t found_prog;
int rc = 0;
DEFINE_WAIT(__wait);
for (;;) {
prepare_to_wait(&newserver_wait, &__wait,
TASK_INTERRUPTIBLE);
server = msm_rpc_get_server(prog, vers, accept_compatible,
&found_prog);
if (server)
break;
if (found_prog) {
pr_info("%s: server not found %x:%x\n",
__func__, prog, vers);
rc = -EHOSTUNREACH;
break;
}
if (msm_rpc_connect_timeout_ms == 0) {
rc = -EHOSTUNREACH;
break;
}
if (signal_pending(current)) {
rc = -ERESTARTSYS;
break;
}
rc = schedule_timeout(
msecs_to_jiffies(msm_rpc_connect_timeout_ms));
if (!rc) {
rc = -ETIMEDOUT;
break;
}
}
finish_wait(&newserver_wait, &__wait);
if (!server)
return ERR_PTR(rc);
if (accept_compatible && (server->vers != vers)) {
D("RPC Using new version 0x%08x(0x%08x) prog 0x%08x",
vers, server->vers, prog);
D(" ... Continuing\n");
}
ept = msm_rpc_open();
if (IS_ERR(ept))
return ept;
ept->flags = flags;
ept->dst_pid = server->pid;
ept->dst_cid = server->cid;
ept->dst_prog = cpu_to_be32(prog);
ept->dst_vers = cpu_to_be32(server->vers);
return ept;
}
struct msm_rpc_endpoint *msm_rpc_connect_compatible(uint32_t prog,
uint32_t vers, unsigned flags)
{
return __msm_rpc_connect(prog, vers, 1, flags);
}
EXPORT_SYMBOL(msm_rpc_connect_compatible);
struct msm_rpc_endpoint *msm_rpc_connect(uint32_t prog,
uint32_t vers, unsigned flags)
{
return __msm_rpc_connect(prog, vers, 0, flags);
}
EXPORT_SYMBOL(msm_rpc_connect);
/* TODO: permission check? */
int msm_rpc_register_server(struct msm_rpc_endpoint *ept,
uint32_t prog, uint32_t vers)
{
int rc;
union rr_control_msg msg;
struct rr_server *server;
struct rpcrouter_xprt_info *xprt_info;
server = rpcrouter_create_server(ept->pid, ept->cid,
prog, vers);
if (!server)
return -ENODEV;
msg.srv.cmd = RPCROUTER_CTRL_CMD_NEW_SERVER;
msg.srv.pid = ept->pid;
msg.srv.cid = ept->cid;
msg.srv.prog = prog;
msg.srv.vers = vers;
RR("x NEW_SERVER id=%d:%08x prog=%08x:%08x\n",
ept->pid, ept->cid, prog, vers);
mutex_lock(&xprt_info_list_lock);
list_for_each_entry(xprt_info, &xprt_info_list, list) {
rc = rpcrouter_send_control_msg(xprt_info, &msg);
if (rc < 0) {
mutex_unlock(&xprt_info_list_lock);
return rc;
}
}
mutex_unlock(&xprt_info_list_lock);
return 0;
}
int msm_rpc_clear_netreset(struct msm_rpc_endpoint *ept)
{
unsigned long flags;
int rc = 1;
spin_lock_irqsave(&ept->restart_lock, flags);
if (ept->restart_state != RESTART_NORMAL) {
ept->restart_state &= ~RESTART_PEND_NTFY;
rc = 0;
}
spin_unlock_irqrestore(&ept->restart_lock, flags);
return rc;
}
/* TODO: permission check -- disallow unreg of somebody else's server */
int msm_rpc_unregister_server(struct msm_rpc_endpoint *ept,
uint32_t prog, uint32_t vers)
{
struct rr_server *server;
server = rpcrouter_lookup_server(prog, vers);
if (!server)
return -ENOENT;
rpcrouter_destroy_server(server);
return 0;
}
int msm_rpc_get_curr_pkt_size(struct msm_rpc_endpoint *ept)
{
unsigned long flags;
struct rr_packet *pkt;
int rc = 0;
if (!ept)
return -EINVAL;
if (!msm_rpc_clear_netreset(ept))
return -ENETRESET;
spin_lock_irqsave(&ept->read_q_lock, flags);
if (!list_empty(&ept->read_q)) {
pkt = list_first_entry(&ept->read_q, struct rr_packet, list);
rc = pkt->length;
}
spin_unlock_irqrestore(&ept->read_q_lock, flags);
return rc;
}
static int msm_rpcrouter_close(void)
{
struct rpcrouter_xprt_info *xprt_info;
union rr_control_msg ctl;
ctl.cmd = RPCROUTER_CTRL_CMD_BYE;
mutex_lock(&xprt_info_list_lock);
while (!list_empty(&xprt_info_list)) {
xprt_info = list_first_entry(&xprt_info_list,
struct rpcrouter_xprt_info, list);
modem_reset_cleanup(xprt_info);
xprt_info->abort_data_read = 1;
wake_up(&xprt_info->read_wait);
rpcrouter_send_control_msg(xprt_info, &ctl);
xprt_info->xprt->close();
list_del(&xprt_info->list);
mutex_unlock(&xprt_info_list_lock);
flush_workqueue(xprt_info->workqueue);
destroy_workqueue(xprt_info->workqueue);
wake_lock_destroy(&xprt_info->wakelock);
/*free memory*/
xprt_info->xprt->priv = 0;
kfree(xprt_info);
mutex_lock(&xprt_info_list_lock);
}
mutex_unlock(&xprt_info_list_lock);
return 0;
}
#if defined(CONFIG_DEBUG_FS)
static int dump_servers(char *buf, int max)
{
int i = 0;
unsigned long flags;
struct rr_server *svr;
const char *sym;
spin_lock_irqsave(&server_list_lock, flags);
list_for_each_entry(svr, &server_list, list) {
i += scnprintf(buf + i, max - i, "pdev_name: %s\n",
svr->pdev_name);
i += scnprintf(buf + i, max - i, "pid: 0x%08x\n", svr->pid);
i += scnprintf(buf + i, max - i, "cid: 0x%08x\n", svr->cid);
i += scnprintf(buf + i, max - i, "prog: 0x%08x", svr->prog);
sym = smd_rpc_get_sym(svr->prog);
if (sym)
i += scnprintf(buf + i, max - i, " (%s)\n", sym);
else
i += scnprintf(buf + i, max - i, "\n");
i += scnprintf(buf + i, max - i, "vers: 0x%08x\n", svr->vers);
i += scnprintf(buf + i, max - i, "\n");
}
spin_unlock_irqrestore(&server_list_lock, flags);
return i;
}
static int dump_remote_endpoints(char *buf, int max)
{
int i = 0;
unsigned long flags;
struct rr_remote_endpoint *ept;
spin_lock_irqsave(&remote_endpoints_lock, flags);
list_for_each_entry(ept, &remote_endpoints, list) {
i += scnprintf(buf + i, max - i, "pid: 0x%08x\n", ept->pid);
i += scnprintf(buf + i, max - i, "cid: 0x%08x\n", ept->cid);
i += scnprintf(buf + i, max - i, "tx_quota_cntr: %i\n",
ept->tx_quota_cntr);
i += scnprintf(buf + i, max - i, "quota_restart_state: %i\n",
ept->quota_restart_state);
i += scnprintf(buf + i, max - i, "\n");
}
spin_unlock_irqrestore(&remote_endpoints_lock, flags);
return i;
}
static int dump_msm_rpc_endpoint(char *buf, int max)
{
int i = 0;
unsigned long flags;
struct msm_rpc_reply *reply;
struct msm_rpc_endpoint *ept;
struct rr_packet *pkt;
const char *sym;
spin_lock_irqsave(&local_endpoints_lock, flags);
list_for_each_entry(ept, &local_endpoints, list) {
i += scnprintf(buf + i, max - i, "pid: 0x%08x\n", ept->pid);
i += scnprintf(buf + i, max - i, "cid: 0x%08x\n", ept->cid);
i += scnprintf(buf + i, max - i, "dst_pid: 0x%08x\n",
ept->dst_pid);
i += scnprintf(buf + i, max - i, "dst_cid: 0x%08x\n",
ept->dst_cid);
i += scnprintf(buf + i, max - i, "dst_prog: 0x%08x",
be32_to_cpu(ept->dst_prog));
sym = smd_rpc_get_sym(be32_to_cpu(ept->dst_prog));
if (sym)
i += scnprintf(buf + i, max - i, " (%s)\n", sym);
else
i += scnprintf(buf + i, max - i, "\n");
i += scnprintf(buf + i, max - i, "dst_vers: 0x%08x\n",
be32_to_cpu(ept->dst_vers));
i += scnprintf(buf + i, max - i, "reply_cnt: %i\n",
ept->reply_cnt);
i += scnprintf(buf + i, max - i, "restart_state: %i\n",
ept->restart_state);
i += scnprintf(buf + i, max - i, "outstanding xids:\n");
spin_lock(&ept->reply_q_lock);
list_for_each_entry(reply, &ept->reply_pend_q, list)
i += scnprintf(buf + i, max - i, " xid = %u\n",
ntohl(reply->xid));
spin_unlock(&ept->reply_q_lock);
i += scnprintf(buf + i, max - i, "complete unread packets:\n");
spin_lock(&ept->read_q_lock);
list_for_each_entry(pkt, &ept->read_q, list) {
i += scnprintf(buf + i, max - i, " mid = %i\n",
pkt->mid);
i += scnprintf(buf + i, max - i, " length = %i\n",
pkt->length);
}
spin_unlock(&ept->read_q_lock);
i += scnprintf(buf + i, max - i, "\n");
}
spin_unlock_irqrestore(&local_endpoints_lock, flags);
return i;
}
#define DEBUG_BUFMAX 4096
static char debug_buffer[DEBUG_BUFMAX];
static ssize_t debug_read(struct file *file, char __user *buf,
size_t count, loff_t *ppos)
{
int (*fill)(char *buf, int max) = file->private_data;
int bsize = fill(debug_buffer, DEBUG_BUFMAX);
return simple_read_from_buffer(buf, count, ppos, debug_buffer, bsize);
}
static int debug_open(struct inode *inode, struct file *file)
{
file->private_data = inode->i_private;
return 0;
}
static const struct file_operations debug_ops = {
.read = debug_read,
.open = debug_open,
};
static void debug_create(const char *name, mode_t mode,
struct dentry *dent,
int (*fill)(char *buf, int max))
{
debugfs_create_file(name, mode, dent, fill, &debug_ops);
}
static void debugfs_init(void)
{
struct dentry *dent;
dent = debugfs_create_dir("smd_rpcrouter", 0);
if (IS_ERR(dent))
return;
debug_create("dump_msm_rpc_endpoints", 0444, dent,
dump_msm_rpc_endpoint);
debug_create("dump_remote_endpoints", 0444, dent,
dump_remote_endpoints);
debug_create("dump_servers", 0444, dent,
dump_servers);
}
#else
static void debugfs_init(void) {}
#endif
static int msm_rpcrouter_add_xprt(struct rpcrouter_xprt *xprt)
{
struct rpcrouter_xprt_info *xprt_info;
D("Registering xprt %s to RPC Router\n", xprt->name);
xprt_info = kmalloc(sizeof(struct rpcrouter_xprt_info), GFP_KERNEL);
if (!xprt_info)
return -ENOMEM;
xprt_info->xprt = xprt;
xprt_info->initialized = 0;
xprt_info->remote_pid = -1;
init_waitqueue_head(&xprt_info->read_wait);
spin_lock_init(&xprt_info->lock);
wake_lock_init(&xprt_info->wakelock,
WAKE_LOCK_SUSPEND, xprt->name);
xprt_info->need_len = 0;
xprt_info->abort_data_read = 0;
INIT_WORK(&xprt_info->read_data, do_read_data);
INIT_LIST_HEAD(&xprt_info->list);
xprt_info->workqueue = create_singlethread_workqueue(xprt->name);
if (!xprt_info->workqueue) {
kfree(xprt_info);
return -ENOMEM;
}
if (!strcmp(xprt->name, "rpcrouter_loopback_xprt")) {
xprt_info->remote_pid = RPCROUTER_PID_LOCAL;
xprt_info->initialized = 1;
} else {
smsm_change_state(SMSM_APPS_STATE, 0, SMSM_RPCINIT);
}
mutex_lock(&xprt_info_list_lock);
list_add_tail(&xprt_info->list, &xprt_info_list);
mutex_unlock(&xprt_info_list_lock);
queue_work(xprt_info->workqueue, &xprt_info->read_data);
xprt->priv = xprt_info;
return 0;
}
static void msm_rpcrouter_remove_xprt(struct rpcrouter_xprt *xprt)
{
struct rpcrouter_xprt_info *xprt_info;
unsigned long flags;
if (xprt && xprt->priv) {
xprt_info = xprt->priv;
/* abort rr_read thread */
xprt_info->abort_data_read = 1;
wake_up(&xprt_info->read_wait);
/* remove xprt from available xprts */
mutex_lock(&xprt_info_list_lock);
spin_lock_irqsave(&xprt_info->lock, flags);
list_del(&xprt_info->list);
/* unlock the spinlock last to avoid a race
* condition with rpcrouter_get_xprt_info
* in msm_rpc_write_pkt in which the
* xprt is returned from rpcrouter_get_xprt_info
* and then deleted here. */
mutex_unlock(&xprt_info_list_lock);
spin_unlock_irqrestore(&xprt_info->lock, flags);
/* cleanup workqueues and wakelocks */
flush_workqueue(xprt_info->workqueue);
destroy_workqueue(xprt_info->workqueue);
wake_lock_destroy(&xprt_info->wakelock);
/* free memory */
xprt->priv = 0;
kfree(xprt_info);
}
}
struct rpcrouter_xprt_work {
struct rpcrouter_xprt *xprt;
struct work_struct work;
};
static void xprt_open_worker(struct work_struct *work)
{
struct rpcrouter_xprt_work *xprt_work =
container_of(work, struct rpcrouter_xprt_work, work);
msm_rpcrouter_add_xprt(xprt_work->xprt);
kfree(xprt_work);
}
static void xprt_close_worker(struct work_struct *work)
{
struct rpcrouter_xprt_work *xprt_work =
container_of(work, struct rpcrouter_xprt_work, work);
modem_reset_cleanup(xprt_work->xprt->priv);
msm_rpcrouter_remove_xprt(xprt_work->xprt);
if (atomic_dec_return(&pending_close_count) == 0)
wake_up(&subsystem_restart_wait);
kfree(xprt_work);
}
void msm_rpcrouter_xprt_notify(struct rpcrouter_xprt *xprt, unsigned event)
{
struct rpcrouter_xprt_info *xprt_info;
struct rpcrouter_xprt_work *xprt_work;
unsigned long flags;
/* Workqueue is created in init function which works for all existing
* clients. If this fails in the future, then it will need to be
* created earlier. */
BUG_ON(!rpcrouter_workqueue);
switch (event) {
case RPCROUTER_XPRT_EVENT_OPEN:
D("open event for '%s'\n", xprt->name);
xprt_work = kmalloc(sizeof(struct rpcrouter_xprt_work),
GFP_ATOMIC);
xprt_work->xprt = xprt;
INIT_WORK(&xprt_work->work, xprt_open_worker);
queue_work(rpcrouter_workqueue, &xprt_work->work);
break;
case RPCROUTER_XPRT_EVENT_CLOSE:
D("close event for '%s'\n", xprt->name);
atomic_inc(&pending_close_count);
xprt_work = kmalloc(sizeof(struct rpcrouter_xprt_work),
GFP_ATOMIC);
xprt_work->xprt = xprt;
INIT_WORK(&xprt_work->work, xprt_close_worker);
queue_work(rpcrouter_workqueue, &xprt_work->work);
break;
}
xprt_info = xprt->priv;
if (xprt_info) {
spin_lock_irqsave(&xprt_info->lock, flags);
/* Check read_avail even for OPEN event to handle missed
DATA events while processing the OPEN event*/
if (xprt->read_avail() >= xprt_info->need_len)
wake_lock(&xprt_info->wakelock);
wake_up(&xprt_info->read_wait);
spin_unlock_irqrestore(&xprt_info->lock, flags);
}
}
static int modem_restart_notifier_cb(struct notifier_block *this,
unsigned long code,
void *data);
static struct notifier_block nb = {
.notifier_call = modem_restart_notifier_cb,
};
static int modem_restart_notifier_cb(struct notifier_block *this,
unsigned long code,
void *data)
{
switch (code) {
case SUBSYS_BEFORE_SHUTDOWN:
D("%s: SUBSYS_BEFORE_SHUTDOWN\n", __func__);
break;
case SUBSYS_BEFORE_POWERUP:
D("%s: waiting for RPC restart to complete\n", __func__);
wait_event(subsystem_restart_wait,
atomic_read(&pending_close_count) == 0);
D("%s: finished restart wait\n", __func__);
break;
default:
break;
}
return NOTIFY_DONE;
}
static void *restart_notifier_handle;
static __init int modem_restart_late_init(void)
{
restart_notifier_handle = subsys_notif_register_notifier("modem", &nb);
return 0;
}
late_initcall(modem_restart_late_init);
static int __init rpcrouter_init(void)
{
int ret;
msm_rpc_connect_timeout_ms = 0;
smd_rpcrouter_debug_mask |= SMEM_LOG;
debugfs_init();
ret = register_reboot_notifier(&msm_rpc_reboot_notifier);
if (ret)
pr_err("%s: Failed to register reboot notifier", __func__);
/* Initialize what we need to start processing */
rpcrouter_workqueue =
create_singlethread_workqueue("rpcrouter");
if (!rpcrouter_workqueue) {
msm_rpcrouter_exit_devices();
return -ENOMEM;
}
init_waitqueue_head(&newserver_wait);
init_waitqueue_head(&subsystem_restart_wait);
ret = msm_rpcrouter_init_devices();
if (ret < 0)
return ret;
return ret;
}
module_init(rpcrouter_init);
MODULE_DESCRIPTION("MSM RPC Router");
MODULE_AUTHOR("San Mehat <san@android.com>");
MODULE_LICENSE("GPL");
|
2024-07-18T01:26:36.242652
|
https://example.com/article/7723
|
The media has placed a lot of emphasis on the racial wealth gap. According to the US Census Bureau , in 2014, white-only households had a median net worth of $102,800, while the corresponding statistic was $17,530 for Hispanic-only households of any race and $9,590 for black-only households. These are ratios of approximately 5:1 and 10:1 for white households compared to Hispanic and black households, respectively. There are many proposed explanations for this gap in the media and academia, including both historical and current causes. Although there are undoubtedly myriad causes of and explanations for the wealth gap, I simply want to point toward three relatively straightforward ways that we can begin to make headway toward closing this gap.
Low Interest Rates Harm Minority-Owned Small Businesses
Economists within the Austrian tradition have long pointed out that artificially low interest rates favor certain kinds of investments over others, including “more durable capital goods” and “more roundabout production processes.” Although disputed by economists of the Keynesian tradition, Benjamin Thompson points to a new National Bureau of Economic Research paper that found much empirical evidence to support this Austrian contention about low interest rates. In short, low interest rates tend to favor big business by incentivizing large, long-term investments over small, short-term investments, which clearly gives advantages to large market players over small businesses.
What does this have to do with the racial wealth gap? One of the best ways to build wealth is by establishing a successful business. A report by the US Small Business Administration found that minority-owned businesses, specifically those owned by black and Hispanic Americans, tend to be smaller in size than those owned by non-Hispanic white Americans. For instance, only 4.2 percent of black-owned firms and 8.7 percent of Hispanic-owned firms have employees compared to 21.8 percent of white-owned firms. Similarly, within firms that do have employees, the average number of employees is only 8.9 per firm for black-owned companies and 8.1 for Hispanic-owned companies, while the corresponding statistic for white-owned companies is 11.6.
Overall, the report pointed to many different factors that contribute to the disparities in earnings, employment, and prevalence of non-minority versus minority-owned businesses. However, the data clearly indicate that minority-owned businesses are smaller on average. Thus, reversing policies that inhibit the growth and competitiveness of small businesses, including artificially low interest rates, could help minority households generate and maintain higher amounts of wealth. Not only will this at least contribute to closing the wealth gap, but it will also help maintain a more competitive economy that is resistant to the concentration of market shares.
Occupational Licensure Disincentivizes Entrepreneurship
Raising interest rates is not the only way to help small businesses grow and aid minority households in establishing wealth. Large up-front costs, such as business registration, licensing, and regulation compliance make it difficult for small businesses to raise enough initial capital to begin their business venture. Given the already established fact that minorities are more likely to own small businesses and have disproportionately less wealth to invest in starting a business, it logically follows that increasing start-up costs for small businesses will harm minority entrepreneurs.
Ilya Shapiro provides a salient example of this principle in his account of the tribulations of Ndioba Niang and Tameka Stigers. They are two African hair-braiders who were taken to court by the Missouri Board of Cosmetology because they did not have the proper cosmetology license for braiding hair, a license that costs thousands of dollars and many hours of unpaid labor to obtain. Ultimately, the court ruled in favor of the Missouri Board of Cosmetology, and Ndioba and Tameka were prevented from making a living by braiding hair. The justification for licensing laws such as these is that they protect public health and safety, preventing uninformed consumers from soliciting low-quality services or products. However, there are ways to derive the benefits of licensing laws without disproportionately punishing small businesses and minorities.
For instance, licensing could be made optional, and the government could simply mandate that businesses make it clear to consumers whether they have a license or not. Thus, if the licensure truly protects public health and safety, consumers will largely choose businesses that are licensed by the government. One could argue that if licensing were optional, then no businesses would pay the money to become licensed. However, of the 102 occupations that require some form of licensing, only 15 percent of occupations are licensed in 40 or more states, and the average number of states that require licensing for any given profession is 22. Therefore, there are many states where these occupations are not licensed at all, suggesting that even businesses without licenses tend to not threaten health and safety in any significant way.
Civil Asset Forfeiture Targets the Wealth of Minorities
In addition to policies that promote the growth of wealth accumulated by minorities, we should also abolish policies that directly steal wealth from innocent people. Civil asset forfeiture essentially allows police to seize property from people provided that the property is suspected of being connected to a crime. In 43 states , between 50 percent and 100 percent of the assets seized can be used as funding for the police departments, which presents a direct profit motive to seize people’s property regardless of their innocence. Additionally, in order to get the property back, many states require that victims of civil asset forfeiture go to court, which is an expensive process that many people cannot afford because counsel is not provided for cases taken against property.
An article by James Devereaux points to a study from the economics department of George Mason University, which found that police departments retaining revenue from asset forfeiture is linked to disproportionately increased arrest rates of black and Hispanic Americans, and this effect unsurprisingly occurs under periods of limited budgets. Ending the disproportionate appropriation of wealth from minority individuals without due process is an obvious way to try to close the racial wealth gap.
Although proponents of civil asset forfeiture argue that the laws help fight large drug cartels and organized crime, this does not necessitate that police departments be allowed to take property without a conviction. At the bare minimum, it would be both just and economically advisable to mandate a conviction before allowing civil asset forfeiture to take place. However, even this might incentivize immoral practices such as planting fake evidence or dishonest accounts of encounters with civilians, especially when dealing with drug arrests. Ultimately, finding a new way to counter drug cartels and organized crime would be highly advisable.
Small Reforms that Give Large Returns
Ultimately, the racial wealth gap is a complex socio-economic phenomenon with myriad plausible explanations and solutions, but the good news is that regardless of its causes, there exist tangible and straightforward policy initiatives that can decrease the disparity. Raising artificially low interest rates, removing occupational licensure, and repealing civil asset forfeiture are seemingly unrelated and irrelevant policies; however, what they all have in common is that they do not require complex policy goals but rather the simple repeal of existing, unjust laws. Regardless of the debated historical causes, focusing on existing injustices can aid progress toward a more perfect union.
|
2024-05-05T01:26:36.242652
|
https://example.com/article/6710
|
Jessica Durando
USA TODAY
Chomping down on 43 1/2 socks was enough to make one 3-year-old Great Dane pretty sick.
After vomiting and retching during the day, abdominal radiographs revealed "a severely distended stomach and a large quality of foreign material," according to Veterinary Practice News.
During surgery performed by a DoveLewis veterinarian in Portland, Ore., the socks were removed. The dog was sent home one day after surgery.
When Dr. Ashley Magee at DoveLewis Animal Hospital opened the dogs stomach, she told KGW-TV, they "kept removing sock after sock of all different shapes and sizes."
The animal hospital submitted the example to the annual "They Ate WHAT?" contest at Veterinary Practice News, which was published online on August 27.
DoveLewis won the $500 third prize. Not bad.
They put their winnings into the Velvet Assistance Fund, which aids qualifying low-income families facing veterinary emergencies.
Magee said the dog had been in for check-ups since surgery, and was doing fine. She hoped the dog had changed its ways.
"He did have a history of preference for socks," she told KGW-TV.
Follow @JessicaDurando on Twitter
|
2024-06-24T01:26:36.242652
|
https://example.com/article/9049
|
Introduction {#s1}
============
Cancers are initiated by genetic preconditions and epigenetic alterations, accompanied by various mechanisms, most of which are still unclear (Bach and Lee, [@B3]). According to Hanahan and Weinberg, these mechanisms are characterized by eight hallmark capabilities which include: sustaining proliferative signaling, evading growth suppressors, activating invasion and metastasis, enabling replicative immortality, inducing angiogenesis, resisting cell death, avoiding immune destruction, and dysregulating cellular energetics (Hanahan and Weinberg, [@B47]). Despite recent advancements in early diagnosis and personalized treatments, cancer incidence is increasing steadily, and the overall survival rate of patients remains poor (Balani et al., [@B4]). Therefore, it is crucial to develop a comprehensive understanding of the molecular mechanisms underlying tumor development and progression.
Hepatocyte growth factor (HGF)/c-mesenchymal-epithelial transition factor (c-Met) axis is an essential mediation axis that regulates cellular biological events including cell proliferation, migration and morphogenesis and tumor biological processes such as angiogenesis and drug resistance (Ebens et al., [@B30]; Arnold et al., [@B2]). The molecular mechanism of this activation involves gene amplification, overexpression of c-Met and HGF proteins, incremental crosstalk between c-Met and other tyrosine kinases, and MET gene mutation (Zhang et al., [@B128]). Furthermore, this axis has been generally reported to deregulate in tumor tissues. And its constitutive over-activation, with canonical signaling pathways containing effector molecules such as STAT3/5, PI3K-AKT, and RAS-MAPK activating, which induce malignant phenotype and promoting tumorigenesis, has been implicated in the progression of multifarious cancers (Fukushima et al., [@B36]). For example, Han et al. found that HGF treatment-induced epithelial-mesenchymal transition (EMT) -like changes and increased the invasive potential of PC-3 cells in human prostate cancer through ERK/MAPK (extracellular-signal-regulated kinase/mitogen-activated protein kinase) and zinc finger E-box binding homeobox 1 (Zeb-1) signaling pathways (Han et al., [@B46]).
Non-coding RNAs are a cluster of RNA that have non-protein-coding transcripts and are the most common RNA species in eukaryotic cells, including rRNA, tRNA, microRNA, snoRNA, piwi-interacting RNA (piRNA), circRNA, lncRNA, and so on (Slack and Chinnaiyan, [@B90]). Since the last decade, increasing studies have confirmed that ncRNAs play pivotal roles in various tumors development by targeting diversified downstream genes and signaling pathways and serve as tumor suppressors or stimulators (Higashio et al., [@B49]; Martianov et al., [@B76]; De Smet et al., [@B26]). Among them, miRNAs (small 20- to 25-nucleotide-long RNAs) and lncRNAs (larger than 200 nucleotides long) are the most common molecules that are investigated worldwide. In the recent past, a significant interaction network between HGF/c-Met axis and ncRNAs has been observed in a considerable number of tumors, stressing further the importance of the HGF/c-Met axis in tumorigenesis.
In this review, the crosstalk between the HGF/c-Met axis and ncRNAs (mostly miRNAs and lncRNAs) in common human cancers are summarized. Also, a comprehensive understanding of their potential mechanisms and roles in cancer development are provided. These findings could open a broader horizon for investigators to engage in exploring the molecular mechanisms in cancer development and progression.
An Overview of HGF/c-Met Axis {#s2}
=============================
HGF, also known as scatter factor, is located on chromosome 7q21 and is a member of the peptidase S1 family of serine proteases, but is short of peptidase activity (Garcia-Vilas and Medina, [@B40]). It was initially identified as a molecule with the ability to stimulate hepatocyte growth and liver regeneration (Ebens et al., [@B30]). It is a large multi-domain heterodimeric protein comprising of α-chain (69 kD) and β-chain (34 kD) subunits and is mainly secreted by mesenchymal cells. The α-chain subunit contains an N-terminal hairpin loop and four kringle domains (K1--K4), which are responsible for the high-affinity binding to the c-Met receptor (Higashio et al., [@B49]; Organ and Tsao, [@B82]; Chen C. T. et al., [@B11]). Through cleaving at the Arg494-Val495 bond, it can transform from an inactive single-chain precursor (pro-HGF) to mature HGF after activation by extracellular proteases such as cellular type II transmembrane serine proteases (Fukushima et al., [@B36]).
C-Met is located on chromosome 7q21-31 and belongs to the family of receptor tyrosine kinases (Zhang et al., [@B128]). It is a heterodimer composed of a highly glycosylated extracellular 50 kDa α-chain and a transmembrane 140 kDa β-chain, linked together by disulfide bonds (Baldanzi and Graziani, [@B5]). As a natural HGF receptor, it is expressed on the surfaces of various epithelial cells and is known for its roles in promoting tumorigenesis. After binding to the HGF, the two subunits are dimerized, leading to the autophosphorylation of two tyrosine residues (Tyr1234 and 1235). The autophosphorylation of the tyrosine residues results in an activated multifunctional docking site composed of Src homology-2 (SH2) domain, phosphotyrosine binding (PTB) domain, and Met binding domain (MDB), which recruit adapter molecules (Furge et al., [@B37]). For example, Grb-2, which is a vital element in HGF/c-Met axis, interacts with Y1356 of c-Met and several essential signaling pathway-related proteins such as Ras, SOS, and Gab1 and eventually activates them. Besides, these residues also recruit PI3K, STAT3, PLCγ, and SHP2 thereby linking oncogenes and many receptors which are crucial for cellular functions (Garcia-Vilas and Medina, [@B40]). Moreover, it has been revealed that c-Met could be activated by non-canonical pathways. Non-canonical pathways are related to c-Met amplification, drug-resistant cancers and malignant tumor features. Several membrane surface proteins (EGFR, β-catenin, MUC-1, CD44, VEGFA, Plexin B, FAK, HER, Integrin α6β4, Fas, etc.) have been confirmed to interact with c-Met and contribute to dynamic c-Met biological responses (Migliore and Giordano, [@B77]; Scagliotti et al., [@B88]). The molecular network of the HGF/c-Met signaling is shown in [Figure 1](#F1){ref-type="fig"}.
{#F1}
Crosstalk Between HGF/c-Met Axis and ncRNAs in Cancers {#s3}
======================================================
This chapter summarizes the interaction between the HGF/c-Met axis and ncRNAs in common cancers. The outline is shown in [Figure 2](#F2){ref-type="fig"}, [Tables 1](#T1){ref-type="table"}, [2](#T2){ref-type="table"}.
{#F2}
######
The crosstalk between microRNAs and HGF/c-Met axis in cancers.
**NcRNAs** **Year** **Expression status in cancers** **Role in cancers** **Mechanism**
----------------------------------------------- ------------------ ------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------
**LUNG CANCER**
MiR-7515 2013 Downexpression Inhibit proliferation and migration Targeting c-Met and altering the signaling of downstream cell-cycle-related proteins
MiR-27a 2013 / / Targeting MET and EGFR
MiR-27b 2017 Downexpression Inhibit the proliferation, migration, and invasion Targeting Met
MiR-34a 2015 Downexpression Serve as a prognostic factor for recurrence Regulating c-Met and CDK6 expression
MiR-34b 2013 Downexpression Induce cell apoptosis Regulating phospho-Met, P53 and Mdm2 expression
MiR-409-3p 2014 Downexpression Inhibit growth, induce apoptosis, reduce migration, and invasion Regulating Akt signaling pathway by targeting c-Met
MiR-449a 2013 Downexpression Inhibit migration and invasion Targeting c-Met
MiR-182 2018 Downexpression Inhibit HGF-induced migration, invasion, and EMT Regulating c-Met/AKT/Snail signaling pathway
MiR-206 2015, 2016 Downexpression Inhibit the proliferation, migration, invasion, angiogenesis and induced apoptosis, as well as increase c-Met induced cisplatin resistance Targeting MET, BCL2, and c-Met/PI3k/Akt/mTOR pathway
MiR-130a 2014 Downexpression in gefitinib resistant NSCLC cell lines Inhibit the resistance of NSCLC cells to gefitinib Downregulation of Met by directly targeting its 3′-UTR
MiR-19a 2017 Downexpression in gefitinib-resistant NSCLC cell lines contribute to cell migration and EMT Targeting c-Met and regulating its downstream pathway such as AKT and ERK pathways
MiR-198 2018 Downexpression Inhibit proliferation, migration, and invasion, induces apoptosis, and overcome resistance to radiotherapy Targeting HGF/c-MET signaling pathway
MiR-200a 2015, 2018 Downexpression Inhibit migration, invasion, gefitinib resistance, and enhance the radiosensitivity of NSCLC cells Targeting EGFR and c-Met, and regulating HGF/c-Met signaling pathway
**HEPATOCELLULAR CARCINOMA**
MiR-34a 2009, 2013 Downexpression Inhibit migration and invasion Directly targeting c-Met
MiR-206 2019 Downexpression Inhibit cell proliferation and migration but promote apoptosis Regulating c-Met
MiR-23b 2009 Downexpression Reduce the migration and proliferation abilities Mediating urokinase and c-Met
MiR-199a-3p 2010 Downexpression Influence the doxorubicin sensitivity of human hepatocarcinoma cells; suppress tumor growth, migration, invasion and angiogenesis Regulating mTOR and c-Met; Targeting VEGFA, VEGFR1, VEGFR2, HGF and MMP2
MiR-198 2011 Downexpression Inhibit migration and invasion Targeting HGF/c-Met pathway
MiR-148a 2014 Downexpression Suppress the EMT and metastasis Targeting Met/Snail signaling
MiR-181a-5p 2014 Downexpression Suppress motility, invasion, and branching-morphogenesis Directly targeting c-Met
MiR-449a 2018 Downexpression Suppress hepatocellular carcinoma cell growth Regulating CDK6 and c-Met/Ras/Raf/ERK signaling
MiR-101-3p 2019 Downexpression Suppress proliferation and migration Targeting HGF/c-Met pathway
MiR-93 2015 Overexpression Increase HCC cells proliferation, migration, invasion, and the resistance to sorafenib and tivantinib treatment Activating c-Met/PI3K/Akt pathway
MiR-26a 2014 Downexpression Suppress angiogenesis Targeting HGF/c-Met pathway
**GASTRIC CANCER**
MiR-1 2015 Downexpression Inhibit cell proliferation and migration Targeting MET
MiR-144 2015 Downexpression Inhibit metastasis and proliferation Directly binding the 3′-UTR of MET mRNA
MiR-16 2016 Downexpression Inhibit proliferation and migration Directly targeting 3′- UTR of HGF mRNA
MiR-658 2018 Overexpression in metastatic gastric group Promote migration and invasion Not explored. But its expression was positively associated with PAX3 and MET
MiR-206 2015 Downexpression Suppress proliferation, migration and invasion *in vitro* and *in vivo*, meanwhile induce G1 phase arrest Targeting c-Met; Through miR-206/PAX3/MET axis
MiR-34a 2014, 2015, 2016 Downexpression, particularly in DDP resistance patients and cells Inhibit the growth, invasion, and metastasis, meanwhile increase the sensitivity to DDP Regulating PDGFR and MET expression through PI3K/Akt/mTOR pathway
**OSTEOSARCOMA**
MiR-199a-3p 2011 Downexpression Inhibit proliferation, migration, and induce G1 phase arrest Not explored, but might associated with mTOR, c-Met and Stat3
MiR-454 2015 Downexpression Suppress cell proliferation and invasion Directly targeting c-Met
MiR-489-3p 2017 Downexpression Suppress proliferation and metastasis *in vitro* and *in vivo* Regulating PAX3-MET axis
MiR-206 2019 Downexpression Suppress cell proliferation and metastasis, as well as increase cell apoptosis Targeting PAX3 and MET
**BREAST CANCER**
MiR-335 2014 Downexpression Suppress breast cancer cell migration Targeting c-Met
MiR-340 2011 Downexpression Suppress cell migration and invasion Targeting c-Met
MiR-128-3p 2018 Downexpression Suppress cell migration and invasion Targeting c-Met
MiR-182 2019 Downexpression in trastuzumab resistant cells Reduce invasion and migration and induce the impediment to trastuzumab resistance Through MET-dependent PI3K/Akt/mTOR pathway
**BLADDER CANCER**
MiR-23b/27b 2014 Downexpression Inhibit cell proliferation, migration, and invasion via the attenuation of EGFR and c-Met
MiR-101 2013 Downexpression Suppress motility of bladder cancer cells Targeting c-Met
MiR-323a-3p 2017 Downexpression Suppress EMT progression Through mMET/SMAD3/SNAIL circuit
MiR-409-3p 2013 Downexpression Inhibit migration and invasion Directly targeting c-Met and indirectly regulating MMP2 and MMP9
MiR-433 2016 Downexpression Suppress cell proliferation, migration and invasion Directly targeting CREB1 and c-Met, and regulating Akt/GSK-3β/Snail signaling
**COLORECTAL CANCER**
MiR-1 2012 Downexpression Impair MET-induced proliferation, migration, and invasion programs Inversely regulating MET
MiR-34a 2013 Downexpression Predict distant metastasis of colon cancer Might associate with its targets c-Met, Snail and β-catenin
MiR-146a 2018 Downexpression Abolish colorectal cancer liver metastasis Targeting c-Met
**GLIOMA**
MiR-410 2012 Downexpression Attenuate tumor growth and invasion Inhibiting MET and AKT signaling
MiR-34a 2009 Downexpression Inhibit cell proliferation, cell cycle progression, cell survival, and cell invasion Targeting c-Met, Notch-1, and Notch-2
MiR-144-3p 2015 Downexpression Inhibit proliferation and invasion Binding to c-Met
**OVARIAN CANCER**
MiR-1 2017 Downexpression Compromise proliferation, survival, invasion, and metastasis Directly targeting c-Met
MiR-206 2018 Downexpression Compromise proliferation, survival, invasion, and metastasis Directly targeting c-Met
MiR-148a-3p 2018 Downexpression Compromise proliferation, survival, invasion, and metastasis Directly targeting c-Met
**CERVICAL CANCER**
MiR-454-3p 2018 Downexpression Impede proliferation, migration, and invasion Targeting c-Met
MiR-1 2019 Downexpression Trigger the proliferation, migration, and infiltration of cancer cells Be associated with c-Met
**PANCREATIC DUCTAL ADENOCARCINOMA (PDAC)**
MiR-181b-5p 2017 Downexpression in radiation-resistant PDAC cells / Through miR-181b-5p/ETS1/c-Met axis
**PROSTATE CANCER**
MiR-34c 2013 Downexpression Suppress migration Targeting MET
MiR-1 2019 Downexpression Suppress migration and proliferation Regulating c-Met/PI3K/Akt/mTOR signaling
**ORAL SQUAMOUS CELL CARCINOMA (OSCC)**
MiR-143 2015 Downexpression Dampen OSCC cell mobility Downregulating of phospho-c-Met through targeting CD44 v3
MiR-23b/27b 2016 Downexpression Inhibit proliferation, migration, and invasion Targeting MET
MiR-152 2018 Downexpression Inhibit proliferation, migration, invasion Targeting c-Met
MiR-365-3p 2019 Downexpression Inhibit OSCC migration, invasion, metastasis and chemoresistance to 5-fluorouracil Targeting miR-365-3p/EHF/KRT16/β5-integrin/c-met signaling axis
**RENAL CELL CARCINOMA**
MiR-199a-3p 2014 Downexpression Inhibit proliferation and caused G1 phase arrest Suppressing HGF/c-Met axis and its downstream signaling
MiR-32-5p 2018 Downexpression Suppress metastasis and enhance the efficacy of sunitinib-chemotherapy Regulating TR4/HGF/Met axis
**THYROID CANCER**
MiR-449b 2015 Downexpression Inhibit tumor proliferation Targeting MET
MiR-3666 2016 Downexpression Inhibit tumor proliferation Targeting MET
**ESOPHAGEAL SQUAMOUS CELL CARCINOMA (ESCC)**
MiR-1 2016 Downexpression Inhibit cell growth and enhance of cell apoptosis Downregulating of MET, cyclin D1, and CDK4 expression
MiR-206 2019 Downexpression Inhibit cell proliferation and induced apoptosis Regulating c-Met/AKT/mTOR axis
######
The crosstalk between lncRNAs and cricRNAs and HGF/c-Met axis in cancers.
**NcRNAs** **Year** **Expression status in cancers** **Role in cancers** **Mechanism**
------------------------------------------- ---------- ------------------------------------------- --------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------------
**LUNG CANCER**
LncRNA FAM83H-AS1 2017 Overexpression Increase cell proliferation, invasion, and migration Targeting MET/EGFR signaling pathway
lncRNA MIR22HG 2018 Downexpression Inhibit cell proliferation, colony formation, migration, and invasion Through regulating YBX1, MET and P21 expression
**HEPATOCELLULAR CARCINOMA**
LncRNA NEAT1 2019 Overexpression Suppress sorafenib sensitivity Regulating miR-335--c-Met axis
CircRNA PTGR1 2019 Overexpression in highly metastatic cells Enhance the metastatic potential of lower metastatic cells Regulating miR-449a/MET interaction
**GASTRIC CANCER**
LncRNA HOTAIR 2015 Overexpression Promote migration, invasion, and metastasis Through lncRNA HOTAIR/miR-34a/HGF/Met/Snail pathway by binding to PRC2
LncRNA TUG1 2016 Overexpression Promote transference and invasion Through lncRNA TUG1/miR-144/c-Met axis
**OSTEOSARCOMA**
LncRNA MALAT1 2019 Overexpression Promote proliferation, migration, and invasion of OS cells *in vitro* Targeting c-Met and SOX4 via miR-34a/c-5p and miR-449a/b
LncRNA PVT1 2019 Overexpression Enhance chemoresistance of gemcitabine Through miR-152/c-MET/PI3K/AKT pathway
**BREAST CANCER**
lncRNA XIST 2018 Downexpression in brain metastasis tissue Inhibit brain metastasis and EMT and stemness process By activating c-Met pathway via upregulating MSN and reprogramming microglia via secreting exosomal miR-503
**COLORECTAL CANCER**
LncRNA GAPLINC 2018 Overexpression Stimulate cells migration and invasion Regulating miR-34a/c-MET Signal Pathway
LncRNA 01510 2018 Overexpression Promote proliferation and cell cycle arrest in G1 phase Regulating MET
LncRNA H19 2019 Overexpression / Positive correlated with MET expression
**GLIOMA**
LncRNA NEAT1 2015 Overexpression Promote cell proliferation, migration, and invasion and inhibit apoptosis Regulating miR-449b-5p/c-Met axis
**GLIOBLASTOMA (GBM)**
LncRNA TALC 2019 Overexpression in TMZ-resistant cells Promote TMZ resistance By trapping miR-20b-3p, activating c-Met and increasing MGMT expression
**SEROUS OVARIAN CANCER (SOC)**
LncRNA ANRIL 2015 Overexpression Promote cell migration and invasion Regulating MET and MMP3
**CERVICAL CANCER**
LncRNA SNHG4 2019 Overexpression Promote cell proliferation and inhibit apoptosis Regulating miR-148a-3p /c-Met axis
**ENDOMETRIAL CANCER**
LncRNA SNHG8 2018 Overexpression Promote cell proliferation Regulating miR-152/c-MET axis
**PANCREATIC CANCER**
Circ-PDE8A 2018 Overexpression Stimulate tumor migration and growth Through miR-338/MACC1/MET/AKT or ERK pathway
LncRNA Meg3 2015 Downexpression Block cell growth and delay cell cycle progression Negatively regulating c-Met
**RENAL CELL CARCINOMA**
LncRNA ARSR 2016 Overexpression Promote sunitinib resistance Through via competitively binding miR-34 and miR-449 to promote AXL and c-MET expression
LncRNA NEAT1 2017 Overexpression Enhance EMT and chemoresistance to sorafenib Via the miR-34a/c-Met axis
**THYROID CANCER**
LncRNA XIST 2018 Overexpression Inhibit the cell proliferation and tumor growth Via LncRNA XIST/miR-34a/MET/PI3K/AKT axis
**MULTIPLE MYELOMA (MM)**
LncRNA UCA1 2019 Overexpression Facilitate proliferation and reduce apoptosis Through lncRNA UCA1/miR-1271-5p/HGF axis
**HEPATOBLASTOMA (HB)**
LncRNA ZFAS1 2019 Overexpression Promote proliferation and invasion Through lncRNA ZFAS1/ miR-193a-3p/RALY/HGF/c-Met pathway
**RETINOBLASTOMA**
LncRNA HOTAIR 2018 Overexpression Promote proliferation and EMT process but impair apoptosis Through miR-613/c-met axis
**DIFFUSE LARGE B-CELL LYMPHOMA (DLBCL)**
LncRNA TUG1 2019 Overexpression Facilitate proliferation and reduce apoptosis Through increasing MET expression by inhibiting its ubiquitination and degradation
Lung Cancer
-----------
Lung cancer is one of the most frequent cancers globally. In 2018, it contributed to 11.6% of all the new cancer cases worldwide (Bray et al., [@B7]). The disease can be classified into two primary subtypes: non-small cell lung cancer (NSCLC) and small-cell lung cancer, representing 85 and 15% of all lung cancer cases, separately. Lung cancer is very aggressive, more than 50% of the patients die within 1 year after diagnosis, and the 5-year survival rate is below 18% (Sun R. C. et al., [@B95]). It is still difficult to disclose the indisposition at an early primary phase for possible therapeutic and surgical treatments.
Lee et al. were the first to identify and characterize a novel miR-7515 from lung cancer cells. The miRNA has been shown to inhibit tumor proliferation and migration by directly repressing c-Met expression and altering the signaling of downstream cell cycle-related proteins (Lee et al., [@B59]). Subsequently, several miRNAs have been reported to regulate c-Met in NSCLC. For example, studies demonstrated that suppression of miR-27a (Acunzo et al., [@B1]), miR-27b (Zhou et al., [@B134]), miR-34a (Hong et al., [@B50]), and miR-34b (Wang et al., [@B105]) impairs NSCLC progression by regulating c-Met. Another tumor suppressor, miR-409-3p, negatively correlates with c-Met and has been shown to undermine tumor growth, migration, and invasion. Also, it induced apoptosis *in vitro* via the Akt signaling pathway by targeting c-Met (Wan et al., [@B102]). Luo et al. revealed that upregulation of miR-449a was significantly associated with less lymph node metastasis and better prognosis in NSCLC via regulation of the target gene c-Met (Luo et al., [@B74]). Consistently, miR-182 was found to inhibit HGF-induced migration, invasion, and EMT by regulating c-Met/AKT/Snail signaling pathway in NSCLC (Li Y. et al., [@B66]). Furthermore, Chen et al. showed that miR-206 could inhibit HGF-induced EMT and angiogenesis and induce cisplatin resistance by regulating c-Met/PI3K/Akt/mTOR pathway in lung cancer (Chen Q. Y. et al., [@B16]; Chen et al., [@B14],[@B15]).
The HGF/c-Met axis also contributes to drug resistance in lung cancer. Zhou et al. were the first to verify that miR-130a is highly expressed in gefitinib-sensitive NSCLC cell lines, but not gefitinib-resistant NSCLC cells. They also demonstrated that elevated miR-130a could enhance the sensitivity of NSCLC cells to gefitinib and promote apoptosis by directly reducing c-Met levels (Zhou et al., [@B135]). Similarly, decreased miR-19a expression in gefitinib-resistant NSCLC cell lines contributes to cell migration, EMT, and gefitinib resistance by negatively regulating c-Met expression and blocking its downstream pathways (such as PI3K-AKT and RAS-ERK pathways) (Cao et al., [@B9]). Zhu et al. demonstrated that miR-198 could inhibit proliferation, migration, and invasion, induce apoptosis, and overcome resistance to radiotherapy via HGF/c-Met axis. It was downregulated in NSCLC cell lines but overexpressed in radiotherapy sensitive patients (Zhu et al., [@B136]). Studies also reported that miR-200a plays an active tumor-suppressing role in non-small cell lung cancer, and could also inhibit gefitinib resistance and enhance the radio-sensitivity by deactivating the HGF/c-Met pathway (Zhen et al., [@B131]; Du et al., [@B28]).
Moreover, lncRNA FAM83H-AS1 was suggested as a potential therapeutic target that could accelerate cell proliferation, invasion, and migration by activating MET/EGFR signaling pathway in lung adenocarcinoma (Zhang et al., [@B124]). Su et al. also identified the anticancer effect of lncRNA MIR22HG and there was a significant association between lncRNA MIR22HG and MET expression (Su et al., [@B94]). These studies provided new insights into prognostic diagnosis and therapeutic strategies for patients with lung cancer. Collectively, the HGF/c-Met axis and ncRNAs play an essential role in the formation and development of lung cancer.
Hepatocellular Carcinoma (HCC)
------------------------------
HCC is one of the ordinary cancers with the highest morbidity and mortality globally. Till now, the underlying molecular mechanisms for pathogenesis and development of HCC remain mostly unknown because of multiple etiologies (Bray et al., [@B7]). Therefore, studies on the molecular checkpoints involved in HCC development and aggressiveness are crucial.
In 2009, Li et al. were the first to demonstrate that miR-34a is less expressed in HCC tissues than in corresponding normal tissues. In the same study, it was revealed that miR-34a HCC reduces malignant phenotype by downregulating c-Met expression and decreasing the phosphorylation level of ERK1/2 (Li N. et al., [@B63]). Later, miR-206 (Wang Y. et al., [@B108]) and miR-23b (Salvi et al., [@B87]) were found to attenuate cell viability, migration, and invasion by blocking the c-Met activation in HCC. The study concluded that miR-199a-3p is closely associated with the formation and progression of HCCs. In the same study, a significant increase in the G1-phase population following the restoration of miR-199a-3p expression was observed. Further investigation of the mechanism showed that miR-199a-3p contributed to the cell cycle modulation by silencing both mTOR and c-Met (Fornari et al., [@B34]; Ghosh et al., [@B41]). MiR-198 bound to the 3′ UTR of c-Met mRNA and blocked p44/42 MAPK activity through HGF/c-Met pathway, leading to the inhibition to migration and invasion of HCC cells (Tan et al., [@B99]). Consistently, miR-148a was reported to impede EMT and metastasis by targeting HGF/Met/Snail signaling in HCC (Zhang et al., [@B125]). Besides invasion, miR-181-5p suppressed branching-morphogenesis by directly regulating c-Met (Korhan et al., [@B57]). Many studies have shown that miR-449a impairs the EMT of tumors by targeting MET, but the precise single target of miR-449a has not been elucidated in HCC (Sun et al., [@B96]). Cheng et al. revealed that miR-449a suppressed HCC growth by targeting CDK6 and impairing c-Met/Ras/Raf/ERK signaling pathway with an iTRAQ proteomics approach. Their study linked miR-449a, cell cycle, and c-Met/Ras/Raf/ERK signaling pathway in HCC and could also explain the abnormal growth characteristics of HCC cells (Cheng et al., [@B20]). Besides, *in vitro* and *in vivo* studies have demonstrated that miR-101-3p inhibits HCC progression by targeting HGF and it could be regarded as another potential therapeutic tool for regulating cell proliferation and metastasis (Liu et al., [@B72]). However, miR-93 was identified as HCC stimulator, which increased HCC cell proliferation, migration, and invasion by activating c-Met/PI3K/Akt pathway (Ohta et al., [@B81]). Thus, HGF/c-Met axis might be of high interest in regulating tumor progression in HCC.
In our review, the potential roles of the HGF/c-Met axis in other hallmarks of HCC, such as interactions with tumor microenvironment and drug resistance, are also highlighted. VEGFA/VEGFR2 signaling is a crucial downstream pathway of HGF/c-Met axis and plays a vital role in tumor angiogenesis. VEGFA secreted from cancer cells binds to VEGFR2 on endothelial cells, phosphorylates and activates VEGFR2, which then phosphorylates downstream extracellular signal-regulated kinase (ERK1/2) thus promoting angiogenesis (Ferracini et al., [@B32]; Fischer et al., [@B33]; Testini et al., [@B100]). Recently, Yang et al. confirmed that miR-26a could inhibit tumor proliferation and metastasis of HCC through IL-6-Stat3 signaling pathway. Notably, a negative correlation between miR-26a and VEGFA or microvessel density (MVD), two well-known proangiogenic factors, was observed. MiR-26a significantly impaired *in vivo* tumor angiogenesis by inhibiting VEGFA production through HGF/c-Met axis in HCC cells. Moreover, miR-26a also impaired VEGFR2 signaling in endothelial cells to exert its antiangiogenesis function (Yang et al., [@B119]). Accordingly, miR-199a-3p showed important inhibitory effect on angiogenesis by targeting HGF and subsequently blocking downstream signaling pathways. Ghosh et al. demonstrated that miR-199a-3p reduced VEGF secretion in HCC cells and inhibited expression of VEGFR1 and VEGFR2 receptors on endothelial cells. Besides, MMP2 signaling was abrogated by miR-199a-3p (Ghosh et al., [@B41]). Furthermore, HGF/c-Met axis was reportedly involved in drug resistance. MiR-199a-3p could regulate the doxorubicin sensitivity of human HCC cells through c-Met and mTOR (Fornari et al., [@B34]). Katsuya revealed that overexpression of miR-93 could improve the resistance of HCC cells against sorafenib and tivantinib treatment through c-Met/PI3K/Akt pathway (Ohta et al., [@B81]).
With regards to lncRNAs, Chen et al. demonstrated that lncRNA NEAT1 could suppress the sorafenib sensitivity of HCC cells by regulating miR-335/c-Met pathway (Chen and Xia, [@B18]). In addition, exosomes derived from highly metastatic cells (LM3) with a high abundance of circPTGR1 might enhance the metastatic potential of lower metastatic cells (97L and HepG2) by inhibiting miR-449a-MET interaction, resulting in destruction on tumor microenvironment and thereby promoting HCC development (Wang G. et al., [@B104]). Collectively, the results of these studies show that HGF/c-Met axis is an effective multifaceted tumor regulator, which could have pivotal implications on the understanding of HCC mechanisms and the improvement of therapeutics.
Gastric Cancer (GC)
-------------------
GC is one of the most ordinary neoplasms with a high incidence, especially in Eastern Asia. Metastasis is the main reason for its which results in high mortality of the patients (Bray et al., [@B7]). Nonetheless, the precise molecular mechanisms underlying GC metastasis have not uncovered.
The HGF/c-Met axis has been implicated as a crucial modulator of metastasis-associated signal transduction pathways in GC progression. Several miRNAs have been reported to participate in the GC proliferation and metastasis by directly or indirectly regulating the expression of c-Met. MiR-1 (Han et al., [@B45]) and miR-144 (Liu J. et al., [@B70]) are downregulated in GC tissues and directly target the 3′-UTR of MET mRNA, thus, leading to the repression of GC progression. Besides, downregulation of miR-16 suppresses HGF expression by binding to its 3′-UTR (Li et al., [@B64]). In a previous study, the expression of miR-658 was elevated in distant GC cells, which increased the levels of serum miR-658 significantly, thus promoting cell migration and invasion. Besides, a strong positive relation between serum level of miR-658 and mRNA PAX3 and MET expression has been observed (Wu et al., [@B111]). However, the precise role of miR-658/PAX3/MET axis needs further exploration.
MiR-206, a famous tumor suppressor, is thought to enhance tumor metastasis by regulating diverse mRNA expression at a post-transcription level in some forms of cancer such as breast and colon cancers. In a study by Zhang et al., the expression of miR-206 was weaker in GC cell lines, especially in high metastatic cell lines. Transwell assay confirmed that the ectopic expression of miR-206 inhibited the migration and invasion ability of GC cells by regulating PAX3-MET pathways. *In vivo* mouse experiments demonstrated that miR-206 overexpression resulted in significant decrease in the incidence of lung metastasis and the number of metastatic lung nodules (Zhang et al., [@B126]). The study from Zheng et al. also supported the conclusion that miR-206/MET axis modulates the migration and invasion of GC. Besides, suppression of tumor growth was observed after miR-206 mimics transfection, which indicated downregulation of c-Met and cell cycle-related proteins in xenograft mouse models and *in vitro* (Zheng et al., [@B132]).
MiR-34a also has tumor suppression ability. A study reported that miR-34a, which was weakly expressed in GC tissues, attenuated the malignant behavior of GC cells by directly targeting PDGFR and MET expression and subsequently regulating the phosphorylation of Akt through PI3K/Akt/mTOR pathway (Peng et al., [@B83]; Wei et al., [@B109]). In addition to these findings, Zhang et al. revealed that miR-34a could modulate human GC cells cisplatin (DDP) sensitivity by regulating cell proliferation and apoptosis by targeting MET. Specifically, they found that miR-34a expression was significantly less in DDP resistance human GC tissues and cells than in normal GC tissues and cells. The overexpression of miR-34a enhanced the DDP sensitivity of SGC7901/DDP cells by inhibiting cell proliferation and inducing cell apoptosis. Therefore, its downregulation could weaken the sensitivity to DDP. A subsequent study confirmed that miR-34a modulates DDP resistance by directly repressing MET (Zhang et al., [@B129]). Collectively, miR-34a could contribute to the development of new therapeutic strategies for gastric cancer.
Furthermore, competing endogenous RNAs (ceRNAs) as essential miRNA-regulators have emerged as therapeutics scavenging oncogenic miRNAs. Recently, they have exposed exciting insights into tumorigenesis. LncRNA HOTAIR was found to be overexpression in GC tissue and cells, particularly in diffuse-type GC. In addition, lncRNA HOTAIR knockdown remarkably impaired migration, invasion and metastasis both *in vitro* and *in vivo* and reversed the EMT in GC cells by epigenetically inhibiting miR34a through recruiting and binding to PRC2, mechanically (Liu Y. W. et al., [@B73]). Similarly, Ji et al. elucidated that overexpression of lncRNA-TUG1 led to a significant proliferation of GC tissue (most likely) by inhibiting miR-144. Also, lncRNA-TUG1 indirectly activated the expression of c-Met, thus promoting the metastasis of GC cells via lncRNA-TUG1/miR-144/c-Met axis (Ji et al., [@B54]).
Osteosarcoma (OS)
-----------------
OS predominantly originates from mesenchymal cells of long bones and has a high prevalence in children and young adults. It usually starts as a monoclonal disease and quickly progresses into a polyclonal disease. It is regarded as one of the most complicated cancers in terms of molecular aberration (Kansara and Thomson, [@B56]). Further elucidation of its exact molecular mechanism could be useful in the identification of its associated markers, which might assist in prognosis and therefore improve its treatment.
In 2011, Duan et al. were the first to reveal the negative association between the expression of miR-199a-3p and mTOR, c-Met and Stat3 (Duan et al., [@B29]). But the molecular mechanism behind the tumor suppressor role of miR-199a-3p in human OS has not been fully elucidated. MiR-454 was found to be downregulated in OS clinical samples and cell lines. And this suppressed proliferation and metastasis of OS cells by inhibiting c-Met expression (Niu et al., [@B80]). Studies conducted by Liu et al. suggested that miR-489-3p expression could inhibit the proliferation and metastasis of OS tissues and cells, particularly in high metastatic potential cells by negative regulation of PAX3-MET axis. Also, xenografts study results showed smaller cancer nodules and fewer incidences of lung metastases in LV-miR-489-3p group compared with LV-control group, indicating the apparent inhibition of OS metastasis *in vivo* (Liu Q. et al., [@B71]). Similarly, miR-206 was reported to repress OS progression by targeting PAX3-MET axis (Zhan et al., [@B122]).
ceRNAs also play critical roles in the development of OS. Sun et al. demonstrated that serum level of long non-coding RNA Metastasis-Associated Lung Adenocarcinoma Transcript 1 (lncRNA MALAT1) was higher in metastatic OS tissues than non-metastasis OS tissues or corresponding normal tissues. In the same study, elevated levels of serum lncRNA MALAT1 predicted worse clinical outcomes in OS patients. The silencing of lncRNA MALAT1 was shown to inhibit proliferation, migration, and invasion of OS cells. Bioinformatic and molecular analyses revealed that lncRNA MALAT1 served as a ceRNA of c-Met and SOX4 by directly targeting miR-34a/c-5p and miR-449a/b (Sun Z. et al., [@B97]). The function of ceRNAs in drug resistance has also been elucidated. LncRNA PVT1 played critical roles in chemoresistance of OS to gemcitabine (GEM) and was upregulated in OS drug-resistant cells. Functional studies have demonstrated that lncRNA PVT1 could reduce GEM-reduced apoptosis and attenuate GEM-induced tumor growth inhibition *in vitro* and *in vivo*. A study on lncRNA PVT1 mechanism revealed that lncRNA PVT1 targeted miR-152, which promoted chemoresistance of OS by activating c-MET/PI3K/AKT pathway (Sun Z. Y. et al., [@B98]). These findings revealed a novel interaction network that could eventually lead to new therapeutic strategies for OS patients based on ncRNAs.
Breast Cancer
-------------
Breast cancer is the leading cause of mortality in women worldwide (Colditz and Bohlke, [@B23]). It occurs as a consequence of various signaling pathways in mammary epithelial cells, including the HGF/c-Met axis. Many studies have shown that the interaction between ncRNAs and HGF/c-Met axis exerts regulatory effects on breast cancer progression and clinical therapy. Recent studies have suggested that miR-335 could be upregulated in breast cancer tissues. Overexpression of miR-335 has been shown to suppress HGF-induced phosphorylation of c-Met, which could subsequently inhibit the HGF role of prompting breast cancer cell migration in a c-Met-dependent manner by targeting c-Met (Gao et al., [@B39]). Wu and Breunig confirmed the hypothesis of post-transcriptional regulation of MET by revealing that miR-340 and miR-128-3p negatively regulate MET expression, thus inhibiting the invasion and migration of breast cancer cells (Wu et al., [@B112]; Breunig et al., [@B8]).
Concerning drug resistance, Yue et al. revealed that miR-182 binds to MET in breast cancer cells and suppresses the cell\'s ability to tolerate trastuzumab, therefore reducing the invasion and migration capability of trastuzumab-resistant cells through MET-dependent PI3K/AKT/mTOR signaling pathways (Yue and Qin, [@B121]). This study highlighted the importance of the interaction between ncRNAs and HGF/c-Met axis in cancer development and therapy.
For lncRNAs, in 2018, Xing et al. profiled lncRNAs in breast cancer tissue with brain metastasis and confirmed that the X-inactive--specific transcript (XIST) was remarkably downregulated. Further *in vitro* and *in vivo* experiments revealed that knockdown lncRNA XIST could activate c-Met pathway via upregulating MSN to promote EMT and stemness. Meanwhile, lncRNA XIST^low^ cells could reprogram microglia in the brain via secreting exosomal miR-503. And the prometastatic effect was inhibited by fludarabine (Xing et al., [@B113]). These indicated that lncRNA XIST might become an effective target for curing brain metastasis.
Bladder Cancer (BCa)
--------------------
BCa is the most frequent cancer of the urinary tract (Grayson, [@B42]). Chlyomaru et al. were the first to reveal the function of miRNA-23b/27b cluster in bladder cancer. In their study, the capacities of cell proliferation, migration, and invasion of bladder cancer cells were repressed after restoring miR-23b and miR-27b expression by attenuation of EGFR and c-Met (Chiyomaru et al., [@B22]). Hu et al. reported a similar mechanism in miR-101 (Hu et al., [@B51]). MiR-323a-3p is a member of the miRNA cluster in DLK1-DIO3 genomic region, which plays a role in several pathologic processes of various cancers, especially bladder cancer. Li et al. showed that the methylation of DLK1-MEG3 intergenic DMR contributed to the decrease in levels of serum miR-323a-3p in bladder cancer. The progression of EMT was suppressed through miR-323a-3p/MET/SMAD3/SNAIL circuit (Li et al., [@B61]). A study elucidated the existence of mutual regulation of BCa progression involving miR-323a-3p/miR-433/miR-409 and MET. The study investigated the role of miR-433 and miR-409 in the development and progression of BCa. The results showed that miR-409-3p could serve as metastasis-suppressor gene by directly targeting c-Met and indirectly regulating MMP2 and MMP9 (Xu et al., [@B115]). CAMP response element-binding protein1 (CREB1) and c-Met could take part in miR-433-mediated inhibition of the EMT by regulating Akt/GSK-3β/Snail signaling. Also, a reciprocal regulation network between miR-433/miR-409-3p and c-Met was revealed (Xu et al., [@B116]). These findings might be useful in the search for effective and promising therapies against BCa.
Colorectal Cancer (CRC)
-----------------------
CRC is a public health concern and accounts for over 10.2% of all cancer cases, representing 1.8 million new cases per year (Bray et al., [@B7]). Despite widespread awareness in the general population regarding CRC, the condition remains a significant cause of mortality and morbidity on account of recurrence and metastasis.
Studies have confirmed that the expression of c-Met in CRC correlates with the presence of local and distal metastasis and poor prognosis. Congruently, Migliore et al. showed that miR-1 is downexpressed in colon cancer cells, and is significantly associated with MET overexpression, especially in metastatic tumors. Further analysis revealed that concomitant MACC1 (MET transcriptional activator) upregulation and miR-1 downregulation are required to elicit the highest level of MET expression. Induced miR-1 expression reduces MET levels and impairs MET-induced proliferation, migration and invasion processes. Notably, a feedback loop between miR-1 and MET has also been revealed. Most likely, MET targeting could result in both abrogations of MET-dependent signaling and some recovery of miR-1 level (Migliore et al., [@B78]). Siemens verified that the generation of distant metastases is correlated with epigenetic silencing of miR-34a in primary tumors. In their study, they reported that miR-34a expression was inversely correlated with CpG methylation and its targets, that is, c-Met, Snail, and β-catenin, and were associated with distant metastases. In the same study, a multivariate regression model containing miR-34a methylation, high c-Met, and β-catenin levels indicated high prognostic value of CRC cells\' metastasis to the liver (Siemens et al., [@B89]). In 2018, Bleau et al. identified c-Met as a prometastatic gene and miR-146a as a negative regulator of c-Met in highly metastatic variants derived from MC38 cells. Further, they firstly confirmed that miR-146a has a crucial inhibitory role in liver metastasis and this suppressive effect is probably because of targeting several protumorigenic genes, including c-Met (Bleau et al., [@B6]).
Further, the ceRNA network has also been reported to play a crucial role in CRC progression. The study results showed that lncRNA GAPLINC was upregulated in CRC tissues and thus stimulated CRC cell migration and invasion by regulating miR-34a/c-MET signal pathway (Luo et al., [@B75]). Analogously, lncRNA 01510 was reported that its overexpression was associated with advanced clinicopathological features. Meanwhile, Cen et al. also found that silencing LINC01510 could restrain cell proliferation and induce G0/G1-phase arrest via a MET-dependent manner (Cen et al., [@B10]). In 2019, Zhong et al. constructed the lncRNA/pseudogene--miRNA--mRNA ceRNA network using The Cancer Genome Atlas database and verified that lncRNA H19, which was upregulated in CRC tissue and correlated with poor prognosis, was positive related to MET expression. However, the specific molecular mechanism and function were not explored (Zhong et al., [@B133]). These findings provided substantial evidence that c-Met has excellent potential as an effective agent for both the prevention and treatment of colorectal cancer.
Brain Cancer
------------
Glioma is the most common malignancy of the central nervous system and is associated with a poor prognosis. Several studies suggest that the condition could occur as a result of complicated gene interaction and molecular modulation network (Sturm et al., [@B93]). *In vitro* and xenograft model experiments have verified that miR-410 repression attenuates tumor growth and invasion by inhibiting MET and AKT signaling. Also, MET overexpression could significantly abrogate miR-410 dependent effects on glioma proliferation and invasion (Chen L. et al., [@B13]). With regard to lncRNA, Li et al. found that lncRNA NEAT1was overexpressed in glioma tissue and cell lines and served as a ceRNA to promote glioma pathogenesis. Moreover, lncRNA NEAT1\'s oncogenic activity was enhanced through inverse regulation of miR-449b-5p and c-Met modulation in glioma cells (Zhen et al., [@B130]). This was the first report on the role and function of lncRNA NEAT1 in glioma.
Concerning glioblastoma (GBM), it has been reported that transient transfection of miR-34a mimics into glioma and medulloblastoma cell lines remarkably inhibits cell proliferation, invasion, survival, and cell cycle progression by targeting c-Met, Notch-1, and Notch-2 (Li Y. et al., [@B65]). MiR-144-3p was downregulated in GBM tissue, and this decrease was significantly correlated with ascending grades and poorer overall survival. Exogenetic miR-144-3p expression compromised the malignant biological properties of GBM cells independent of PTEN and resulted in enhancement of radiation and temozolomide (TMZ) sensitivity by binding to c-Met and thus impairing the activity of downstream signaling (Lan et al., [@B58]). As for lncRNAs, Wu et al. firstly identified that lncRNA TALC, located on the AL358975 locus and consisted of two exons with a full length of 418 nt, had elevated expression in temozolomide-resistant GBM cells. Further mechanism exploration revealed that lncRNA TALC induced TMZ resistance in GBM through trapping miR-20b-3p and activating c-Met. Meanwhile, lncRNA TALC also upregulated MGMT expression by refitting the acetylation of H3K9, H3K27, and H3K36 in MGMT promoter regions via c-Met/Stat3/p300 axis (Wu et al., [@B110]). Despite the identification of many new biomarkers for brain cancer, improvement in treatment options is yet to be achieved.
Female Reproductive Cancers
---------------------------
One of the most prevalent cancers of the female reproductive system is ovarian cancer (Eisenhauer, [@B31]). Substantial evidence shows that some miRNAs (such as miR-1, miR-206, and miR-148a-3p) can suppress the proliferation, survival, invasion, and metastasis of ovarian cancer cells by directly targeting c-Met, and subsequently regulating downstream signaling pathway to serve as tumor suppressors such as PI3K/Akt/mTOR and ERK1/2 pathways (Qu et al., [@B86]; Dai et al., [@B25]; Wang W. et al., [@B107]). As for lncRNAs, Qiu et al. highlighted the role of lncRNA antisense non-coding RNA in the INK4 locus (ANRIL) in serous ovarian cancer (SOC). They demonstrated its elevated level in SOC tissue and cell lines, particularly in high metastatic cell lines. Meanwhile, there was significant association between lncRNA ANRIL expression and advanced FIGO stage, high histological grade, lymph node metastasis, and poor prognosis. Moreover, MET and MMP3 were verified as key downstream genes of ANRIL involved in SOC cell migration/invasion by microarray analysis and Western Blotting (Qiu et al., [@B84]). Therefore, a breakthrough in ovarian cancer treatment could be achieved by a combination of therapy involving both ncRNAs and c-Met inhibitors.
Cervical cancer is a frequent aggressive malignancy and the fourth leading cause of cancer-related deaths among females worldwide, particularly in China. MiR-454-3p mimics treatment has been shown to suppress the proliferation, migration, and invasion ability of cervical tumor cells *in vitro* by targeting c-Met (Guo et al., [@B43]). The downregulation of miR-1 in cervical cancer tissues is correlated with high c-Met expression. Also, c-Met upregulation inhibits E-cadherin expression, which triggers the proliferation, migration, and infiltration of cancer cells, thus lowering the survival rates of the patient (Cheng Y. et al., [@B21]). In addition, ceRNA also has been reported in cervical cancer. LncRNA SNHG4 was overexpressed in cervical cancer tissue and cells. And this upregulation could facilitate proliferation and reduce apoptosis by binding to miR-148a-3pand ultimately activating c-Met (Li et al., [@B60]). These findings indicate that c-Met isan attractive therapeutic target for cervical cancer.
Endometrial cancer (EC) is the most epidemic neoplasm of the female genital tract worldwide. Despite the great development in early identification and treatment, an abundant number of cases of advanced ECs are still diagnosed (Herrero et al., [@B48]). LncRNA SNHG8, which are located on Chr4, has been verified to participate in the progression and drug resistance of multiple malignancies, such as esophageal squamous cell carcinoma (Song et al., [@B91]), gastric cancer (Zhang P. et al., [@B127]), pancreatic adenocarcinoma (Song et al., [@B92]), and hepatocellular carcinoma (Dong et al., [@B27]). In 2018, Yang et al. firstly verified the positive association between lncRNA SNHG8 and c-Met in EC. They found silencing lncRNA SNHG8 resulted in weaker c-MET expression and less proliferation. Meanwhile, this reduction could be reversed by addition of miR-152 inhibitor (Yang C. H. et al., [@B117]). This study connected ncRNA with HGF/c-Met axis together in EC and demonstrated the significant importance of HGF/c-Met axis in EC.
Pancreatic Cancer
-----------------
Pancreatic cancer is one of the most aggressive malignancies, and is the seventh cause of cancer-related mortality worldwide, with a 5-year survival rate of about 5% (Bray et al., [@B7]). Tomihara et al. were the first to confirm the association between preoperative chemoradiation therapy and c-Met expression in pancreatic ductal adenocarcinoma (PDAC). They successfully confirmed the association between irradiation-induced c-Met expression and activated c-Met pathways through miR-181b-5p/ETS1/c-Met axis in PDAC cells (Tomihara et al., [@B101]). Recently, circRNA and exosomes were shown to play essential roles in various tumors, particularly PDAC. Circ-PDE8A, a highly contained and stable circular RNA screened out from tumor exosomes, is overexpressed in PDAC tissues and is an independent risk factor for PDAC survival. Its upregulation could stimulate tumor migration and growth through miR-338/MACC1/MET/AKT or ERK pathway by sponging miR-338. Further, they found that circ-PDE8A excreted by tumor could be released into blood circulation through exosome transportation. Also, plasma exosomal circ-PDE8A was correlated with PDAC invasion and prognosis (Li Z. et al., [@B67]). Modali et al. demonstrated the importance of HGF/c-Met axis in development of pancreatic neuroendocrine tumors. They revealed that menin could activate lncRNA Meg3 through H3K4me3 and CpG hypomethylation. And lncRNA Meg3 was shown to have tumor suppressor activity because of its role in suppression of cell growth and cycle progression by negatively targeting c-Met (Modali et al., [@B79]). All these findings provided a strong basis for considering c-Met suppression as novel therapeutic approach for the treatment of pancreatic cancer through prevention of metastasis and irradiation resistance.
Prostate Cancer
---------------
Prostate cancer accounts for 3.8% of cancer-related deaths annually, and this has economic implications on the public health sector worldwide (Bray et al., [@B7]). Treatment of the condition using exogenous miR-34c and miR-1 has been shown to suppress MET expression by preventing its binding to 3′-UTR and thereby inhibiting prostate cancer\'s aggressive phenotype (Hagman et al., [@B44]; Gao et al., [@B38]). Further studies have confirmed that miR-1 can suppress c-Met/PI3K/Akt/mTOR signaling and impair tumor progression (Gao et al., [@B38]). However, the specific mechanism of miR-34c is still unclear.
Other Cancers
-------------
Oral squamous cell carcinoma (OSCC) represents a unique and major health concern all over the world. A study by Xu et al. indicated that miR-143 inhibited OSCC cell mobility by suppressing phospho-c-Met expression through targeting CD44 v3 (Xu et al., [@B114]). The miR-23b/27b cluster was also shown to inversely regulate MET in OSCC and bladder cancers (Fukumoto et al., [@B35]). Analogously, miR-152 served as a tumor suppressor by directly targeting c-Met (Li M. et al., [@B62]). Moreover, Huang et al. unveiled a novel c-Met regulating mechanism that might be applied as a modality for OSCC therapy. They demonstrated that miR-365-3p/ETS homologous factor (EHF, a KRT16transcription factor) axis could reduce OSCC cell migration, invasion, metastasis, and chemoresistance to 5-fluorouracil through the suppression of KRT16. In the same study, depletion of KRT16 resulted in ample protein degradation of β5-integrin and c-Met via a lysosomal pathway, subsequently led to the repression of downstream Src/STAT3/FAK/ERK signaling in OSCC cells (Huang et al., [@B53]). Generally, c-Met plays a crucial role in OSCC progression and could be a potential target in OSCC therapy.
In renal cell carcinoma (RCC), miR-199a-3p is known as a tumor attenuator. Huang et al. revealed that miR-199a-3p was downregulated in RCC primary tumor and cell lines, and this loss was associated with advanced tumor-lymph node-metastasis (TNM) stage and Fuhrman grade. Reintroducing miR-199a-3p in RCC cell lines inhibited proliferation and led to the arrest ofG1 phase by negatively regulating c-Met, thus suppressing HGF/c-Met axis and it\'s downstream signaling such as Akt, ERK1/2 and mTOR (Huang et al., [@B52]). These provided a potential target for RCC. Wang et al. reported that miR-32-5p functions by altering the TR4/HGF/Met/MMP2-MMP9 signaling to suppress the clear cell renal cell carcinoma (ccRCC) metastasis *in vitro* and *in vivo*. Also, they demonstrated that targeting miR-32-5p/TR4/HGF/Met signaling could enhance the efficacy of current sunitinib-chemotherapy for ccRCC suppression (Wang M. et al., [@B106]). For lncRNA, Qu et al. first identified a novel lncRNA, called lncARSR (lncRNA Activated in RCC with Sunitinib Resistance), which could promote sunitinib resistance and predict poor response of RCC patients. Moreover, they found that intercellular transfer of lncARSR by exosomes disseminated sunitinib resistance. Mechanically, lncARSR functioned as a ceRNA for miR-34 and miR-449 to promote AXL and c-MET expression (Qu et al., [@B85]). In addition, overexpression of lncRNA NEAT1 was also observed in RCC cells, and its elevated levels were associated with poor prognosis. The silencing of lncRNA NEAT1 has been shown to inhibit RCC cell proliferation, migration, and invasion by inhibiting cell cycle progression and EMT phenotype. Down-regulation of lncRNA NEAT1 enhanced the sensitivity of RCC cells to sorafenib *in vitro*. Mechanistic analysis revealed that lncRNA NEAT1 acts as a competitive sponge for miR-34a, therefore preventing inhibition of c-Met (Liu F. et al., [@B68]). Therefore, ncRNAs and c-Met might serve as a predictor and a potential therapeutic target for RCC.
In thyroid cancer (TC), the crosstalk between ncRNAs and HGF/c-Met axis has a significant effect on tumor growth and progression. Several reports have shown that some miRNAs (such as miR-449b and miRNA-3666) act as tumor suppressors that inhibit TC growth and reduce apoptosis by decreasing the levels of MET protein rather than its transcription (Chen L. et al., [@B12]; Wang et al., [@B103]). Moreover, ceRNA plays a role in thyroid cancer progression. Liu et al. also observed a significant increase in lncRNA XIST expression in thyroid cancer tissues and cell lines. Currently, lncRNA XIST is used as an important prognostic predictor for TC patients. Further investigation involving *in vitro* and *in vivo* experiments, online datasets, and online predicting tools has revealed that lncRNA XIST serves as a ceRNA for miR-34a by sponging miR-34a, and competing with MET for miR-34a binding, hence modulated thyroid cancer cell proliferation and tumor growth (Liu et al., [@B69]). These findings provided a foundation for TC therapy improvement based on lncRNA-miRNA-mRNA interaction.
Esophageal squamous cell carcinoma (ESCC) is one of the major histological subtypes of esophageal cancer in China. Currently, there are limited therapeutic options for the disease because of limited understanding of its molecular mechanism. MiR-1 functions as a crucial tumor inhibitor in ESCC (same as its role in HCC, GC, and ovarian cancer). Its overexpression is associated with a decrease in acquisition of MET, cyclin D1, and CDK4 (oncogene and cell cycle-related proteins), which eventually lead to are duction in cell growth and enhanced cell apoptosis *in vitro* and *in vivo* (Jiang et al., [@B55]). The downregulation of miR-206 is associated with ESCC of lymph node metastasis, advanced TNM stage, and overall survival. Furthermore, luciferase reporter gene assay revealed that c-Met is a direct target of miR-206, and ectopic miR-206 expression inhibits ESCC cell proliferation and induces apoptosis by inhibiting c-Met/AKT/mTOR pathway (Zhang J. et al., [@B123]). Collectively, these findings confirm the role of c-Met in ESCC progression.
Multiple myeloma (MM) is the second most general hematological cancer in globe with poor survival on account of high recurrence (Chen et al., [@B17]). In 2019, Yang and his team demonstrated that HGF/c-Met axis played an essential role in MM development. They first verified the overexpression of lncRNA UCA1 in MM and clarified its tumor-promoting effect (mainly facilitating proliferation and reducing apoptosis) could be regulated by miR-1271-5p/HGF axis (Yang and Chen, [@B120]). These indicated that RNA regulation might be a new target for the cure of MM.
Hepatoblastoma (HB) is a highly invasive neoplasm in childhood. In 2019, Cui et al. revealed a vital role of crosstalks between ncRNAs and HGF/c-Met axis in HB. LncRNA ZFAS1 is a snoRNA host gene locating in chromosome 20q13.13. They found that lncRNA ZFAS1 was overexpression in HB tissue and correlated with malignant pathological features and poor prognosis through tissue microarray analysis. Furthermore, they also showed that lncRNA ZFAS1 served as a ceRNA to regulate RALY by sponging miR-193a-3p and played an oncogenic role during HB progression via HGF/c-Met pathway during HB development (Cui et al., [@B24]). This study expounded a specific molecular mechanism of HB development involving ZFAS1/miR-193a-3p/RALY axis, which could be functioned as a potential biomarker and therapeutic target for HB.
As for retinoblastoma, Yang and his team found that there was a negative correlation between the expression of lncRNA HOTAIR and miR-613 in retinoblastoma tissue compared with normal tissue. And lncRNA HOTAIR could stimulate progression and aggravation of retinoblastoma by miR-613/c-Met axis (Yang G. et al., [@B118]). Although this study provided great evidences for identifying potential diagnostic and therapeutic target in retinoblastoma, further exploration was in demand.
Diffuse large B-cell lymphoma (DLBCL) is the most frequent lymphoid malignancy all over the world. MET was reported to be upregulated in DLBCL and predicted poor outcomes. Cheng et al. investigated that elevated lncRNA TUG1 expression could facilitate cell proliferation and decrease apoptosis *in vitro* and *in vivo* by increasing MET expression through inhibiting its ubiquitination and degradation (Cheng H. et al., [@B19]). In summary, this study provided a novel insight for DLBCL treatment.
Conclusions and Future Perspectives {#s4}
===================================
In this review, we have summarized the crosstalk between HGF/c-Met axis and ncRNAs in common multiple human cancers, which has improved our understanding on the pathogenetic mechanism of tumor occurrence and development. However, further studies are required to fully explore the interaction between ncRNAs and HGF/c-Met axis in cancer. Despite the evidence presented here, the precise interactions between ncRNAs and HGF/c-Met axis, and how these interactions affect tumorigenesis and progression of cancers are still largely unknown. This implies that additional controlled and large-scale clinical studies are required before cancer-specific ncRNAs and HGF/c-Met inhibitors can be recommended for clinical diagnosis and treatment.
Taken together, deeper understanding of HGF/c-Met axis will reveal beneficial avenues and generate new hypotheses regarding cancer pathogenesis and treatment.
Author Contributions {#s5}
====================
ZY, ZR, and RS proposed the study. XL, JC, LL, XC, SS, and GC performed the research and wrote the first draft. ZR and ZY are the guarantors. All authors contributed to interpretation of the study and to further drafts.
Conflict of Interest
--------------------
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
We apologize to all our colleagues and authors whose studies we could not include into this review.
**Funding.** This study was supported by the National S&T Major Project of China (2018ZX10301201-008), Natural Science Foundation of China (81702757, 81702346, 81702927, and 81600506), National Key Research and Development Program of China (2018YFC2000500), China Postdoctoral Science Foundation (2017M610463 and 2018M632814). National Engineering Laboratory for Internet Medical System and Application open fund project (NELIMSA2018P03).
HGF
: hepatocyte growth factor
c-Met
: c-mesenchymal-epithelial transition factor
EMT
: epithelial-mesenchymal transition
ncRNAs
: non-coding RNAs
NSCLC
: non-small cell lung cancer
HCC
: hepatocellular carcinoma
GC
: gastric cancer
DDP
: cisplatin
ceRNAs
: competing endogenous RNAs
OS
: osteosarcoma
BCa
: bladder cancer
CRC
: colorectal cancer
GBM
: glioblastoma
TMZ
: temozolomide
SOC
: serous ovarian cancer
EC
: endometrial cancer
OSCC
: oral squamous cell carcinoma
RCC
: renal cell carcinoma
ccRCC
: clear cell renal cell carcinoma
PDAC
: pancreatic ductal adenocarcinoma
PNET
: pancreatic neuroendocrine tumors
TC
: thyroid cancer
ESCC
: esophageal squamous cell carcinoma
MM
: multiple myeloma
HB
: hepatoblastoma
DLBCL
: diffuse large B-cell lymphoma.
[^1]: Edited by: Pedro M. Fernández-Salguero, University of Extremadura, Spain
[^2]: Reviewed by: Qiulun Lu, Nanjing Medical University, China; Wei-Hsiung Yang, Mercer University, United States
[^3]: This article was submitted to Signaling, a section of the journal Frontiers in Cell and Developmental Biology
[^4]: †These authors have contributed equally to this work
|
2024-01-17T01:26:36.242652
|
https://example.com/article/1370
|
Our long-term objective remains to unravel the genetic complexities of essential hypertension and its complications. Specific aim (i) will test the hypothesis that blood pressure is controlled by many genetic and environmental factors that individually have only small effects but which in some combinations are detrimental and in others beneficial. Mice having pair-wise combinations of high and low expressing variants at genetic loci (Agtr1a, Npr1, and Pparg) in three different physiological systems will be generated. Telemetric blood pressure monitoring and quantitative RT-PCR will determine the effects on these mice of dietary salt and fat, and of relevant drug treatments, and how homeostatic compensations in their heart, kidneys, adrenals, liver and adipose tissues are affected. Specific aim (ii) will test the hypothesis that the renin gene outside the kidney is important in blood pressure maintenance. Ren1c-/- mice (which cannot produce renin anywhere), and mice with renin transgenes, RenTgs (which produce renin at different constant levels only in the liver) will be mated, and their Ren1c-/-RenTg progeny will be used to determine whether extra-renal renin can regulate blood pressure. We will transplant non-renin-producing kidneys from Ren1c-/-RenTg mice into wildtype mice to determine whether the Ren1c gene in extra-renal tissues, but not in the kidney, can control blood pressure. Specific aim (iii) will test the hypothesis that, during hypertensive cardiac hypertrophy, myocytes assume one of two states: hypertrophic but not expressing fetal genes, or hypertrophic and expressing fetal genes. We will induce and reverse hypertension in mice expressing fluorescent indicators of hypertrophy-responsive genes, and assess expression of the indicator and other genes in individual cells to determine whether genes switch concordantly or randomly in individual cells, and whether switched cells can resume their former state. Together these several studies should contribute to a better understanding of how genetic factors affect blood pressure, its homeostasis, and the complications of hypertension. [unreadable] [unreadable] [unreadable]
|
2024-02-05T01:26:36.242652
|
https://example.com/article/8311
|
Emotion regulation in violent conflict: reappraisal, hope, and support for humanitarian aid to the opponent in wartime.
It is well known that negative intergroup emotions such as anger, fear, and hatred play a major role in initiating and maintaining intergroup conflicts. It is far less clear, however, what factors promote the resolution of intergroup conflicts. Using an emotion regulation- framework, we hypothesised that one form of emotion regulation-namely cognitive reappraisal-should play a salutary role in such conflicts, and be associated with increased hope as well as greater support for humanitarian aid to out-group members. To test these hypotheses, we used a nationwide survey of Jewish-Israeli adults, conducted during the war in Gaza between Israelis and Palestinians. Results obtained via structural equation modelling revealed that Israelis who regulated their negative emotions during the war through reappraisal were more supportive in providing humanitarian aid to innocent Palestinian citizens and that this relation was partially mediated by an enhanced feeling of hope.
|
2024-04-29T01:26:36.242652
|
https://example.com/article/2466
|
IN THE COURT OF CRIMINAL APPEALS OF TENNESSEE
AT KNOXVILLE
Assigned on Briefs March 22, 2005
STATE OF TENNESSEE v. EARL D. MILLS - July 5, 2005
Direct Appeal from the Criminal Court for Knox County
No.78215 Ray L. Jenkins, Judge
No. E2004-01218-CCA-R3-CD
The appellant, Earl D. Mills, pled guilty to vehicular homicide. As a result of the guilty plea, the
remaining nine (9) counts of the indictment were either merged with the vehicular homicide
conviction or nolle prossed by the State. The trial court sentenced the appellant to twelve (12) years
as a multiple offender. At the sentencing hearing, the appellant sought pre-trial jail credit for the 197
days he spent in jail prior to his guilty plea. The trial court denied the request because the appellant
was serving a sentence on an unrelated probation violation charge while awaiting trial on the charges
arising out of the indictment for vehicular homicide. The appellant filed a motion to reconsider. The
trial court granted the motion and awarded the appellant thirty-six (36) days of jail credit. However,
the appellant insists he should receive credit for the entire 197 days. For the following reasons, we
affirm the judgment of the trial court.
Tenn. R. App. P. 3 Appeal as of Right; Judgment of the Trial Court is Affirmed.
JERRY L. SMITH , J., delivered the opinion of the court, in which DAVID G. HAYES, and JAMES
CURWOOD WITT , JR., JJ., joined.
Mark E. Stephens, District Public Defender and Robert C. Edwards, Assistant Public Defender,
Knoxville, Tennessee, for the appellant, Earl Mills.
Paul G. Summers, Attorney General & Reporter; William G. Lamberth, II, Assistant Attorney
General; Randall E. Nichols, District Attorney General; and Jo Helm, Assistant District Attorney
General, for the appellee, State of Tennessee.
OPINION
Factual Background
On September 30, 2003, the appellant was indicted by the Knox County Grand Jury with a
ten (10) count indictment charging the appellant with: (1) three (3) alternative theories of vehicular
homicide; (2) failure to yield; (3) failure to render aid; (4) failure to give information; (5) driving on
a suspended license; (6) driving on a revoked license; (7) driving on a canceled license; and (8)
driving without a license in possession.
On April 15, 2004, the appellant pled guilty to vehicular homicide as stated in count one of
the indictment. The facts were stated by the prosecuting attorney at the guilty plea hearing as
follows:
On August 21st, 2003, about 10:30 in the morning, the victim, Michael England, was
going northbound on Clinton Highway. The defendant was going southbound and
was attempting to turn into Lowe’s on Clinton Highway.
The defendant pulled into the turn lane and stopped, and as a motorcycle came past,
he pulled into the side of the motorcycle, immediately ejecting Michael England from
that motorcycle off to the side of the road.
The defendant no doubt could have seen what had happened, but he kept driving for
about 80 feet because - and stopped only because the motorcycle was lodged under
the front of his car.
There were three witnesses to this. After the defendant stopped and tried to get the
motorcycle out from underneath the car, they prevented him from leaving further.
The police were called; investigation ensued. . . . [The appellant’s] blood was drawn.
He registered a .10.
It would be further proof that all these events occurred in Knox County.
In conjunction with the guilty plea, the trial court heard testimony from Jennifer England, the
victim’s wife. She read a prepared statement to convey the loss that she and her two (2) sons
suffered as a resulted of the appellant’s actions. The victim’s mother, Wanda England also testified
as to the impact of the victim’s death on her life. She asked the trial court to sentence the appellant
to the maximum possible sentence on all counts.
After hearing the proof and accepting the appellant’s guilty plea, the trial court sentenced the
appellant to twelve (12) years as a Range II multiple offender. The trial court initially indicated that
the appellant would receive “credit for the prior service of 197 days” that the appellant had served
-2-
prior to the entry of the plea. 1 However, the State objected to the issuance of the jail credit, because
the 197 days were part of a sentence for a probation violation that the appellant was serving.
Counsel for the appellant argued that the credits should be applied as concurrent. The trial court
denied the request and refused to give the appellant any jail credit.
The appellant subsequently filed a motion to reconsider. He requested that the trial court
reconsider the denial of jail credits, arguing that the credits should be awarded as part of his plea
agreement.2 At argument, counsel for the appellant admitted that he assumed the jail credits would
be applied when the trial court accepted the plea agreement.
The parties stipulated that the appellant was charged with aggravated vehicular homicide on
October 1, 2003, and was placed in the Knox County Sheriff’s Detention Facility that day. On
October 3, 2003, the appellant was charged with violation of probation on two (2) prior DUI
offenses. The trial court set bond in the vehicular homicide case at $100,000. The appellant failed
to make bond, and remained in custody until the entry of the guilty plea. During the time he was
incarcerated, the appellant reached a resolution in his violation of probation charges that required
him to serve eight (8) months in order to complete the sentence for violation of probation.
At the hearing on the motion to reconsider, the appellant argued that his sentence for
violation of probation expired on March 9, 2004, and that he did not plead guilty to vehicular
homicide until April 15, 2004. The appellant requested that the trial court issue jail credit for the
entire 197 days that he was incarcerated prior to the entry of the guilty plea. The appellant conceded
that the misdemeanor sentences made no reference to the pending felony vehicular homicide case
and that the plea agreement made no mention of jail credit.
The State argued that “concurrent” jail credit was never a part of the plea agreement and
pointed to the transcript of the guilty plea hearing where the attorney for the State objected to the
issuance of any type of jail credit. The State conceded that the appellant completed his sentence for
the violation of probation on March 9, 2004, and submitted that the trial court had the discretion to
award the appellant thirty (30) plus days of jail credit from the expiration of his probation violation
sentence to April 15, 2004.
At the conclusion of the hearing, the trial court granted the motion to reconsider and awarded
the appellant thirty-six (36) days of jail credit, from March 9, 2004, to April 15, 2004.
The appellant filed notice of appeal within thirty (30) days of the entry of the guilty plea,
challenging the trial court’s decision to award only thirty-six (36) days of jail credit, but not the
entire 197 days.
1
The appellant was placed in jail on October 1, 2003.
2
The appellant was still in jail at the time the motion to reconsider was filed. Thus, the trial court had
jurisdiction to amend the appellant’s sentence. Tenn. Code Ann. sec 40-35-212(d).
-3-
Analysis
The appellant contends on appeal that the trial judge was required to order jail credit and
failed to do so. Further, the appellant argues that because there was “no statement on the record to
the effect as to whether or not they [the sentences in the prior probation violation cases] were
concurrent or consecutive to the sentence received in the vehicular homicide case, [the sentences]
are presumed to be concurrent.” The State contends that the trial court properly denied the
appellant’s motion to issue jail credits for the entire time he was incarcerated prior to pleading guilty
to vehicular homicide. We agree.
Tennessee Code Annotated section 40-23-101(c) provides that:
The trial court shall, at the time the sentence is imposed and the defendant is
committed to jail, the workhouse, or the state penitentiary for imprisonment, render
the judgment of the court so as to allow the defendant credit on the sentence for any
period of time for which the defendant was committed and held in the city jail or
juvenile court detention prior to waiver of juvenile court jurisdiction, or county jail
or workhouse, pending arraignment and trial. The defendant shall also receive credit
on the sentence for the time served in the jail, workhouse or penitentiary subsequent
to any conviction arising out of the original offense for which the defendant was
tried.
Tenn. Code Ann. § 40-23-101(c). As written, the statute provides for credits against the sentence
only if the incarceration, claimed as a basis for the credits, arises from the offense for which the final
sentence was imposed.
In the case herein, the appellant was charged with aggravated vehicular homicide on October
1, 2003. On October 3, the appellant was charged with violation of probation stemming from two
(2) prior unrelated DUI convictions. The General Sessions Court ordered the appellant to serve eight
(8) months to complete his sentence on the DUI convictions. The trial court herein granted the
appellant jail credit for the time he spent in confinement for the vehicular homicide conviction, from
March 9, 2004, the date on which his sentence for probation violation expired, to April 15, 2004, the
date on which he was sentenced on the vehicular homicide conviction. The appellant seeks
concurrent jail credit for the vehicular homicide conviction for the time he spent in jail on the
unrelated probation violation charges. It is only when the time spent in jail or prison is due to, or
arises out of, the original offense against which the claim is credited that such an allowance becomes
a matter of right. See Trigg v. State, 523 S.W.2d 375, 376 (Tenn. Crim. App. 1975). This Court has
repeatedly rejected “double dipping” for credits from periods of continuous confinement for two (2)
separate and unrelated charges. See e.g. State v. Michael Bikrev, No. M2001-01620-CCA-R3-CD,
2002 WL 170734 (Tenn. Crim. App., at Nashville, Feb. 4, 2002); State v. Frederick Cavitt, No.
E1999-00304-CCA-R3-CD, 2000 WL 964941 (Tenn. Crim. App., at Knoxville, July 13, 2000). We
conclude that the appellant is not entitled to credits from a period of continuous confinement in this
state for separate and unrelated charges. The trial court properly credited the appellant for only the
-4-
thirty-six (36) days he was incarcerated after the expiration of the unrelated probation violation
sentence. This issue is without merit.
Conclusion
For the foregoing reasons, the judgment of the trial court is affirmed.
___________________________________
JERRY L. SMITH, JUDGE
-5-
|
2024-06-08T01:26:36.242652
|
https://example.com/article/4457
|
Bolsonaro: Brazil Is Resuming a Growth Trajectory
President JairBolsonaro celebrated in his Twitter profile the result of the January primary surplus. According to the representative, Brazil is resuming the growth trajectory.
In the first month of the year public Accounts, the federal government closed with a primary surplus of R $ 35.607 billion. A value celebrated by President Bolsonaro on Twitter, in a message in which he attributed this result to the work of his government.
Consolidated public sector accounts had a primary surplus of R $ 46.897 billion in January. The accounts include the federal government, states, municipalities, and state-owned enterprises. The data were released on Thursday (28) by the Central Bank.
The president once again defended reforms, such as the one that foresees social security changes. According to him, they would be key to attracting investments that could boost the economy.
“We are changing Brazil! Rescuing the growth of our economy is one of the first steps towards prosperity. If all goes as planned, advancing in the necessary changes, Brazil will increase its investments considerably. The Brazilian population wins, “wrote Bolsonaro.
|
2023-10-23T01:26:36.242652
|
https://example.com/article/2577
|
TIGRINA d, required for regulating the biosynthesis of tetrapyrroles in barley, is an ortholog of the FLU gene of Arabidopsis thaliana.
Regulation of tetrapyrrole biosynthesis in higher plants has been attributed to negative feedback control of steps prior to delta-aminolevulinic acid (ALA) formation. One of the first mutants with a defect in this control had been identified in barley. The tigrina (tig) d mutant accumulates 10-15-fold higher amounts of protochlorophyllide than wild type, when grown in the dark. The identity of the TIGRINA d protein and its mode of action are not known yet. Initially this protein had been proposed to act as a repressor of genes that encode enzymes involved in early steps of ALA formation, but subsequent attempts to confirm this experimentally failed. Here we demonstrate that the TIGRINA d gene of barley is an ortholog of the FLU gene of Arabidopsis thaliana. The FLU protein is a nuclear-encoded plastid protein that plays a key role in negative feedback control of chlorophyll biosynthesis in higher plants. Sequencing of the FLU gene of barley revealed a frame shift mutation in the FLU gene of the tig d mutant that results in the loss of two tetratricopeptide repeats that in the FLU protein of Arabidopsis are essential for its biological activity. This mutation cosegregates strictly with the tigrina phenotype within the F1 population of a heterozygous tig d mutant, thus providing additional support for the flu gene being responsible for the tigrina phenotype of barley.
|
2024-01-20T01:26:36.242652
|
https://example.com/article/5944
|
<?php
/**
* Zend Framework
*
* LICENSE
*
* This source file is subject to the new BSD license that is bundled
* with this package in the file LICENSE.txt.
* It is also available through the world-wide-web at this URL:
* http://framework.zend.com/license/new-bsd
* If you did not receive a copy of the license and are unable to
* obtain it through the world-wide-web, please send an email
* to license@zend.com so we can send you a copy immediately.
*
* @category Zend
* @package Zend_Gdata
* @subpackage App
* @copyright Copyright (c) 2005-2010 Zend Technologies USA Inc. (http://www.zend.com)
* @license http://framework.zend.com/license/new-bsd New BSD License
* @version $Id: Title.php 20096 2010-01-06 02:05:09Z bkarwin $
*/
/**
* @see Zend_Gdata_App_Extension_Text
*/
#require_once 'Zend/Gdata/App/Extension/Text.php';
/**
* Represents the atom:title element
*
* @category Zend
* @package Zend_Gdata
* @subpackage App
* @copyright Copyright (c) 2005-2010 Zend Technologies USA Inc. (http://www.zend.com)
* @license http://framework.zend.com/license/new-bsd New BSD License
*/
class Zend_Gdata_App_Extension_Title extends Zend_Gdata_App_Extension_Text
{
protected $_rootElement = 'title';
}
|
2024-03-21T01:26:36.242652
|
https://example.com/article/9168
|
Mark Teixeira and Tim Kurkjian both like the Braves' addition of Shane Greene to solidify their bullpen. (1:08)
The Atlanta Braves added two more relievers before the trade deadline, acquiring All-Star closer Shane Greene from the Detroit Tigers and right-hander Mark Melancon from the San Francisco Giants on Wednesday.
The Braves gave up two minor-leaguers -- left-hander Joey Wentz and infielder Travis Demeritte -- for Greene. They sent right-handed pitchers Dan Winkler and Tristan Beck to the Giants.
The Braves also acquired catcher John Ryan Murphy from the Arizona Diamondbacks on Wednesday for cash considerations.
"We engaged everything -- position players, starting pitchers, the bullpen -- right up until the end,'' Braves general manager Alex Anthopoulos said. "At the end of the day, where we thought there were deals that made sense for us and what we had to give up and so on, the bullpen made the most sense. But we definitely tried some other areas. We just couldn't wind up with a deal that made sense to our organization.''
Greene, 30, has a 1.18 ERA and 22 saves this season. The right-hander recorded 32 saves last season in his first full year as a closer.
Melancon, 34, is a three-time All-Star who has a 3.50 ERA in 43 games with the Giants this season.
Greene and Melancon are both under contract through the 2020 season. Greene is eligible for arbitration, and Melancon is set to make $14 million in the final year of his big deal, which the Braves will fully assume.
"That was part of it, no doubt,'' Anthopoulos said. "That adds value. You want contractual control."
Melancon waived a no-trade clause to join the Braves after his wife gave the green light.
"She's running the show here,'' Melancon said after his bags were packed in the visiting clubhouse at Philadelphia. "After we talked and realized it's Atlanta, a really good situation over there, we decided it's OK. It's a winning team. They got a lot of young talent, a lot of upside there."
The Braves bolstered their bullpen Tuesday with their acquisition of right-hander Chris Martin from the Texas Rangers.
Anthopoulos said the flurry of moves at the trade deadline pushed Atlanta well over its planned budget for 2019, but the GM was quick to point out that the much-maligned ownership group signed off on the extra spending without much hesitation.
Liberty Media has come under fire in the community for zealously guarding its checkbook, despite getting a new suburban ballpark that was largely paid for with some $400 million in public funding.
"We're a significant chunk over our allocated budget for the current year,'' Anthopoulos said.
Luke Jackson has served as Atlanta's closer this season, recording 17 saves. However, he has struggled lately, posting a 13.50 ERA with two blown saves in seven appearances since the All-Star break. He blew a save chance on Wednesday against the Washington Nationals, but the Braves won 5-4 in 10 innings.
For the Tigers, the trade of Greene likely clears the closer role for Joe Jimenez, who has been the team's closer of the future for some time. Buck Farmer, who has nine consecutive scoreless appearances to begin the second half, could force himself into the mix if Jimenez initially struggles.
The Associated Press contributed to this report.
|
2024-03-06T01:26:36.242652
|
https://example.com/article/8161
|
---
abstract: 'We study the Cauchy problem for non-linear non-local operators that may be degenerate. Our general framework includes cases where the jump intensity is allowed to depend on the values of the solution itself, e.g. the porous medium equation with the fractional Laplacian and the parabolic fractional $p$-Laplacian. We show the existence, uniqueness of bounded solutions and study their further properties. Several new examples of non-local, non-linear operators are provided.'
address:
- |
Instytut Matematyczny, Uniwersytet Wrocławski,\
pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland
- |
Universität Bielefeld, Fakultät für Mathematik,\
Postfach 10 01 31, 33501 Bielefeld, Germany
- |
Instytut Matematyczny, Uniwersytet Wrocławski,\
pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland
author:
- Grzegorz Karch
- Moritz Kassmann
- Miłosz Krupski
bibliography:
- 'kkk-05.bib'
title: 'A framework for non-local, non-linear initial value problems'
---
[Introduction]{}\[sec:introduction\] One of the core ideas in describing many phenomena in natural sciences is the notion of diffusion, whose mathematical description goes back to the beginning of the 20th century. A comprehensive introduction to this concept from an analytical perspective is given in the review article [@MR3588125]. The most prominent diffusion is the Brownian Motion with the Laplace operator $-\Delta$ as its infinitesimal generator. The more general class of Lévy processes has been found to be important for the modelling of diffusive and non-diffusive phenomena in natural and social sciences [@Humphries2010; @pyle1986diffusion; @schoutens2003levy; @Viswanathan1996; @MR1833700]. Here, the so called rotationally invariant $\alpha$-stable jump process can be seen as an important non-local counterpart of the Brownian Motion. Its infinitesimal generator is the fractional Laplace operator $(-\Delta)^{\alpha/2}$, where $\alpha \in (0,2)$. An introduction and overview of some the results related to non-local phenomena in analysis can be found in [@MR3469920].
In this paper we put forward a framework for non-local, non-linear “diffusion”. The operators that we consider might be degenerate but still allow for the conservation of mass, the maximum principle, and the comparison principle. It encompasses some of the known examples of equations which are used to describe behaviour of non-local diffusive-type processes, like the linear heat equation with the fractional Laplacian, the fractional porous medium equation or the parabolic equation with the fractional $p$-Laplacian. The framework also allows for new examples to be constructed and studied.
Statement of the problem {#statement-of-the-problem .unnumbered}
------------------------
Consider the initial value problem $$\label{pns}
\left\{
\begin{aligned}
&{\partial_t}u + {\mathcal{L}}_u u = 0\quad&\text{on ${[0,\infty)}\times{{{\mathbb{R}}^N}}$}, \\
&u(0) = u_0\quad&\text{on ${{{\mathbb{R}}^N}}$},
\end{aligned}
\right.$$ where the non-linear non-local operator ${\mathcal{L}}$ is defined by the formula $$\label{operator}
\big({\mathcal{L}}_vu\big)(x) = \int_{{{\mathbb{R}}^N}}\big[u(x)-u(y)\big] {{\rho}\big(v(x),v(y);x,y\big)}\,dy$$ for a given *homogeneous jump kernel* ${\rho}$.
\[def:jump-kernel\] We say a function ${\rho}:({\mathbb{R}}\times{\mathbb{R}})\times({{{\mathbb{R}}^N}}\times{{{\mathbb{R}}^N}})\to{\mathbb{R}}$ is a homogeneous jump kernel if it satisfies conditions \[a1:positive\]–\[a6:lipschitz\]. For all $a,b,c,d\in{\mathbb{R}}$ and for almost every $(x,y)\in{{{\mathbb{R}}^N}}\times{{{\mathbb{R}}^N}}$ we assume that
(A1)\[a1:positive\]
: ${\rho}$ is a non-negative Borel function;
(A2)\[a2:symmetry\]
: ${\rho}$ is symmetric, i.e. ${{\rho}(a,b;x,y)} = {\rho}(b,a;y,x)$;
(A3)\[a3:monotonicity\]
: ${\rho}$ is monotonous in the following sense: $$\hspace{\leftmargin}
(a-b){{\rho}(a,b;x,y)} \geq (c-d){{\rho}(c,d;x,y)}\quad\text{whenever $a\geq c\geq d\geq b$};$$
(A4)\[a4:homogeneity\]
: ${\rho}$ is homogeneous $$\hspace{\leftmargin}
{{\rho}(a,b;x,y)} = {\rho}\big(a,b;|x-y|\big);$$
(A5)\[a5:1levy\]
: for every $R> 0$ there exists a function $m_R:[0,\infty)\to[0,\infty)$ such that $\sup_{-R\leq a,b\leq R}{{\rho}(a,b;x,y)}\leq m_R\big(|x-y|\big)$ and $$\hspace{\leftmargin}
\int_{{{\mathbb{R}}^N}}\big(1\wedge |y|\big)m_R\big(|y|\big)\,dy = K_R <\infty;$$
(A6)\[a6:lipschitz\]
: ${\rho}$ is continuous with respect to the first two variables and it is locally Lipschitz-continuous outside diagonals, i.e. for every ${\varepsilon}>0$ and every $R>{\varepsilon}$ there exists a constant $C_{R,{\varepsilon}}$ such that $$\hspace{\leftmargin}
\big|{\rho}(a,b,x,y) - {\rho}(c,d,x,y)\big| \leq C_{R,{\varepsilon}} \big(|a-c|+|b-d|\big)\, m_R\big(|x-y|\big)$$ for every $a,b,c,d\in[-R, R]$ such that $|a-b|\geq{\varepsilon}$ and $|c-d|\geq{\varepsilon}$.
The name *jump kernel* comes from the probabilistic interpretation of the role of the operator ${\mathcal{L}}$ in equation . The function ${\rho}(a,b,x,y)$ describes the density of jumps from $x$ to $y$ within a unit time interval. In our setup, this density is moreover allowed to depend on the values $u(x)$ and $u(y)$ of the solution in place of parameters $a$ and $b$.
In the integrability condition \[a5:1levy\], one may simply *define* the function $m_R$ as $m_R\big(|x-y|\big) = \sup_{-R\leq a,b\leq R}{{\rho}(a,b;x,y)}$. In some situations, however, it is more convenient to consider a different majorant (cf. Proposition \[lemma:bielefeld\]).
\[rem:levy\] If $\mu$ is a non-negative function and the integral $\int_{{{\mathbb{R}}^N}}\big(1\wedge |y|\big)\mu(y)\,dy$ is finite, then we say that $\mu$ is the density of a Lévy measure with low singularity. This corresponds to our assumption on the function $m_R$ in condition \[a5:1levy\] in Definition \[def:jump-kernel\]. Note that, in case of a general Lévy measure $\mu$, the integral $\int_{{{\mathbb{R}}^N}}\big(1\wedge |y|^2\big)\mu(dy)$ is assumed to be finite. We do not treat this general case here.
Note that in condition \[a4:homogeneity\] and in the sequel we allow for some ambiguity with respect to the function ${\rho}$. Moreover, for clarity of presentation we abbreviate the notation for the jump kernel and write $$\begin{aligned}
{{\rho}\big(u(x),u(y);x,y\big)} = {\rho}_{u,x,y}& &\text{and}& &{{\rho}\big(u(x),u(y);x,y\big)}\,dy\,dx = d{\rho}_u.
\end{aligned}$$
An operator $\big(A, D(A)\big)$ satisfies the positive maximum principle if for every $u \in D(A)$ the fact that $u(x_0)=\sup_{x\in{{{\mathbb{R}}^N}}} u(x)\geq 0$ for some $x_0\in {{{\mathbb{R}}^N}}$ implies $A u(x_0) \leq 0$. Because of formula , the operator $-{\mathcal{L}}_v$ has this property for each $v\in L^\infty({{{\mathbb{R}}^N}})$ as long as it is supplemented with a suitable domain (for example, the $BV$ space, see Lemma \[lemma:bv\] below).
Main results {#main-results .unnumbered}
------------
Our goal is to prove the results gathered in Theorem \[thm:main\] and Corollary \[cor:main\]. We prove properties typical for solutions to diffusion equations.
\[thm:main\] Let ${\rho}$ be a homogeneous jump kernel in the sense of Definition \[def:jump-kernel\]. For every initial condition $u_0\in L^\infty({{{\mathbb{R}}^N}})\cap BV({{{\mathbb{R}}^N}})$, problem has a unique very weak solution $u$ such that $$u \in L^\infty \big([0,\infty), L^\infty({{{\mathbb{R}}^N}})\cap BV({{{\mathbb{R}}^N}}) \big)\cap W^{1,1}_{\operatorname{loc}}\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$$ (see Definition \[def:bvsolution\]). This solution has the following properties
- mass is conserved: $\int_{{{{\mathbb{R}}^N}}} u(t,x)\,dx = \int_{{{{\mathbb{R}}^N}}} u_0(x)\,dx$ for all $t\geq 0$;
- $L^p$-norms are non-increasing: $\|u(t)\|_p\leq \|u_0\|_p$ for all $p\in [1,\infty]$ and $t\geq 0$;
- if $u_0(x)\geq 0$ for almost every $x\in{{{\mathbb{R}}^N}}$ then $u(t,x)\geq 0$ for almost every $x\in {{{\mathbb{R}}^N}}$ and $t\geq 0$.
Moreover, for two solutions $u$ and $\widetilde u$ corresponding to initial conditions $u_0$ and $\widetilde u_0$, respectively, we have $$\|u(t)-\widetilde u(t)\|_1\leq \|u_0-\widetilde u_0\|_1\quad\text{for every $t\geq 0$}$$ and if $u_0(x)\geq \widetilde u_0(x)$ for almost every $x\in{{{\mathbb{R}}^N}}$ then $u(t,x)\geq \widetilde u(x,t)$ for almost every $x\in {{{\mathbb{R}}^N}}$ and $t\geq 0$.
\[cor:main\] Let ${\rho}$ be a homogeneous jump kernel in the sense of Definition \[def:jump-kernel\]. For every initial condition $u_0\in L^1({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$, problem has a very weak solution $u$ such that $$u \in L^\infty \big([0,\infty), L^1({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})\big)\cap C\big([0,\infty), L^1({{{\mathbb{R}}^N}})\big).$$ This solution has the following properties
- mass is conserved: $\int_{{{{\mathbb{R}}^N}}} u(t,x)\,dx = \int_{{{{\mathbb{R}}^N}}} u_0(x)\,dx$ for all $t\geq 0$;
- $L^p$-norms are non-increasing: $\|u(t)\|_p\leq \|u_0\|_p$ for all $p\in [1,\infty]$ and $t\geq 0$;
- if $u_0(x)\geq 0$ for almost every $x\in{{{\mathbb{R}}^N}}$ then $u(t,x)\geq 0$ for almost every $x\in {{{\mathbb{R}}^N}}$ and $t\geq 0$.
Notice that in the statement of Corollary \[cor:main\] we consider more general initial data and consequently there is no claim of uniqueness of solutions nor a notion of $L^1$-contraction.
One could expect solutions to diffusion equations to be more regular than their initial data (cf. the heat equation). In general, this is not the case in our framework and can easily be disproved by the trivial example ${{\rho}(a,b;x,y)}= 0$. It satisfies Definition \[def:jump-kernel\], but there is no smoothing effect in the Cauchy problem $$\partial_t u =0, \qquad u(0)=u_0.$$ This example also shows that we cannot expect any decay of solutions.
### Strategy of the proof of Theorem \[thm:main\] {#strategy-of-the-proof-of-theoremthmmain .unnumbered}
Let us briefly describe the strategy to prove Theorem \[thm:main\] and thus also the general outline of the paper. In Section \[sec:regular\], Definition \[def:regular\], we introduce the notion of *regular jump kernels* in order to show in Theorem \[thm:classical\] that in such cases there exist unique classical solutions to problem for every initial condition $u_0\in L^1({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$. Then, in Section \[sec:existence\], we “regularize” homogeneous jump kernels (Lemma \[lemma:approx\]). In Theorem \[thm:existence\], we show that if $u_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ then the approximating sequence of solutions $u^{{\varepsilon}}$ to problems , with initial conditions $u_0$, corresponding to a sequence of regularized jump kernels, has a convergent subsequence and its limit $u$ is a strong solution to problem (see Definition \[def:bvsolution\]). The solution satisfies $u\in L^\infty\big([0,\infty),BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})\big)\cap C\big([0,\infty),L^1_{\operatorname{loc}}({{{\mathbb{R}}^N}})\big)$. In Theorem \[thm:contraction\] we prove the $L^1$-contraction property, which immediately implies uniqueness of solutions (Corollary \[cor:uniqueness\]). The properties of solutions indicated in the statement of Theorem \[thm:main\] follow as side-effects in the process of this construction (see Corollaries \[cor:Lp-weak\], \[cor:mass\_conservation\] and \[cor:positivity\]).
### Strategy of the proof of Corollary \[cor:main\] {#strategy-of-the-proof-of-corollarycormain .unnumbered}
As a consequence of Theorem \[thm:main\], we obtain Corollary \[cor:main\]. In Theorem \[thm:existence2\] we consider general initial condition $u_0\in L^1({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ and a sequence of its approximations for which we may use Theorem \[thm:main\] to construct unique strong solutions. We are able to verify Definition \[def:distributional\] of the pointwise limit of these solutions and to deduce properties of this solution as a consequence of the pointwise convergence of approximations (see Corollary \[cor:properties\]).
Scope of the framework {#scope-of-the-framework .unnumbered}
----------------------
Let us introduce our framework by presenting several examples. Many of them have been discussed intensively in the literature but some of them, to the best of our knowledge, are new. A more detailed description of these examples follows also in Section \[sec:examples\].
### Known models {#known-models .unnumbered}
As a simple example which could be written in the form we recall the linear fractional heat equation $$\label{eq:heat}
\partial_t u +(-\Delta)^{\alpha/2} u=0 \quad \text{with the jump kernel} \quad
{{\rho}(a,b;x,y)}=\frac{C_{\alpha,N}}{|x-y|^{N+\alpha}}.$$ Because of the integrability constraint \[a5:1levy\], in this work we have to assume $\alpha\in (0,1)$. We refer to [@MR3469920] for a gentle introduction to the fractional Laplacian. Equation has an explicit solution $u(t)=p_\alpha(t)*u_0$ with the $\alpha$-stable density $p_\alpha(t) \in C^\infty({{{\mathbb{R}}^N}})\cap L^1({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ (see [@MR2373320; @MR3211862]).
A more complicated case is the fractional porous medium equation $$\label{fpme}
\partial_t u +(-\Delta)^{\alpha/2} \big(|u|^{m-1}u\big)=0,$$ which is studied in depth in [@MR2334594; @MR2737788; @MR2954615]. See also [@MR3666562] for most recent results and more references. In our case, we can write this equation as , using the following jump kernel with $\alpha\in(0,1)$ and $m\geq1$ $${{\rho}(a,b;x,y)}=\frac{|a|^{m-1}a-|b|^{m-1}b}{a-b}\cdot\frac{C_{\alpha,N}}{|x-y|^{N+\alpha}}.$$
Let $\mu$ be a Lévy measure as defined in Remark \[rem:levy\]. One can replace the operator $(-\Delta)^{\alpha/2}$ in equation by a more general *Lévy operator* $$\label{L:lin}
\mathcal{L}^\mu\psi(x)
= \int_{{{{\mathbb{R}}^N}}\setminus\{0\}} \Big(\psi(x+y) - \psi(x) - y\cdot\nabla\psi(x)\mathbbm{1}_{|y|\leq 1}(y)\Big)\,d\mu(y),$$ and the function $u\mapsto |u|^{m-1}u$ by $u\mapsto \varphi(u)$ which is (for example) a continuous, increasing function with $\varphi(0)=0$. Some modifications of equation in this fashion are described in [@MR3485132; @MR3656476]. The general case is studied in [@MR3724879; @MR3570132].
Assuming that $\varphi$ is continuous and non-decreasing and $\mu$ is a general symmetric Lévy measure, the authors establish a uniqueness result for bounded distributional solutions and several estimates. In our framework we are able to prove some of these results. Our approach is less general than the one in [@MR3570132] because conditions \[a5:1levy\] and \[a6:lipschitz\] limit its scope.
A different but related stream of research focuses on another type of non-linear non-local operator, the $s$-fractional $p$-Laplacian (see [@MR3148135; @MR3491533; @MR3456825] and the references therein) in the context of the following evolution equation $$\label{plap}
\partial_t u +\int_{{{\mathbb{R}}^N}}\frac{\Phi\big(u(x)-u(y)\big)}{|x-y|^{N+ps}}\,dy =0,\quad \Phi(z) = z|z|^{p-2}.$$ Usually it is assumed that $s\in(0,1)$ and $p\in(1,\infty)$. The case $p=2$ reduces to the linear equation . For some pairs $(s,p)$, but also other functions $\Phi$, equation can be written in the form of equation , see Proposition \[lemma:fpl\].
Our results also apply to a regular version of equation i.e. where the kernel $|x-y|^{-(N+ps)}\,dy$ is replaced by a sufficiently regular, integrable and non-negative function $J\big(|x-y|\big)$. This case was studied in [@MR2722295 Chapter 6].
Results involving regular jump kernels (see Definition \[def:regular\] and the entire Section \[sec:regular\]) can be directly applied to the following non-local equation studied in [@2016arXiv160203522S] $${\partial_t}u =\int_{{{\mathbb{R}}^N}}k \big(u(t, x), u(t, y)\big)\big[u(t, y) - u(t, x)\big]J(x - y)\,dy.$$ Here, the kernel $J:{{{\mathbb{R}}^N}}\to{\mathbb{R}}$ is an integrable, non-negative function supported in the unit ball. The function $k : {\mathbb{R}}^2 \to {\mathbb{R}}$ is locally Lipschitz-continuous and non-negative. We refer the reader to the work [@2016arXiv160203522S] for other properties of solutions such as the strong maximum principle.
Models combining local counterparts of operators and [^1], namely $$\label{eq:doubly-nonlinear}
{\partial_t}u = (\Delta_p)\big(u\,|u|^m\big),\quad\text{where}\quad\Delta_pv = \operatorname{div}\big(|\nabla v|^{p-2}\nabla v\big),$$ have been studied as well [@MR1097286; @MR2988757].
### New models {#new-models .unnumbered}
Our results can be applied to non-linear, non-local evolution equations which have not been previously studied. We may combine equations , and and study the following non-local counterpart of equation $${\partial_t}u +\int_{{{\mathbb{R}}^N}}{\Phi\big[f\big(u(x)\big)-f\big(u(y)\big)\big]}\mu\big(|x-y|\big)\,dy = 0.$$ Here $f$ and $\Phi$ are non-decreasing functions and $\mu$ is a density of a Lévy measure with low singularity. All assumptions are indicated in Proposition \[lemma:doubly-nonlinear\].
By considering what we call *convex diffusion operator* we introduce the following evolution equation $${\partial_t}u + \int_{{{\mathbb{R}}^N}}\big[u(x)-u(y)\big]\big[f\big((u(x)\big)+f\big(u(y)\big)\big]\mu\big(|x-y|\big)\,dy = 0$$ for a non-negative, convex function $f$ and a density of a Lévy measure with low singularity $\mu$. We discuss this example in Proposition \[lemma:breslau\].
Next, we may study nonlocal operators, where the order of differentiability is not fixed. Here is a possible example:
$${\partial_t}u - \int_{{{\mathbb{R}}^N}}\frac{u(y)-u(x)}{ |y-x|^{N+ \frac12 - \frac{1}{4}\sin\frac{1}{|x-y|}}} = 0\,.$$
We may even allow the order of differentiability to depend on $u(x), u(y)$ as in the following example: $${\partial_t}u - \int_{B_1(x)} \frac{u(y)-u(x)}{|x-y|^{N+\frac12-\frac{1}{4}\exp(-|u(y)-u(x)|)}}\,dy = 0 \,.$$ The general case including precise assumptions is explained in Proposition \[lemma:bielefeld\].
### Potential extensions {#potential-extensions .unnumbered}
Our framework could be extended and adapted to cover the following models which are not currently in its scope.
In the series of papers [@MR2914243; @MR3218830; @MR2795714; @MR3286677] the properties of solutions to the following conservation laws $${\partial_t}u + \operatorname{div}f(u) + \mathcal{L}u = g(x,t)$$ have been studied. The non-local operator $\mathcal{L}$ is given by formula .
One may also consider the following general fractional porous medium equation with variable density $$\rho(x){\partial_t}u + (-\Delta)^s (u^{m-1}u) = 0,$$ which was considered in [@MR3412412; @MR3158444].
We also mention the work [@MR3466219], devoted to the inhomogeneous non-local diffusion equation $${\partial_t}u (x, t) = \int_{\mathbb{R}}J\bigg(\frac{x-y}{g(y)}\bigg) \frac{u(y, t)}{g(y)}\,dy - u(x, t),$$ where $J$ is a non-negative even function supported in the unit interval $[-1, 1]$ and such that $\int_{\mathbb{R}}J(x)\,dx = 1$ and the function $g$ is continuous and positive.
We conclude this overview by recalling non-linear porous medium equation with fractional potential pressure $$\label{pmep}
{\partial_t}u = \operatorname{div}\big(u^{m_1}\nabla(-\Delta)^{-s} u^{m_2}\big)$$ where $m_1,m_2\geq 1$ and $s\in (0,1)$. This equation was first studied in [@MR2575479] in the one dimensional case and for $m_1=m_2=1$, and solutions to the corresponding Cauchy problem were shown to exist and to be unique. Moreover, an explicit self-similar compactly supported solution has been constructed for this equation for $N=1$ in [@MR2575479] and for $N\geq 1$ in [@MR2817383; @MR3294409]. Independently, a theory of equation has been developed in [@MR2847534; @MR2773189]. Recent results and several other references have been obtained and gathered in [@MR3151879; @MR3419724].
Outline {#outline .unnumbered}
-------
The paper is structured as follows. In Section \[sec:operator\] we discuss the properties of the operator ${\mathcal{L}}$. In Section \[sec:regular\] we solve equation in a regular setting. In Section \[sec:existence\] we prove our main results (see Theorem \[thm:main\] and Corollary \[cor:main\]), namely existence and uniqueness of solutions to equation and we study their properties. In Section \[sec:examples\] we give several examples of jump kernels.
[Non-linear Lévy operator]{}\[sec:operator\] We begin by introducing our notation. We use the Banach space $${L^{[1,\infty]}({{{\mathbb{R}}^N}})}= L^1({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$$ supplemented with the usual norm $\|u\|_{[1,\infty]} = \|u\|_1+\|u\|_\infty$ as well as standard Sobolev spaces $W^{1,\infty}({{{\mathbb{R}}^N}})$ and $W^{1,1}_{\operatorname{loc}}\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$.
We employ the space of functions of bounded variation, following [@MR3726909]. Let $u\in L^1({{{\mathbb{R}}^N}})$ and suppose for $i=1,\ldots,d$ there exist finite signed Radon measures $\lambda_i$ such that $$\int_{{{\mathbb{R}}^N}}u\,\partial_{x_i} \phi\,dx = - \int_{{{\mathbb{R}}^N}}\phi\, d\lambda_i\quad\text{for every $\phi\in C_c^\infty({{{\mathbb{R}}^N}})$}.$$ We define $$|Du|({{{\mathbb{R}}^N}}) = \sum_{i=1}^N\sup\bigg\{\int_{{{\mathbb{R}}^N}}\Phi_i\,d\lambda_i: \Phi\in C_0({{{\mathbb{R}}^N}},{{{\mathbb{R}}^N}}), \|\Phi\|_{C_0({{{\mathbb{R}}^N}},{{{\mathbb{R}}^N}})}<1\bigg\}.$$ Then we say $u\in BV({{{\mathbb{R}}^N}})$ if the value of the following norm $$\|u\|_{BV} = 2\|u\|_1 + |Du|({{{\mathbb{R}}^N}})$$ is finite (caution: the number 2 in front of the $L^1$-norm is added to simplify estimates below). We also recall an alternative characterization of the $BV$-space which is more useful for us.
\[lemma:bv-char\] Let $(e_1,\ldots,e_N)$ be the canonical basis of ${{{\mathbb{R}}^N}}$. Suppose $u\in L^1({{{\mathbb{R}}^N}})$ and denote $$|u|_{BV} = \sum_{i=1}^N \liminf_{h\to0^+} \int_{{{{\mathbb{R}}^N}}} \frac{\big|u(x)-u(x+he_i)\big|}{h}\,dx.$$ Then $u\in BV({{{\mathbb{R}}^N}})$ if and only if $|u|_{BV}<\infty$. Moreover $|u|_{BV} = |Du|({{{\mathbb{R}}^N}})$.
See [@MR3726909 Theorem 13.48] and [@MR3726909 Exercise 13.3].
\[lemma:bvnorm\] If $u\in BV({{{\mathbb{R}}^N}})$ then $$\sup_{y\in{{{\mathbb{R}}^N}}\setminus\{0\}}\int_{{{\mathbb{R}}^N}}\frac{\big|u(x)-u(x-y)\big|}{1\wedge|y|}\,dx \leq \|u\|_{BV}.$$
According to [@MR3726909 Lemma 13.33] we have $$\int_{{{\mathbb{R}}^N}}\big|u(x)-u(x-y)\big|\,dx \leq |y|\,|Du|({{{\mathbb{R}}^N}}).$$ Thus $$\sup_{y\in{{{\mathbb{R}}^N}}\setminus\{0\}}\int_{{{\mathbb{R}}^N}}\frac{\big|u(x)-u(x-y)\big|}{1\wedge|y|}\,dx \leq 2\|u\|_1 + |Du|({{{\mathbb{R}}^N}}) = \|u\|_{BV}.\qedhere$$
Now we are ready to show that if $v$ is a bounded function, the linear operator ${\mathcal{L}}_v$ given by formula is well-defined on the space of $BV$-functions.
\[lemma:bv\] Let ${\rho}:({\mathbb{R}}\times{\mathbb{R}})\times({{{\mathbb{R}}^N}}\times{{{\mathbb{R}}^N}})\to{\mathbb{R}}$ be a function satisfying conditions \[a1:positive\], \[a2:symmetry\] and \[a5:1levy\] in Definition \[def:jump-kernel\]. For every $v\in L^\infty({{{\mathbb{R}}^N}})$ such that $\|v\|_\infty \leq R$ we have $${\mathcal{L}}_v:BV({{{\mathbb{R}}^N}})\to L^1({{{\mathbb{R}}^N}})\quad\text{and}\quad\|{\mathcal{L}}_vu\|_1 \leq K_R\|u\|_{BV},$$ where $K_R$ is the constant in the integrability condition \[a5:1levy\] in Definition \[def:jump-kernel\]
We use condition \[a5:1levy\] and Lemma \[lemma:bvnorm\] to estimate $$\begin{aligned}
\|{\mathcal{L}}_vu\|_1 = \int_{{{\mathbb{R}}^N}}\bigg|\int_{{{\mathbb{R}}^N}}&\big[u(x)-u(y)\big]{\rho}_{v,x,y}\,dy\,\bigg|\,dx\\
&\leq\iint_{{{{\mathbb{R}}^{2N}}}}\frac{\big|u(x)-u(x-y)\big|}{1\wedge|y|}\big(1\wedge|y|\big)m_R\big(|y|\big)\,dx\,dy\\
&\leq\|u\|_{BV}\int_{{{{\mathbb{R}}^N}}}\big(1\wedge|y|\big)m_R\big(|y|\big)\,dy = \|u\|_{BV}K_R.&&\qedhere
\end{aligned}$$
Let us now prove other properties of the operator ${\mathcal{L}}_v$.
\[lemma:sym\] Let ${\rho}:({\mathbb{R}}\times{\mathbb{R}})\times({{{\mathbb{R}}^N}}\times{{{\mathbb{R}}^N}})\to{\mathbb{R}}$ be a function satisfying conditions \[a1:positive\], \[a2:symmetry\] and \[a5:1levy\] in Definition \[def:jump-kernel\]. For every $v\in L^\infty({{{\mathbb{R}}^N}})$ the operator ${\mathcal{L}}_v:C_c^\infty({{{\mathbb{R}}^N}})\to {L^{[1,\infty]}({{{\mathbb{R}}^N}})}$ is $L^2$-symmetric and positive-definite. If $u\in BV({{{\mathbb{R}}^N}})$ and $\phi\in C_c^\infty({{{\mathbb{R}}^N}})$ then $\int_{{{\mathbb{R}}^N}}{\mathcal{L}}_vu\phi\,dx = \int_{{{\mathbb{R}}^N}}{\mathcal{L}}_v\phi u\,dx$.
Let $\phi,\psi\in C_c^\infty({{{\mathbb{R}}^N}})$. We have $$\sup_{x\in{{{\mathbb{R}}^N}}}\bigg|\int_{{{\mathbb{R}}^N}}\big[\phi(x)-\phi(y)\big] {\rho}_{v,x,y}\,dy\,\bigg|\leq 2\|\phi\|_{W^{1,\infty}} K_R,$$ which combined with Lemma \[lemma:bv\] gives us ${\mathcal{L}}_v\phi\in {L^{[1,\infty]}({{{\mathbb{R}}^N}})}\subset L^2({{{\mathbb{R}}^N}})$. Thanks to condition \[a2:symmetry\] in Definition \[def:jump-kernel\] we may “symmetrize” the double integral and obtain (see Remark \[rem:sym\] below) $$\begin{gathered}
\int_{{{\mathbb{R}}^N}}\psi(x)\big({\mathcal{L}}_v\phi\big)(x)\,dx
= \int_{{{\mathbb{R}}^N}}\psi(x)\int_{{{\mathbb{R}}^N}}\big[\phi(x)-\phi(y)\big] {\rho}_{v,x,y}\,dy\,dx\\
= \frac{1}{2}\iint_{{{{\mathbb{R}}^{2N}}}} \big[\psi(x)-\psi(y)\big]\big[\phi(x)-\phi(y)\big] \,d{\rho}_{v}
= \int_{{{\mathbb{R}}^N}}\big({\mathcal{L}}_v\psi(x)\big)\phi(x)\,dx.
\end{gathered}$$ The same observation holds if we exchange $\psi$ by $u\in BV({{{\mathbb{R}}^N}})\subset L^1({{{\mathbb{R}}^N}})$ (all the integrals are well-defined because of Lemma \[lemma:bv\]). Finally $$\int_{{{\mathbb{R}}^N}}\phi(x)\big({\mathcal{L}}_v \phi\big)(x)\,dx =
\iint_{{{{\mathbb{R}}^{2N}}}}\big[\phi(x)-\phi(y)\big]^2 \,d{\rho}_{v}\geq 0.\qedhere$$
\[rem:sym\] The “symmetrization argument” that we use in the proof of Lemma \[lemma:sym\] is going the be used extensively throughout this paper. In every instance it looks like the following identity $$\begin{gathered}
\iint_{{{{\mathbb{R}}^{2N}}}} \big[f(x)-f(y)\big] g(x){\rho}_{v,x,y}\,dy\,dx
= \iint_{{{{\mathbb{R}}^{2N}}}} \big[f(y)-f(x)\big] g(y){\rho}_{v,y,x}\,dx\,dy\\
= \frac{1}{2}\iint_{{{{\mathbb{R}}^{2N}}}} \big[f(x)-f(y)\big]\big[g(x)-g(y)\big] d{\rho}_{v,x,y}\,dy\,dx,
\end{gathered}$$ for a suitable pair of functions $f$ and $g$ (notably we may take $g\equiv 1$ and the integral vanishes). The first equality requires no effort, it is simply renaming the variables. In the second equality we use the Fubini-Tonelli theorem to exchange $dx$ and $dy$, use the symmetry property \[a2:symmetry\] of the jump kernel introduced in Definition \[def:jump-kernel\], which states that ${\rho}_{v,y,x}={\rho}_{v,x,y}$, and take the average of both integrals.
In the next theorem, we prove a result which is reminiscent of the famous Kato inequality [@MR0333833; @MR2056467]. In a way, it is central to our entire work and a source of some of its limitations. In particular, it is the reason behind the monotonicity condition \[a3:monotonicity\] in Definition \[def:jump-kernel\] as well as the introduction of the $BV$ space. Indeed, in Lemma \[lemma:bvestimate\] we show that the solution $u(t)$ belongs to $BV({{{\mathbb{R}}^N}})$ for all $t> 0$ if the initial condition does too. Then we have ${\mathcal{L}}_uu\in L^1({{{\mathbb{R}}^N}})$ (cf. Lemma \[lemma:bv\]) and we may use the theorem.
\[thm:kato\] Let ${\rho}:({\mathbb{R}}\times{\mathbb{R}})\times({{{\mathbb{R}}^N}}\times{{{\mathbb{R}}^N}})\to{\mathbb{R}}$ be a function satisfying conditions \[a1:positive\], \[a2:symmetry\] and \[a3:monotonicity\] in Definition \[def:jump-kernel\]. If $u,v\in L^\infty({{{\mathbb{R}}^N}})$ are such that ${\mathcal{L}}_uu,{\mathcal{L}}_vv\in L^1({{{\mathbb{R}}^N}})$ then $$\int_{{{\mathbb{R}}^N}}({\mathcal{L}}_uu-{\mathcal{L}}_vv)\operatorname{sgn}(u-v)\,dx\geq 0.$$
Let $$\begin{aligned}
&\eta(x) = \operatorname{sgn}\big(u(x)-v(x)\big),\\
&f(x,y) = \big[u(x)-u(y)\big]{\rho}_{u,x,y}-\big[v(x)-v(y)\big]{\rho}_{v,x,y}.
\end{aligned}$$ Since we assume ${\mathcal{L}}_uu-{\mathcal{L}}_vv\in L^1({{{\mathbb{R}}^N}})$ and since $\eta\in
L^\infty({{{\mathbb{R}}^N}})$, the symmetrization argument (see Remark \[rem:sym\]) gives us $$\begin{gathered}
\int_{{{\mathbb{R}}^N}}\big(({\mathcal{L}}_uu)(x)-({\mathcal{L}}_vv)(x)\big) {\eta{(x)}}\,dx\\
=\iint_{{{{\mathbb{R}}^{2N}}}} f(x,y) \,dy\,{\eta{(x)}}\,dx
=\frac{1}{2}\iint_{{{{\mathbb{R}}^{2N}}}} f(x,y)\big[{\eta{(x)}}-{\eta{(y)}}\big]\,dy\,dx.
\end{gathered}$$ Because of the symmetry condition \[a2:symmetry\], we have $f(x,y) =
-f(y,x)$ and hence $$\begin{aligned}
&\iint_{{{{\mathbb{R}}^{2N}}}} f(x,y)\big[{\eta{(x)}}-{\eta{(y)}}\big]\,dy\,dx \\
&\qquad=\frac12 \iint_{{{{\mathbb{R}}^{2N}}}}f(x,y)\big[{\eta{(x)}}-{\eta{(y)}}\big] \mathbbm{1}_{\{{\eta{(x)}} > {\eta{(y)}}\}} \,dy\,dx \\
&\qquad\quad+ \frac12 \iint_{{{{\mathbb{R}}^{2N}}}} f(x,y)\big[{\eta{(x)}}-{\eta{(y)}}\big] \mathbbm{1}_{\{{\eta{(x)}} < {\eta{(y)}}\}} \,dy\,dx
\\
&= \iint_{{{{\mathbb{R}}^{2N}}}} f(x,y)\big[{\eta{(x)}}-{\eta{(y)}}\big] \mathbbm{1}_{\{{\eta{(x)}} > {\eta{(y)}}\}}
\,dy\,dx \,.\end{aligned}$$ The set $\{{\eta{(x)}} >
{\eta{(y)}}\}$ is a subset of the set $M=\{ u(x) \geq v(x), \; v(y) \geq u(y) \}$.
In order to complete the proof, if suffices to show that $f$ is nonnegative on $M$. If $(x,y) \in M$ and additionaly $v(x) \geq v(y)$, then $f(x,y) \geq 0$ because of assumption \[a3:monotonicity\]. Thus, we only need to consider the situation, where $(x,y) \in M$ and $v(x) < v(y)$. There are two cases. If $u(x) \geq u(y)$, then $f(x,y) \geq 0$ just because ${\rho}$ is nonnegative. If $u(x) < u(y)$, then $ v(x) \leq u(x) < u(y) \leq v(y)$. In this case, assumption \[a3:monotonicity\] implies $$\begin{aligned}
\big[v(y)-v(x)\big] {\rho}(v(y), v(x),
y,x)-\big[u(y)-u(x)\big] {\rho}(u(y), u(x),y,x) \geq 0\end{aligned}$$ Due to assumption \[a2:symmetry\] we obtain $$\begin{aligned}
\big[u(x)-u(y)\big] {\rho}(u(x), u(y),
x,y)-\big[v(x)-v(y)\big] {\rho}(v(x), v(y),x,y) \geq 0\,,\end{aligned}$$ which is nothing but $f(x,y) \geq 0$. The proof of Theorem \[thm:kato\] is complete.
[Regular jump kernels]{}\[sec:regular\]
In this section we construct global-in-time unique classical solutions of problem under strong regularity assumptions on the jump kernel. Notice that we do not assume the jump kernel to be homogeneous.
\[def:regular\] We say a function ${\rho}:({\mathbb{R}}\times{\mathbb{R}})\times({{{\mathbb{R}}^N}}\times{{{\mathbb{R}}^N}})\to{\mathbb{R}}$ is a regular jump kernel if it satisfies conditions \[a1:positive\], \[a2:symmetry\] and \[a3:monotonicity\] in Definition \[def:jump-kernel\] and in addition:
(B1)\[b1:nonsing\]
: it is integrable on the diagonal $y=x$, namely, for each $R>0$ there exists $M_R>0$ such that $$\hspace*{\leftmargin}
\sup_{\|u\|_\infty\leq R}\sup_{x\in{{{\mathbb{R}}^N}}} \int_{{{\mathbb{R}}^N}}{\rho}_{u,x,y}\,dy = M_R<\infty;$$
(B2)\[b2:Lip:reg\]
: it is locally Lipschitz-continuous with respect to $u$, that is, for each $R>0$ there exists $L_R>0$ such that $$\hspace*{\leftmargin}
\sup_{x\in{{{\mathbb{R}}^N}}} \int_{{{\mathbb{R}}^N}}|{\rho}_{u,x,y}-{\rho}_{v,x,y}|\,dy
\leq L_R \|u-v\|_{[1,\infty]}$$ for all $\|u\|_\infty\leq R$ and $\|v\|_\infty\leq R$.
First we prove a counterpart of Lemma \[lemma:bv\] for regular jump kernels. It turns out that in this case for every $v\in{L^{[1,\infty]}({{{\mathbb{R}}^N}})}$ the linear operator ${\mathcal{L}}_v$ is bounded on ${L^{[1,\infty]}({{{\mathbb{R}}^N}})}$.
\[lemma:bounded\] If ${\rho}$ is a regular jump kernel then for every $u,v\in{L^{[1,\infty]}({{{\mathbb{R}}^N}})}$ we have ${\mathcal{L}}_vu\in{L^{[1,\infty]}({{{\mathbb{R}}^N}})}$.
Let $R$ be such that $\|v\|_\infty\leq R$. It follows from condition \[b1:nonsing\] that $$\|{\mathcal{L}}_vu\|_\infty \leq 2 \|u\|_\infty M_R.$$ Renaming the variables, using the symmetry condition \[a2:symmetry\] (cf. Remark \[rem:sym\]) and property \[b1:nonsing\] we obtain $$\iint_{{{{\mathbb{R}}^{2N}}}} \big|u(y)\big| {\rho}_{v,x,y}\,dy\,dx = \iint_{{{{\mathbb{R}}^{2N}}}} \big|u(x)\big| {\rho}_{v,x,y}\,dy\,dx
\leq \|u\|_1 M_R$$ and therefore $$\|{\mathcal{L}}_vu\|_1 \leq \iint_{{{{\mathbb{R}}^{2N}}}} \big(\big|u(x)\big|+\big|u(y)\big|\big){\rho}_{v,x,y}\,dy\,dx\leq 2 \|u\|_1 M_R,$$ which completes the proof that ${\mathcal{L}}_v:{L^{[1,\infty]}({{{\mathbb{R}}^N}})}\to{L^{[1,\infty]}({{{\mathbb{R}}^N}})}$.
\[lemma:regular-lipschitz\] If ${\rho}$ is a regular jump kernel then the operator $F(u)=-{\mathcal{L}}_uu$ is locally Lipschitz as a mapping $F: {L^{[1,\infty]}({{{\mathbb{R}}^N}})} \to {L^{[1,\infty]}({{{\mathbb{R}}^N}})}$.
Let $u,v\in {L^{[1,\infty]}({{{\mathbb{R}}^N}})}$ be such that $\|u\|_\infty\leq R$ and $\|v\|_\infty\leq R$. Note the identity $${\mathcal{L}}_uu-{\mathcal{L}}_vv= {\mathcal{L}}_u(u-v)+({\mathcal{L}}_u-{\mathcal{L}}_v)v.$$ We have, using the integrability condition \[b1:nonsing\], $$\begin{gathered}
\|{\mathcal{L}}_u(u-v)\|_\infty
= \sup_{x\in{{{\mathbb{R}}^N}}}\bigg|\int_{{{\mathbb{R}}^N}}\big(u(x)-u(y)-v(x)+v(y)\big){\rho}_{u,x,y}\,dy\,\bigg|\\
\leq 2\|u-v\|_\infty\sup_{x\in{{{\mathbb{R}}^N}}}\int_{{{\mathbb{R}}^N}}{\rho}_{u,x,y}\,dy \leq 2M_R\|u-v\|_\infty
\end{gathered}$$ and by the local Lipschitz-continuity of the jump kernel \[b2:Lip:reg\] we obtain $$\begin{gathered}
\|{\mathcal{L}}_uv-{\mathcal{L}}_vv\|_\infty =
\sup_{x\in{{{\mathbb{R}}^N}}}\bigg|\int_{{{\mathbb{R}}^N}}\big[v(x)-v(y)\big]\big({\rho}_{u,x,y}-{\rho}_{v,x,y}\big)\,dy\,\bigg|\\
\leq 2\|v\|_\infty\sup_{x\in{{{\mathbb{R}}^N}}}\int_{{{\mathbb{R}}^N}}|{\rho}_{u,x,y}-{\rho}_{v,x,y}|\,dy
\leq 2L_R\|v\|_\infty\|u-v\|_{[1,\infty]}.
\end{gathered}$$ By a similar calculation and the symmetrization argument (see Remark \[rem:sym\]) we also get $$\begin{aligned}
\|{\mathcal{L}}_u(u-v)\|_1
&= \int_{{{\mathbb{R}}^N}}\bigg|\int_{{{\mathbb{R}}^N}}\big[u(x)-u(y)-v(x)+v(y)\big]{\rho}_{u,x,y}\,dy\,\bigg|\,dx\\
&\leq \iint_{{{{\mathbb{R}}^{2N}}}} \big(\big|u(x)-v(x)\big|+\big|v(y)-u(y)\big|\big){\rho}_{u,x,y}\,dy\,dx\\
&= 2\int_{{{\mathbb{R}}^N}}\big|u(x)-v(x)\big|\int_{{{\mathbb{R}}^N}}{\rho}_{u,x,y}\,dy\,dx
\leq 2M_R\|u-v\|_1\
\end{aligned}$$ and $$\begin{aligned}
\|{\mathcal{L}}_uv&-{\mathcal{L}}_vv\|_1
= \int_{{{\mathbb{R}}^N}}\bigg|\int_{{{\mathbb{R}}^N}}\big[v(x)-v(y)\big]({\rho}_{u,x,y}-{\rho}_{v,x,y})\,dy\,\bigg|\,dx\\
&\leq \iint_{{{{\mathbb{R}}^{2N}}}} \big(\big|v(x)\big|+\big|v(y)\big|\big)|{\rho}_{u,x,y}-{\rho}_{v,x,y}|\,dy\,dx\\
&= 2\int_{{{\mathbb{R}}^N}}\big|v(x)\big|\int_{{{\mathbb{R}}^N}}|{\rho}_{u,x,y}-{\rho}_{v,x,y}|\,dy\,dx
\leq 2L_R\|v\|_1\|u-v\|_{[1,\infty]},
\end{aligned}$$ which completes the proof of Lemma \[lemma:regular-lipschitz\].
Now we may construct local-in-time solutions via the Banach fixed point argument.
\[lemma:loc-clas\] If ${\rho}$ is a regular jump kernel then for every $u_0\in{L^{[1,\infty]}({{{\mathbb{R}}^N}})}$ there exist $T>0$ and a unique local classical solution $u\in C^1\big([0,T],{L^{[1,\infty]}({{{\mathbb{R}}^N}})}\big)$ to problem on $[0,T]$.
Notice that if $v\in C^1\big([0,T],{L^{[1,\infty]}({{{\mathbb{R}}^N}})}\big)$ then the expression ${\partial_t}v +{\mathcal{L}}_vv$ is well-defined for every regular jump kernel ${\rho}$ (see Lemma \[lemma:bounded\]). Consider the mapping $F(v)=-{\mathcal{L}}_vv$ and an integral operator $$\mathfrak{F}v(t)=u_0+\int_0^t F\big(v(s)\big)\;ds$$ in the Banach space $C\big([0,T], {L^{[1,\infty]}({{{\mathbb{R}}^N}})}\big)$. We know from Lemma \[lemma:regular-lipschitz\] that the operator $F$ is locally Lipschitz. Therefore it suffices to apply the Banach contraction principle on a certain interval $[0,T]$ in order to obtain the unique fixed point $u$ of the operator $\mathfrak{F}$. Moreover, $$\mathfrak{F}:C\big([0,T], {L^{[1,\infty]}({{{\mathbb{R}}^N}})}\big)\to C^1\big([0,T], {L^{[1,\infty]}({{{\mathbb{R}}^N}})}\big),$$ hence the equation ${\partial_t}u = F(u)= -{\mathcal{L}}_uu$ is satisfied in the usual classical sense.
\[lemma:Lp\] If $u$ is a local classical solution to problem on $[0,T]$ then for every $t\in[0,T]$ and every $p\in[1,\infty]$ we have $$\label{Lp:ns}
\|u(t)\|_p\leq \|u_0\|_p.$$
Let us fix $p\in(1,\infty)$. We multiply the equation ${\partial_t}u = -{\mathcal{L}}_uu$ by $|u|^{p-2}u$ and integrate with respect to $x$ to obtain $$\int_{{{\mathbb{R}}^N}}\big({\partial_t}u(x)\big)\big(\big|u(x)\big|^{p-2}u(x)\big)\,dx
= \iint_{{{{\mathbb{R}}^{2N}}}}\big[u(y)-u(x)\big]\big|u(x)\big|^{p-2}u(x)\,d{\rho}_u.$$ Using the fact that $u\in C^1\big([0,T],{L^{[1,\infty]}({{{\mathbb{R}}^N}})}\big)$ we get $${\partial_t}\int_{{{\mathbb{R}}^N}}\big|u(x)\big|^p\,dx = p\int_{{{\mathbb{R}}^N}}\big({\partial_t}u(x)\big)\big(\big|u(x)\big|^{p-2}u(x)\big)\,dx$$ and thanks to the symmetrization argument (see Remark \[rem:sym\]) it follows that $$\begin{gathered}
\iint_{{{{\mathbb{R}}^{2N}}}}\big[u(y)-u(x)\big]\big|u(x)\big|^{p-2}u(x)\,d{\rho}_u
\\= \frac{1}{2}\iint_{{{{\mathbb{R}}^{2N}}}} \big[u(y)-u(x)\big]\big(\big|u(x)\big|^{p-2}u(x)
-\big|u(y)\big|^{p-2}u(y)\big)\,d{\rho}_u\leq 0.
\end{gathered}$$ The last inequality holds because the mapping $a\mapsto |a|^{p-2}a$ is non-decreasing on $\mathbb{R}$ and the measure $d{\rho}_u$ is non-negative due to condition \[a1:positive\]. We thus have proved inequalities for all $p\in (1,\infty)$. The limit cases in are obtained by passing to the limits $p\to 1$ and $p\to\infty$.
Now we are ready to prove existence of solutions in the case of regular jump kernels.
\[thm:classical\] If ${\rho}$ is a regular jump kernel then the classical solution is global.
Consider the local classical solution ${\partial_t}u = -{\mathcal{L}}_uu$ on an interval $[0,T]$, as constructed in Lemma \[lemma:loc-clas\]. It follows from Lemma \[lemma:Lp\] that $$\|u(t)\|_{[1,\infty]}\leq\|u_0\|_{[1,\infty]}$$ thus the local classical solution may be extended to all $t\in [0,\infty)$ by a usual continuation argument.
We now examine some of the properties of classical solutions, which will be useful in the next section. Notice that these results cannot be directly applied in the general case, where we need a weaker notion of solutions. In the following lemma we discuss the $L^1$-contraction property. In the proof we use the Kato-type inequality from Theorem \[thm:kato\].
\[lemma:contraction\] If $u,v$ are classical solutions to problem with initial conditions $u_0$ and $v_0$, respectively then $$\|u(t)-v(t)\|_1 \leq \|u_0-v_0\|_1$$ for every $t\geq 0$.
We have $u,v\in C^1\big([0,\infty),{L^{[1,\infty]}({{{\mathbb{R}}^N}})}\big)$, therefore the following integral $$\int_0^\infty\int_{{{\mathbb{R}}^N}}\Big({\partial_t}\big(u(t,x)-v(t,x)\big) +\big({\mathcal{L}}_uu-{\mathcal{L}}_vv\big)(t,x)\Big)\psi(t,x)\,dx\,dt = 0$$ is convergent for $$\psi(t,x) = \mathbbm{1}_{[0,T]}(t)\operatorname{sgn}\big((u(t,x)-v(t,x)\big),$$ where we arbitrarily fix $T>0$. Thus by the assumed regularity of $u$ and $v$ we get $$\int_0^T{\partial_t}\int_{{{\mathbb{R}}^N}}|u-v|\,dx\,dt
= -\int_0^T\int_{{{\mathbb{R}}^N}}\Big({\mathcal{L}}_uu-{\mathcal{L}}_vv\Big)\operatorname{sgn}(u-v)\,dx\,dt.$$ It follows from Theorem \[thm:kato\] that $$\int_0^T{\partial_t}\|u-v\|_1\,dt \leq 0$$ and consequently $\|u(T)-v(T)\|_1 \leq \|u_0-v_0\|_1$.
In the next lemma we estimate the $BV$-norm of a solution in case of an additional assumption of homogeneity (as in condition \[a4:homogeneity\] in Definition \[def:jump-kernel\]). This estimate will help us to establish relative compactness of an approximating sequence of solutions we construct in Lemma \[lemma:approx\] by regularizing the jump kernel.
\[lemma:bvestimate\] Let ${\rho}$ be a regular jump kernel satisfying the homogeneity condition \[a4:homogeneity\] i.e. $${\rho}\big(v(x),v(y);x,y\big) = {\rho}\big(v(x),v(y);|x-y|\big).$$ If $u_0\in BV({{{\mathbb{R}}^N}})$ and $u$ is the classical solution to problem then $$\|u(t)\|_{BV} \leq \|u_0\|_{BV}\quad\text{for every $t\geq0$}.$$
Let $v_\xi(x)=v(x+\xi)$ for an arbitrary $\xi\in{{{\mathbb{R}}^N}}$ and $v\in L^\infty({{{\mathbb{R}}^N}})$. Because ${\rho}$ is homogeneous we have ${\rho}_{v,x+\xi,y+\xi}={\rho}_{v_\xi,x,y}$ and consequently, for an arbitrary $\psi\in C_c^\infty({{{\mathbb{R}}^N}})$, $$\begin{gathered}
\label{eq:shift}
\big({\mathcal{L}}_v\psi\big)(x+\xi)=\int_{{{\mathbb{R}}^N}}\big(\psi(x+\xi)-\psi(y)\big){{\rho}^{{\varepsilon}}}_{v,x+\xi,y}\,dy \\=
\int_{{{\mathbb{R}}^N}}\big(\psi_\xi(x)-\psi_\xi(y)\big){{\rho}^{{\varepsilon}}}_{v_\xi,x,y}\,dy =
\big({\mathcal{L}}_{v_\xi}\psi_\xi\big)(x).
\end{gathered}$$ It follows from identity , and assumed regularity of $u$, that $u_\xi$ is the classical solution to problem with initial condition $u_{0,\xi}(x) = u_0(x+\xi)$. By Lemma \[lemma:contraction\] we thus have $$\|u_\xi(t)-u(t)\|_1 \leq \|u_{0,\xi}-u_0\|_1$$ and by [@MR3726909 Lemma 13.33] $$\|u_{\xi,0}-u_0\|_1 = \int_{{{\mathbb{R}}^N}}\big|u_0(x+\xi)-u_0(x)\big|\,dx \leq |\xi|\|u_0\|_{BV}.$$ By taking $\xi=he_i$ with $\{e_i\}$ being the canonical basis of ${{{\mathbb{R}}^N}}$ and $h>0$ we get $$\int_{{{\mathbb{R}}^N}}\frac{\big|u(x)-u(x+he_i)\big|}{h}\,dx \leq \|u_0\|_{BV}$$ and it follows by Lemma \[lemma:bv-char\] that $\|u(t)\|_{BV} \leq \|u_0\|_{BV}$.
[Construction of solutions]{}\[sec:existence\]
Definitions of solutions {#definitions-of-solutions .unnumbered}
------------------------
Our goal is to construct solutions in the case of general homogeneous jump kernels and prove the results stated in Theorem \[thm:main\]. As usual in such contexts we work with a weak formulation of problem .
\[def:distributional\] We say $u\in L^\infty\big([0,\infty)\times{{{\mathbb{R}}^N}}\big)$ is a very weak solution to problem if $$\label{pns:weak}
\int_0^\infty\int_{{{\mathbb{R}}^N}}u(t,x)\big[\big({\partial_t}-{\mathcal{L}}_u\big)\psi\big](t,x)\,dx\,dt = 0$$ for every $\psi\in C^\infty_c\big((0,\infty)\times {{{\mathbb{R}}^N}}\big)$ and $\lim_{t\to0}u(t,x) = u_0(x)$ in $L^1_{\operatorname{loc}}({{{\mathbb{R}}^N}})$.
Notice that thanks to Lemma \[lemma:bv\] this definition is well-posed.
\[def:bvsolution\] We say a very weak solution to problem $u$ is a strong solution to problem if $$u\in L^\infty\big([0,\infty),BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})\big)\cap C\big([0,\infty),L^1_{\operatorname{loc}}({{{\mathbb{R}}^N}})\big).$$
\[rem:classical-bv\] Notice that because of Lemmas \[lemma:bv\] and \[lemma:sym\], if $u$ is a strong solution to problem then ${\mathcal{L}}_uu$ is well-defined and we have $$\int_0^\infty\int_{{{\mathbb{R}}^N}}u(t,x){\partial_t}\psi(t,x)-\big({\mathcal{L}}_uu\big)(t,x)\psi(t,x)\,dx\,dt = 0.$$
\[rem:constant\] Notice that each constant function $u(t,x)\equiv k\in{\mathbb{R}}$ is a classical solution to problem for every jump kernel ${\rho}$ and we have ${\mathcal{L}}_uu \equiv 0$.
Approximate solutions {#approximate-solutions .unnumbered}
---------------------
In this part we regularize an arbitrary homogeneous jump kernel and study compactness of the corresponding sequence of approximations. In order to simplify our reasoning we begin with the following observation.
\[rem:lip-sym\] Consider a homogeneous jump kernel ${\rho}$. For arbitrary $a,b,c,d\in {\mathbb{R}}$ by the symmetry assumption \[a2:symmetry\] we have $$\begin{gathered}
\big| {\rho}(a,b;x,y)-{\rho}(c,d;x,y)\big| \\
\leq \big| {\rho}(a,b;x,y)-{\rho}(c,b;x,y)\big| + \big| {\rho}(b,c;x,y)-{\rho}(d,c;x,y)\big|.
\end{gathered}$$ Therefore it is sufficient (and necessary) to verify the Lipschitz-continuity part of condition \[a6:lipschitz\] only for the difference $$\big| {\rho}(a,b;x,y)-{\rho}(c,b;x,y)\big|$$ and $a,b,c\in[-R, R]$ such that $|a-b|\geq{\varepsilon}$ and $|c-b|\geq{\varepsilon}$.
\[lemma:approx\] For every ${\varepsilon}\in(0,1]$ consider a function $h_{\varepsilon}\in C^\infty\big([0,\infty)\big)$ which is non-decreasing and such that $h_{\varepsilon}(x) = 0$ for $x \leq \frac{{\varepsilon}}{2}$ and $h_{\varepsilon}(x) =1$ for $x\geq {\varepsilon}$. Let ${\rho}$ be a homogeneous jump kernel and $${{{\rho}^{{\varepsilon}}}(a,b;x,y)}
= h_{\varepsilon}\big(|a-b|\big)\mathbbm{1}_{|x-y|\geq {\varepsilon}}(x,y){{\rho}(a,b;x,y)}$$ Then ${{\rho}^{{\varepsilon}}}$ are regular, homogeneous jump kernels.
Conditions \[a1:positive\] to \[a6:lipschitz\] in Definition \[def:jump-kernel\] are easy to verify. Let us check conditions \[b1:nonsing\] and \[b2:Lip:reg\] of Definition \[def:regular\] for fixed functions $u,v\in L^\infty({{{\mathbb{R}}^N}})$ such that $\|u\|_\infty,\|v\|_\infty\leq R$. Because ${\rho}$ is a homogeneous jump kernel, we have $$\begin{gathered}
\sup_{x\in{{{\mathbb{R}}^N}}}\int_{{{\mathbb{R}}^N}}{{{\rho}^{{\varepsilon}}}(a,b;x,y)}\,dy \leq \int_{{{\mathbb{R}}^N}}\mathbbm{1}_{|y|>{\varepsilon}}(y)m_R\big(|y|\big)\\
\leq {\varepsilon}^{-1}\int_{{{\mathbb{R}}^N}}\big(1\wedge|y|\big) m_{R}\big(|y|\big)\,dy
= {\varepsilon}^{-1}K_{R},
\end{gathered}$$ where $m_R$ and $K_R$ come from condition \[a5:1levy\] satisfied by the jump kernel ${\rho}$. This verifies condition \[b1:nonsing\].
Notice that because of the properties of the function $h_{\varepsilon}$ and condition \[a6:lipschitz\], the jump kernel ${\rho}_{\varepsilon}$ is locally Lipschitz-continuous in the first two variables, including the diagonal. Namely, $$\big|{{{\rho}^{{\varepsilon}}}(a,b;x,y)}-{{{\rho}^{{\varepsilon}}}(c,b;x,y)}\big|\leq C_{R}|a-c|\mathbbm{1}_{|x-y|>{\varepsilon}}(x,y)m_R\big(|x-y|\big)$$ for all $-R\leq a,b,c\leq R$, where $C_R=C_{R,\frac{{\varepsilon}}{2}}$ is the constant from condition \[a6:lipschitz\] satisfied by the jump kernel ${\rho}$ (cf. Remark \[rem:lip-sym\]). Therefore $$\begin{aligned}
&\sup_{x\in{{{\mathbb{R}}^N}}} \int_{{{\mathbb{R}}^N}}|{{\rho}^{{\varepsilon}}}_{u,x,y}-{{\rho}^{{\varepsilon}}}_{v,x,y}|\,dy\\
&\leq\sup_{x\in{{{\mathbb{R}}^N}}} \int_{{{\mathbb{R}}^N}}\big|{{\rho}^{{\varepsilon}}}_{u,x,y}-{{\rho}^{{\varepsilon}}}\big(u(x),v(y),x,y\big)\big|
+ \big|{{\rho}^{{\varepsilon}}}\big(u(x),v(y),x,y\big)-{{\rho}^{{\varepsilon}}}_{v,x,y}\big|\,dy\\
&\leq C_R \sup_{x\in{{{\mathbb{R}}^N}}} \int_{{{\mathbb{R}}^N}}\Big(\big|u(y)-v(y)\big| + \big|u(x)-v(x)\big|\Big)\mathbbm{1}_{|x-y|>{\varepsilon}}m_R\big(|x-y|\big)\,dy\\
&\leq L_R \|u-v\|_{[1,\infty]},
\end{aligned}$$ which confirms condition \[b2:Lip:reg\].
\[thm:existence\] If ${\rho}$ is a homogeneous jump kernel then there exists a strong solution to problem for every initial condition $u_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$.
For every ${\varepsilon}\in (0,1]$ consider the unique classical solution $u^{\varepsilon}$ of the following initial value problem $$\label{eq:approx}
\left\{
\begin{aligned}
&\partial_t u^{\varepsilon}+ {\mathcal{L}}^{\varepsilon}_{u^{\varepsilon}}u^{\varepsilon}= 0,\\
& {\mathcal{L}}^{\varepsilon}_vu = \int_{{{\mathbb{R}}^N}}\big[u(x)-u(y)\big]{{\rho}^{{\varepsilon}}}\big(v(x),v(y);x,y\big)\,dy,\\
&u^{\varepsilon}(0,\,\cdot\,)=u_0,
\end{aligned}
\right.$$ where the regular, homogeneous jump kernels ${{\rho}^{{\varepsilon}}}$ are introduced in Lemma \[lemma:approx\]. It follows from Lemmas \[lemma:bvestimate\] and \[lemma:bv\] that ${\mathcal{L}}^{\varepsilon}_{u^{\varepsilon}(t)}u^{\varepsilon}(t)\in L^1({{{\mathbb{R}}^N}})$ is well-defined for every $t\geq 0$. Moreover, we get an estimate on the time derivative $$\big\|{\partial_t}u^{\varepsilon}(t)\big\|_1 = \big\|{\mathcal{L}}^{{\varepsilon}}_{u^{{\varepsilon}}(t)}u^{{\varepsilon}}(t)\big\|_1 \leq \big\|u^{{\varepsilon}}(t)\big\|_{BV}K_R \leq \|u_0\|_{BV}K_R.$$ For an arbitrary bounded open set $\Omega\subset{{{\mathbb{R}}^N}}$ with a sufficiently regular boundary we have the compact embedding $BV(\Omega)\subset L^1(\Omega)$ (see [@MR3726909 Theorem 13.35]). Thus we obtain a convergent subsequence in the usual way, by applying the Aubin-Lions-Simon lemma (see [@MR916688 Theorem 1]) in the space $L^\infty\big([0,T],L^1(\Omega)\big)$ for an arbitrarily fixed $T>0$. Namely, it follows that there exists a function $u$ and a subsequence $\{{\varepsilon}_j\}$ such that $$u^{{\varepsilon}_j}\to u\quad\text{in}\quad C\big([0,T],L^1_{\operatorname{loc}}({{{\mathbb{R}}^N}})\big).$$ In particular we also have $\lim_{j\to\infty}u^{{\varepsilon}_j}(t,x)= u(t,x)$ almost everywhere. We may enhance this result by applying the Fatou lemma to inequalities $$\label{p:est}
\|u^{{\varepsilon}}(t)\|_p \leq \|u_0\|_p,$$ which we proved in Lemma \[lemma:Lp\], to obtain the same estimates for $\|u\|_p$. By using [@MR3726909 Theorem 13.35] and Lemma \[lemma:bv-char\] we also get $$\label{BV:est}
\|u(t)\|_{BV} \leq \|u_0\|_{BV}.$$ In this way we obtain that $$\label{eq:estimates}
u\in L^\infty\big([0,\infty),BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})\big)\cap C\big([0,\infty),L^1_{\operatorname{loc}}({{{\mathbb{R}}^N}})\big).$$ Consider the sequence of approximations $u^j = u^{{\varepsilon}_j}$. Let $$f_j(t,x,y) = \big[u^{j}(t,x)-u^{j}(t,x-y)\big]{\rho}^{{\varepsilon}_j}\big(u^j(x),u^j(x-y),|y|\big)\psi(t,x),$$ with an arbitrary test function $\psi\in C^\infty_c\big((0,\infty)\times {{{\mathbb{R}}^N}}\big)$. Let $f$ be defined analogously for the function $u$ in place of $u^j$ and the jump kernel ${\rho}$ instead of ${\rho}^{{\varepsilon}_j}$. We have (see Remark \[rem:classical-bv\]) $$\label{eq:distributional-classical}
\int_0^\infty\int_{{{\mathbb{R}}^N}}u^j\,{\partial_t}\psi\,dx\,dt
=\int_0^\infty\iint_{{{\mathbb{R}}^{2N}}}f_j(t,x,y)\,dx\,dy\,dt$$ for every $j\in\mathbb{N}$.
On the left-hand side of equalities we have the majorant $$\big|u^j(t,x){\partial_t}\psi(t,x)\big| \leq \|u_0\|_\infty\big|{\partial_t}\psi(t,x)\big|$$ hence we may pass to the limit by the Lebesgue dominated convergence theorem. On the right-hand side of equalities , by the integrability condition \[a5:1levy\] satisfied by the jump kernel ${\rho}$, we obtain the following estimate $$\label{eq:majorant1}
\big|f_j(t,x,y)\big|
\leq 2R\, m_R\big(|y|\big)\, |\psi(t,x)|.$$ Because of the continuity of the jump kernel assumed in condition \[a6:lipschitz\] we also have $$\lim_{j\to\infty} f_j(t,x,y)= f(t,x,y)\quad\text{a.e.~in $(t,x,y)$}$$ and therefore we may pass to the limit by the Lebesgue dominated convergence theorem and get $$\lim_{j\to\infty}\int_{{{\mathbb{R}}^N}}f_j(t,x,y)\,dx = \int_{{{\mathbb{R}}^N}}f(t,x,y)\,dx,\quad \text{a.e.~in $(t,y)$}.$$ Then, by Lemmas \[lemma:bvnorm\] and \[lemma:bvestimate\], we have $$\label{eq:majorant2}
\begin{split}
\bigg|&\int_{{{\mathbb{R}}^N}}f_j(t,x,y)\,dx\,\bigg|\\
&\leq\sup_{x\in{{{\mathbb{R}}^N}}}|\psi(t,x)|\big(1\wedge|y|\big)m_R\big(|y|\big) \sup_{y\in{{{\mathbb{R}}^N}}\setminus\{0\}}\int_{{{\mathbb{R}}^N}}\frac{\big|u^{j}(t,x)-u^{j}(t,x-y)\big|}{1\wedge|y|}\,dx
\\
&\leq \sup_{x\in{{{\mathbb{R}}^N}}}|\psi(t,x)|\big(1\wedge|y|\big)m_R\big(|y|\big)\|u_0\|_{BV}.
\end{split}$$ By the Lebesgue dominated convergence theorem we may thus pass to the limit once more. Combining both arguments in and , we get $$\lim_{j\to\infty}\iint_{{{\mathbb{R}}^{2N}}}f_j(t,x,y)\,dx\,dy
= \iint_{{{\mathbb{R}}^{2N}}}f(t,x,y)\,dx\,dy\quad \text{a.e.~in $t$}.$$ We also have $$\bigg|\iint_{{{\mathbb{R}}^{2N}}}f_j(t,x,y)\,dx\,\bigg| \leq \mathbbm{1}_{\operatorname{supp}\psi}(t)\|\psi\|_\infty \|u_0\|_{BV}K_R,$$ which allows us to pass to the limit with the integral in time. In this way we have shown that $u$ satisfies the following integral equality $$\int_0^\infty\int_{{{\mathbb{R}}^N}}u\,{\partial_t}\psi\,dx\,dt
=\int_0^\infty\iint_{{{\mathbb{R}}^{2N}}}\big[u(t,x)-u(t,y)\big]{\rho}_{u,x,y}\psi(t,x)\,dx\,dy\,dt$$ for each test function $\psi$. To finish the proof we apply the Fubini-Tonelli theorem to exchange $dx$ and $dy$, which together with confirms Definition \[def:distributional\].
\[thm:regularity\] If $u$ is a strong solution to problem then $$u\in W^{1,1}_{\operatorname{loc}}\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big).$$
Consider a sequence $\{\phi_n\}\in C_c^\infty\big((0,\infty)\times{{{\mathbb{R}}^N}}\big)$ such that $$\begin{aligned}
&\lim_{n\to\infty}\phi_n(t,x) = \mathbbm{1}_{[t_1,t_2]}(t)\phi(x) &&\text{pointwise},\\
&\lim_{n\to\infty}{\partial_t}\phi_n(t,x) = \big(\delta_{t_1}(t)-\delta_{t_2}(t)\big)\phi(x) &&\text{weakly as measures}
\end{aligned}$$ for given $t_2> t_1>0$ and a function $\phi\in C_c({{{\mathbb{R}}^N}})$. Because $u\in C\big([0,\infty),L^1_{\operatorname{loc}}({{{\mathbb{R}}^N}})\big)$, the function $t\mapsto \int_{{{\mathbb{R}}^N}}u(t,x)\phi(x)\,dx$ is continuous. Then, due to the very weak formulation and the fact that $u\in BV({{{\mathbb{R}}^N}})$, we have $$\begin{gathered}
\label{eq:l1-test}
0 = \lim_{n\to\infty}\int_0^\infty\int_{{{\mathbb{R}}^N}}u(t,x){\partial_t}\phi_n(t,x)-\big({\mathcal{L}}_uu\big)(t,x)\phi_n(t,x)\,dx\,dt\\
= \int_{{{\mathbb{R}}^N}}\big(u(t_1,x)-u(t_2,x)\big)\phi(x)\,dx - \int_{t_1}^{t_2}\int_{{{\mathbb{R}}^N}}\big({\mathcal{L}}_uu\big)(t,x)\phi(x)\,dx\,dt.
\end{gathered}$$ The assumed continuity also allows us to approach the case $t_1 = 0$.
Because $u\in L^\infty\big([0,\infty),BV({{{\mathbb{R}}^N}})\big)$, for every $t\geq 0$ we have $u(t)\in L^1({{{\mathbb{R}}^N}})$ and ${\mathcal{L}}_{u(t)}u(t)\in L^1({{{\mathbb{R}}^N}})$. Since equality holds for every function $\phi\in C_c({{{\mathbb{R}}^N}})$, it follows that $$u(t_2,x) = u(t_1,x) + \int_{t_1}^{t_2}-\big({\mathcal{L}}_uu\big)(t,x)\,dt\quad\text{a.e. in $x$}.$$ By [@MR1691574 Theorem 1.4.35] we obtain $u\in W^{1,1}_{\operatorname{loc}}\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$.
\[rem:ac\] As stated in [@MR1691574 Theorem 1.4.35], if $u\in W^{1,1}_{\operatorname{loc}}\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$ then in particular $u:[0,\infty)\to L^1({{{\mathbb{R}}^N}})$ is absolutely continuous.
The next theorem provides the proof of the $L^1$-contraction of strong solutions, which then directly implies uniqueness.
\[thm:contraction\] If $u$ and $v$ are strong solutions to problem , corresponding to initial conditions $u_0,v_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ respectively, then $$\|u(t)-v(t)\|_1\leq \|u_0-v_0\|_1 \qquad \text{for every} \quad t>0.$$
Consider a sequence of test functions $\{\psi_n\}\subset C_c^\infty\big([0,\infty)\times{{{\mathbb{R}}^N}}\big)$ such that $\lim_{n\to\infty}\psi_n(t,x) = \mathbbm{1}_{[t_1,t_2]}(t)\operatorname{sgn}\big(u(t,x)-v(t,x)\big)$ for almost every $t > 0$ and $x\in{{{\mathbb{R}}^N}}$ and some $t_2>t_1>0$. Then for every $t\in[t_1,t_2]$ we have $$\begin{gathered}
\lim_{n\to\infty}-\int_{{{\mathbb{R}}^N}}\big (u(t,x)-v(t,x)\big){\partial_t}\psi_n(t,x)\,dx \\
= \lim_{n\to\infty}\int_{{{\mathbb{R}}^N}}{\partial_t}\big(u(t,x)-v(t,x)\big) \psi_n(t,x)\,dx = \int_{{{\mathbb{R}}^N}}{\partial_t}\big|u(t,x)-v(t,x)\big|\,dx
\end{gathered}$$ and $$\begin{gathered}
\lim_{n\to\infty}\int_{{{\mathbb{R}}^N}}\Big(\big({\mathcal{L}}_uu\big)(t,x)-\big({\mathcal{L}}_vv\big)(t,x)\Big)\psi_n(t,x)\,dx\,dt.\\
\int_{{{\mathbb{R}}^N}}\Big(\big({\mathcal{L}}_uu\big)(t,x)-\big({\mathcal{L}}_vv\big)(t,x)\Big)\operatorname{sgn}\big(u(t,x)-v(t,x)\big)\,dx\,dt.
\end{gathered}$$ Then $$\begin{gathered}
\int_{t_1}^{t_2}\int_{{{\mathbb{R}}^N}}{\partial_t}\big|u(t,x)-v(t,x)\big|\,dx =
\int_{t_1}^{t_2}{\partial_t}\int_{{{\mathbb{R}}^N}}\big|u(t,x)-v(t,x)\big|\,dx\,dt \\=
\big\|u(t_2,x)-v(t_2,x)\big\|_1-\big\|u(t_1,x)-v(t_1,x)\big\|_1.
\end{gathered}$$ Moreover, thanks to Theorem \[thm:regularity\] and Remark \[rem:ac\], we may also approach the case $t_1 = 0$. Finally we obtain $$\begin{gathered}
\big\|u(t_1,x)-v(t_1,x)\big\|_1-\big\|u(t_2,x)-v(t_2,x)\big\|_1
\\=
\int_{t_1}^{t_2}\int_{{{\mathbb{R}}^N}}\Big(\big({\mathcal{L}}_uu\big)(t,x)-\big({\mathcal{L}}_vv\big)(t,x)\Big)\operatorname{sgn}\big(u(t,x)-v(t,x)\big)\,dx\,dt.
\end{gathered}$$ The right-hand side is positive due to Theorem \[thm:kato\].
Properties of strong solutions {#properties-of-strong-solutions .unnumbered}
------------------------------
We conclude our reasoning by gathering some of the most fundamental properties of strong solutions to problem .
\[cor:uniqueness\] Let ${\rho}$ be a homogeneous jump kernel. For every $u_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ there exists a unique strong solution to problem .
It follows directly from Theorems \[thm:existence\] an \[thm:contraction\].
\[cor:Lp-weak\] If $u$ is a strong solution to problem with initial condition $u_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ then $$\|u(t)\|_p\leq\|u_0\|_p\quad\text{and}\quad \|u(t)\|_{BV}\leq\|u_0\|_{BV} \qquad \text{for all} \quad t>0.$$
We established these estimates in relations and , in the course of proving Theorem \[thm:existence\] for the solution obtained as the limit of a subsequence of approximate solutions. It follows from Corollary \[cor:uniqueness\] that there are no other strong solutions.
\[cor:mass\_conservation\] If $u$ is a strong solution to problem with initial condition $u_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ then $\int_{{{\mathbb{R}}^N}}u(t)\,dx = \int_{{{\mathbb{R}}^N}}u_0\,dx$ for every $t\geq0$.
The technique of this proof is essentially the same as the one used in the proof of Theorem \[thm:regularity\]. Consider a sequence $\{\phi_n\}\in C_c^\infty\big((0,\infty)\times{{{\mathbb{R}}^N}}\big)$ such that $$\begin{aligned}
&\lim_{n\to\infty}\phi_n(t,x) = \mathbbm{1}_{[t_1,t_2]}(t)\mathbbm{1}_K(x) &&\text{pointwise},\\
&\lim_{n\to\infty}{\partial_t}\phi_n(t,x) = \big(\delta_{t_1}(t)-\delta_{t_2}(t)\big)\mathbbm{1}_K(x) &&\text{weakly as measures}
\end{aligned}$$ for given $t_2> t_1>0$. Then, due to the very weak formulation and the fact that $u\in BV({{{\mathbb{R}}^N}})$, we have $$\begin{gathered}
\label{eq:mass}
0 = \lim_{n\to\infty}\int_0^\infty\int_{{{\mathbb{R}}^N}}{\partial_t}\phi_n(t,x)u(t,x)-\big({\mathcal{L}}_uu\big)(t,x)\phi_n(t,x)\,dx\,dt\\
= \int_{{{\mathbb{R}}^N}}\big(u(t_1,x)-u(t_2,x)\big)\,dx - \int_{t_1}^{t_2}\int_{{{\mathbb{R}}^N}}\big({\mathcal{L}}_uu\big)(t,x)\,dx\,dt.
\end{gathered}$$ The assumed continuity also allows us to approach the case $t_1 = 0$.
We may now use the symmetrization argument (see Remark \[rem:sym\]) and get $$\int_{{{\mathbb{R}}^N}}{\mathcal{L}}_uu\,dx = \iint_{{{{\mathbb{R}}^{2N}}}} \big[u(t,y)-u(t,x)\big]{{\rho}\big(u(t,x),u(t,y);x,y\big)}\,dy\,dx = 0.$$ Note that the integrals are convergent because of the same calculation we used in Lemma \[lemma:bv\] and we may use the Fubini-Tonelli theorem needed for the argument to work. In consequence, it follows from that $$\int_{{{\mathbb{R}}^N}}u(t_1,x)\,dx = \int_{{{\mathbb{R}}^N}}u(t_2,x)\,dx.$$ This means that the function $t\mapsto \int_{{{\mathbb{R}}^N}}u(t,x)\,dx$ is constant.
\[cor:comparison\] If $u$ and $v$ are strong solutions to problem with initial conditions $u_0,v_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$, respectively, such that $u_0(x)\leq v_0(x)$ almost everywhere in $x\in{{{\mathbb{R}}^N}}$ then $u(t,x)\leq v(t,x)$ almost everywhere in $(t,x)\in[0,\infty)\times {{{\mathbb{R}}^N}}$.
Using the $L^1$-contraction property established in Theorem \[thm:contraction\] and the conservation of mass from Corollary \[cor:mass\_conservation\] we get $$\begin{gathered}
\int_{{{\mathbb{R}}^N}}\big(u(t)-v(t)\big)^+\,dx = \int_{{{\mathbb{R}}^N}}\frac{\big|u(t)-v(t)\big|+u(t)-v(t)}{2}\,dx
\\
\leq
\int_{{{\mathbb{R}}^N}}\frac{|u_0-v_0|+u_0-v_0}{2}\,dx = \int_{{{\mathbb{R}}^N}}(u_0-v_0)^+\,dx.
\end{gathered}$$ In particular, the equality $(u_0-v_0)^+=0$ a.e. implies $(u-v)^+=0$ a.e., which means exactly that $u\leq v$ a.e. in $[0,\infty)\times{{{\mathbb{R}}^N}}$.
\[cor:positivity\] If $u$ is a strong solution to problem with initial condition $u_0\in BV({{{\mathbb{R}}^N}})\cap L^\infty({{{\mathbb{R}}^N}})$ such that $u_0\geq 0$ then $u\geq 0$.
This follows directly from Corollary \[cor:comparison\] and the fact that $v\equiv0$ is a strong solution to problem (cf. Remark \[rem:constant\]).
Existence of solutions for less regular initial data {#existence-of-solutions-for-less-regular-initial-data .unnumbered}
----------------------------------------------------
The results obtained for strong solutions may be used to show existence of solutions for more general initial conditions, namely in the space ${L^{[1,\infty]}({{{\mathbb{R}}^N}})}$ (see Corollary \[cor:main\]).
\[thm:existence2\] If ${\rho}$ is a homogeneous jump kernel then there exists a very weak solution to problem for every initial condition $u_0\in {L^{[1,\infty]}({{{\mathbb{R}}^N}})}$.
We define $u_0^{\varepsilon}= \omega_{\varepsilon}* u_0$ for a sequence of mollifiers $\{\omega_{\varepsilon}\}$. We then have $u_0^{\varepsilon}\in BV({{{\mathbb{R}}^N}})$, $\|u_0^{\varepsilon}\|_\infty\leq \|u_0\|_\infty$ and $\lim_{{\varepsilon}\to0}\|u_0^{\varepsilon}-u_0\|_1=0$.
For every ${\varepsilon}>0$ we consider the strong solution $u^{\varepsilon}$ corresponding to the initial condition $u_0^{\varepsilon}$. It follows from Theorem \[thm:contraction\] that $$\sup_{t\geq0}\|u^{{\varepsilon}_1}(t)-u^{{\varepsilon}_2}(t)\|_1\leq \|u_0^{{\varepsilon}_1}-u_0^{{\varepsilon}_2}\|_1,$$ which shows that $\{u^{\varepsilon}\}$ is a Cauchy sequence in the space $C_b\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$ and hence has a limit $u\in C_b\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$.
Consider the folowing equations (cf. Definition \[def:distributional\]) $$\begin{gathered}
\label{eq:approx2}
\int_0^\infty\int_{{{\mathbb{R}}^N}}u^{\varepsilon}(t,x){\partial_t}\psi(t,x)\,dx\,dt
= \int_0^\infty\int_{{{\mathbb{R}}^N}}u(t,x) \big({\mathcal{L}}_{u^{\varepsilon}}\psi\big)(t,x)\,dx\,dt \\
= \int_0^\infty\iint_{{{{\mathbb{R}}^{2N}}}} u^{\varepsilon}(t,x)\big[\psi(t,x)-\psi(t,y)\big]{\rho}_{u^{\varepsilon}(t),x,y}\,dy\,dx\,dt = 0.
\end{gathered}$$ Notice that because $u$ is the limit of $\{u^{\varepsilon}\}$ in the space $C_b\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$, it also is its limit in the space $L^1\big([0,T]\times{{{\mathbb{R}}^N}}\big)$ for an arbitrary $T>0$. It follows from [@MR2759829 Theorem 4.9] that there exists a function $v\in L^1\big([0,T]\times{{{\mathbb{R}}^N}}\big)$ and a subsequence ${\varepsilon}_j$ such that $$\begin{aligned}
&\lim_{j\to\infty} u^{{\varepsilon}_j}(t,x) = u(t,x)& &\text{a.e.~in $(t,x)\in[0,T]\times{{{\mathbb{R}}^N}}$,}\\
&|u^{{\varepsilon}_j}(t,x)|\leq v(t,x)& &\text{a.e.~in $(t,x)\in[0,T]\times{{{\mathbb{R}}^N}}$ for every $j\in\mathbb{N}$}.
\end{aligned}$$ We thus have $$\begin{gathered}
\big|u^{\varepsilon}(t,x)\big[\psi(t,x)-\psi(t,x-y)\big]{\rho}_{u^{\varepsilon}(t),x,x-y}\big|\\
\leq 2 v(t,x)\sup_{t\in[0,T]}\|\psi(t)\|_{W^{1,\infty}({{{\mathbb{R}}^N}})}\big(1\wedge|y|\big)m_R\big(|y|\big),
\end{gathered}$$ where $R\geq \|u_0\|_\infty$. This allows us to pass to the limits on both sides of equations on a subsequence $\{{\varepsilon}_j\}$ and verify that $u$ satisfies Definition \[def:distributional\].
\[cor:properties\] Let $u$ be the very weak solution to problem constructed in Theorem \[thm:existence2\]. We have
- $u\in C\big([0,\infty),L^1({{{\mathbb{R}}^N}})\big)$
- $\int_{{{{\mathbb{R}}^N}}} u(t,x)\,dx = \int_{{{{\mathbb{R}}^N}}} u_0(x)\,dx$ for all $t\geq 0$;
- $\|u(t)\|_p\leq \|u_0\|_p$ for all $p\in [1,\infty]$ and $t\geq 0$;
- if $u_0(x)\geq 0$ for almost every $x\in{{{\mathbb{R}}^N}}$ then $u(t,x)\geq 0$ for almost every $x\in{{{\mathbb{R}}^N}}$ and $t>0$.
The first claim follows from the construction itself. Two other are a consequence of the fact that $u$ is the pointwise limit of the sequence of approximations, for which these claims are satisfied.
[Examples]{}\[sec:examples\] In this section we discuss several examples of homogeneous jump kernels, either well-known or new. Before we do so, however, we would like to have a quick look at the geometry of the set of jump kernels.
\[lemma:cone\] Let ${\rho}_1$ and ${\rho}_2$ be homogeneous jump kernels in the sense of Definition \[def:jump-kernel\]. Then ${\rho}=\alpha{\rho}_1+\beta{\rho}_2$ is a homogeneous jump kernel for every $\alpha,\beta\geq0$ (i.e. the set of homogeneous jump kernels is a convex cone).
It is easy to see that ${\rho}$ satisfies conditions \[a1:positive\], \[a2:symmetry\], \[a4:homogeneity\] and \[a6:lipschitz\]. Then, $$\begin{gathered}
(a-b){{\rho}(a,b;x,y)} = \alpha(a-b){\rho}_1(a,b;x,y)+\beta(a-b){\rho}_2(a,b;x,y)\\
\geq \alpha(c-d){\rho}_1(c,d;x,y)+\beta(c-d){\rho}_2(c,d;x,y) = (c-d){{\rho}(c,d;x,y)},
\end{gathered}$$ which confirms \[a3:monotonicity\], and $$\begin{gathered}
\sup_{-R\leq a,b\leq R}{{\rho}(a,b;x,y)}\leq
\alpha \sup_{-R\leq a,b\leq R} {\rho}_1(a,b;x,y) + \beta\sup_{-R\leq a,b\leq R}{\rho}_2(a,b;x,y)\\
\leq \alpha\, m^1_R\big(|x-y|\big)+\beta\, m^2_R\big(|x-y|\big) = m_R\big(|x-y|\big),
\end{gathered}$$ where $m_R^1$ and $m_R^2$ are functions related to ${\rho}_1$ and ${\rho}_2$ as in condition \[a5:1levy\], respectively, and it follows that $$\int_{{{\mathbb{R}}^N}}\big(1\wedge|y|\big)m_R\big(|y|\big)\,dy
\leq \alpha K^1_R + \beta K^2_R,$$ where $K_R^1$ and $K_R^2$ are appropriate constants related to $m_R^1$ and $m_R^2$ as in condition \[a5:1levy\]. This confirms condition \[a5:1levy\] in case of the jump kernel ${\rho}$.
Decoupled jump kernels {#decoupled-jump-kernels .unnumbered}
----------------------
In this subsection we study examples of homogeneous jump kernels given in the following form $$\label{separated}
{{\rho}(a,b;x,y)} = F(a,b)\times \mu\big(|x-y|\big),$$ where $F\geq0$ and $\mu$ is a density of a Lévy measure with low singularity, i.e. $$\int_{{{\mathbb{R}}^N}}\big(1\wedge|y|\big)\mu\big(|y|\big)\,dy\leq \infty.$$ We call such jump kernels *decoupled*. We are going to consider several different choices of $F$ and show that the resulting functions possess properties \[a1:positive\] to \[a6:lipschitz\], confirming they are homogeneous jump kernels. Some of these examples have been well-studied before, but we are able to verify that they fit neatly in our framework. Because of the structure of formula , condition \[a4:homogeneity\] is always satisfied. The same is true for \[a5:1levy\], as long as $\sup_{-R\leq a,b\leq R}F(a,b)<\infty$. In identical fashion as in Lemma \[lemma:cone\], we may see that decoupled jump kernels also form a convex cone on their own.
### Fractional porous medium equation {#fractional-porous-medium-equation .unnumbered}
In our first example we show that the theory we developed may be applied to equation , for restricted ranges of parameters $s$ and $m$, and some of its generalisations.
\[lemma:fpme\] Let $f\in C^1({\mathbb{R}})$ be a non-decreasing function. If $$F(a,b) = \frac{f(a)-f(b)}{a-b}$$ then ${\rho}$ given by formula is a homogeneous jump kernel.
We assume $f\in C^1({\mathbb{R}})$, thus the function $F$ is in fact continuous even for $a=b$. Because the function $f$ is non-decreasing we have $F(a,a) = f'(a) \geq 0$ and $$\operatorname{sgn}\big(f(a)-f(b)\big)= \operatorname{sgn}(a-b)\quad\text{or}\quad f(a)=f(b)\quad \text{for all $a\neq b$},$$ therefore both \[a1:positive\] and \[a2:symmetry\] are satisfied. Because of the assumed monotonicity of $f$, for $a\geq c\geq d\geq b$ we have $f(a)\geq f(c)\geq f(d)\geq f(b)$, hence $$(a-b)\frac{f(a)-f(b)}{a-b} = f(a)-f(b)\geq f(c)-f(d) = (c-d)\frac{f(c)-f(d)}{c-d}$$ and \[a3:monotonicity\] is also fulfilled.
Next, let us take $-R<a,b,c< R$ such that $|c-b|,|a-b|>{\varepsilon}$. Then $$\bigg|\frac{f(a)-f(b)}{a-b}-\frac{f(c)-f(b)}{c-b}\bigg|
\leq \frac{2}{{\varepsilon}^{2}}\Big(\max_{|\xi|<R}|f(\xi)|+R\max_{|\xi|<R}|f'(\xi)|\Big)|a-c|.$$ This proves the local Lipschitz-continuity condition \[a6:lipschitz\] (see Remark \[rem:lip-sym\]).
This example, for $\mu\big(|y|\big) = |y|^{-N-\alpha}$, $\alpha\in(0,1)$ and $f(u)=u|u|^{m-1}$, corresponds to the following operator $${\mathcal{L}}_uu = \Delta^{\alpha/2}\big(u|u|^{m-1}(x)\big),$$ introduced in Section \[sec:introduction\] by formula . It has been thoroughly studied in [@MR2954615] (for the full range $\alpha\in(0,2)$ and $m>0$). Even more general non-linear operators of this type, involving linear operators represented by formula , were considered in [@MR3724879; @MR3570132].
### Convex diffusion operator {#convex-diffusion-operator .unnumbered}
In the next example we introduce a decoupled jump kernel which has not been previously studied.
\[lemma:breslau\] Let $f:{\mathbb{R}}\to[0,\infty)$ be a convex function and $$F(a,b) = f(a)+f(b).$$ Then ${\rho}$ given by formula is a homogeneous jump kernel.
Conditions \[a1:positive\] and \[a2:symmetry\] are easy to verify.
Let $a\geq c\geq d\geq b$ and take $t\in[0,1]$ such that $d=ta+(1-t)b$. Then $$\begin{gathered}
f(a)+f(b) \geq (1-t^2)f(a)+(1-t)^2f(b)\\
=(1-t)\big((1+t)f(a)+(1-t)f(b)\big)
=(1-t)\big(f(a)+tf(a)+(1-t)f(b)\big).
\end{gathered}$$ Because we assume $f$ to be convex, we have $$tf(a)+(1-t)f(b) \geq f\big(ta+(1-t)b\big)= f(d),$$ hence $$f(a)+f(b)\geq (1-t)\big(f(a)+f(d)\big).$$ In the same fashion, by taking $s\in[0,1]$ such that $c=(1-s)a+sd$, we can show that $$f(a)+f(d)\geq (1-s)\big(f(c)+f(d)\big).$$ We also have $(1-t)(a-b) = a-\big(ta+(1-t)b\big) = a-d$ and $(1-s)(a-d) = (c-d)$, therefore $$(a-b)\big(f(a)+f(b)\big) \geq (1-s)(1-t)(a-b)\big(f(c)+f(d)\big)= (c-d)\big(f(c)+f(d)\big).$$ This verifies the property \[a3:monotonicity\]. Since every convex function is locally Lipschitz, condition \[a6:lipschitz\] is satisfied and hence ${\rho}$ is a homogeneous jump kernel.
This example is somewhat similar to the fractional porous medium case. Indeed, consider $g(a) = a|a|^{m}$ for $m=2k$ and $k\in\mathbb{N}$. Then $$g(a)-g(b) = (a-b)\big(|a|^{m}+|a|^{m-1}|b|+\ldots+|a||b|^{m-1}+|b|^{m}\big)$$ and one may be tempted to “abbreviate” the expression on the right-hand side to obtain $$\label{eq:breslau}
G(a,b) = (a-b)(|a|^{m}+|b|^{m}).$$ However, the operator ${\mathcal{L}}$ based on the second kernel cannot be expressed as a linear operator acting on a non-linear transformation of the solution, as in the case of the fractional porous medium equation.
Notice that the jump kernel related to expression satisfies the hypothesis of Proposition \[lemma:breslau\] for every real number $m\geq 1$.
### Fractional $p$-Laplacian {#fractional-p-laplacian .unnumbered}
Our results may also be applied to equation .
\[lemma:fpl\] Let $\Phi:{\mathbb{R}}\to{\mathbb{R}}$ be a continuous, non-decreasing function satisfying $\Phi(z)\geq 0$ for $z\geq 0$, $\Phi(-z)=-\Phi(z)$ such that ${\Phi(z)}$ is locally Lipschitz-continuous and $\lim_{z\to0}\tfrac{\Phi(z)}{z}<\infty$. If $$F(a,b) = \frac{\Phi(a-b)}{a-b}$$ then ${\rho}$ given by formula is a homogeneous jump kernel.
Because $\operatorname{sgn}\big(\Phi(z)\big) = \operatorname{sgn}(z)$ and $\Phi(-z)=-\Phi(z)$, conditions \[a1:positive\] and \[a2:symmetry\] are satisfied. We assume the limit $\lim_{z\to0}\tfrac{\Phi(z)}{z}$ to exist, which verifies condition \[a5:1levy\]. Then, for $a\geq c\geq d\geq b$ and by using the fact that $\Phi$ is non-decreasing, we have $$(a-b)\frac{\Phi(a-b)}{a-b} = \Phi(a-b) \geq \Phi(c-d) = (c-d)\frac{\Phi(c-d)}{c-d},$$ from which \[a3:monotonicity\] follows. Let $-R<a,b,c<R$ such that $|a-b|,|c-b|>{\varepsilon}$. The function $\Phi$ is locally Lipschitz-continuous, therefore $$\bigg|\frac{\Phi(a-b)}{a-b}-\frac{\Phi(c-b)}{c-b}\bigg|\leq \frac{c_R}{{\varepsilon}^2}|a-c|,$$ with a number $c_R>0$ depending on $R$ and the Lipschitz constant of the function $\Phi$. This confirms condition \[a6:lipschitz\] (see Remark \[rem:lip-sym\]).
Consider the function $\Phi(z) = |z|^{p-2}z$. It is easy to verify that it satisfies the hypothesis of Proposition \[lemma:fpl\] if and only if $p\geq 2$. Then we may take $s<\frac{1}{p}$ (so that $sp<1$ and condition \[a5:1levy\] holds) and we recover the non-local $s$-fractional $p$-Laplace operator which appears in equation .
### Doubly non-linear Lévy operator {#doubly-non-linear-lévy-operator .unnumbered}
The following non-local counterpart of equation , which appears to have not yet been studied, turns out to be covered by our theory.
\[lemma:doubly-nonlinear\] Suppose functions $f$ and $\Phi$ satisfy adequate parts of hypotheses of Propositions \[lemma:fpme\] and \[lemma:fpl\], respectively. If $$F(a,b) = \frac{\Phi\big(f(a)-f(b)\big)}{a-b}$$ then ${\rho}$ given by formula is a homogeneous jump kernel.
Conditions \[a1:positive\], \[a2:symmetry\], \[a3:monotonicity\] and \[a6:lipschitz\] follow easily as combinations of the arguments already used to prove Propositions \[lemma:fpme\] and \[lemma:fpl\].
Entangled jump kernels. {#entangled-jump-kernels. .unnumbered}
-----------------------
Homogeneous jump kernels which cannot be decomposed as in formula are also part of our framework.
### Jump kernel with variable order. {#jump-kernel-with-variable-order. .unnumbered}
In the last example we study an operator whose “differentialbility order” is allowed to depend on the solution itself.
\[lemma:bielefeld\] Let $$\Psi(\mathfrak{a};z) = \Psi_1(\mathfrak{a})\mathbbm{1}_{z<1}(z)+\Psi_2(\mathfrak{a})\mathbbm{1}_{z\geq 1}(z)+\Theta\big(z\big),$$ where $\Psi_1:[0,\infty)\to {\mathbb{R}}$ is non-decreasing, $\Psi_2:[0,\infty)\to {\mathbb{R}}$ is non-increasing, both $\Psi_1$ and $\Psi_2$ are locally Lipschitz-continuous, $\Theta:[0,\infty)\to{\mathbb{R}}$ is measurable and $$0<A_1\leq \Psi(\mathfrak{a};z)\leq A_2<1,\qquad A_1\leq \Theta(z)\leq A_2$$ Then $${{\rho}(a,b;x,y)} = |x-y|^{-N-\Psi(|a-b|;|x-y|)}$$ is a homogeneous jump kernel.
Conditions \[a1:positive\], \[a2:symmetry\] and \[a4:homogeneity\] are easy to check. In order to verify \[a3:monotonicity\] we notice that for $\mathfrak{a}\geq \mathfrak{b}$ and $z\geq0$ we have $$\mathfrak{a}z^{-\Psi_1(\mathfrak{a})\mathbbm{1}_{z<1}(z)}\geq \mathfrak{b}z^{-\Psi_1(\mathfrak{b})\mathbbm{1}_{z<1}(z)},$$ because $\Psi_1$ is non-decreasing and $$\mathfrak{a}z^{-\Psi_2(\mathfrak{a})\mathbbm{1}_{z\geq1}(z)}\geq \mathfrak{b}z^{-\Psi_2(\mathfrak{b})\mathbbm{1}_{z\geq1}(z)},$$ because $\Psi_2$ is non-increasing. Hence for $a\geq c\geq d\geq b$, by setting $\mathfrak{a} = a-b$ and $\mathfrak{b} = c-d$, we obtain $$(a-b){{\rho}(a,b;x,y)}\geq (c-d){{\rho}(c,d;x,y)}.$$
Notice the following estimate $$\begin{gathered}
\label{eq:bielefeld1}
\int_{{{\mathbb{R}}^N}}\big(1\wedge|x-y|\big)\sup_{-R<a,b<R}{{\rho}(a,b;x,y)}\,dy \\\leq
\int_{|y|<1}|y|^{1-N-A_2}\,dy +
\int_{|y|\geq 1}|y|^{-N-A_1}\,dy < \infty
\end{gathered}$$ and let $$m^0(z) = \mathbbm{1}_{z<1}(z)z^{-N-A_2}+\mathbbm{1}_{z\geq1}(z)z^{-N-A_1}.$$ Because functions $\Psi_1$, $\Psi_2$ are locally Lipschitz-continuous, we have $$\label{eq:bielefeld2}
\begin{split}
\big|&z^{-N-\Psi(\mathfrak{a};z)}-z^{-N-\Psi(\mathfrak{b};z)}\big|\\
&= \big(z^{-N-\Theta(z)}\big)\Big(\big|z^{\Psi_1(\mathfrak{a})}-z^{\Psi_1(\mathfrak{b})}\big|\mathbbm{1}_{z<1}(z)
+ \big|z^{\Psi_2(\mathfrak{a})}-z^{\Psi_2(\mathfrak{b})}\big|\mathbbm{1}_{z\geq 1}(z)\Big)\\
&\leq \big|\Psi_1(\mathfrak{a})-\Psi_1(\mathfrak{b})\big|\big|\log(z)\big|
\Big(\sup_{{ \vcenter{ \Let@ \restore@math@cr \default@tag
\baselineskip\fontdimen10 \scriptfont\tw@
\advance\baselineskip\fontdimen12 \scriptfont\tw@
\lineskip\thr@@\fontdimen8 \scriptfont\thr@@
\lineskiplimit\lineskip
\ialign{\hfil$\m@th\scriptstyle##$&$\m@th\scriptstyle{}##$\crcr
\alpha&\in[0,A_2-A_1]\\z&\in[0,1)\crcr
} }
}}z^\alpha\Big)\big(z^{-N-A_2}\mathbbm{1}_{z<1}(z)\big)\\
&\qquad+ \big|\Psi_2(\mathfrak{a})-\Psi_2(\mathfrak{b})\big|\big|\log(z)\big|
\Big(\sup_{{ \vcenter{ \Let@ \restore@math@cr \default@tag
\baselineskip\fontdimen10 \scriptfont\tw@
\advance\baselineskip\fontdimen12 \scriptfont\tw@
\lineskip\thr@@\fontdimen8 \scriptfont\thr@@
\lineskiplimit\lineskip
\ialign{\hfil$\m@th\scriptstyle##$&$\m@th\scriptstyle{}##$\crcr
\alpha&\in[A_1-A_2,0]\\z&\in[1,\infty)\crcr
} }
}}z^\alpha\Big)\big(z^{-N-A_1}\mathbbm{1}_{z\geq 1}(z)\big)\\
&\leq\big(L_{2R}^{\Psi_1}+L_{2R}^{\Psi_2}\big)|\mathfrak{a}-\mathfrak{b}|\big|\log(z)\big|m^0(z).
\end{split}$$ In estimate we used the local Lipschitz-continuity of functions $\Psi_1$ and $\Psi_2$ as well as the fact that $$\begin{aligned}
&\sup_{{ \vcenter{ \Let@ \restore@math@cr \default@tag
\baselineskip\fontdimen10 \scriptfont\tw@
\advance\baselineskip\fontdimen12 \scriptfont\tw@
\lineskip\thr@@\fontdimen8 \scriptfont\thr@@
\lineskiplimit\lineskip
\ialign{\hfil$\m@th\scriptstyle##$&$\m@th\scriptstyle{}##$\crcr
\alpha&\in[0,A_2-A_1]\\z&\in[0,1)\crcr
} }
}}z^\alpha =\sup_{{ \vcenter{ \Let@ \restore@math@cr \default@tag
\baselineskip\fontdimen10 \scriptfont\tw@
\advance\baselineskip\fontdimen12 \scriptfont\tw@
\lineskip\thr@@\fontdimen8 \scriptfont\thr@@
\lineskiplimit\lineskip
\ialign{\hfil$\m@th\scriptstyle##$&$\m@th\scriptstyle{}##$\crcr
\alpha&\in[A_1-A_2,0]\\z&\in[1,\infty)\crcr
} }
}}z^\alpha = 1.
\end{aligned}$$ It follows from estimates and that by putting $\mathfrak{a} = |a-b|$, $\mathfrak{b} = |c-d|$ and $z = |x-y|$ we may verify both conditions \[a5:1levy\] and \[a6:lipschitz\] by considering $$m_R\big(z\big) = \Big(\mathbbm{1}_{z<1}(z)z^{-N-A_2}+\mathbbm{1}_{z\geq1}(z)z^{-N-A_1}\Big)
\times\max\big\{1,\big|\log(z)\big|\big\}.\qedhere$$
In Proposition \[lemma:bielefeld\] it would suffice to assume local Lipschitz-continuity of functions $\Psi_1$ and $\Psi_2$ on $(0,\infty)$.
[^1]: We thank Félix del Teso for signalling this example and pointing us to the references.
|
2023-12-13T01:26:36.242652
|
https://example.com/article/4952
|
Coronavirus pandemic has changed some trends in the global telecom services market, but operators have adapted quickly and temporarily pushed aside some earlier priorities, says IDC
Despite the huge impact it is having on economies across the globe, Covid-19 is likely to have a limited effect on the global telecommunications services business, according to research from IDC.
In its Worldwide semiannual telecom services tracker, IDC calculates that in 2020, telecom services spending will drop in all geographic regions to a total of $1.561tn.
The largest market, the Americas, is set to see what the analyst described as a “tiny” decline of 0.04% compared with 2019, while Europe, the Middle East and Africa (EMEA) and Asia-Pacific (including Japan) will dip more, mainly because of the larger price-sensitive audience in the low-income countries of Africa and Asia.
Asia-Pacific is set to see a 1.4% year-on-year dip in revenues to $465bn and EMEA is projected to have a fall of 1.2% annually to $474bn, while the Americas are forecast to generate $623bn, as they did in 2019. No growth is not expected in EMEA or Asia-Pacific before 2022, as users in emerging markets are expected to remain cautious about spending for some time.
IDC noted that the telecoms industries are among the most resilient sectors of the global economy during the Covid-19 crisis, but it cautioned that the economic impact from shutting down businesses, higher unemployment, frozen tourist activities and reduced consumer spending on non-essential products and services would have a negative impact on the market.
The mobile segment, the largest in the market, will post a slight decline in 2020 because of lower revenues from roaming charges, fewer mobile data overages due to the stay-at-home situation, and slower net additions, especially in the consumer segment, said IDC.
Telecoms services and pay TV will reach nearly $1.6tn by the end of 2020, a decrease of 0.8% compared with 2019. IDC expects the decline to continue in 2021, but at a somewhat lower degree. Although pay-TV services are set to be boosted by the lockdown but also affected by the economic downturn, IDC believes spending in this category will decline slightly.
Fixed data services spending will increase by 2.9% in 2020 as the need for more fixed internet connectivity, determined by the “great lockdown”, is likely to help this segment maintain growth, said IDC.
Spending on fixed voice services is forecast to continue to decline and will take an additional hit from the pandemic as users will are likely to drop fixed voice services to save money. Fixed IP voice will survive longer because the service is included in bundles, in most cases.
Summing up the trends it discovered in the research, IDC said the pandemic had changed some trends in the global telecom services market, but operators have quickly adapted to the forced changes in customer behaviour and have temporarily pushed aside some earlier priorities.
“As the 5G revolution is being put on hold or delayed by the pandemic, the already proven technologies and business cases will keep the ball rolling in these uncertain times,” saidKresimir Alic, research director with IDC’s worldwide telecom services team. “Hosted VoIP/UCaaS, collaboration tools, SD-WAN, IoT, along with network optimisation and increased reliability, will keep consumers and businesses connected during the tough days of pandemic and global recession.”
ABI said telco cloud revenue from 5G core deployments would undoubtedly fall by 20-30% short of the forecast $9bn in 2020, and that the investment shortfall in modernising telco networks may be between $2bn and $3bn in the short term.
Content Continues Below
Download this free guide
Unified Communications: the key to prospering in the new working reality of Covid-19
The coronavirus is changing everything about how people work, and will do so permanently. It added that even though the working world was experiencing unprecedented uncertainty, there were two things that should be borne in mind: the virus will pass, and at the other side of the pandemic, the world of work will look very different.
I agree to TechTarget’s Terms of Use, Privacy Policy, and the transfer of my information to the United States for processing to provide me with relevant information as described in our Privacy Policy.
Please check the box if you want to proceed.
I agree to my information being processed by TechTarget and its Partners to contact me via phone, email, or other means regarding information relevant to my professional interests. I may unsubscribe at any time.
Please check the box if you want to proceed.
By submitting my Email address I confirm that I have read and accepted the Terms of Use and Declaration of Consent.
Start the conversation
0 comments
Register
I agree to TechTarget’s Terms of Use, Privacy Policy, and the transfer of my information to the United States for processing to provide me with relevant information as described in our Privacy Policy.
Please check the box if you want to proceed.
I agree to my information being processed by TechTarget and its Partners to contact me via phone, email, or other means regarding information relevant to my professional interests. I may unsubscribe at any time.
|
2023-11-13T01:26:36.242652
|
https://example.com/article/6835
|
The Crown (season 1)
The first season of The Crown follows the life and reign of Queen Elizabeth II. It consists of ten episodes and was released on Netflix on November 4, 2016.
Claire Foy stars as Elizabeth, along with main cast members Matt Smith, Vanessa Kirby, Eileen Atkins, Jeremy Northam, Victoria Hamilton, Ben Miles, Greg Wise, Jared Harris, John Lithgow, Alex Jennings, and Lia Williams.
Premise
The Crown traces the life of Queen Elizabeth II from her wedding in 1947 through to the present day. The first season, in which Claire Foy portrays the Queen in the early part of her reign, depicts events up to 1955, with Winston Churchill resigning as prime minister and the Queen's sister Princess Margaret deciding not to marry Peter Townsend.
Cast
Main
Claire Foy as Princess Elizabeth and later Queen Elizabeth II
Matt Smith as Prince Philip, Duke of Edinburgh, Elizabeth's husband
Vanessa Kirby as Princess Margaret, Elizabeth's younger sister
Eileen Atkins as Queen Mary, Elizabeth's grandmother and great-granddaughter of King George III
Jeremy Northam as Anthony Eden, Churchill's deputy prime minister and Foreign Secretary, who succeeds him as prime minister
Victoria Hamilton as Queen Elizabeth, George VI's wife and Elizabeth II's mother, known as Queen Elizabeth The Queen Mother during her daughter's reign
Ben Miles as Group Captain Peter Townsend, George VI's equerry, who hopes to marry Princess Margaret
Greg Wise as Louis Mountbatten, 1st Earl Mountbatten of Burma, Philip's ambitious uncle and great-grandson of Queen Victoria
Jared Harris as King George VI, Elizabeth's father, known to his family as Bertie
John Lithgow as Winston Churchill, the Queen's first prime minister
Alex Jennings as the Duke of Windsor, formerly King Edward VIII, who abdicated in favour of his younger brother Bertie to marry Wallis Simpson; known to his family as David
Lia Williams as Wallis, Duchess of Windsor, Edward's American wife
Featured
The below actor is credited in the opening titles of a single episode in which they play a significant role.
Stephen Dillane as Graham Sutherland, a noted artist who paints a portrait of the aging Churchill
Recurring
Billy Jenkins as young Prince Charles
Grace and Amelia Gilmour as young Princess Anne (uncredited)
Clive Francis as Lord Salisbury
Pip Torrens as Tommy Lascelles
Harry Hadden-Paton as Martin Charteris
Daniel Ings as Mike Parker
Lizzy McInnerny as Margaret "Bobo" MacDonald
Patrick Ryecart as the Duke of Norfolk
Will Keen as Michael Adeane
James Laurenson as Doctor Weir
Mark Tandy as Cecil Beaton
Harriet Walter as Clementine Churchill
Nicholas Rowe as Jock Colville
Simon Chandler as Clement Attlee
Kate Phillips as Venetia Scott
Ronald Pickup as the Archbishop of Canterbury
Nigel Cooke as Harry Crookshank
Patrick Drury as the Lord Chamberlain
John Woodvine as the Archbishop of York
Rosalind Knight as Princess Alice of Battenberg
Andy Sanderson as Prince Henry, Duke of Gloucester
Michael Culkin as Rab Butler
George Asprey as Walter Monckton
Verity Russell as young Princess Elizabeth
Beau Gadsdon as young Princess Margaret
James Hillier as Equerry
Jo Stone-Fewings as Collins
Anna Madeley as Clarissa Eden
Tony Guilfoyle as the Bishop of Durham
Nick Hendrix as Billy Wallace
Josh Taylor as Johnny Dalkeith
David Shields as Colin Tennant
Paul Thornley as Bill Mattheson
Guest
Michael Bertenshaw as Piers Legh, Master of the Household
Julius D'Silva as Baron Nahum
Jo Herbert as Mary Charteris
Richard Clifford as Norman Hartnell
Joseph Kloska as Porchey
Amir Boutrous as Gamal Abdel Nasser
Abigail Parmenter as Judy Montagu
Episodes
Release
The series' first two episodes were released theatrically in the United Kingdom on November 1, 2016. The first season was released on Netflix worldwide in its entirety on November 4, 2016. Season 1 was released on DVD and Blu-ray in the United Kingdom on October 16, 2017 and worldwide on November 7, 2017.
Reception
The review aggregator website Rotten Tomatoes reported 90% approval for the first season based on 69 reviews, with an average rating of 8.77/10. Its critical consensus reads, "Powerful performances and lavish cinematography make The Crown a top-notch production worthy of its grand subject." On Metacritic, the series holds a score of 81 out of 100, based on 29 critics, indicating "universal acclaim".
The Guardians TV critic Lucy Mangan praised the series and wrote that "Netflix can rest assured that its £100m gamble has paid off. This first series, about good old British phlegm from first to last, is the service's crowning achievement so far." Writing for The Daily Telegraph, Ben Lawrence said, "The Crown is a PR triumph for the Windsors, a compassionate piece of work that humanises them in a way that has never been seen before. It is a portrait of an extraordinary family, an intelligent comment on the effects of the constitution on their personal lives and a fascinating account of postwar Britain all rolled into one." Writing for The Boston Globe, Matthew Gilbert also praised the series saying it "is thoroughly engaging, gorgeously shot, beautifully acted, rich in the historical events of postwar England, and designed with a sharp eye to psychological nuance". Vicki Hyman of The Star-Ledger described it as "sumptuous, stately but never dull". The A.V. Clubs Gwen Ihnat said it adds "a cinematic quality to a complex and intricate time for an intimate family. The performers and creators are seemingly up for the task".
The Wall Street Journal critic Dorothy Rabinowitz said, "We're clearly meant to see the duke [of Windsor] as a wastrel with heart. It doesn't quite come off—Mr. Jennings is far too convincing as an empty-hearted scoundrel—but it's a minor flaw in this superbly sustained work." Robert Lloyd writing for the Los Angeles Times said, "As television it's excellent—beautifully mounted, movingly played and only mildly melodramatic." Hank Stuever of The Washington Post also reviewed the series positively: "Pieces of The Crown are more brilliant on their own than they are as a series, taken in as shorter, intently focused films". Neil Genzlinger of The New York Times said, "This is a thoughtful series that lingers over death rather than using it for shock value; one that finds its story lines in small power struggles rather than gruesome palace coups." The Hollywood Reporters Daniel Fienberg said the first season "remains gripping across the entirety of the 10 episodes made available to critics, finding both emotional heft in Elizabeth's youthful ascension and unexpected suspense in matters of courtly protocol and etiquette". Other publications such as USA Today, Indiewire, The Atlantic, CNN and Variety also reviewed the series positively.
Some were more critical of the show. In a review for Time magazine, Daniel D'Addario wrote that it "will be compared to Downton Abbey, but that .. was able to invent ahistorical or at least unexpected notes. Foy struggles mightily, but she's given little...The Crowns Elizabeth is more than unknowable. She's a bore". Vultures Matt Zoller Seitz concluded, "The Crown never entirely figures out how to make the political and domestic drama genuinely dramatic, much less bestow complexity on characters outside England's innermost circle." Verne Gay of Newsday said, "Sumptuously produced but glacially told, The Crown is the TV equivalent of a long drive through the English countryside. The scenery keeps changing, but remains the same." Slate magazine's Willa Paskin, commented: "It will scratch your period drama itch—and leave you itchy for action."
References
Category:The Crown (TV series)
Category:2016 American television seasons
Category:2016 British television seasons
Category:Cultural depictions of Elizabeth II
Category:Cultural depictions of Winston Churchill
Category:Cultural depictions of Charles, Prince of Wales
Category:Cultural depictions of Louis Mountbatten, 1st Earl Mountbatten of Burma
Category:Films with screenplays by Peter Morgan
|
2023-10-23T01:26:36.242652
|
https://example.com/article/4059
|
The subject of the invention is a hub, in particular for a rear bicycle wheel.
So far, rear wheel hubs have been used having freewheels with 3 or 6 pawls which mesh with the toothed surface of an inner toothed disc. There is disclosed in the U.S patent application No. US20080006500 the description of a rear wheel hub having a hub shell and a freewheel shell which are rotatably supported by two bearings relative to a hub axle. The hub shell is slidingly coupled through spline coupling with a ring disc provided with frontal toothing which intermesh with the toothing of identical freewheel coupling ring spline coupled with the freewheel shell, while the rings are urged towards one another by springs.
|
2024-02-03T01:26:36.242652
|
https://example.com/article/4542
|
Q:
Who were the "sons of God" (bene elohim) in Genesis 6:2?
Genesis 6:1-2 (ESV emphasis mine):
When man began to multiply on the face of the land and daughters were born to them, the sons of God saw that the daughters of man were attractive. And they took as their wives any they chose.
Who are these "sons of God" (bene elohim) in Genesis 6:2? Are these some kind of divine being or angels that are intermarrying with human women? I've heard some people claim that they are the men in the godly line of Seth, while the daughters are from the line of Cain. What leads people to this interpretation? Are there other ideas?
A:
There are three common views on the identity of the 'sons of God' marrying the 'daughters of men' in Genesis 6.1-4:
Descendants of Seth married descendants of Cain
Nobles married commoners
Angels married human women
1. Descendants of Seth married descendants of Cain
This view was popularized by Augustine (City of God, chapter 23), and the argument amounts to the following: the 'sons of God' designates people who are faithful to God (e.g. Romans 8.14), and hence are being contrasted to people not-faithful to God.
The account in Genesis 6.1-4, then, is telling us that there was a mingling of righteous men with unrighteous women, leading directly to the wickedness that prompted God to flood the world. Because Cain's descendants in Genesis 4 are inferred to be more wicked (based on the progression of Genesis 4.8-24), while Seth's descendants are inferred to be more righteous (based almost entirely on Genesis 4.25-26), it is common for adherents of this view to further identify the righteous 'sons of God' with Seth's offspring and the 'daughters of men' with Cain's.
A common criticism of this view is that Genesis 6.1-4 mentions neither Seth nor Cain, so identifying the 'sons of God' and the 'daughters of men' as their descendants, respectively, is accused of presupposing too much about the author's intentions.
2. Nobles married commoners
Another view, originating in 2nd century AD rabbinic thought, is that 'sons of God' designates members of nobility. We know from a variety of texts from the Ancient Near East that rulers were regularly perceived as the 'sons of God'. For biblical examples, see 2 Samuel 7.14 or Psalm 2, where God identifies the king of Israel as his 'son'.
In this case, the 'sons of God' — the rulers of the ancient world — are forcefully taking women from the common folk, which is also attested in ancient Near Eastern culture. The biblical book of Esther depicts such an occasion.
While the 'sons of God' label could indeed refer to nobility, both of views 1 and 2 suffer from the particular designation of the women as being 'daughters of men'. This epithet, which is contrasted to the 'of God', seems completely unnecessary if both the 'sons' and 'daughters' are humans.
3. Angels married human women
The third view is that a group of angels (the 'sons of God') descended upon the earth and married human women (the 'daughters of men'). I would argue this is the most accurate interpretation of the text (see my 'personal thought' below), and it seems to have been the earliest view as evident in both Jewish and Christian texts:
1 Enoch's Book of Watchers (3rd century BC)
And it came to pass when the children of men had multiplied that in those days were born unto them beautiful and comely daughters. And the angels, the children of the heaven, saw and lusted after them, and said to one another: 'Come, let us choose us wives from among the children of men and beget us children.' ... And they were in all two hundred; who descended in the days of Jared on the summit of Mount Hermon. (R.H. Charles translation)
Jubilees 4.15-5.7 (2nd century BC)
in [Jared's] days the angels of the Lord descended on the earth, those who are named the Watchers, that they should instruct the children of men ... And it came to pass when the children of men began to multiply on the face of the earth and daughters were born unto them, that the angels of God saw them on a certain year of this jubilee, that they were beautiful to look upon; and they took themselves wives of all whom they chose, and they bare unto them sons and they were giants. (R.H. Charles translation)
LXX Genesis 6.2-5 (2nd-1st century BC)
Some copies of the Septuagint chose to translate the Hebrew 'sons of God' into the Greek 'angels of God'.
Philo, On the Giants (1st century AD)
"And when the angels of God saw the daughters of men that they were beautiful, they took unto themselves wives of all of them whom they Chose." Those beings, whom other philosophers call demons, Moses usually calls angels; and they are souls hovering in the air.
Josephus, Jewish Antiquities 1.3.1 (1st century AD)
For many angels of God accompanied with women, and begat sons that proved unjust, and despisers of all that was good, on account of the confidence they had in their own strength; for the tradition is, that these men did what resembled the acts of those whom the Grecians call giants. (William Whiston translation)
Jude 6-7 (1st century AD)
And the angels who did not stay within their own position of authority, but left their proper dwelling, he has kept in eternal chains under gloomy darkness until the judgment of the great day: just as Sodom and Gomorrah and the surrounding cities, which likewise indulged in sexual immorality and pursued unnatural desire, serve as an example by undergoing a punishment of eternal fire. (ESV translation)
The epistle of Jude draws extensively upon 1 Enoch; with that textual transmission in mind, it is clear Jude is referring to the episode in Genesis 6.1-4. Jude 6-7 is further repeated in 2 Peter 2.4.
By the second century AD, the Jewish authorities were moving away from the 'angels' interpretation because of the growing view that angels could not, by nature, defy God's will. See, for example, Justin Martyr's Dialogue With Trypho, chapter 79. In this text, Justin (allegedly) debated a Jewish man named Trypho, who said:
The utterances of God are holy, but your expositions are mere contrivances, as is plain from what has been explained by you; nay, even blasphemies, for you assert that angels sinned and revolted from God. (Philip Schaff translation)
Meanwhile, Christian authorities favored it until about the fourth or fifth century, with Augustine being the main contributor to a shift in popular opinion.
Personal thought
As an aside, my personal thought is that Genesis 6.1-4 was written as an etiology for the tribes of 'giants' found in the narrative between the exodus and the rise of David: the Rephaim, the Emim, and the Anakim, all groups remembered for their extreme size (e.g. Numbers 13.33; Deuteronomy 1.28; 2.10,21; 9.2).
The last group, the offspring of Anak, are explicitly said to come from the nephilim (Numbers 13.33). A few 'giants' in particular survived in Israel's social memory: Og of Bashan (Deuteronomy 3.11), Goliath of Gath (1 Samuel 17.4), and a group of six Philistines from Gath (2 Samuel 21.18-22).
By the exilic period, memory of 'giants' who fought against Israel's ancestors was retained in the social consciousness. With this, as the scribes were compiling the larger narrative of Genesis—2 Kings, they wrote a story explaining the immense size and violence of those ancient enemies: Og, Goliath, et al, were offspring of the Rephaim, the Emim, and the Anakim, who were all descendants of the nephilim, the 'mighty men of ancient times, men of fame', who owed their great stature to angelic fathers.
A:
The first part of the term "Bene Ha'elohim" simply means sons of. Therefore, the question really revolves around what "elohim" refers to here. In that vein, there are a couple of different possible translations for "elohim". In the Bible, elohim is most often used to refer to Yahewh (God,) however elohim can also refer to gods; the mighty, great or powerful (that is - lords or aristocracy); or rulers/judges. Many have used the book of Enoch, an apocryphal text to fill in the blank here and say that these were angels, however I find it helpful to consider the idea that the Bene Ha'elohim were simply mesopotamian rulers or aristocracy (who would certainly qualify as "men of old" and "renown") and see how this impacts the our interpretation of this narrative in Genesis. Nephilim means (roughly) the fallen ones - so perhaps these sons of the powers or lords fell in battle.
First, In Genesis 6:5-8 it is revealed that the relationships between the Bene Ha'elohim. (Literally, sons of the powers) and the daughters of man is the reason for the great flood.
Secondly, at the time, the Hebrews were a nomadic people who lived in the hills near Ur and surrounding areas of the Fertile Crescent. At that time the major powers and empires (aka kings or lords) were either the Sumerians, Akkadians, Hittites or Mitannis depending on when you date this story and/or the flood.
Lastly, in the pericope, it seems like the daughters of man are the daughters of God's people (the Hebrews) based on context of the passage. So what does the puzzle look like get if we assemble all of these pieces?
This paints the picture of the Israelites and people of God marrying into neighboring cultures with all their gods, customs and religious practices because these people were wealthy and powerful.
So suddenly, a familiar theme emerges - the theme that is presented in the story of the tower of Babel, the theme presented in Deuteronomy 20:16-18 and the most common theme throughout the entire Old Testament: Idoaltry.
Under this understanding, what comes into relief is that with the intermarriage of races were repeatedly forbidden by God. Marriages of convenience to join tribes and help leaders acquire wealth and in the spirit of greed would seem to be further afoul of God's will for his people.
The reasoning behind this was that when the Israelite intermarried, with these marriages comes the intermarriage of religions and this caused temptation of the Israelite people to follow other gods. This was repeatedly condemned as unacceptable to Yahweh as he is Jealous God.
Having this idolatry as the reason behind the flood makes a ton more sense than to obliterate the earth because there were some half-breed little green men from outer space or some mulatto angels running around. This may be a more mundane interpretation, but it is also more sensical and fits more neatly into the story arc of the text.
A:
Are the 'sons of God' genetic progeny or an 'offshoot' of humanity?
I support Samuel's argument against the 'sons of God' as angels - it is well founded, if not widely accepted.
But what does the word bene really mean?
A common error of understanding in the Old Testament has been in preferring the literal, physical translation of a word despite it being used elsewhere in a figurative sense.
When my daughter was first learning to talk, one of her first words was 'bah' - which we translated as 'bath'. It wasn't long before we noticed that she was pointing to puddles on the road and saying 'bah'. When we have no word to describe an experience, we use what we believe is the closest approximation in our vocabulary to our experience, in the hope that the listener or reader can understand this unnamed experience we mean to communicate. My daughter meant to communicate an experience of 'water', but she didn't have that word available.
So when someone says 'sons' of God, do they literally mean genetic progeny - someone physically born of God and not of man?
The Hebrew word 'bene' has been used for more than genetic progeny in various instances throughout the bible.
One interesting occurrence is from Job:
For affliction does not come from the dust, nor does trouble sprout from the ground;
but man is born to trouble as the sparks (ū·ḇə·nê re·šep̄) fly upward. (Job 5:7)
Here Eliphaz is talking about 'sparks', but the literal translation is 'the sons of flame'. The imagery is very poetic, but it is the experience that resonates with the reader, and is unfortunately lost when we translate it to 'sparks'. Job also uses the word ben to refer to 'sons of God'.
Other instances suggest that bene may not refer only to genetic progeny, described as "often plural with name of ancestor, people, land, or city, to denote descendants, inhabitants, membership in a nation or family, etc." (biblehub.com)
I will provide one more example in Isaiah's last words or 'prophecy' regarding his descendants:
Joseph is a fruitful bough (ben), a fruitful bough (ben) by a spring; his branches run over the wall. (Genesis 49:22)
The fascinating thing about this verse is that Joseph is also his genetic progeny, but the word ben is not used in this way, but describes him as an 'offshoot' of the vine, a cutting that will be most beneficial in continuing the life or purpose of the original vine.
If we go back to Genesis 4:26, we see that the birth of Seth and his son Enosh begins an 'offshoot' of humanity that differs from Cain and Enoch in one specific way:
To Seth also a son was born, and he called his name Enosh. At that time men began to call upon the name of the Lord. (Genesis 4:26)
The wording of this is interesting, because it doesn't necessarily distinguish these men genetically from Cain's descendants, nor does it state that Seth and his descendants all began to call upon the name of the Lord. Although it is easy enough to make that incorrect assumption. This section of Genesis concludes with a distinction between two kinds of men, regardless of whether we believe the distinction to be genetically determined: those who called on the name of the Lord, and those who didn't.
This distinction is described a little differently in the toledoth of Chapter 5, as Enoch is particularly noted to have 'walked with God' (Genesis 5:22). And then in Chapter 6 the same distinction is described as 'the sons of God' as opposed to 'the daughters of men'.
When men began to multiply on the face of the ground, and daughters were born to them, the sons of God saw that the daughters of men were fair; and they took to wife such of them as they chose. Then the Lord said, “My spirit shall not abide in man for ever, for he is flesh, but his days shall be a hundred and twenty years.” The Nephilim were on the earth in those days, and also afterward, when the sons of God came in to the daughters of men, and they bore children to them. These were the mighty men that were of old, the men of renown. (Genesis 6: 1-4)
This distinction between male and female as well as between God and men can be considered figurative here - it's unlikely that marriages occurred only along these gender lines. The use of gender and their decision to 'take wives' based on sexual attractiveness (rather than connecting with each other on a spiritual level) highlights humanity's tendency to follow evolutionary instinct rather than the spirit of God within them.
The 'mighty men that were of old, the men of renown' refer to the descendants of these unions, the 'nephilim' - which literally means 'the fallen', but also has connotations of 'prisoner'. In some way they could be afforded some pity, as their fathers had once walked with God but chose to turn from Him and live by evolutionary instinct. It was, after all, their parents who chose genetic self-benefit and proliferation, raising their children with partners who did not call upon the name of the Lord.
These 'fallen' children became 'mighty', great men not in terms of physical size (giants), but in terms of individual worldly achievement: success, power and physical ability. They were not 'sons of God' because they did not 'call upon the name of the Lord', they did not 'walk with God', and the spirit of God did not 'abide' in them as it did their fathers. They also lived only 120 years - considered a normal span of life for a human body - as opposed to the 300+ years of those who walked with God, whose spiritual presence or capacity to impact on the world probably outlasted their physical life.
Again, the assumption may be that this 'spirit of God' was being 'bred out' at a genetic level - but this is not the case. The stories of the Old Testament continually demonstrate both that this 'spirit of God' cannot be passed down genetically, and that it only takes one's awareness and openness for the spirit to abide in them.
This also relates to Jesus as a 'son of God', as one in whom the spirit of God abides, whose example inspires all of us to be aware and open to this spirit abiding within us, to join this 'offshoot' of humanity (not just calling on the name of the Lord but crying 'Abba, father' as sons of God), and whose spiritual presence continues to impact on the world more than 2000 years beyond his physical life.
|
2023-11-14T01:26:36.242652
|
https://example.com/article/9423
|
Q:
Angularjs populate the select and checkbox from JSON not working
I'm trying to populate the form with Data that are coming from Database/JSON.
I can populate the text field but for some reason the select drop down and the checkbox are not being populated with data. The select should have "male" and the checkbox should be ticked because it's set true.
code:
<form>
<label>Gender:</label>
<select id="s1" ng-model="myData.gender"></select>
<br>
<label>Name:</label>
<input type="text" ng-model="myData.name">
<br>
<label>Active:</label>
<input type="checkbox" ng-model="myData.active" value="" id="checkbox" name="check" ng-init="myData.active=myData.active"><br>
<input type="button" value="Save" ng-click="Update">
</form>
//assume these data coming from database
$scope.myData = {
"name" : "John",
"active" : "true",
"gender" : "male"
};
So basically the whole idea is that, when the fields are populated, the user can change the values and then hit the Save button which will update the database with new data.
Can anyone help?
PLUNR
A:
You need to make some changes in template
<label>Gender:</label>
<select
id="s1"
ng-model="myData.gender"
ng-options="sex for sex in ['male', 'female']">
</select>
<br>
<label>Name:</label>
<input
type="text"
ng-model="myData.name">
<br>
<label>Active:</label>
<input
type="checkbox"
ng-model="myData.active"
id="checkbox"
name="check" >
<br>
<input type="button" value="Save" ng-click="Update">
and in data
//assume these datra coming from database
$scope.myData = {
"name" : "John",
"active" : true, // it will be true not string "true"
"gender" : "female"
};
here is working pluck
If data from db is not valid Boolean use Transformer to make data valid for js. in short cast the int, and boolean from db.
|
2024-07-07T01:26:36.242652
|
https://example.com/article/3487
|
Elon Musk is trying his hand at a new career path: selling solar roofs.
Continue Reading Below
The Tesla CEO took to Twitter on Monday to push the company’s Solarglass Roof onto the Twittersphere.
Ticker Security Last Change Change % TSLA TESLA INC. 442.15 +18.72 +4.42%
“The degree to which SolarGlass will positively effect the esthetics & energy sustainability of neighborhoods throughout the world is not yet well appreciated,” Musk tweeted. “This is a very important product.”
Musk also tweeted out a picture of a home with Solarglass and a link to the company’s website where interested parties can buy the roof.
Solarglass costs an estimated $33,950 for a 2,000-square-foot roof, according to the company’s website. That’s less than buying a premium roof with solar panels, which costs an estimated $43,790, according to the company.
CLICK HERE TO READ MORE ON FOX BUSINESS
Musk's push comes after Tesla's solar business generated $1.53 billion of revenue in 2019, making up 6.2 percent of Tesla's sales in 2019.
Solar panel installations are expected to grow in popularity this year. The U.S. Energy Information Administration expects a record 13.5 gigawatts of solar capacity to come online in 2020, up 68.75 percent from its record of 8 gigawatts in 2016.
|
2023-09-19T01:26:36.242652
|
https://example.com/article/2456
|
Bend Weekly Community ForumsWelcome to BendWeekly.com Discussion Board. If this is your first visit, be sure to check out the "FAQ" by clicking the link below. You may have to register before you can post: click the "register" link below to proceed.
Stop! Drop everything you're doing and go and see this film immediately. I cannot begin to express how truly incredible this film is. I absolutely can't stop thinking about it and what an impact it made. A beautifully written script, fabulous direction, breathtaking scenery and truly superb acting.
I suggest going with a friend (and Kleenex) as it leaves you with a very alone and isolated feeling...not to mention sad. Furthermore, you will have to the need to discuss and evaluate it over and over again.
For those of you who are conservative, judgmental and non-accepting/non-understanding of homosexuality, you need to put your discrimination aside and see the story for what it really is. It's such a small (and beautiful) piece of the bigger story being told. It's not just a gay cowboy film. Oh hell, I don't even know why I try?
Anyhow, one of the best films I've ever seen. You won't be disappointed. It's powerful, beautiful, numbing and thought provoking. It far exceeded my expectations.
I heard about this movie and I think you are right, it's about a couple of gay cowboys. I for one won't be seeing it. The left wing is trying to bring down one of the last true American icons, the American Cowboy. They would love nothing more than to normalize this type of lewd behavior and make it aceptable to our society. They wont stop until the gays can marry and adopt kids. But no, I won't be seeing Bareback Mounting or whatever the hell it's called.
I've been waiting for somebody to bring this film up. The only surprise is how tame the reactions have been. I plan on seeing it. I heard it's no more of a gay film than "Casablanca" is a heterosexual film. Anyway, it has my curiosity up and the soundtack is one of the best soundtracks I have heard. Lots of interesting music. I love Willie's viersion of Bob Dylans "He Was A Friend Of Mine".
Personally, I really don't want to watch this movie. Before you cast judgment on me note that some people aren't just against the idea of homosexuality based on their political/religious views, but are not interested in seeing the film's depiction of families torn apart by being left in the wake of people finally coming to terms with their sexuality a little bit to late. It is difficult to watch herterosexual infidelity for some, and can also apply to this movie too.
|
2024-06-23T01:26:36.242652
|
https://example.com/article/6295
|
adapter: sqlite3
database: development.sqlite3
pool: 5
timeout: 5000
|
2023-09-29T01:26:36.242652
|
https://example.com/article/7027
|
Willowson Flooring has April Sale
Willowson Flooring, a flooring company in the UK, has a fantastic sale going on this April. They are currently offering a five percent discount on all of their products for orders over £500. This offer is only valid until 30th April, so now is the time to buy that flooring you’ve been wanting for so long.
Willowson Flooring has a sale for their customers that will help them save a lot of money if they are thinking about installing quality flooring in their home. When customers spend over £500, they will get 5% off of their purchase plus free underlay and free delivery. The underlay that customers will receive is 3mm PF Foam with DPM Metallised Foil 19dB. This is equal to m2 coverage to flooring ordered. In order for customers to take advantage of this offer, they must keep their order confirmation and then contact the customer support team at +44 (0)20 3115 1707. Their office hours are from 9:30 a.m. to 5:00 p.m. Monday thru Friday. You can also email [email protected] for any questions you may have.
Customers can shop from the large variety of quality flooring options that Willowson Flooring has to offer. Whether customers are shopping for wood flooring, laminate flooring, vinyl click flooring, accessories, or more, Willowson is making it easy to save money on the products needed to install beautiful floors in your home. However, this offer ends soon so there is no time to delay.
About Willowson Flooring
Willowson Flooring sells luxury oak flooring at prices that are affordable. They have a reputation for excellence and this shows in the product that they sell. Their oak flooring is a carefully chosen range of solid wood flooring as well as engineered wood flooring that is based on the durability, appearance, and quality. They listen to the research that shows that customers want high-quality flooring at great value. They aim to make the purchase of wood flooring as easy and pleasurable as they possibly can, starting with selection all the way through to delivery.
They have a 30 years warranty that guarantees that the flooring will last. Barring normal wear and tear, any damages that occur to the flooring are covered by the 30 year warranty which means that damages can be repaired or replaced. This sets Willowson apart from other flooring companies as they want only the very best quality for their customers, and they have the guarantee to prove it.
|
2024-07-14T01:26:36.242652
|
https://example.com/article/3310
|
News
The NHL will reportedly meet Friday with Vancouver Canucks winger Alexandre Burrows regarding comments he made to New Jersey Devils winger Jordin Tootoo in Sunday’s game. Tootoo told media post-game Sunday that Burrows made remarks about his “personal life and family.”
The NHL is reportedly set to meet with Vancouver’s Alexandre Burrows after New Jersey’s Jordin Tootoo accused Burrows of making “personal remarks” regarding Tootoo’s family Sunday night.
According to Sportsnet’s John Shannon, Burrows is set to meet with NHL officials Friday in Toronto to discuss the incident. What exactly was said by Burrows is unknown, but Tootoo was upset with Burrows’ comments and told media post-game that he had no respect for the Canucks winger.
“The penalty box guys even rolled their eyes like, ‘Is this guy really saying this (expletive)?’” Tootoo told NorthJersey.com’s Tom Gulitti. “I don’t have any respect for him. I don’t need an apology for him or nothing. It’s just classless. We’re all professionals and everyone fights a fight no one knows about and when you dive into personal issues, it’s just classless. To me, that’s cowardly.”
Tootoo said he would leave it to Burrows to tell media what was said, and the Devils right winger refused to confirm whether the comments had anything to do with his history in the NHL’s substance abuse problem or his family’s heritage.
Tootoo attempted to fight Burrows later in the contest, but Vancouver’s Derek Dorsett stepped in to drop the gloves with Tootoo instead.
“If you’re going to talk the talk, you’ve got to walk the walk,” Tootoo told NJ.com’s Rich Chere post-game. “To make the remarks he did about my personal life and family is classless and unacceptable in this day and age. That’s why I went after him.”
Burrows has been known as a pesky player, but he hasn't gone over the edge often. Only once has he been suspended by the league. He has been involved in other infamous moments, though, such as an alleged biting incident in the 2011 Stanley Cup final.
The Canucks will be in Ottawa Thursday to take on the Senators before heading to Toronto for a Saturday night tilt with the Maple Leafs.
|
2024-01-28T01:26:36.242652
|
https://example.com/article/7420
|
Blog
Everything is energy and that’s all there is to it. Match the frequency of the reality you want and you cannot help but get that reality. It can be no other way. This is not philosophy. This is Physics!Albert Einstein
Perception is based on expectations and expectations are influenced by our beliefs, experiences and all the memories stored in our sub conscious database. Our mind processes the information that it receives via the senses based on the information that it already has stored. How you perceive the world is your own individual reality! It may be similar to someone else’s, however you contain your own unique database of beliefs, experiences, emotions and memories, therefore your interpretation of the world (perception) is always unique to you and as such your personal reality is also unique. In general we are not taught this principle and this lack of understanding creates conflict between individuals, families, cultural groups and nations.
We assume that we are seeing and interpreting the same thing and in so many cases we are not. We have our own mind's view and we have convinced ourselves that it is so.
Understanding that our perception is just our own interpretation allows us to open up to the possibility that there is other realities if we change our thinking. This the key to liberation and self healing. This the key to our own power, the power to create a NEW reality!
|
2024-04-09T01:26:36.242652
|
https://example.com/article/9086
|
Purple Hello Kitty Flower Badge Reel & Rhinestone Lanyard Set
A Reel Cute Set
SIZZLE CITY is the leader in custom retractable ID badge reels for a reason. We’ve paved the way in style, selection and quality and we are proud to present you with another amazing choice for your custom retractable ID badge reel needs at unbeatable prices!
These one-of-a-kind SIZZLE CITY custom retractable ID badge reel designs are sure to steal the show and bring life, style and pizazz to any old boring ID badge. Bring the party with you to work, on a special event, to a concert or just running everyday errands – these custom ID badge reels are amazing!
Be sure to check out the SIZZLE CITY shop for more custom badge reel designs!
SEARCH THE SHOP
Search for:
BLING RHINESTONE LANYARDS
YOUR CART
HAPPY CUSTOMERS
We work for the TSA so we are required to wear ID badges on the job. If your job requires you to wear an ID badge then you’re going to need a pull reel to keep your ID presented with style. SIZZLE CITY Shop is the only place I buy my pull reels. These ladies […]
I can’t believe the quality of the spring bling infinity scarves I purchased from your shop – why are they so inexpensive compared to department stores? I am VERY happy with all of my purchases. Thank you so much for EVERYTHING!
|
2024-04-25T01:26:36.242652
|
https://example.com/article/5839
|
All your best friend needs for the beach this summer
When you take your best friend to the beach this summer, you need a few essentials! A fetch toy, some poo bags, a holder, and some wax! Surfdog has put them all together in a great little dog sized waterproof beach bag ready to go!
Great for a gift for those hard to buy for dog lovers!
The bag contains:
72 Poop bags to keep our beautiful beaches clean. The best poop bags you can buy- with handles, mind distracting logo, and environmentally friendly features to ensure they cause the least impact on our amazing environment!
Surfdog Pookey Bag - the only way to carry your poop bags, keys, treats or a little cash for morning coffee!
The famout Bazza/Shazza "save me! throw toy - to turn your dog into a life saver! (although they are proving increasingly popular with kids too!).
After beach Soothing Wax to soothe beach weary paws and noses.
It's the perfect gift pack for your best mate... or your friends best mate.... no sizes to worry about just the coolest collection of dog beach accessories! Save over $10 from buying the items individually.
Roxy absolutely loves the Bazza doll and brings him back to the beach every time. The pouch is handy and great to clip to the lead. The poo bags, however, are tough to break off from the roll. Two out of four so far have also split down the middle before use. Jill, Hobart TAS
Posted by Jill
4/5
Roxy absolutely loves the Bazza doll and brings him back to the beach every time. The pouch is handy and great to clip to the lead. The poo bags, however, are tough to break off from the roll. Two out of four so far have also split down the middle before use.
302
Quick Despatch, Flat Rate Delivery, FREE Regular Delivery over $200
We despatch most orders on the same day you place your order. We strive to make your delivery faster than you can get anywhere else online. We'll provide you with a tracking number so you can track your delivery online.
Order before 2pm to ensure your order goes out today.
Regular Delivery by Australia Post Parcel Post is $9.95.
Here is a guide to delivery times: Sydney, Melbourne, Brisbane: 2-3 days Country NSW, Country VIC SE QLD, Adelaide, Hobart: 3-5 days Darwin, Perth, Northern QLD, Country SA, Tasmania: 4-6 days Country WA, NT: 5-7 days
Express Delivery by Australia Express Post is $14.95.
Express Post delivery is guaranteed next business day within the Express Post network. The Express Post network covers most metropolitan areas accross the country.
If you aren't sure if your address is within the network you can check on the Auspost website.
Outside Australia
If you would like delivery outside Australia, we are happy to post things out to you. Please contact us for the shipping rates to your area.
Easy 100 Day Returns
We want your dog to be comfortable. And we want you to be worry free.
That's why we make returns so easy.
If you purchase an item that is not the right size or fit, we are more than happy for you to return it for a refund as long as it is returned in a new, resalable condition with all packaging intact within 100 days.
Just pop the item back to us in the post along with a note explaining the reason for return and we will refund your original purchase as soon as we receive the item you return.
You can place a new order for the correct size / fit item on the website anytime. No fuss, no waiting.
It's that easy.
Feel free to give us a ring on 1300 725 781 if you have any questions about sizing. We're here to help.
|
2023-11-22T01:26:36.242652
|
https://example.com/article/6746
|
<!--start-code-->
```js
const instance = (
<DatePicker
format="yyyy-MM-dd HH:mm:ss"
ranges={[
{
label: 'Now',
value: new Date()
}
]}
/>
);
ReactDOM.render(instance);
```
<!--end-code-->
|
2023-08-10T01:26:36.242652
|
https://example.com/article/2860
|
Green House Seeds
Discreet Worldwide Shipping
why choose Green House Seeds
About Green House Seeds
Thanks to the high quality of their products and the innovative strains produced, Green House Seeds is now the most successful cannabis seed company on the planet. Holding no less than 40 High Times Cannabis Cups, they are the leaders in the cannabis seed industry like no other and the full range of Greenhouse cannabis seeds offer taste, quality and power like no other weed in the world.
Product Information
To this day Arjan, owner and founder of the cannabis seedbank Greenhouse Seeds and the proclaimed 'King of Cannabis', still works with his team of strain hunters to find the best new strains of cannabis being developed and incorporates them into the full range of feminised seeds. It doesn't matter where in the world the strains are coming from, if the smoke is good, the strain is strong and the plant can meet the high standards of the Greenhouse Seeds team, then you will find it incorporated into this fabulous brand of marijuana seeds. Choose a cup winner for a reliable smoke, like the Great White Shark which which was placed 1st in the HTCC cup in 1997. A blend of Super Skunk, Brazilian and South Indian that will lock you to the couch with it´s devastating Jaws like bite or try one of the new up and coming strains that will probably be the award winner of the future. Green House Seeds took their time to release a quality range of medicinal seeds so we know they have to be good, working mainly on their own solid genetics to raise the CBD level and reduce the THC level to bring to you some of the finest medical cannabis seeds out there so now everyone can grow their own medicine from Kings Kush CBD and The Church CBD to easy to grow automatics like Super Lemon Haze Auto CBD.
Green House Seeds Availability
Buy Green House Seeds at the Original Seeds Store in single pick and mix seeds and breeder packs of 3, 5 and 10. Bulk bundles are available to buy in packs of 20 – 200 and you can always be sure you are getting the best price for your smoke.
free seeds
Now you can choose your own!Get free seeds with every order. Add up to 24 seeds for free !Top Strains from Big Brands!
DISCLAIMER
This website is intended for persons over 18 years only, this is required for the purchase of any products from our cannabis seeds bank. The cultivation of cannabis seeds is illegal in most countries. For
this reason we advise you to seek information on the laws in your country before purchasing cannabis seeds. Original Seeds will not send seeds where it is illegal to do so but accept no responsibility
if your countries laws do not allow the import of cannabis seeds. We cannot always monitor the changing laws around the world. Original Seeds does not accept ant Liability for any misuse of our seeds.
Seeds are sold as collector’s items only. All product information and descriptions are taken from information supplied by the manufacturer and are not verified or endorsed by Original Seeds.
Original Seeds ( The Original Seeds Store ) does not encourage anyone to break the law in any way. All images, videos and content are for educational purposes only.
Content for people of 18 years of age or older, entering originalseedsstore.com is reserved for people at the age of majority. In the UK, the age of majority is 18 years old, check your local laws and respect them.
originalseedsstore.com is not responsible for the misuse or illegal use according to the law of each country regarding the traded products. Our online store complies with UK law.
|
2023-08-23T01:26:36.242652
|
https://example.com/article/8595
|
Watch!Missile trail picture taken near the seperatist held town of Torez:Dialogue:TranslationIgor Bezler: We have just shot down a plane. Group Minera. It fell down beyond Yenakievo.Vasili Geranin: Pilots. Where are the pilots?IB: Gone to search for and photograph the plane. It's smoking.VG: How many minutes ago?IB: About 30 minutes ago.40 Minutes Later:“Major”: These are Chernukhin folks shot down the plane. From the Chernukhin check point. Those cossacks who are based in Chernukhino.“Greek”: Yes, Major."Major": The plane fell apart in the air. In the area of Petropavlovskaya mine. The first “200” (code word for dead person). We have found the first “200”. A Civilian.Greek: Well, what do you have there?Major: In short, it was 100 percent a passenger (civilian) aircraft.Greek: Are many people there?Major: Holy sh*t! The debris fell right into the yards (of homes).Greek: What kind of aircraft?Major: I haven’t ascertained this. I haven’t been to the main sight. I am only surveying the scene where the first bodies fell. There are the remains of internal brackets, seats and bodies.Greek: Is there anything left of the weapon?Major: Absolutely nothing. Civilian items, medicinal stuff, towels, toilet paper.Greek: Are there documents?Major: Yes, of one Indonesian student. From a university in Thompson. Fuck.Final Call:Rebel: Regarding this plane that was downed in the Snizhne-Torez area. It turned out to be a passenger aircraft. It fell near Grabovo. A lot of bodies of women and children. Now the Cossacks are looking at all that.Rebel: The TV said it was AN-26. A Ukrainian cargo plane. But Malaysia Airlines is written on it. What was it doing on Ukraine’s territory?Cossack commander: It means they wanted to bring some spies to us. Fuck them. They should not fly, we are at war here.Read more at www.liveleak.com/view?i=37e_1405626526#EdhWbXBgThqjyTKB.99
|
2024-02-20T01:26:36.242652
|
https://example.com/article/5006
|
Vitamin A is necessary not only for prevention of xerophthalmia but also for preserving integrity and maintaining the function of several organs in the body. Available evidence has established the role of vitamin A in preventing childhood morbidity and mortality.\[[@CIT1][@CIT2]\] Vitamin A deficiency is a major cause of morbidity and mortality in India and other developing countries.\[[@CIT3]\] An estimated 5.7% children in India suffer from eye signs of vitamin A deficiency.\[[@CIT4]\] Although, vitamin A deficiency can occur in any age group, the most serious effects are usually seen in the preschool children.\[[@CIT5]\] Vitamin A requirement in the fast-growing age group of two to four years is the greatest since dietary intake is precarious and illnesses such as diarrhea, acute respiratory tract infection and measles, which deplete vitamin A reserves, are common. Currently, vitamin A deficiency is considered to be a public health problem in selected geographical areas in India with superimposed wide variations within the regions.
Heartily, there is a scientific evidence of declining trends of vitamin A deficiency in the country.\[[@CIT6]\] Under vitamin A supplementation program that is integrated through Reproductive and Child Health (RCH) program and now National Rural Health Mission (NRHM), children between nine and 36 months of age are to be provided with vitamin A solution every six months starting with 100,000 IU at nine months of age with measles vaccination and subsequently 200,000 IU every six months till 36 months of age. With rapid urbanization in India and one of the highest growth rates in the world, around 27.8% of the population is forced to reside in urban slums (Census 2001). As the slums are considered to be high-risk areas in terms of healthcare delivery, an attempt was made to determine vitamin A-first dose coverage amongst children (12--23 months) residing in slums of Delhi and to explore its association with selected variables.
Materials and Methods {#sec1-1}
=====================
The 30-cluster sampling technique based on probability proportional to size advocated by the World Health Organization (WHO) was used to assess coverage of vitamin A-first dose supplement.\[[@CIT7]\] Out of 12 municipal zones in Delhi, one was selected randomly i.e. south municipal zone. List of all the slum clusters existing in the south municipal zone was procured from the municipal office ([Annexure I](#APP1){ref-type="app"}). The approximate population residing in these slum clusters was 4,29,130. A cluster sampling is a two-stage random sampling technique i.e. selection of cluster and identification of children in the selected cluster. Steps involved were listing of slum clusters along with their population; calculating cumulative population for each cluster; determining sampling interval; selecting a random number which was less than or equal to sampling interval; this represented the first cluster; by adding sampling interval to the selected random number, second and then subsequent clusters were selected. A total of 30 such clusters were chosen this way. After selection of a cluster, first household was selected randomly and then subsequent household using right hand approach. From each selected slum cluster, seven eligible children were covered thus making a total sample size of 210 (30 × 7). Resident children in the age group of 12--23 months who were born between the reference period of October 1, 2003 and September 30, 2004 were enumerated from each household. Based on the documentary evidence/recall of mother regarding vitamin A-first dose received by the eligible child, data was recorded in the pre-structured proforma ([Annexure II](#APP2){ref-type="app"}). Selected information related to religion, sex, place of birth, birth order, immunization status and education of mother was also recorded. Data was collected during October-November 2005 by a single investigator and analyzed by calculating percentages and degree of association (chi-square test) using SPSS software.
Results {#sec1-3}
=======
Of the total eligible subjects contacted, only one refused to participate in the study. Hence, next eligible child was contacted in the same cluster. Out of 210 study subjects, there were 175 (83%) Hindu and the rest were non-Hindu. There were 120 (57.0%) male and 90 (43.0%) female children amongst study subjects. Nearly three-fifth (126) children were born at home with the rest (84) in health institutions. The birth order of children was one, two, three (or above) as 64 (30.4%), 63 (30.0%) and 83 (39.6%) respectively. There were nearly 50.0% children fully immunized for vaccine-preventable diseases up to the age-of-one year whereas 23% were never taken for immunization. There were 74 (35%) mothers who were literate.
It was observed that only 79 (37.6%) children out of 210 had received vitamin A-first dose supplement in the community [Table 1](#T0001){ref-type="table"}. Further analysis of 79 children was carried out with regard to selected variables. This showed that 71 (89.9%) were Hindu and eight (10.1%) were non-Hindu (*P* = 0.04). Nearly 44 (55.7%) males and 35 (44.3%) females had received vitamin A (*P* = 0.74). The proportion of children born in health institutions who received first-dose (57%) of vitamin A supplementation was significantly higher than children born at home (43%) (*P* \< 0.001). Similarly, higher proportion of children with birth order-one (48.1%) in comparison to birth order-three or above (26.6%) had received vitamin A (*P* \< 0.001).
######
Association of vitamin A-first dose coverage with selected variables
Variable YES n=79 (%) NO n=131 (%) χ^2^ value *P* value
------------------------------------------------------------------------------------- -------------- -------------- ------------ -----------
Religion
Hindu 71 (89.9) 104(59.4) 3.90 0.048
Non-Hindu 8(10.1) 27(77.1)
Sex
Male 44 (55.7) 76 (63.3) 0.10 0.742
Female 35 (44.3) 55(61.1)
Place of birth
Health institution 45 (57.0) 39 (46.4) 15.18 \<0.001
Home 34 (43.0) 92 (73.0)
Birth order
1 38(48.1) 26(19.9) 19.20 \<0.001
2 20 (25.2) 43 (32.8)
3 or above 21 (26.6) 62 (47.3)
Immunization status
FI[\*](#T000F1){ref-type="table-fn"} 74 (93.7) 30 (22.9) 37.52 \<0.001
PI[\*\*](#T000F2){ref-type="table-fn"} or NI[\*\*\*](#T000F3){ref-type="table-fn"} 5 (6.3) 101 (77.1)
Education status of mother
Literate 38(48.1) 36 (27.5) 9.18 0.002
Illiterate 41 (51.9) 95 (72.5)
FI (Fully immunized),
PI (Partially Immunized),
NI (Non-immunized) column %
The child can receive vitamin A-first dose independent of immunization status, however, from the point of view of operational feasibility, a child is administered the first dose along with measles vaccine. It was noted that 30 children though fully immunized for vaccine-preventable disease up to age-one had not received vitamin A-first dose supplement. The proportion of children receiving vitamin A was slightly higher for illiterate mothers (51.9%) than literate mothers (48.1%). However, overall relationship of literacy status and vitamin A was found to be statistically significant (*P* \< 0.001).
Discussion {#sec1-4}
==========
India was one of the first countries in the world to have launched a vitamin A supplementation (VAS) program. In spite of this leadership role of the country in initiating the program, vitamin A-first dose supplement coverage was found to be low (37.6%) in this study. When vitamin A-first dose supplement was analyzed along with other selected variables a significant association was found amongst Hindu child, born in health institution, and with birth order one, suggestive of higher level of awareness, motivation, and/or better socioeconomic status.
A review of literature corroborated the observation of low vitamin A supplementation coverage. Rapid Household Survey (RHS) reported similar results with coverage at 35%.\[[@CIT8]\] According to the National Family Health Survey (NFHS-3), Delhi recorded a low coverage of 17.1% of the children having received vitamin A dose in the last six months (2005--06). Taneja reported that only 37.8% children in Delhi had received vitamin A first-dose supplement.\[[@CIT9]\] Annual report of ministry of health and family welfare, GoI (2005--06) also mentioned the coverage of vitamin A first dose as 44%. It is noted that over the years no improvement in vitamin A coverage in Delhi has been observed. Further, it was noted that even though 30 children were completely immunized for vaccine-preventable disease up to the age of one, they had not received vitamin A supplement, suggestive of missed opportunity. This further corroborates the fact that "access" to health system does not necessarily translate into delivery of quality services to beneficiaries.
A large proportion of the Indian population receives less than 50% of the recommended dietary intake of vitamin A from dietary sources.\[[@CIT10]\] In the absence of improved dietary intake or fortification strategy, it is clear that vitamin A supplementation is a necessary intervention to compensate for the shortfall in recommended dietary allowance, especially for the community residing in slums. To conclude, the study reflects low vitamin A-first dose coverage in children residing in the slums of Delhi and requires appropriate corrective measures.
**Source of Support:** Nil
**Conflict of Interest:** None declared.
######
Slum clusters in south municipal zone, Delhi
Name/address of slum clusters Pop. Cum. Pop.
------------------------------- ------------------------------------------------- ----------- ----------
1 Indira Gandhi Camp, Block A, Begampur 3000 3000
2 Indira Gandhi Camp, Block B, Begampur 4416 7416
3 Lai Gumbad Camp, Malviya Nagar 2000 9416
4 Valmiki Camp, Begampur 1200 10616
5 Harizan Camp, Begumpur 2500 \*13116
6 Jugdamba Camp, Block-A, Malviya Nagar 2556 15672
7 Jugdamba Camp, Block-B, Malviya Nagar 1444 17116
8 Soami Nagar, Jhuggis 1015 18131
9 Guluk wall Maszid, Jhuggis 1207 19338
10 Jamrud Pur, Jhuggis 3555 22893
11 Madrasi Camp, L Block, Kailash Colony 650 23543
12 JJ Cluster Mohammadpur 2000 \*25543
13 JJ cluster Arjun Nagar 4500 30043
14 Dr. Ambedkar Basil, Block-A, Sect-l, RK Puram 2250 32293
15 Dr. Ambedkar Basil, Block-B, Sect-l, RK Puram 3352 35645
16 Dr. Ambedkar Basil, Block-C, Sect-l, RK Puram 5602 \*41247
17 J.D Leprosy colony, sect-1, RK Puram 215 41462
18 Hanuman Camp, Sector-l, R.K. Puram 1500 42962
19 Ravldass camp, sector-1 , RK Puram 1200 44162
20 Nepali Camp, sect-1 , RK Puram 560 44722
21 Ekta Vihar, Sector-VI, R.K.Puram 3000 47722
22 JPCol. Nehru Ekta Camp, Sect-VI, R.K.Puram 2500 50222
23 J.J. Colony, Malai Mandir, Sect-VII, R.K.Puram 1000 51222
24 Sonia Camp, Sector-VII, R.K.Puram. 1000 52222
25 K.D. Colony, Block-1,Sector-XII, R.K. Puram 3359 \*55581
26 K.D. Colony, Block-2,Sector- XII, R.K. Puram 1547 57128
27 K.D. Colony, Block-3,Sector- XII, R.K. Puram 1210 58338
28 K.D. Colony, Block-4,Sector- XII, R.K. Puram 4100 62438
29 Shastri Market. JJ Cluster, Block A, Nanak Pura 3000 65438
30 Sashtri Market. JJ Cluster, Block B, Nanak Pura 2500 67938
31 Bhanvarsingh camp, Vasant vihar 1500 \*69438
32 Khanpur Extension 2500 71938
33 J.J. Colony, Block A, Khanpur 2500 74438
34 J.J. Colony, Block B, Khanpur 1400 75838
35 J.J. Colony, Block C, Khanpur 1500 77338
36 J.J. Colony, Block D, Khanpur 2000 79338
37 Ambedkar Colony 2500 81838
38 Nutt colony, Chhattapur Extension 2700 \*84538
39 Harsarup Colony 2500 87038
40 Bhlm Bastl, Jaunapur 4000 91038
41 Shantl Camp, Mandl Gaon 3000 94038
42 Bapu camp, Mandl Gaon 2100 96138
43 Shambu camp Mandi Gaon 3250 \*99388
44 Aya Nagar Extension 3500 102888
45 Janta Jiwan Camp, Block A, Devil Road, Tigri 2500 105388
46 Janta Jiwan Camp, Block A-1 , Devil Road, Tigri 2250 107638
47 Janta Jiwan Camp, Block B, Devil Road, Tigri 2230 109868
48 Janta Jiwan Camp, Block B-1 , Devil Road, Tigri 2563 \*112431
49 Janta Jiwan Camp, Block C Devil Road, Tigri 2541 114972
50 Janta Jiwan Camp, Block C-1 , Devli Road, Tigri 2252 117224
51 Janta Jiwan Camp, Block D, Devli Road, Tigri 2290 119514
52 Janta Jiwan Camp, Block D-1 , Devli Road, Tigri 3000 122514
53 Janta Jiwan Camp, Block E, Devli Road, Tigri 3500 \*126014
54 Janta Jiwan Camp, Block E-1, Devli Road, Tigri 2500 128514
55 Janta Jiwan Camp, Block-F, Devli Road, Tigri 2460 130974
56 Janta Jiwan Camp, Block-F-1 , Devli Road, Tigri 1453 132427
57 Janta Jiwan Camp, Block-G, Devli Road, Tigri 1211 133638
58 Janta Jiwan Camp, Block G-1 , Devli Road, Tigri 1200 134838
59 Janta Jiwan Camp, Block-H, Devli Road, Tigri 1200 136038
60 J.J. Colony, Block-1 , Tigri 2800 138838
61 J.J. Colony, Block-2, Tigri 2565 \*141403
62 J.J. Colony, Block-3, Tigri 2400 143803
63 J.J. Colony, Block-4, Tigri 2100 145903
64 J.J. Colony, Block-5, Tigri 2366 148269
65 J.J. Colony, Block-6, Tigri 2300 150569
66 J.J. Colony, Block-7, Tigri 2890 153459
67 J.J. Colony, Block-8, Tigri 3100 \*156559
68 J.J. Colony, Block-9, Tigri 3111 159670
69 J.J. Colony, Block-10, Tigri 3500 163170
70 J.J. Colony, Tigri Extension 2800 165970
71 JJ colony, Block A, Sangam Vihar 6500 \*172470
72 JJ colony, Block B, Sangam Vihari 7000 179470
73 JJ colony, Block C, Sangam Vihar 6257 \*185727
74 JJ colony, Block D, Sangam Vihar 6600 192327
75 JJ colony, Block E, Sangam Vihar 7566 \*199893
76 JJ colony, Block F, Sangam Vihar 7410 207303
77 JJ colony, Block G, Sangam Vihar 6500 \*213803
78 JJ colony, Block H, Sangam Vihar 6660 220463
79 JJ colony, Block I, Sangam Vihar 7565 \*228028
80 JJ colony, Block J, Sangam Vihar 7555 235583
81 JJ colony, Block K, Sangam Vihar 8200 \*243783
82 JJ colony, Block L, Sangam Vihar 7775 251558
83 JJ colony, Block M, Sangam Vihar 7532 \*259090
84 JJ colony, Block A, Dakshin Puri 6880 265970
85 JJ colony, Block B, Dakshin Puri 6880 \*272850
86 JJ colony, Block C, Dakshin Puri 6333 279183
87 JJ colony, Block D, Dakshin Puri 7112 \*286295
88 JJ colony, Block E, Dakshin Puri 7533 293828
89 JJ colony, Block F, Dakshin Puri 7755 \*301583
90 JJ colony, Block G, Dakshin Puri 7850 309433
91 JJ colony, Block H, Dakshin Puri 7880 \*317313
92 JJ colony, Block I, Dakshin Puri 7230 324543
93 JJ colony, Block J, Dakshin Puri 7521 \*332064
94 JJ colony, Block K, Dakshin Puri 6711 338775
95 Harijan camp Khanpur 1236 \*340011
96 Shri Ram Camp, South Camp 3100 343111
97 Moti Lai Nehru Camp, J.N.U 3560 346671
98 Indira Camp, Bhatti Mines 2850 349521
99 Balbir Nagar, Bhatti Mines 3400 352921
100 Sanjay Camp-1 , Bhatti Mines 3190 \*356111
101 Sanjay Camp-2, Bhatti Mines 1750 357861
102 Sanjay Camp-3, Bhatti Mines 4002 361863
103 Sanjay Camp-4, Bhatti Mines 4934 366797
104 Sanjay Camp-5, Bhatti Mines 1100 367897
105 Shaheed camp, Dakshin Puri 1047 \*368944
106 Sanjay camp, Dakshin Puri 3963 372907
107 Subhash camp, Dakshin Puri 5740 378647
108 Dalit camp, G block, Dakshin Puri 300 378947
109 Banjara camp, Dakshin Puri 850 379797
110 Harijan camp, lal building, Dakshin Puri 1120 380917
111 Kalyan Samiti Camp, Dakshin Puri 630 381547
112 J.J. Colony, Block-1 , Dakshin Puri 2000 \*383547
113 J.J. Colony, Block-2, Dakshin Puri 2500 386047
114 J.J. Colony, Block-3, Dakshin Puri 2530 388577
115 J.J. Colony, Block-4, Dakshin Puri 2360 390937
116 J.J. Colony, Block-5, Dakshin Puri 2133 393070
117 J.J. Colony, Block-6, Dakshin Puri 2500 395570
118 J.J. Colony, Block-7, Dakshin Puri 2140 \*397710
119 J.J. Colony, Block-8, Dakshin Puri 2400 400110
120 J.J. Colony, Block-9, Dakshin Puri 2200 402310
121 J.J. Colony, Block-10, Dakshin Puri 2230 404540
122 J.J. Colony, Block-11, Dakshin Puri 2500 407040
123 J.J. Colony, Block-12, Dakshin Puri 2340 409380
124 J.J. Colony, Block-13, Dakshin Puri 2511 411891
125 J.J. Colony, Block-14, Dakshin Puri 2496 \*414387
126 J.J. Colony, Block-15, Dakshin Puri 2477 416864
127 J.J. Colony, Block-16, Dakshin Puri 2500 419364
128 J.J. Colony, Block-17, Dakshin Puri 2541 421905
129 J.J. Colony, Block-18, Dakshin Puri 2311 424216
130 J.J. Colony, Block-19, Dakshin Puri 2403 \*426619
131 J.J. Colony, Block-20, Dakshin Puri 2511 429130
Sampling interval 429130/30=14304
Random no. 10866
Selected slum clusters (N= 30)
**Name of the Institute**.................................\[*National Institute of Health and Family Welfare, New Delhi*\]
D.O.B (eligible child): Household no:Religion \[Hindu/Non-Hindu\]Literacy status of mother \[Literate/Illiterate\]:Place of birth \[Health Institution/home\]:Sex \[M / F\]:Birth order:Child taken for immunization \[Yes/No\]:Immunization status up to age-one \[√\]:Complete:Partial:Non-immunized:Vitamin A-first dose supplement received \[Yes/No\]: Put \[√\] where applicable:
BCG DPT OPV Hepatitis B Measles Vitamin A-I
----- ----- ----- ------------- --------- ------------- --- --- --- --- --- --- -- --
1 2 3 0 1 2 3 0 1 2 3
|
2023-08-10T01:26:36.242652
|
https://example.com/article/7702
|
This year my goal is to grow 2,000 pounds of fresh fruits and vegetables. I think I can do it. With 16 raised garden beds, a greenhouse, a raspberry patch and a few more planting beds sprinkled throughout our property, I think growing 2,000 pounds of food is an attainable goal. Even if I do live right in the middle of high maintenance suburbia.
Sweet potato slips were planted this week. This is our first year growing them. If you have any advise about growing sweet potatoes I should know about, please leave a comment below. ♥Mavis
~~~~~~~~~~~~~~~~~~~
I have spent a total of $$414.90 on seeds, soil, plants and supplies for this year.
This year my goal is to grow 2,000 pounds of fresh fruits and vegetables. I think I can do it. With 16 raised garden beds, a greenhouse, a raspberry patch and a few more planting beds sprinkled throughout our property, I think growing 2,000 pounds of food is an attainable goal. Even if I do live right in the middle of high maintenance suburbia.
I believe people have lost touch with what the term “fresh produce” really means. Fresh produce is not something that has been flown in from 1,500 miles away and has been sitting on a grocers shelf for five days. The true meaning of “fresh produce” in my opinion, is walking out your back door and harvesting your own food.
Real food does not come in a box nor does it need an ad campaign. Real Food does not come with a rebate, or an incentive to buy. One bite of an heirloom tomato on a warm summers day is all the convincing you’ll need to keep coming back for more.
Real food will sell itself, hands down, any day of the week.
~~~~~~~~~~~~~~~~~~~
I have spent a total of $412.40 on seeds, soil, plants and supplies for this year.
Today was the first day since I began my little adventure/wish of trying to grow 2,000lbs of garden produce that I thought I might actually be able to do this, like for real. Sure I’ve had a garden before, but were talking a few tomato, cucumber, pumpkin and maybe bean plants. Nothing like what I’ve got going on this year. Not even close.
I started the day by harvesting 6lb 10 oz. of shelling peas, checked in on the chickens, then went down to my neighbor’s yard (who’s moving tomorrow) and planted her 4 garden boxes with beans, carrots, squash, radish, and 18 cabbage. I’ll be going back in a few more days to plant the parsnips. I know I’m taking a bit of a gamble with planting in her backyard boxes because if her house sells before I can harvest…. well let’s just say the new homeowners will be picking their own dinner.
I was able to harvest 1lb 4 oz of sage and 12oz of oregano from her herb box {she was going to pull them out if I wasn’t going to use it} and then came home and washed and bundled up the herbs for drying. I was also able to pick a few strawberries and 1lb 6 oz of wild salmon berries as well. All in all, a good day.
I’m beginning to think that if I had to grow all our food we would starve to death. Today’s harvest? 2 oz radish, 2 oz lettuce and 1 oz broccoli. Maybe growing 2,000lbs of garden produce is going to be harder that I thought.
This post may contain affiliate links. These affiliate links help support this site. For more information, please see my disclosure policy. Thank you for supporting One Hundred Dollars a Month.
Yippee! Something else for me to plant! The seed potatoes arrived today from Seed Savers. I like surprises so I ordered the 20lb sampler. I don’t know if I’m more excited about the potatoes or the cute little muslin bags they came in. I can’t wait to re-use them. I received 2.5lbs of each of the following varieties: All Blue, Yukon Gold, La Ratte, Purple Viking, Kerr’s Pink, Red Gold, All Red & Austrian Crescent. I’ll keep you posted on how they grow!
This post may contain affiliate links. These affiliate links help support this site. For more information, please see my disclosure policy. Thank you for supporting One Hundred Dollars a Month.
|
2023-10-06T01:26:36.242652
|
https://example.com/article/1781
|
Neck Pain
Neck pain is a common problem, with two-thirds of the population having neck pain at some point in their lives.
Neck pain is most often caused by spinal problems. This can often come in conjunction with muscle tightness, inflammation and nerve irritation.
The head (roughly the weight of a bowling ball) is supported by the lower neck and upper back, and it is these areas that commonly cause neck pain. The top three joints in the neck allow for most movement of your neck and head. The lower joints in the neck and those of the upper back create a supportive structure for your head to sit on. If this support system is affected adversely, then the muscles in the area will tighten, leading to neck pain.
Minor and Major
Generally, we see two types of neck pain cases. Minor neck and shoulder pain involve sensations of discomfort, stiffness or soreness. If these symptoms last for more than a day or so, occur frequently or were preceded by an accident or some type of injury, we consider it major.
Response to Stress
We often feel like pain comes only from physical problems. Emotional and chemical stress can often (and generally the most common causes) cause neck and shoulder pain. This is where many people “carry their stress.” It’s also a very overlooked evil-doer.
As always, pills and medications simply mask the pain and don’t treat the underlying cause!
Consult Our Practice
We see this sort of thing all the time. It’s almost routine. Chiropractic care has a history of producing excellent results with those suffering from neck pain. And we do it naturally, without drugs or surgery.
At Zannetti Chiropractic we specialize in reducing interference to the nervous system in the neck. Many of our practice members find that chiropractic care gives them relief from both minor and major neck pain complaints.
Call our office to schedule a no-obligation consultation and find out if you’re a good candidate for today’s safe and natural chiropractic care.
|
2024-02-21T01:26:36.242652
|
https://example.com/article/7886
|
Your……Call
I recently ran across some article that just seem to fit together. And while the country wasn’t America, the discussions are certainly ones that have taken place in America.
The article that caught my eye was in an Israeli newspaper. I know, you’re dumbfounded, right?
It’s about a group of German women that are rising up against the government. Quite similar to the American protest in that it’s women protesting their treatment at the hands of men. While American women walk around with silly pink hats on their heads and offensive signs to show how liberated and feminist they are, they protest against (mostly it seems) about the election of a man who “said bad things”. Mind you they do this marching around fully in the daylight and in the open. They know as long as they don’t break any laws they won’t have any problems. So you can tell they are very brave in speaking out. Yes, I’m being sarcastic #NoForcedHijab. Even that paragon of courage Linda Sarsour didn’t go to Iran to support her sisters as they protest having been forced to wear a hijab.
‘Because of your immigration policies, we soon face a majority of young men who come from archaic societies with no women’s rights.’
……….
A study commissioned by the German government using data from Lower Saxony concluded that migrants “may be responsible” for most of Germany’s recent rise in violent crime. More than 90% of the increase was attributed to young male migrants.
“Because of your immigration policies, we are facing soon a majority of young men who come from archaic societies with no women’s rights. You knew that, and you accepted it. You knew that, you accepted it, and you abandoned us. You sacrificed us.”
A Pew study found that the Muslim population in Europe will continue to grow in the coming decades even if migration to the continent is completely halted.
……
“It can’t go on like this. Pepper spray and pocket alarms are already the basic equipment of European women. Going jogging has become the most dangerous sport for us.
So, it’s kind of like screaming in terror, except maybe the alarm can do it longer? Especially if the throat screaming for help is cut or a hand/s is/are clapped over the mouth doing the screaming for help.
Pepper spray, the other piece of standard equipment. How far will it spray? How long? Depends.
Regular pepper spray that probably most of the German women, and indeed European women sound like they are carrying are about a half ounce and will spray from 5 to 35 seconds with a reach of 5 to 12 feet. And you hope the wind isn’t against you. But you can get a foam spray.
You could go with bear pepper spray. With that you will get almost a 8 oz can, but it while it will only last 8 seconds, it will go 16 feet. Yeah, I’m not liking this one either.
What if the wind is against you, or more come after the fight ensues?
Now I’m sure they would prefer you do the “civilized” thing in a country that is becoming most uncivilized towards women. Just “call the police”. From this report the time till your emergency call is answered is 3 to less than 30 seconds. Response time seems to range from 8 to 15 minutes, a quarter of an hour. You know, a quarter of an hour is a long time to wait while you scream at the top of your lungs for help and watch as your pepper spray is empty and your attackers are now pissed. And still there, just out of reach of the pepper spray. They in the meantime have used their cellphones to “phone a friend”. Think you will still be there 12 minutes later when the police arrive?
Two years after your chancellor decides to admit over 1 million undocumented middle-eastern immigrants to boost the economy and instead gets a series of terrorist attacks in return, this is the outcome: “Germans are taking up arms of angst.”
………
There is a growing feeling that the state cannot sufficiently protect its citizens and therefore they must protect themselves. Recent cuts to the police force contributed to the problem.
No kidding? Ya think?
But Germany has very strict gun control laws, to keep everyone safe, of course. So they can pretty much only buy non-lethal weapons. But as in America, there are those that are telling the women that getting a gun is not the way to go.
However, Holger Stahlknecht, state interior minister in Saxony-Anhalt, isn’t convinced. He worries about the current trend and warns that arming oneself with small weapons can lead to a false sense of security. “Obviously, people believe they are buying safety with a small gun license,” he said.
“However, this sense of security is deceptive, since these weapons could escalate a situation and could even be used against the owner.”
Well, #1 Old Holger Stahlknecht is a government minister. And as I recall from another column I did, the government doesn’t appreciate anyone speaking out publicly against their “poor refugees”. So. And #2, Old Holger IS a man. Not so sure he is in sync here with the women who fear attack from his government’s policies.
Now I’ve heard the 9mm is called the European .45, so lets just look at the 9mm caliber cartridge. Looks like it’s roughly 980 to 1600 ft/sec.
Huh, how about that. And it doesn’t matter which way the wind is blowing, it’s unlikely to end up in your face. There is a good chance once you produce the delivery mechanism they may decide to go for easier pickings. Like maybe Old Holger, or Nanny Angela Merkel? Oh, wait no, they have government paid for security. Just women those in the video don’t.
The German government killed 6 million Jews, and 5 million dissents, gays, gypsies and assorted others. Now the German government chose to import millions of people that threaten the lives, liberty and way of life in Germany. Maybe some day the German government will learn, not all things are the same. Maybe some day they will learn to tell good from evil, right from wrong. Today apparently, isn’t that day.
There are a variety of ways to respond to the threats, it’s your call.
Sure is funny. The German people, mostly women, are arming up, and the American people, mostly women, are trying to get other American’s to disarm. Something seems a little backwards here. Oh, I forgot, America has a disease that is spreading, called liberalism. It must be that it is spread mostly through contact, and also is confined to most Universities. It thrives mostly along both coasts, while the middle part of the country tends to be immune.
Those are things that also strike me. In Iran, women are risking torture and death to be rid of the forced hijab, when I say they are brave to tie their hijab to a pole and stand on a street corner and wave it, they are! But in America? Women WANT to wear them to show they are “liberated”. Indeed. Liberated from common sense. German women are crying out for the protection that could come from being armed but they are essentially disarmed by their governmental nannies. A protection American liberal women not only throw away, but try to have removed from women that are smarter. I understand Justin Beibe….er Trudeau recently said Sharia is compatible with democracy. That should be reassuring to Canadians. And yes, that video of Jimmy Atkkison of Sweden is wonderful. I think it’s already to late for Sweden, but they have to try. Appointing a Pakistani as Culture minister was the wrong way to go. Especially as he admits he knows not much about Sweden. https://www.frontpagemag.com/fpm/269244/sweden-appoints-pakistani-muslim-head-national-robert-spencer All of Europe seems to be in a race to see who can commit cultural, economic suicide and have the highest casualty and rape statistics due to “refugees”. Sadly it is a race in which the “winner” will be the “loser” and the first to die.
|
2024-01-19T01:26:36.242652
|
https://example.com/article/7634
|
News
CME: Cattle Move Lower as Boxed Beef Hits $208 High
16 May 2013
US - Live cattle futures probed higher in early trading on rising dressed beef prices but then lost ground in sympathy with the general selloff in commodities and rise in the US dollar.
Live cattle finished 55 cents to 90 cents lower and near the Wednesday's lows. Choice boxed beef moved substantially higher to a record high of $208.18 this morning, up $2.09, write ProFarmer commentators.
Importantly, movement improved to 144 loads. Meanwhile, cash trade seems to be stymied as feedlots hold out for higher prices than week-ago, while packers have been slow to establish bids.
June cattle closed sharply lower on the session and experienced the lowest close since April 15th. The market saw choppy to higher trade early on Wednesday and traded slightly higher on the day into the mid-session, write CME analysts.
The upside was limited by talk that record high beef prices could encourage consumers to shift to other meats. However, the market also found support from a new record high beef price posted on Tuesday and that this could help encourage packers to pay at least steady for cash this week.
Packer margins jumped on the beef move so packers have incentive to own live inventory. Steady this week would leave June near a $5.00 discount as compared with $1.00 as a normal discount for this time of the year. Open interest fell 6,416 contracts on Tuesday to the lowest level since January.
For the Cattle-on-Feed report, traders see placements for April up about 12-13 per cent from last year and marketings up 2-3 per cent which would leave May 1st on-feed supply down 3.5-4.0 per cent from last year.
Choice boxed-beef cut-out was up $2.09 at mid-session to $208.18 from $204.67 last week which marks a new all-time high.
|
2023-12-16T01:26:36.242652
|
https://example.com/article/7623
|
"""
This script adds accounts value, only if they are debtors
"""
request = context.REQUEST
portal = context.getPortalObject()
kw = dict(kwd)
kw['simulation_state'] = kwd.get('simulation_state', request.get('simulation_state'))
kw["section_category"] = kwd.get('section_category', request.get('section_category'))
at_date = kwd.get('at_date', request['at_date'])
kw['at_date'] = at_date.latestTime()
if request.get('account_id_list_conversion_script_id'):
account_id_list_conversion_script = getattr(portal, request['account_id_list_conversion_script_id'])
kw['node_category'] = account_id_list_conversion_script(account_id_list)
else:
kw['node_category'] = account_id_list
sum_ = 0.0
for inventory in portal.portal_simulation.getInventoryList(
group_by_node=1,
**kw):
if inventory.total_price > 0:
sum_ += inventory.total_price
return sum_
|
2024-05-15T01:26:36.242652
|
https://example.com/article/5256
|
package japicmp.test;
import japicmp.cmp.JarArchiveComparator;
import japicmp.cmp.JarArchiveComparatorOptions;
import japicmp.model.JApiChangeStatus;
import japicmp.model.JApiClass;
import org.junit.BeforeClass;
import org.junit.Test;
import java.util.List;
import static japicmp.test.util.Helper.getArchive;
import static japicmp.test.util.Helper.getJApiClass;
import static org.hamcrest.CoreMatchers.is;
import static org.junit.Assert.assertThat;
public class ClassTypeTest {
private static List<JApiClass> jApiClasses;
@BeforeClass
public static void beforeClass() {
JarArchiveComparator jarArchiveComparator = new JarArchiveComparator(new JarArchiveComparatorOptions());
jApiClasses = jarArchiveComparator.compare(getArchive("japicmp-test-v1.jar"), getArchive("japicmp-test-v2.jar"));
}
@Test
public void testClassToClass() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.ClassToClass.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.isBinaryCompatible(), is(true));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.getClassType().getOldType(), is("CLASS"));
assertThat(jApiClass.getClassType().getNewType(), is("CLASS"));
}
@Test
public void testClassToInterface() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.ClassToInterface.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("CLASS"));
assertThat(jApiClass.getClassType().getNewType(), is("INTERFACE"));
}
@Test
public void testClassToAnnotation() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.ClassToAnnotation.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("CLASS"));
assertThat(jApiClass.getClassType().getNewType(), is("ANNOTATION"));
}
@Test
public void testClassToEnum() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.ClassToEnum.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("CLASS"));
assertThat(jApiClass.getClassType().getNewType(), is("ENUM"));
}
@Test
public void testInterfaceToClass() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.InterfaceToClass.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("INTERFACE"));
assertThat(jApiClass.getClassType().getNewType(), is("CLASS"));
}
@Test
public void testInterfaceToInterface() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.InterfaceToInterface.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.isBinaryCompatible(), is(true));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.getClassType().getOldType(), is("INTERFACE"));
assertThat(jApiClass.getClassType().getNewType(), is("INTERFACE"));
}
@Test
public void testInterfaceToAnnotation() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.InterfaceToAnnotation.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("INTERFACE"));
assertThat(jApiClass.getClassType().getNewType(), is("ANNOTATION"));
}
@Test
public void testInterfaceToEnum() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.InterfaceToEnum.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("INTERFACE"));
assertThat(jApiClass.getClassType().getNewType(), is("ENUM"));
}
@Test
public void testAnnotationToClass() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.AnnotationToClass.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("ANNOTATION"));
assertThat(jApiClass.getClassType().getNewType(), is("CLASS"));
}
@Test
public void testAnnotationToInterface() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.AnnotationToInterface.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("ANNOTATION"));
assertThat(jApiClass.getClassType().getNewType(), is("INTERFACE"));
}
@Test
public void testAnnotationToAnnotation() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.AnnotationToAnnotation.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.isBinaryCompatible(), is(true));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.getClassType().getOldType(), is("ANNOTATION"));
assertThat(jApiClass.getClassType().getNewType(), is("ANNOTATION"));
}
@Test
public void testAnnotationToEnum() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.AnnotationToEnum.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("ANNOTATION"));
assertThat(jApiClass.getClassType().getNewType(), is("ENUM"));
}
@Test
public void testEnumToClass() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.EnumToClass.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("ENUM"));
assertThat(jApiClass.getClassType().getNewType(), is("CLASS"));
}
@Test
public void testEnumToInterface() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.EnumToInterface.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("ENUM"));
assertThat(jApiClass.getClassType().getNewType(), is("INTERFACE"));
}
@Test
public void testEnumToAnnotation() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.EnumToAnnotation.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.isBinaryCompatible(), is(false));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.MODIFIED));
assertThat(jApiClass.getClassType().getOldType(), is("ENUM"));
assertThat(jApiClass.getClassType().getNewType(), is("ANNOTATION"));
}
@Test
public void testEnumToEnum() {
JApiClass jApiClass = getJApiClass(jApiClasses, ClassType.EnumToEnum.class.getName());
assertThat(jApiClass.getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.isBinaryCompatible(), is(true));
assertThat(jApiClass.getClassType().getChangeStatus(), is(JApiChangeStatus.UNCHANGED));
assertThat(jApiClass.getClassType().getOldType(), is("ENUM"));
assertThat(jApiClass.getClassType().getNewType(), is("ENUM"));
}
}
|
2024-05-02T01:26:36.242652
|
https://example.com/article/8280
|
44 – the final flush of fertility
44 – the final flush of fertility (and documenting my pregnancy)
Napping with the girls
My second daughter will be here sometime between now and the next full moon. She’s feisty and strong and her kicks sometimes take my breath away. How awesome. ‘Awesome’ – that word is bandied about too much, usually to describe something slightly above mediocrity, but my husband Daniel and I are truly awestruck that my body has grown us another baby. We wonder who will arrive this time? For most of the last 4 ½ years we’ve just stared at Tulsi, hardly believing our luck that this magical creature is ours. And another one is nearly here . . .
Pregnancy is an everyday miracle. We can’t comprehend the trillions of complex decisions and manoeuvres that are unconsciously made within our pregnant bodies. It’s the stuff of Gods, way beyond our human understanding.
Daniel and I have had a long and complex journey with pregnancy, this is my 6th pregnancy and at 44 years old – really, truly, in the final flush of my fertility – we’ve been blessed with another girl. It’ll be Daniel and all his girls and all their tiaras.
Documenting my pregnancy
Astonished that we’ve got this far, I am keen to capture the experience. Once we dared trust that this was indeed a strong pregnancy we began to document it. From 17 weeks I took a ‘bumpie’ shot each week.
She had a good start, Goddessing in the American desert, absorbing ancient cacti karma . . .
There have been numerous pregnancy yoga photos, and last weekend we had enormously messy fun making a plaster cast of my tummy*.
I’d always really hoped to be able to experience pregnancy for a second time. The first time around I had done pregnancy training with the phenomenal Uma Dinsmore Tuli (famous for her groundbreaking book, Yoni Shakti) and since that time, I’d become, I suppose, a little bit more ‘womb centric.’ I began to really notice and value the power of female friendship and what happens when women support each other with kindness, empathy and humour (whether they have children or not).
The beauty and strength of women
I also enjoyed designing and executing our own goddess workshops, and contemplating women’s deeply creative and cyclical connection to nature. I loved teaching pregnancy yoga classes and watching new friendships blossom with growing babies.
And so, as this pregnancy has progressed, so has my sense of connection to mother earth and the miracle that’s happening within me – culminating in the weekend’s ‘project’, which involved Daniel digging a womb-like hole in the sand on the beach, me lying in it naked, and waiting for the waves to wash in. And it wasn’t in the tropics – it was at Saltburn, North Yorkshire. And no, the beach wasn’t deserted; it was well populated by dog walkers, because, well, that’s our reality isn’t it.
As this pregnancy has progressed, so has my sense of connection to Mother Earth.
I am not easy to say no to at the moment, and bless him, my husband is such a good sport, so my insistence of, ‘Daniel I just have to do this,’ meant that that’s just what had to happen.
While I was communing with Mother Earth and the elemental forces of nature and Daniel was taking my photo, I could hear him chatting merrily to passing locals, “Turned out nice again,” “Look what just got washed ashore,” “Yes, she was just like that when I got here,”. Oh my goodness, I do love him.
Weirdly I wasn’t embarrassed, not a jot. When I am pregnant all vanity disappears – I just exist in this state of awe, beguiled by the fact that my body is creating life, and I am utterly thrilled with my pregnant form – how astonishing it is! So what if some of the locals gawped, most walked on by in that true Yorkshire way of “Nowt to see here,” and those that did see – well then what a nice thing to look at and chat about over fish and chips.
Has it been easy? No of course not (life isn’t, I run a popular yoga school and we’ve completely renovated our house during my pregnancy!), I’ve been sick most days, suffered nausea throughout, I’ve had nerve-wrecking insomnia, fainting and anaemia, but all of those are just pregnancy symptoms. I’ve not been ill and this has been a strong, straightforward pregnancy. I feel so lucky and I feel compelled to document my gratitude.
Categories
Meta
Any questions? Get in touch!
Contact me to chat about how Peacock Treecan help you achieve your goals.
Lilley Harvey:
info@peacocktreeyoga.com
Mobile: 07772 706 736
Office: 01904 235932
*Google has asked us to add the following disclaimer: Results may vary from person to person.
|
2024-01-15T01:26:36.242652
|
https://example.com/article/1637
|
"Seems River doesn't want me making up a bed for our young guest." "Or she's starting a pillow collection, I'm still collating data." " I'm sorry." "I'll take care of the room." " It's not important!" "Tell him." "Tell him what?" "We want you to marry us." "What?" "Wait!" "No!" " What?" " Two by two." "Everyone a match, a mate, a doppel." "I love you." "River, I mean, of course, I love you too." "But we can't be married." "She's really crazy." "Oh!" "No!" "I don't mean crazy." "That's just..." "You know, that's not something brothers and sisters do." "I mean, on some planets, but only pretty bad ones." "The captain took a wife." "Well, that's also complicated." "I don't know where this is coming from." "We'll take care of each other." "I'll knit." " You don't love me." " What's going on?" "I really couldn't say." "I was going to show Saffron to her quarters." "It squared away?" "Once upon a time..." "I really don't need anything." "I'm just fine." " You're a thief." " Whoa, ho." "Let's play nice here." "Your sister's got some funny notions." "That's not untrue." "I'm sorry." "I didn't know when I was to be fed, and I was afraid." "You made that fine meal, didn't eat yourself?" "That was for you, weren't but pot-lickings left." "I took this for later." "I didn't know she saw me." "I didn't see you." " There's certainly no harm done." " And I say there is." "A good deal of harm." "It's starting to tick me off." "I got no use for people sneaking around, taking what ain't theirs." "Yes, we frown on that here." "But what I got even less use for is a woman who won't stand up for herself." "Five days hence we're putting you in the world, and you won't last a day by bowing and sniffing for handouts." "You want something, you take it or you ask for it." "Don't wait to be told when to breathe, don't take orders from anyone except me." "That's just because I'm the captain." "People take orders from captains, even in the world." "But for the rest be like a woman is, not some petrified child." "Over 70 Earths spinning about the galaxy and the meek have inherited not a one." "You understand what I'm saying to you?" "I do." "Shepherd would you show Saffron her room, please?" "Yes." "Now we have to be married." "I'm in the family way."
|
2023-10-21T01:26:36.242652
|
https://example.com/article/4551
|
Q:
GDI+ performance tricks
Does anyone know of any reliable (and, hopefully, extensive) books/websites that discuss GDI+ performance (beyond the obvious)?
For example, I recently came across this excellent experiment. I also recently noticed that Graphics.FillPath() is way, way faster than Graphics.DrawPath(). I'd love to know what other vital bits of information I'm missing.
Goodwill,
David
A:
Hmmm. There is no gain in knowing that FillPath is faster than DrawPath if you need to draw the path's outline!
The best way to optimise GDI+ is exactly the same as for any other code: Firstly, don't optimise it. Instead:
Start by writing it so it simply works, and then decide if it is actually too slow.
Then examine your "algorithm":
Simplify what you are drawing (reduce the number of things you are drawing) and it will go faster (and in most cases will look better for having reduced the clutter).
Are you drawing your entire display every time, or are you using the clip rectangle to avoid drawing parts of the image that don't need to be updated?
Examine how you draw things. Are you creating and destroying resources (e.g. brushes and pens) for every redraw? Cache them in a member variable. Are you over-drawing the same pixel multiple times? (e.g. drawing the background then drawing a bitmap on top then drawing a rectangle on top of that - perhaps you can avoid some of these redraws). Are you drawing a curve using 100 polygon segments when it looks good enough with only 10 segments? When the window scrolls, do you get the OS to move the existing image so you only need to redraw the newly exposed strip, or do you waste time redrawing the entire window?
Are you using transforms or are you doing lengthy positioning calculations in your code?
Check any loops and make sure you move as much code out of them as possible - precalculate values you use within the loop, etc. Make sure your loops iterate over your data in a cpu-cache-friendly direction/manner where possible.
Is there anything in your data that you are processing during the redraw? Perhaps some of this can be precalculated or organised in a more rendering-optimal form. e.g. Would a different type of list be faster to enumerate your data from? Are you processing 1000 data items to find the 10 you need to draw?
Can you achieve the same look with a different approach? e.g. You can draw a chess board by drawing 64 squares in alternating black and white. It might be faster to draw 32 black and then 32 white squares so you avoid state changes between the rects. But you can actually draw it using a white background clear, 4 black rectangles, and 4 XOR rectangles (8 rects instead of 64 => much faster algorithm).
Are there parts of the image that don't change often? Try caching them in an offscreen bitmap to minimise the amount you have to "rebuild" for each redraw. Remember that you can still render the offscreen bitmap(s) and then layer graphics primitives on top of them, so you may find a lot more "static" image area than you realise.
Are you rendering bitmap images? Try converting them to the screen's pixel format and cache them in that "native" form rather than making GDI+ convert them every time they are drawn.
Turn down the quality settings if you are happy with the trade-off of lower quality for faster rendering
Once you have done all these things you can start looking for books about optimising the rendering. If it is still too slow, of course. Run a profiler to find out which parts of the rendering are the slowest.
Where you think you might be able to make gains, try different ways of rendering things (e.g. it's likely that Graphics.Clear() will be much faster than filling the background with FillRectangle()), or different rendering orders (draw all the things of one colour first, in case state changes cost you time - batching operations is often very important with modern graphics cards. A single call that draws multiple polygons is usually faster than making multiple single-polygon calls, so can you accumulate all your polys into a deferred-rendering buffer and then commit them all at the end of your rendering pass?)
After that, you may have to look at using GDI or DirectX to get closer to the hardware.
A:
This may not be the answer you are looking for, but consider not using GDI+ at all. I had to recently rewrite the rendering stack of a 2D-CAM application, and the most important requirement was to get good anti-aliased lines fast (the anti-aliasing was what prompted us to rewrite the existing GDI renderer).
Here are some results I got with a render of 200 items (each item is itself some lines and small filled-shape markers). These are frame rates (on Windows 7), so higher is better:
200 items:
GDI=51, GDI+=20, D2D=59, WPF=33, GL=59.
(D2D is Direct2D, GL is OpenGL). Already you can see that GDI+ is trailing. WPF is perhaps handicapped in being a retained mode API, but then OpenGL is double-buffered as well and looks just as smooth.
At 1000 items, the difference is more marked:
GDI=23, GDI+=5, D2D=17, WPF=2, GL=40.
That's right, WPF has fallen to 2 FPS by now, and GDI+ is crawling along at 5 FPS. So consider D2D, or simply go back to OpenGL. That's what we are using now and 3 months into the rewrite, I think we made the right choice. The programming model itself is a lot cleaner than D2D seems to be.
Note that the WPF render we are using is highly optimized; no callbacks, no events, no binding. We just get a DrawingContext and draw everything on it each frame using the lowest level primitives so there is no event overhead.
If you are interested, let me know, and I can send you the test suites I used so you can fiddle around with that.
(One reason I might steer clear of GDI+ is that it is unlikely to ever be hardware accelerated).
|
2024-04-23T01:26:36.242652
|
https://example.com/article/4121
|
Melania Trump seemed like a rebellious first lady. She’s turning out to be a retro one.
First lady Melania Trump smiles as she attends a Wounded Warrior Project Soldier Ride event April 6 in the East Room of the White House. (Andrew Harnik/AP)
Melania Trump’s first act as first lady suggested she might play the rebel.
When she announced that she would not move to the White House right away — and instead remained in her New York penthouse with her young son while her husband began rolling out controversial executive orders in Washington — she flouted the most basic of all first lady traditions.
Now, after weeks of shirking the spotlight, Trump has begun to emerge from her cocoon, taking tentative steps to establish herself in her new role. In her first public events and statements, Trump has hewed surprisingly close to the historical expectations of first ladies.
Rather than rebellious, she is shaping up to be retro.
“As people get to know her, [they will see] she has been so focused on tradition and family and children,” said Stephanie Grisham, the first lady’s spokeswoman.
Earlier this month, Trump released her official portrait, a signal that she would be ramping up her official duties. The portrait echoed in style and aesthetic the official photographs of two of her Republican predecessors. She stood in front of an ornate window in the White House, as did Nancy Reagan, and wore a black blazer and folded her arms, as did Laura Bush.
Two days later, Trump hosted Jordan’s Queen Rania for the most conventional of first lady activities — a tour of an all-girls public charter school that included a stop in a visual arts class. “Beautiful,” Trump said softly, while looking at a painting by one of the students. Last week, she took Peng Liyuan, the wife of the visiting Chinese president, to tour a middle school in West Palm Beach, Fla.
Her conventional approach is in line with her personality and style, said an associate who has known the family for years and spoke on the condition of anonymity, lacking authorization by the Trumps to speak the press.
(Monica Akhtar/The Washington Post)
“She is steeped in Eastern European history,” the associate said. “You can’t grow up in her region without being that way, and Mrs. Trump has a high appreciation for the thread of history and its passing from generation to generation, administration to administration and empire to empire.”
Trump’s ceremonial role as the nation’s hostess will take center stage Monday when she hosts her largest event yet at the White House. The annual Easter Egg Roll, which had grown into a carnival-like celebration of healthy eating and exercise under Michelle Obama, will shrink in the Trump era.
“This year being our first, we’ve chosen to focus on the historic aspect of the Easter Egg Roll,” Grisham said. She said the first lady was concerned that the event had grown too large — 35,000 attendees last year — creating long waits for some activities.
The scaled-back event — the White House won’t say how many are expected, but noted that 18,000 souvenir eggs will be given to children — will recall an era when the biggest star in attendance was the Easter Bunny, who first appeared in 1969 when a member of Pat Nixon’s staff wore the furry costume. During the Obama years, the Easter Egg Roll drew performances by Justin Bieber and Idina Menzel, clinics by sports pros and presentations by celebrity chefs.
This year, the only announced performers are little-known bands Bro4 and Martin Family Circus.
This pivot away from pop culture is a safe tack for the new first lady, who has been acquainting herself with the way things have historically been done at the White House.
While she has spent relatively little time in Washington, she has borrowed books from the White House Historical Association’s archives, which describe the antiques and traditions of the executive mansion, said Anita McBride, who served as chief of staff to Laura Bush and sits on the association’s board.
“She is very interested in past practice and in precedent, and that gives you context for where you can do things your way and you make your mark,” McBride said.
“She has a respect and reverence for the White House and its traditions and the opportunities that she has to follow in the footsteps of her predecessors even without residing there,” McBride added.
Still, Trump’s moves to follow her predecessors have all been tentative and excruciatingly slow to some onlookers.
“She is embracing the ceremonial aspects of the role, but we have not seen any advocacy,” said Myra Gutin, a professor of communication at Rider University and author who has studied first ladies.
Trump said during the campaign that she would like to lead an initiative to combat cyberbullying, but she has not taken any public steps in that direction. She has a small staff in place at the White House, and associates say she is building a rapport with them while moving cautiously to establish herself. She is keen to avoid any big mistakes, particularly after the embarrassment she suffered following a prime-time speech at the Republican National Convention that she later acknowledged contained lines plagiarized from Michelle Obama.
“She is going to try to take time to do things right,” Grisham said, explaining the pace of the first lady’s activity. “The fact that it takes time to do it right doesn’t faze her at all.”
Trump presents Veronica Simon, of Papua New Guinea, with the 2017 Secretary of State’s International Women of Courage award at the State Department last month. (Kevin Lamarque/Reuters)
Trump “is going to try to take time to do things right,” said her press secretary, explaining the first lady’s slow rollout of events. (Saul Loeb/AFP/Getty Images)
Initially, the first lady relied heavily on her friend and senior adviser Stephanie Winston Wolkoff, a fashion industry event planner who helped organize President Trump’s inauguration but had no experience in the White House or in politics. Trump has since added several experienced Republicans to her team, including a chief of staff, social secretary and director of the White House Visitors Office — all key to planning events at the executive mansion.
As the first lady’s team works to put the Easter Egg Roll together, they are getting to know Trump, who has popped into Washington to host a luncheon celebrating International Women’s Day, held a reception for senators with her husband and helped hand out awards celebrating women at the State Department.
The public glare still seems challenging for the first lady, who is said to cherish her privacy. At the awards ceremony, Trump read from a teleprompter and seemed uncomfortable behind the microphone, but warmly embraced the awardees, looking visibly relaxed when her speech was over.
Trump also seemed especially at ease during the visit with Queen Rania, a woman who also had to adjust to life as a high-profile spouse.
The Jordanian queen, now 46, once described in an interview with Oprah Winfrey the steep learning curve she faced upon her coronation. “You grow into the role,” she said. “You take it by your stride.”
During their visit to the Excel Academy Charter School in Southeast Washington, the two women had a roundtable with school officials, parents and students. As cameras broadcast their meeting to the world, Queen Rania asked question after question. Trump sat silently at the center of the table, watching her.
1 of 67
Full Screen
Autoplay
Close
Skip Ad
×
See what Melania Trump has been doing since becoming first lady
View Photos
She recently moved to the White House from New York and has Washington waiting to see what she intends to do with her prominent position.
Caption
She recently moved to the White House from New York and has Washington waiting to see what she intends to do with her prominent position.
July 14, 2017First lady Melania Trump arrives for the traditional Bastille Day military parade on the Champs-Elysees in Paris.Yves Herman/Reuters
Krissah Thompson began writing for The Washington Post in 2001, and has reported for the National, Business and Feature staffs. Before becoming an editor, she covered the first lady's office, politics and culture.
|
2023-10-26T01:26:36.242652
|
https://example.com/article/7780
|
Synchronous Hepatoblastoma, Neuroblastoma, and Cutaneous Capillary Hemangiomas: A Case Report.
Multiple synchronous tumors presenting in infancy raise concern for inherited or sporadic cancer predisposition syndromes, which include Beckwith-Wiedemann syndrome, familial adenomatous polyposis syndrome, and Li-Fraumeni syndrome. We report a case of a 7-month-old previously healthy male born following an in vitro fertilization-assisted twin pregnancy who presented with new-onset refractory shock, severe acidosis, and rapid decline over several hours. An autopsy revealed a ruptured liver involved by hepatoblastoma, an adrenal gland involved by neuroblastoma, and multiple cutaneous capillary hemangiomas. Standard genetic testing demonstrated that both twins were Gaucher disease (GD) carriers without evidence of other known cancer predisposition syndromes. This report describes a unique association of multiple synchronous tumors, which underscores the utility and importance of the pediatric autopsy. Moreover, given that the reported child was a GD carrier, the possibility the tumors were the result of a GD-mediated cancer-associated phenotype or an unrecognized sporadic clinical syndrome remains an unanswered, but intriguing, question worthy of further investigation.
|
2023-10-09T01:26:36.242652
|
https://example.com/article/1822
|
The National Healthcare Group Domain Specific Review Board (DSRB) did not grant approval for data sharing with individuals or entities outside the National University of Singapore. Upon consenting to their participation, participants were ensured that the information collected for this study would be kept confidential, and specifically that their questionnaire and discussion/interview answers would not be made publicly available. Data may be available from the DSRB for researchers who meet the criteria for access to confidential data. For any data requests, researchers should contact: NHG Domain Specific Review Boards (DSRB); Tel: (65) 6471 3266 (Office Hours); Fax:(65) 6496 6257; Email: <ohrpp@nhg.com.sg>.
Introduction {#sec001}
============
Being physically inactive, defined as accumulating less than 150 minutes of moderate- to vigorous-intensity physical activity per week, is a significant risk factor for developing non-communicable, chronic diseases such as stroke, diabetes, and cancer \[[@pone.0218247.ref001]--[@pone.0218247.ref003]\]. Physical inactivity is also one of the 10 leading risk factors for global mortality \[[@pone.0218247.ref004]\]. The World Health Organization (WHO) estimated the worldwide physical inactivity prevalence among adults to be 23.3%, with varying percentages across WHO regions; from 32.4% in the Americas to 14.7% in South-East Asia \[[@pone.0218247.ref005]\]. But also within these regions prevalence rates of physical inactivity differ. For example, research among a Singapore sample showed that over 26% of adults were not sufficiently physically active and only 24% engaged in regular leisure-time physical activity \[[@pone.0218247.ref006]\]. To develop evidence-based interventions, countries have been monitoring their populations' physical activity levels more closely and research on the correlates of physical activity has increased, also among low- and middle-income countries \[[@pone.0218247.ref007]\] where the health burden of non-communicable diseases is disproportionately high compared to high-income countries \[[@pone.0218247.ref008]\]. There is a high demand for novel and effective programs to mitigate the global pandemic of physical inactivity.
Healthcare systems may be good platforms to implement and roll out strategies that increase physical activity levels for chronic disease prevention \[[@pone.0218247.ref009]\]. One of the objectives of the Healthy People 2020, a 10-year agenda of the United States (US) Department of Health and Human Services for improving public health, is to increase the proportion of physician visits that include physical activity counseling or education \[[@pone.0218247.ref010]\]. Similarly, WHO has prioritized 'the promotion of physical activity for all adults from all social groups as part of daily life, \[...\] through the healthcare system' in their recently released physical activity strategy document \[[@pone.0218247.ref011]\]. The *Exercise is Medicine* (EIM) initiative is a well-known healthcare-based strategy for promoting physical activity. The American College of Sports Medicine (ACSM) developed EIM as an alternative form of treatment or preventive medicine compared to traditional medicine-based prescriptions where healthcare providers refer their patients to EIM certified exercise programs \[[@pone.0218247.ref012]\]. Healthcare providers are encouraged to use the EIM physical activity prescription pad, which is a basic exercise prescription in an easy-to-use and printable format providing space for written recommendations on the type, frequency and duration of physical activity a patient should engage in.
Along the lines of EIM, the US Centers for Disease Control and Prevention and the US National Recreation and Park Association collaborated to develop the 'National Park Prescriptions Initiative' that brings together healthcare providers and stakeholders of park associations in order to improve physical and mental health among individuals and communities \[[@pone.0218247.ref013]\]. A definition of 'Park Prescriptions' was formalized in 2013 during the National Park Prescriptions Initiative Convening, encompassing ''programes that are designed by healthcare providers and relevant community partners to utilize parks, trails, and open space to improve individual and community health". A 'Park Prescription' could, compared to a normal EIM prescription, incorporate the park-context in recommendations on physical activity type by highlighting suitable walking trails or available exercise corners in parks. Practitioners may further point out nearby parks where people can be active and provide park maps on which physical activity opportunities are indicated. Throughout the prescription process practitioners could emphasize the additional health benefits of the natural environments that parks are.
Natural environments/(urban) green spaces have been associated with several beneficial health effects, including reduced cardiovascular mortality \[[@pone.0218247.ref014],[@pone.0218247.ref015]\], lower Type 2 diabetes risk \[[@pone.0218247.ref016]\] and improved mental health and well-being \[[@pone.0218247.ref014],[@pone.0218247.ref017]\]. The mechanisms thought to underlie these associations include: parks provide a setting for community engagement, greenery provides restorative sensory effect, spiritual values enhance from being in direct contact with nature and physical activity and leisure recreation increases in residents when parks and green spaces are present in the neighborhood \[[@pone.0218247.ref018]\]. Evidence suggests that visiting local green spaces increases the odds to achieve the recommended amount of physical activity \[[@pone.0218247.ref019]\] and that neighborhood green protects against physical activity decline in older adults \[[@pone.0218247.ref020]\]. Presence of and access to green spaces has further been linked to more leisure time physical activity engagement in suburban residential areas and more active commuting in urban residential areas \[[@pone.0218247.ref021]\]. Several studies report promising outcomes for interventions that combine physical activity with green space exposure. For example, a systematic review by Hunter and colleagues showed that physical activity programs in combination with physical changes to the built environment (e.g., improvements of walking paths, gyms and landscaping) are likely to positively influence physical activity levels. However, the authors also noted that robust evaluations of such programs are required \[[@pone.0218247.ref022]\]. Han and colleagues \[[@pone.0218247.ref023]\] examined the impact of providing free exercise classes in low-income neighborhood parks and found that the classes increased participants' moderate-to-vigorous physical activity. Another study by Marselle et al. \[[@pone.0218247.ref024]\] reported improved well-being, including lower depression rates and lower perceived stress in groups of people who attended nature walks compared to those who did not. According to another study by Calogiuri et al. \[[@pone.0218247.ref025]\] outdoor exercises versus indoor exercises increased positive feelings in office employees.
To the best of our knowledge, however, there is a lack of methodologically rigorous research studies that have looked specifically into combining exercise/physical activity prescription with a focus on the use of parks and green spaces. Most studies in the field of physical activity and green spaces did not integrate a healthcare system, did not use the 'act of prescribing' to improve participants' behavior and health, or were conducted in Western contexts only.
This mixed-methods study, which is named the Park Prescription Study, aims to inform the development of a 'Park Prescription' intervention, including face-to-face counseling on physical activity and park use and providing weekly structured exercise sessions in the park to promote physical activity among inactive individuals from a northern community of Singapore. It was designed to better understand park use and physical activity behaviors in an Asian setting, making it an original contribution to the research field. For the purpose of this study, a collaborating team was formed with researchers and staff of the \[details omitted for double-blind reviewing\].
Materials and methods {#sec002}
=====================
To understand participants' park use, their physical activity behavior (in general and with the focus on park-based physical activities) and common barriers and facilitators to physical activity engagement and visiting parks, this mixed-method sequential explanatory study \[[@pone.0218247.ref026]\] includes three inter-related components:
- *Component 1*: An anonymous self-administered questionnaire;
- *Component 2*: A focus group (FG);
- *Component 3*: A series of short interviews with people who already engaged in physical activity in the park. This 'doers' research \[[@pone.0218247.ref027]\] provided input for enhancing non-doers motivations and helping them overcome their barriers with practical tips shared by their peers.
The qualitative data from component 2 (FGs) and component 3 (interviews) were used to further explain and interpret the quantitative findings from component 1 (questionnaire).
Details on the recruitment efforts and procedures for all components are described below. This research has been approved by the National Healthcare Group Domain Specific Review Board (DSRB) in Singapore \[2015/0015-Park Prescription Study\] and has been conducted in full accordance with the 1964 Helsinki declaration and its later amendments.
Recruitment component 1: Quantitative questionnaire {#sec003}
---------------------------------------------------
Participants aged 40--65 years were recruited from health screening events organized by one large regional hospital located in the North of Singapore. These screenings targeted Singaporean nationals and permanent residents living in the North of Singapore, with the objective of early detection of diseases, increasing health awareness and encouraging positive healthy lifestyle changes. The hospital collaborated with community partners, such as religious institutions, to recruit residents for the screening events. The events were advertised on websites, through posters, and mailed flyers. All events followed a systematic approach through a series of health screenings at common community outdoor open spaces or community centres, followed by separate sessions during which residents picked-up their health reports \[[@pone.0218247.ref028]\]. On the screening day, residents had their measurements taken which included fasting blood tests for blood cholesterol and glucose, measurements of blood pressure, height and weight and a questionnaire to assess their current health status and health behaviors (e.g., smoking, physical activity). Approximately one week later, residents' picked-up their health reports and based on their screening results were directed to a health seminar provided by the Singapore Health Promotion Board to assist them in interpreting their screening results as well as to give them relevant health promotion education. A nominal fee of \$2 was charged to each individual as co-payment for the screening.
We recruited residents from seven screening events between May and August 2015. For the initial four screenings all eligibility criteria listed below applied. For the remaining three screenings conducted from end of July to end of August, we only applied selection criteria one to four, due to logistical constraints.
Eligibility criteria:
1. Provide informed consent;
2. 40--65 years old;
3. Singaporean national or permanent resident;
4. Report exercising \<30 minutes per week;
5. Pass the Physical Activity Readiness Questionnaire (PAR-Q) \[[@pone.0218247.ref029]\];
6. Blood pressure of ≤139 mmHG (systolic) over ≤89 mmHG (diastolic);
7. Fasting glucose levels of ≤6.0 mmol/L.
During both the screening and report collection days, eligible residents were directed to the Park Prescription booth manned by trained \[details omitted for double-blind reviewing\] researchers. They were informed on the study content and received the participant information and consent form at the screening sessions. Eligible residents subsequently provided written informed consent at the report collection day if they chose to participate in the study.
Data collection through completion of the questionnaire took place on the report collection day for all participants. Questionnaires were provided in English, Malay and Chinese ([S1](#pone.0218247.s001){ref-type="supplementary-material"}--[S3](#pone.0218247.s003){ref-type="supplementary-material"} Supporting information). Participants were given the questionnaire in the language they were most comfortable with. They received vouchers worth S\$25 for completing the questionnaire. The target was to recruit a convenience sample of 50--100 participants.
Recruitment component 2: Focus groups {#sec004}
-------------------------------------
Participants for the FGs were recruited from the same screening sessions described under component 1, and the same selection criteria applied. Information on the FGs was included in the original participant information and consent form. Although the option of only attending a FG was available, all FG participants had completed the questionnaire prior to their FG participation. Due to scheduling logistics, the FG was not held on the report collection day but on a subsequent weekend between August and September 2015 that was most convenient to participants. Participants who were interested in attending a FG were contacted shortly after the report collection day and informed about the specific date/time/venue of the FG. Verbal consent from each participant was obtained prior to the start of the FG. Vouchers worth S\$25 were given for participation in a FG. The target was to conduct between two to four FGs in total, with a maximum of eight participants per group.
Recruitment component 3: Doers research {#sec005}
---------------------------------------
Participants for the short individual interviews were recruited between December 2015 and January 2016, while being physically active at parks located in the North of Singapore. They were not part of the questionnaire or FGs sample. Doers were selected based on a matrix of their age and gender profiles: 40-\<55-year-old males, 40-\<55-year-old females, 55-\<65-year-old males and 55-\<65-year-old females. They were randomly approached by a trained interviewer from \[details omitted for double-blind reviewing\] while they were either participating in a structured-exercise session in the park on Sunday mornings or were performing physical activity at the park on their own (e.g., walking at a brisk pace, running, cycling, playing active games, etc.) on weekday mornings or afternoons. The interviewer explained the study content, provided an information letter and asked whether they were interested to participate. All participants provided verbal consent. The interviews took place while standing or walking along with the participants. This mobile interviewing technique, compared to a seated face-to-face situation, puts participant at ease and may add more insightful details to the conversation. While sharing their views, participants can directly reflect on their surroundings (i.e., the park) and their relationship to it. It is also a time- and resource efficient way of collecting information \[[@pone.0218247.ref030]\]. Participants received a simple hand towel and cap as appreciation for their time. The target was to recruit 16 participants, with four participants in each age and gender profile.
Measures {#sec006}
--------
### Component 1: Quantitative questionnaire {#sec007}
Socio-demographic information included age, gender, ethnicity, marital status, level of education, and employment status. The questions on park use included the number of times participants visited any park in their local area over the past month, the physical and social activities they had engaged in during their last park visit and common reasons for not visiting parks. These questions were modified from a park survey developed by Leslie et al \[[@pone.0218247.ref031],[@pone.0218247.ref032]\]. For eight different park-based physical activities, participants indicated their interest on a 4-point scale ranging from 'not interested at all' to 'very interested'. They could also state other physical activities they would enjoy doing in parks in an open-ended format. Additional questions included how often they would visit parks to engage in such physical activities, how long they would do the activities for, and at what intensity they would enjoy doing them. These questions were developed specifically for the current research study to be able to inform he structured-exercise component of the Park Prescription intervention.
### Component 2: Focus groups topic guide {#sec008}
The topic guide for the FGs was grounded in the PRECEDE framework \[[@pone.0218247.ref033]\]. As part of the sequential explanatory mixed-method design, the topic guide was refined based on preliminary findings from the quantitative questionnaire results. It included questions on motivating factors and perceived benefits, reinforcing factors, enabling factors and barriers for physical activity and physical activity in parks that were organized by the following topics and sub-domains:
- Topic 1: Participant's physical activity ○Domain 1: Perceived current physical activity and health○Domain 2: Intention and motivations to increase physical activity○Domain 3: Barriers to increasing physical activity
- Topic 2: Parks for physical activity ○Domain 1: Neighborhood parks○Domain 2: Physical activity programs within parks○Domain 3: Barriers to physical activity within parks
With these topics and domains, we aimed to identify parks in the community that would be suitable for physical activity. We further aimed to identify any perceived facilitators and barriers for engaging in physical activity in the parks, suggestions for park improvement to motivate more physical activities, as well as get input on how to best structure an exercise program within a designated local park for individuals within their neighborhood. The full topic guide is available as [S4 Supporting information](#pone.0218247.s004){ref-type="supplementary-material"}.
Prior to the FG, the moderator informed participants on the aim, its interactive nature, and the definition of key concepts so participants could understand the topics for discussion. Anonymous socio-demographic data (age, gender, and ethnicity) were collected. Moderators did not have a prior relationship with participants. All moderators conducted or at least attended several FGs before leading a FG for the current study. They were a female postdoc researcher fluent in English, a female PhD student and a male research assistant fluent in both English and Chinese. Each of them took up the moderator role in turn. FGs were conducted in both English and Chinese. They were audio taped and a second staff researcher was present to take notes. The FGs were held in a closed meeting room at \[details omitted for double-blind reviewing\] with only \[details omitted for double-blind reviewing\] staff and participants present or at one of the health screening venues where hospital staff and non-participants of the study were present as well.
### Component 3: Doers interviews {#sec009}
The doers interviews, comprising five open-ended questions ([S5](#pone.0218247.s005){ref-type="supplementary-material"} Supporting information), aimed to explore the benefits/reinforcing factors, enabling factors/self-efficacy, barriers and strategies for overcoming specific barriers (i.e., lack of time, feeling too tired, weather concerns) related to being physically active in the park \[[@pone.0218247.ref027]\]. The questions on specific barriers were designed based on issues that were consistently mentioned in the FGs. The scope of the questions was kept to a minimum to reduce the disruption of participant's physical activity routine. The interviewers were two male research assistants who recorded the key points of their discussion with participants in writing only. No follow-up interviews were carried out and the interviewers did not have a prior relationship with participants. Participants were asked to verify their age, gender and ethnicity prior to the interview.
Outcomes and analysis {#sec010}
---------------------
### Component 1: Quantitative questionnaire {#sec011}
Participants' responses on the number of times they visited any park in their local area over the past month were collapsed into the following categories: 'never', 'once or twice', 'three to seven times' and 'eight times or more'. Categories for activities that participants had engaged in while being in the park were collapsed for 'active sport' (e.g., cricket, football, etc.) and 'informal activities' (cycling, martial arts, etc.). For the items on preferred frequency (i.e., 'once a week', 'twice a week', 'three times a week or more') and intensity of park-based activities (i.e., 'light intensity only', 'up to moderate intensity', 'up to vigorous intensity') the categories were kept similar to the answering options in the original questionnaire. Answering options for the preferred duration of park-based activities were collapsed into '15--30 minutes', '45 minutes' and '60 minutes or more'. Participant responses on their interest in eight different park-based activities were dichotomized as 'not interested' and 'interested'. For the item on common reasons for not visiting parks, the categories were kept similar to the answering options in the original questionnaire. Written statements from open-ended formats were checked and re-classified within the fixed questionnaire categories if appropriate. For items considered not re-classifiable, new categories were derived. Descriptive statistics (means and SD, or proportions) were calculated for all variables and analyses were performed in IBM SPSS Statistics version 24.
### Component 2: Focus groups {#sec012}
All FGs were transcribed verbatim in English by a bilingual research assistant. The FGs conducted in Chinese were translated into English and back-translated into Chinese to ensure consistency in meaning. Transcripts were checked for transcription errors by another bilingual research assistant. The transcripts were not returned to participants for commenting. Thematic analysis was conducted by two independent reviewers using *a priori* codes previously established on the PRECEDE model \[[@pone.0218247.ref033],[@pone.0218247.ref034]\]. For text that could not be coded with pre-established codes, reviewers added new codes to the coding scheme, using an inductive data-driven approach \[[@pone.0218247.ref035]\]. To improve inter-coder reliability, pre-established codes were clearly organized in a codebook and reviewers were instructed to keep the number of new codes to a minimum \[[@pone.0218247.ref036]\]. Reviewers independently read and coded the transcripts before coming together to categorize the codes into themes. They met a total of three times to discuss codes and themes and reach consensus. They independently re-coded the data after these meetings if necessary \[[@pone.0218247.ref036]\]. The FGs were used to provide more details and in-depth explanations to the quantitative questionnaire findings \[[@pone.0218247.ref026]\]. Themes were matched to quantitative questionnaire findings for reinforcement purposes and to further inform intervention development.
### Component 3: Doers research {#sec013}
The interviewer systematically summarized the notes taken during and after the doers interviews by participant and by question. These summaries were not returned to participants for commenting. To reduce reflexivity bias \[[@pone.0218247.ref037]\] three reviewers of different gender, age group and cultural background independently read and categorized participant responses and views. The topic of the five interview questions (i.e., benefits/reinforcing factors, enabling factors/self-efficacy, barriers and overcoming specific barriers) served as a priori themes for categorizing the data. The three reviewers met a total of two times to discuss their data categorization per theme and reach consensus.
No special software was used to analyze the qualitative FG or doers interview data. Participants were not asked to provide feedback on the study findings.
Results {#sec014}
=======
[Fig 1](#pone.0218247.g001){ref-type="fig"} presents the number of people who joined one of the health screening events where we recruited for this study. The figure also reflects eligibility and participation rates of those who were invited to participate in the Park Prescription Study.
{#pone.0218247.g001}
Overall, 97 people were willing to participate and all of them completed the questionnaire. Sixteen participants agreed to participate in the FGs. In total, three FGs were conducted, with four to seven participants per group. The average FG duration was 77 minutes. Depending on the participants of each FG, one was conducted in English, one was conducted in Chinese and one was conducted in English and Chinese simultaneously. All FGs were mixed in terms of gender and age, but only one included multiple ethnicities, i.e., Chinese and Indian.
The individual face-to-face interviews with doers were conducted on 3 weekdays and 4 weekend days and each interview took no longer than 15 minutes. No formal record of the number of people approached was made, but between 24 to 27 people were asked to participate. Sixteen of them agreed, reflecting a participation rate of approximately 60%.
Participants' characteristics for each component are presented in [Table 1](#pone.0218247.t001){ref-type="table"}. The majority of participants were female and of Chinese ethnicity for all components. Eighty-four percent of the participants who completed the questionnaire had an education degree less than or equal to post-secondary education and 23% of them were unemployed.
10.1371/journal.pone.0218247.t001
###### Participant characteristics per study component, reflecting total numbers and respective proportions (%), except for age, for which mean±SD or age range are reported.
{#pone.0218247.t001g}
--------------------------------------------------------------------------------------------------------------------------------------------------------------
Questionnaire\ FGs\ Doers research\
(N = 97) (N = 16) (N = 16)
------------------------------------------------------------------------------------------------------------ ---------------- -------------- -----------------
**Mean age (±SD)**[^**a**^](#t001fn003){ref-type="table-fn"} 54.6 (8.5) 53.2 (8.8)
**Age range**[^**b**^](#t001fn004){ref-type="table-fn"}
40-\<55 years 8 (50)
55-\<65 years 8 (50)
**Gender N (%)**[^**c**^](#t001fn005){ref-type="table-fn"}
Male 37 (38) 7 (44) 8 (50)
Female 60 (62) 9 (56) 8 (50)
**Ethnicity N (%)**[^**c**^](#t001fn005){ref-type="table-fn"}^,^[^**d**^](#t001fn006){ref-type="table-fn"}
Chinese 87 (90) 15 (94) 13 (81)
Malay 5 (5) 0 (0) 2 (13)
Indian 2 (2) 1 (6) 0 (0)
Other 3 (3) 0 (0) 0 (0)
**Marital status N (%)**[^**c**^](#t001fn005){ref-type="table-fn"} Not assessed
Never married 8 (8)
Currently married 80 (83)
Separated/widowed/divorced 9 (9)
**Education N (%)**[^**c**^](#t001fn005){ref-type="table-fn"}
No formal/PSLE/less than secondary education 39 (40)
Secondary/O/N/ITE/NTC 43 (44)
Post-secondary education/A'level/Poly/Other diploma 12 (12)
University degree and above 3 (3)
**Employment status N (%)**[^**c**^](#t001fn005){ref-type="table-fn"}
Employed 61 (63)
Unemployed 22 (23)
Retired 12 (12)
Other 2 (2)
--------------------------------------------------------------------------------------------------------------------------------------------------------------
ITE: Institute of Technical Education, NTC: National technical certificate, O/N: O and N levels
Poly: Polytechnic, PSLE: Primary school leaving exam, 12 years old
^a^ For one FG participant, age was not noted
^b^ Participants were purposefully sampled in various age categories
^c^ Percentages may not add up to 100% due to rounding
^d^ For one participant, ethnicity was not reported by the interviewer after the interview.
Quantitative questionnaire findings {#sec015}
-----------------------------------
Results from the questionnaire ([Table 2](#pone.0218247.t002){ref-type="table"}) showed that 27 (29%) participants had not visited a park in their local area, while 67 (71%) visited a park at least once in the past month. [Fig 2](#pone.0218247.g002){ref-type="fig"} provides a schematic overview of the participants' reasons for not visiting parks in their local area. Participants mentioned "being busy with work or study" (28%) most frequently, followed by "feeling too tired, lazy or prefer to stay at home" (21%) and "having concerns about the weather" (13%). Other reasons for not visiting parks expressed by four (4%) participants were distance of parks and having other (priority) duties.
{#pone.0218247.g002}
10.1371/journal.pone.0218247.t002
###### Current and preferred park use pertaining to physical activities.
{#pone.0218247.t002g}
N (%)[^a^](#t002fn001){ref-type="table-fn"} N (%)[^a^](#t002fn001){ref-type="table-fn"}
------------------------------------------------------------------------------------------------------------------------------------------- --------------------------------------------- ---------------------------------------------------------------------------------------------------------------------------------------- ---------------------------------------------
**Number of times the participants visited a park over the past month (N = 94)** **Preferred weekly frequency of engaging in park-based physical activities (N = 76)**
Never 27 (29) Once 52 (68)
Once or twice 32 (34) Twice 17 (22)
Three to seven times 23 (24) More than three times 7 (9)
Eight times or more 12 (13)
**Preferred duration of park-based physical activities (N = 88)**
About 15--30 minutes per session 59 (67)
About 45 minutes per session 14 (16)
60 minutes or more per session 15 (17)
**Preferred intensity of park-based physical activities (N = 84)**
Light intensity only 48 (57)
Up to moderate intensity 34 (40)
Up to vigorous intensity 2 (2)
**Type of activities participants engaged in during their last park visit (N = 97)**[^**b**^](#t002fn002){ref-type="table-fn"} **Type of activities participants would be interested in to engage in at the park (N = 96)**[^**b**^](#t002fn002){ref-type="table-fn"}
Walking with family/friends 42 (43) Self-guided walking 91 (95)
Walking alone 39 (40) Walking tour led by guide 68 (71)
Passive activities such as reading, watching children 15 (16) Yoga 55 (57)
Active sport/activities such as cycling, ball games, martial arts 8 (8) Aerobic dance 54 (56)
Jogging 7 (7) Tai-Chi 51 (53)
Walking with dog(s) 2 (2) Qi-Gong 50 (52)
Gardening 1 (1) Pilates 45 (47)
Kickboxing 35 (36)
Other non-physical activities, such as carnival/fun fair, family bonding, picnic, musical performances, watching people, admiring scenery 12 (13)
Running/jogging 9 (9)
Cycling 4 (4)
Aerobic exercise/routine exercises 3 (3)
Ball sports 2 (2)
Line dancing 2 (2)
Gymnastics 1 (1)
Wing Chun Kung Fu 1 (1)
^a^ Missing and invalid responses are not reported. For this reason, and/or because of rounding, percentages may not add up to 100%. Reported percentages are calculated based on the total participants who answered the respective item
^b^ Participants were allowed to tick multiple options, hence percentages do not add up to 100%.
The most frequently reported activity during their last park visit was walking, either alone (40%) or with family/friends (43%). Only 15 (15%) participants had engaged in jogging or active sports/activities such as cycling or ball games when they visited the park. One participant stated to use parks for another activity than the ones listed out in the questionnaire, namely gardening.
Fifty-two participants (68%) indicated that they would like to visit the park to engage in physical activities once a week. The majority of participants preferred a duration of park-based physical activities of 15--30 minutes (67%) and with a light intensity only (57%). Participants were interested to engage in a wide variety of park-based physical activities, with the largest proportions of them preferring walking; either self-guided (95%) or led by a guide (71%), Yoga (57%) and/or aerobic dance (56%).
Qualitative focus groups and doers interview findings {#sec016}
-----------------------------------------------------
### Barriers to physical activity {#sec017}
[Table 3](#pone.0218247.t003){ref-type="table"} provides an overview of all themes and sub-themes as derived from the FGs. In the following sections the numbers of themes and sub-themes correspond to the numbering in this Table overview, but not in chronological order. FG themes that were consistent with quantitative questionnaire findings are highlighted with an asterisk in [Table 3](#pone.0218247.t003){ref-type="table"}.
10.1371/journal.pone.0218247.t003
###### Summary of themes and sub-themes derived from the FGs.
{#pone.0218247.t003g}
Topic Themes and subthemes
------------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
1\. Current use of parks
Park Use **(1i) Using parks for exercise**[\*](#t003fn001){ref-type="table-fn"}
**(1ii) Using parks for social interaction**[\*](#t003fn001){ref-type="table-fn"}
**(1iii) Using parks for relaxation and enjoyment**
2\. Barriers and facilitators to doing physical activity
Barriers **(2i) Intrinsic lack of motivation**
**(2ii) Comfort-zoning** (also being too tired, too lazy)[\*](#t003fn001){ref-type="table-fn"}
**(2iii) Risk of injury**
(2iiia) Traditional Chinese Medicine
(2iiib) Body ailments
Facilitators **(2iv) Restorative/invigorating effects of physical activity**
**(2v) Opportunities for social interaction**[\*](#t003fn001){ref-type="table-fn"}
**(2vi) Peer-motivation**
3\. Barriers and facilitators to using parks
Barriers **(3i) Safety concerns about parks**
(3ia) Fear of crime
(3iib) Unsafe park facilities
**(3ii) Haze and hot weather**[\*](#t003fn001){ref-type="table-fn"}
**(3iii) Traveling distance to parks**
Facilitators **(3iv) Number of facilities**
**(3v) Scenery and landscape**
4\. Preferences for a physical activity program in the park
Preferred type **(4i) Simple and easy-to-master activities**[\*](#t003fn001){ref-type="table-fn"}
**(4ii) Lower intensity activities**[\*](#t003fn001){ref-type="table-fn"}
**(4iii) Family-friendly activities**
**(4iv) Solitary activities, appealing to males**
Preferred frequency, timing and structure **(4v) Unstructured events, allowing people to come and go**
(4va) Multiple sessions a week
(4vb) Informal learning through 'community of practice', or informal group
**(4vi) Timing at weekday evening and/or weekend morning**
\*Consistent with quantitative questionnaire findings
While the importance of physical activity was mostly acknowledged, FG participants mentioned a lack of intrinsic motivation **(2i)** to engage in physical activity if they, for example, did not have a partner: ''*I don't really exercise due to a lack of exercise partner*. *If I exercise alone*, *it can be quite boring*.*"* (FG1) Some of them also preferred to stay in their comfort zone **(2ii)** rather than to push themselves to go exercise. Participants found it hard to overcome low levels of energy or competing demands such as housework on top of their usual working hours: ''A*fter coming home from work I'm tired and still have to do housework*. *So*, *I'm too tired to exercise*.*"* (FG1) Being lazy was also frequently mentioned in connection with not being active: *''(I exercise) usually on an 'off-day' or when I don't feel lazy*! *Also*, *because there's no fixed routine or schedule so it's hard to keep doing it*." (FG3) The latter quote illustrates that doing physical activity was largely related to occasions when one was free, making it more difficult to sustain between daily routines.
The risk of injuring oneself through physical activity **(2iii)** was a concern with participants who occasionally or regularly engaged in physical activity. For some participants, this risk was shaped by Traditional Chinese Medicine views (**2iiia**), which advocates harmony between the body and the environment. One participant discussed the necessity of a harmonious balance between Yin and Yang forces when doing exercise: *''We should exercise in the morning*, *and only when the sun is out... as the sun would not have risen and there would be too much yin energy in the air*. *So*, *we need the sun to come out first as it would provide yang energy*." (FG3) Participants who experienced body ailments **(2iiib)** said to cautiously self-monitor and adjust their physical activity intensity accordingly: *''I don't really intend to increase my physical activity duration or intensity*, *due to my occasional knee pain... if it hurts*, *I just tone down on my activity e*.*g*. *not climb stairs or climb less*.*"* (FG3) They acknowledged the fine balance between being cautious, versus pushing through discomfort for improvement of one's health. As one participant explained: *''We have to push through*. *With age the ligaments in our legs contract and \[we\] become less mobile*. *So*, *for me*, *even if I have some pain in the leg I will still force myself to walk... push through the pain--usually I get better*.*"* (FG3)
### Barriers to park use {#sec018}
During the FGs, three main factors were raised as barriers in frequenting parks. Safety (**3i**) was an important issue in terms of fear of crime (**3ia**) and facilities being perceived as not sufficiently safe **(3ib)**. The presence of shady characters in certain parks made park users feel unsafe at night. Participants described them as potentially dangerous immigrants from Malaysia who stayed at parks overnight: ''*It may be quite scary*. *Because you can imagine if they run out of money they may think about doing something illegal*." (FG3) Researchers noted how such feelings of danger were contagious, with participants reinforcing each other's fears in the FGs. Participants with young children also raised concerns about rubber matting at playgrounds, giving off a smell during the hot weather, explaining their worries as follows: '' \[...\] *under the hot sun in the afternoon I'm not sure if there could be some chemical reaction which poses a safety hazard for young children playing nearby*." (FG3) Further, it was mentioned that haze (i.e., particulate matter in the air reducing air quality) **(3ii)** could disrupt plans to use the parks, and that as participants valued convenience, long traveling distance to the parks **(3iii)** were deemed unfavorable: '*'Some of the parks are not very convenient*. *You can take a bus there but it takes a long time to walk out \[...\]*. *You need to get to the train*, *sometimes cutting across public housing estates*. *And after that still have to walk to the park so it can be quite frustrating*." (FG1)
Doers identified different barriers to using parks specifically for exercise. They mentioned park maintenance issues (e.g., falling branches), lighting issues (e.g., parks being too dark), fast riding cyclists and the presence of insects as main factors that made it more difficult for them to exercise in the park. The doers also noted that bad weather occasionally caused their structured outdoor class to be cancelled or resulted in the need to perform physical activity indoors. One interviewee said she felt watched while doing exercises in the parks.
When doers were asked about ways to overcome specific barriers that were identified from the FG participants, they provided the following solutions:
- Set aside time to exercise in the park and commit to your plan. When feeling tired or stressed, see/plan activity in park as time for relaxation;
- Create social support: share your plans with family/friends and get them to remind you. Or involve family/friends in park activities; e.g., spend active time with children/grandchildren;
- In case of bad weather, plan/identify potential alternatives such as going to the gym, climb stairs, walk at void deck areas (open spaces found on the first floor of public housing blocks in Singapore, which may be used for community activities);
- In case of heat, drink plenty of water and seek shade.
### Current park use, facilitators and benefits {#sec019}
Congruent with the questionnaire findings, walking was considered a popular form of exercise in the context of the park. Participants reported mostly engaging in walking, cycling or playing traditional games, (*e*.*g*., Chapteh, where a weighted shuttlecock is kept in the air usually by the feet) **(1i)**. The restorative effects experienced after exercise **(2iv)** were an important facilitator to engaging in physical activity: *''Personally I feel fresher after exercising; have more energy*. *That's why I try to exercise at least once a week*.*"* (FG2) Doers shared this perception and mentioned improved health and well-being as the most common benefit of exercising in parks. They also expressed their appreciation for being physically active in the parks specially because they felt close to nature, could breathe in fresh and clean air (as compared to the air-conditioned city environment) and enjoy natural sunlight.
FG participants referred to doing physical activities that offered the opportunity for social interaction **(2v)**, which related to the previously mentioned barrier of an intrinsic lack of motivation to visit parks and exercise. Such social activities provided extrinsic motivation to do physical activity and some participants mentioned the idea of an exercise 'buddy' or coach as a form of peer-motivation **(2vi)**. While these participants did not perceive physical activity as important per se, they were willing to take part if pulled along by friends. As explained by one participants: *''I think it'll be difficult \[to encourage me\]* ... *but if it's a group walking activity*, *I would consider taking part because my friends are all there"* (FG3).
For other participants, parks were places to people-watch, to learn more about and interact with their community **(1ii)**. FG participants further mentioned to visit parks for relaxation and enjoyment purposes **(1iii)**. Parks with pleasant scenery **(3v)** and sufficient facilities **(3iv)** were perceived as particularly enjoyable. The park aesthetics was reported to be therapeutic for some participants who utilized the space to unwind and engage in introspection.
### Preferences for a physical activity program in the park {#sec020}
Simple activities that were easy to master appealed specifically to older FG participants who were concerned about difficulties in learning due to their age **(4i)**. Other participants preferred activities of lower intensity **(4ii)**, as they did not want *''To go home with aches and pains*.*"* (FG2) Neuromotor/ balance activities such as Qi Gong, Wing Chun Kung Fu, Tai-Chi or Yoga were popular as they were perceived as relaxing and recreational. Activities with reminiscence value (e.g., childhood games such as 'Chapteh'), were culturally attractive, with widespread appeal because *''\[letting\] people re-live their childhood may better motivate them*." (FG2) A minority of FG participants preferred to sustain their interest through a variety of different classes to pick from each week: *''Because different people have different preferences ... offers different things each week for people to try"* (FG2)
Having family-friendly activities **(4iii)** was noted as important for parents, who explained how engaging their child would more likely attract them to these activities: *''We should have activities that are more family or child-oriented so that they can bring their children along and not have to worry what's going to happen to them*.*"* (FG2) More solitary activities **(4iv)** appealed to male participants who seemed more reluctant to join group-based aerobic activities, perceiving them as mostly for females.
Ideally, participants wanted to be offered multiple sessions a week **(4vi)**, from which to pick and choose. In this way, participants did not have to commit a fixed day to their schedule: *''I mean we already have a fixed schedule for work so I don't want another rigid thing in my free time*.*"* (FG3) Events taking place on weekday evenings and weekend mornings **(4vb)** and that allowed people to come and go, seemed particularly desirable to the participants **(4v)**.
In addition, participants liked the idea of an informal group **(4vb)** that came together and exercised together. One participant illustrated the 'carefree' nature of such an informal approach: ''*All sorts of people who just stop-by to join in the aerobics group; ranging from a well-dressed woman who was on her way to work*, *to an elderly lady just coming back from grocery shopping*. *All of them just put down their stuff*, *took off their sandals or shoes and joined in the activity*.*"* (FG3) Nevertheless, participants acknowledged the difficulties of organizing classes that did not have a fixed schedule and were open to having fixed organized classes all the same. Some participants preferred a fixed venue for familiarity reasons.
Discussion {#sec021}
==========
This mixed-methods study aimed to inform the development of a Park Prescription intervention, including a face-to-face counseling on physical activity and park use and providing weekly structured exercise sessions in the park to promote physical activity. We managed to recruit a sample of Singaporean adults of low socio-economic status. Participants who completed the questionnaire had low educational levels and all of them lived in public housing (data not shown). A recent review among Singapore citizens showed that staying in public rental housing was an important risk marker for lower participation in health screenings, preference for alternative medicine practitioners and poorer health outcomes \[[@pone.0218247.ref038]\]. Our results are thus particularly interesting in the context of a hard to reach population most in need of health promotion efforts \[[@pone.0218247.ref039]\].
Although the majority of the participants indicated that they would like to visit the parks often and engage in physical activity in parks, only few of them went to the park to perform such activities, primarily because they were too busy or too tired. Participants mostly indicated doing informal activities, such as walking, cycling or playing traditional games when using the parks for exercise. They valued parks because of their pleasant landscapes, greenery and facilities and acknowledged the health benefits of parks and natural environments. Participants shared a broad range of barriers to physical activity engagement and park use and provided solutions to overcome certain barriers. Finally, when discussing the content of an exercise-based park program, participants shared their preferences for the type, frequency, duration and timing of activities. The next paragraphs elaborate on the study findings and provide recommendations for the design and content of the Park Prescription intervention.
Elaboration of findings and implications for the Park Prescription intervention {#sec022}
-------------------------------------------------------------------------------
### Coping with barriers {#sec023}
The most frequently mentioned barriers to physical activity engagement in general, and to physical activity in parks in specific, were ''being too busy" and ''feeling too tired". The Centers for Disease Control and Prevention listed the same barriers among the top 10 of most common barriers to physical activity participation \[[@pone.0218247.ref040]\]. Research among other international populations, including adult Malays, Brazilians and Americans, presented similar results \[[@pone.0218247.ref041]--[@pone.0218247.ref043]\]. Based on the doers interviews and the FGs, the following strategies could be considered to address these barriers:
a. *Emphasize the restorative effect of physical activity and the health benefits of natural environments*. The proposed face-to-face counseling session would offer a good opportunity to discuss barriers with each individual. The counsellor could mention the restorative effect of physical activity and highlight the health benefits of being active in green spaces such as improved well-being and perceiving lower stress \[[@pone.0218247.ref024]\]. He/she could also share experiences of the individuals' peers, i.e., those already performing physical activity in parks, as per the peer-to-peer model \[[@pone.0218247.ref044]\].
b. *Encourage goal setting and planning of physical activity*. In their review Greaves and colleagues \[[@pone.0218247.ref045]\] identified self-regulatory techniques such as goal setting and self-monitoring as possibly effective intervention components associated with changes in physical activity and dietary behaviors. A more recent systematic review and meta-analyses showed that multi-component goal setting interventions (i.e., combining goal setting with other attributes such as strategy planning or feedback) are effective in promoting physical activity across different populations and contexts \[[@pone.0218247.ref046]\]. Combining goal setting with writing a physical activity plan and keeping track of one's achievements may thus be a good means to motivate people to incorporate physical activity into their daily lives. This strategy was recommended by our doers interviewees too. Providing a goal setting and/or self-monitoring tool may be considered as part of the Park Prescription intervention.
c. *Create social support*. The concept of social support is incorporated in many existing behavior change theories such as the Social Cognitive Theory \[[@pone.0218247.ref047]\], Social-Ecological Model \[[@pone.0218247.ref048]\] and the Theory of Planned Behaviour \[[@pone.0218247.ref049]\], and is believed to positively influence behavior change and maintaining the desired behavior on the longer term. Research has also shown that expanding social networks at an older age is associated with improvements in functional and self-rated health \[[@pone.0218247.ref050]\]. Finlay and colleagues \[[@pone.0218247.ref051]\] further found that ageing participants who often live alone, enjoy public green spaces such as parks because they provide opportunities for social interaction and contribute towards their social integration. The Park Prescription intervention will encompass a structured group exercise session in the park, facilitating social interaction among participants in a public green space. The importance of social support from friends or family for realizing behavior change may in addition be a point of discussion during the counseling sessions, as well as the opportunity of enhancing social connections through physical activity in the park.
Singapore has a tropical climate with year-round high and uniform temperatures and high humidity. The country also copes with occasional heavy rainfall and experiences severe periods of haze throughout the year. Research among older adults from six European countries showed that certain weather conditions were associated with physical activity behavior \[[@pone.0218247.ref052]\]. A recent review and meta-analyses also reported that air pollution discouraged physical activity among adults \[[@pone.0218247.ref053]\]. The seven studies that were included in the review were either conducted in the US or the United Kingdom. Our results are in line with these findings: weather conditions were an important concern to our participants when considering outdoor physical activities, including exercising in parks. To avoid the heat, the proposed weekly exercise sessions should therefore best be conducted in shady areas and during cooler timings of the day. In addition, it would be beneficial to arrange an indoor space where the sessions can take place in case of rainfall or haze episodes. The latter would also add to the continuity of the sessions. Moreover, any weather-related harmful consequence such as heat stroke, haze hazards or thunder hazards should be clearly communicated to individuals who are participating in the Park Prescription intervention, either during the weekly exercise sessions, the face-to-face counseling or potentially via intervention materials.
The current research showed that the fear of injuring oneself may hinder physical activity engagement in our target group. International studies have documented that fear of injury is a common barrier to physical activity participation, especially among older adults \[[@pone.0218247.ref042],[@pone.0218247.ref054],[@pone.0218247.ref055]\]. To avoid injuries from occurring, and to create a feeling of physical safety among participants of the Park Prescription intervention, a certified doctor and exercise specialist should be consulted during the development of the weekly structured exercise sessions and emphasis be placed on including age-appropriate content. The Park Prescription sessions should ideally be conducted by a trained exercise instructor who has experience working with this age group. He/she should also be made aware that participants have been largely inactive and may not know the limits of their bodies at the start of the intervention. Phillips and colleagues \[[@pone.0218247.ref056]\] further suggested that education on safety techniques, gradually increasing the duration and frequency of physical activities and focusing on low intensity activities could help to address injury concerns. Such safety principles are similar to those operated within the existing EIM program. Another way of dealing with this specific barrier is to include safety information in the intervention materials for participants and highlight those during the face-to-face counseling.
### Park proximity and accessibility {#sec024}
Thematic analysis showed that both traveling distance to and the accessibility of parks (by public transport) was a key condition for park use among our participants. This is in line with results from a qualitative review showing that several park attributes among which park proximity is important for encouraging park use \[[@pone.0218247.ref057]\]. Several quantitative studies, on the other hand, reported mixed findings on the association between park proximity/accessibility and park use and physical activity \[[@pone.0218247.ref058]--[@pone.0218247.ref060]\]. Although the Park Prescription intervention should try to address park proximity and accessibility based on our qualitative findings, one must bear in mind that it may not be the most effective way to increase the quantitative use of parks for physical activity. With over 400 parks on a surface approximately 700 square kilometers, Singapore is referred to as the 'City in a Garden' and offers plenty of opportunities for residents in each part of the country to visit (and be active in) parks. Our participants were not well aware of parks that were close to their home and that could be easily reached. As part of the questionnaire, but not reported on in the current study, we asked participants whether they could name up to 3 parks in their neighborhood. Although two-thirds of the participants wrote down the name of at least one park, there was minor variation among the parks mentioned and several parks appeared not to exist. Participants of the Park Prescription intervention may need to be better informed about parks in their living area in order to use them, including public transport routes and access points. Also, to encourage physical activity in parks specifically, such park information could highlight exercise facilities within the parks. For a good take up of the weekly structured sessions, the parks where the sessions take place should best be organized close to where most of the participants live. Another more general but still relevant factor to consider is the perceived safety of parks (also an important factor for park use according to the qualitative review by McCormack et al. \[[@pone.0218247.ref057]\]). This may refer to the maintenance of walking paths and exercise equipment, sufficient light at night and/or measures to decrease mosquito breeding, which were worries of our participants in the context of park use. An attempt should be made to take these worries into account when selecting parks for the intervention.
### Content of the structured-exercise sessions {#sec025}
Participants preferred to engage in low-intensity activities, for about 30 minutes per session. Research on the health benefits of light-intensity physical activity is accumulating \[[@pone.0218247.ref061],[@pone.0218247.ref062]\]. Gradually increasing one's activities, starting at lower intensity levels and slowly increasing to achieve moderate intensity levels may reduce the incidence of adverse events and improve adherence \[[@pone.0218247.ref062]\]. One activity that would lend itself well in this context is walking. Walking was also the most commonly reported physical activity that participants currently engaged in and would be interested to do. Walking has been shown to be reversely associated with cardio-metabolic risk \[[@pone.0218247.ref063]\] and mortality \[[@pone.0218247.ref064]\]. It is regarded as an appropriate activity for any age group. Other activities of interest to our participants included Yoga, Pilates and Qi-gong, Tai-Chi. Benefits for middle-aged and older populations of traditional Asian physical activities such as Yoga are well-documented \[[@pone.0218247.ref065],[@pone.0218247.ref066]\] and have been recommended by the Health Promotion Board, Singapore to increase strength and balance in adults, specifically the elderly. These activity types could be taught as part of the weekly exercise sessions.
Participants also expressed their preference for family friendly activities and/or activities with social elements. Research concurrently showed that leisure time activities combining mental, physical and/or social components reduce dementia risk among older adults \[[@pone.0218247.ref067]\]. It would thus be beneficial to include team challenges or partnered exercises in the Park Prescription exercise sessions. Considering the importance of social support and social interaction for behavior change\[[@pone.0218247.ref047]--[@pone.0218247.ref049]\] and health \[[@pone.0218247.ref050]\], participants should further be encouraged to go for walks or exercise in the park with family or friends in their free time. This could be done during the counseling sessions or by highlighting such opportunities in the intervention material.
According to the participants of this study, timing of the weekly exercise sessions is another important condition for their attendance, which is not surprising considering the many work- and family responsibilities most of them experience. Results from the thematic analysis showed that weekday evenings and weekend mornings were suitable timings for most participants. But during the actual FG discussion, it also became evident that catering to each participant's need would be difficult.
The Asian context {#sec026}
-----------------
A key feature of this study is that it took place in an Asian context. Barriers and facilitators of physical activity and park use in our Singapore population were nevertheless fairly similar to those identified by McCormack and colleagues \[[@pone.0218247.ref057]\], who performed a qualitative review on this topic including research from mainly the US and Australia. Singapore is considered one of the wealthiest and most well-developed nations in the world \[[@pone.0218247.ref068]\]. This may be a reason why the views and preferences of its inhabitants show resemblance to those of Western populations. Our results did highlight a few focus points that could be considered typical for Singapore:
- The preference to engage in traditional Asian exercises such Yoga, Tai-Chi, Pilates and Qi-Gong was high among our participants and they also mentioned the nostalgia of playing traditional Asian games such as Chapteh in the park. This finding is supported by results form a recent systematic review and meta-analysis which showed that Yoga was among the top-5 leisure time physical activities (ranking fourth after walking, running and cycling) that adults from South East Asia engaged in \[[@pone.0218247.ref069]\]. Although Asian-based leisure time physical activities such as Yoga are also quite popular among some Western populations, the same review did not list them as common activities among adults from other regions, including Africa, Europe, the Americas, Western Pacific and Eastern Mediterranean \[[@pone.0218247.ref069]\]. Including traditional Asian activities in park-based physical activity programs may specifically appeal to Singaporeans or Asian populations in general.
- Singapore's high humidity and heat discouraged our participants from being physically active outdoors. They were often also worried about the air quality. Weather conditions have been associated with outdoor physical activity in older European adults too \[[@pone.0218247.ref052]\], but unlike our participants, they tended to become more active when temperatures got up. Whether weather conditions hamper or promote physical activity seem to depend on the usual climate and thus on the specific region that adults live in. It may be crucial to the uptake of park-based physical activity among Singaporeans to a) closely monitor the temperature and air quality and inform participants accordingly, and b) provide an indoor option for exercise classes in case of heavy rain or haze.
- A well-maintained park is never far away in Singapore. Park accessibility in this country is very high compared to, for example, estimations from the US where residential populations have to travel an average of about 10 kilometers (6.7 miles) to access their local neighborhood parks \[[@pone.0218247.ref070]\]. Almost all Singaporeans have a large park in or close by their neighborhood, including exercise corners and walking paths, which offers an excellent opportunity for promoting outdoor park-based exercise in this population.
Strengths and limitations {#sec027}
-------------------------
To our knowledge, this is the first mixed-methods study looking into the development of a Park Prescription intervention for inactive community members in Asia and beyond. The main strength of the current study is that it combines different research components (questionnaire, FGs and doers interviews) to facilitate an in-depth understanding of important factors such as the personal barriers, enablers and preferences of the target group related to park use and physical activity behavior, which may eventually enhance the effectiveness of the intervention to be developed. We managed to recruit a sample of Singaporean adults with relatively low socio-economic status. Individuals of lower socio-economic status tend to be particularly hard to reach with health promotion efforts, but are most in need of intervention efforts due to their lower physical activity levels \[[@pone.0218247.ref039]\]. We also acknowledge several study limitations. During some of the report collection events participants engaged in discourse with hospital health screening volunteers about questionnaire items. This might have led to social desirability bias. The questionnaire was adapted from a previously published questionnaire, but not validated in the local context, as no such instrument has been developed and validated with this population. FG participants were recruited from the questionnaire sample, which may have led to social desirability and detection bias. Conducting the FGs in different languages, especially the bilingual one, may have compromised the understanding of some attendees and therefore the quality of data. This procedure was necessary in the multi-ethnic population of Singapore which consists of varied native speakers. The response rate was extremely low despite our best efforts and this reduces the generalizability of our findings. Lastly, this study was conducted among a selective sample of relatively healthy Singapore adults, mostly living in the North of Singapore. Results can therefore not be generalized to less healthy individuals (e.g., those with chronic conditions such as diabetes or heart disease may experience very different barriers, enablers and preferences to physical activity in parks), other age groups, or those living in other parts of Singapore.
Conclusions {#sec028}
===========
This mixed-methods study showed that community-dwelling individuals in Singapore expressed an intention to visit parks often and be active there, but only few of them do so. The identified important barriers (e.g., being too busy, lack of social support, weather-related concerns and the fear of injuring oneself) and facilitators (e.g., park proximity and accessibility, physical activities of interest to the target group) to physical activity and park use will inform the design of a Park Prescription intervention. The effectiveness of the Park Prescription intervention in promoting physical activity, park use, as well as physical and mental well-being will be tested in a one-year Randomized Controlled Trial.
Supporting information {#sec029}
======================
###### Questionnaire ENG.
(DOCX)
######
Click here for additional data file.
###### Questionnaire CHIN.
(DOCX)
######
Click here for additional data file.
###### Questionnaire MAL.
(DOCX)
######
Click here for additional data file.
###### FG protocol.
(DOCX)
######
Click here for additional data file.
###### Doers interview protocol.
(DOCX)
######
Click here for additional data file.
The authors wish to thank Ken Tham Runjie, May Lim Lin Lin, Siew Yong Tan and all Alexandra Health Pte Ltd Community Screening Volunteers for supporting the selection of eligible participants, carrying out study-related procedures and instructing their colleagues on the former; Muhamad Aminuddin Bin Hussain, Kakershaw Yeo, Francis Ang, Ang Chian Siang and Anne Chu for assisting with data collection.
[^1]: **Competing Interests:**The authors have declared that no competing interests exist.
|
2023-12-16T01:26:36.242652
|
https://example.com/article/9314
|
Children's and adults' understanding of the impact of nutrition on biological and psychological processes.
Four studies examined children's and adults' beliefs about the impact of nutrition on growth and mood states. In Studies 1 and 2, 271 participants (preschoolers through adults) judged the impact of healthy and unhealthy nutrition on height and weight. In Studies 3 and 4, 267 participants judged the impact of healthy and unhealthy nutrition on positive and negative mood states. The results suggest that young children demonstrate a co-existence of an ontologically distinct theory of biology as well as a theory of cross-domain interaction when reasoning about the impact of food on biological and psychological processes.
|
2024-05-25T01:26:36.242652
|
https://example.com/article/7207
|
Q:
Dynamically store and access file via url
I am trying to generate a feed file to publish to Facebook. They require a URL to hit and grab a file. I was wondering what approach I should take to store and make the file publicly available to Facebook.
My first approach was to store the CSV file in a public folder named "feed" located in webapp/feed/{filename.csv}, however, I have come to learn that using Faces.getExternalContext().getRealPath("/") is not the best approach as the files are lost on redeployment or server restart. This approach seems to only work on my local environment, and not AWS.
My next approach was to store each users individual feed files in my database and retrieve them on request, but I have not been able to find information on if/how this is possible. I am not confused on how to get the file, but how to design a page that makes it available to Facebook to retrieve.
In short, I want to take a CSV file I have created and make it publicly available through a URL that Facebook can identify and grab. Currently, I am looking at Amazon Elastic File System to solve this problem. Is this the correct approach or is there a simpler solution.
Thank you for reading.
A:
This answer grabs a feed file from a specific users database. Feed files are just a CSV file containing product information with values required by Facebook. When a data feed is scheduled with Facebook, they hit a given url (for example, https://www.yourwebsite.com/feed.xhtml?user={some_user}). This url should send a file to the requester. This xhtml file and java class do exactly that. Keep in mind, this example does not show how the files are generated only how they are returned.
feed.xhtml
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml"
xmlns:h="http://java.sun.com/jsf/html"
xmlns:f="http://java.sun.com/jsf/core"
xmlns:ui="http://java.sun.com/jsf/facelets"
xmlns:p="http://primefaces.org/ui"
xmlns:adm="http://github.com/adminfaces">
<h:body>
<!-- Meta Data -->
<f:metadata>
<f:viewParam name="user" value="#{feed.userId}"
converter="javax.faces.Long" />
<f:event type="preRenderView" listener="#{feed.init}" />
</f:metadata>
</h:body>
</html>
Feed.java
package me.walkerworks.bean;
import java.io.IOException;
import java.io.Serializable;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import javax.enterprise.context.RequestScoped;
import javax.inject.Named;
import org.omnifaces.util.Faces;
import me.walkerworks.security.DataConnect;
/**
*
* @author Thomas Walker 6/18/2020
*
*/
@Named
@RequestScoped
public class Feed implements Serializable {
private static final long serialVersionUID = 1L;
private String userId;
private int feedId;
private byte[] content;
/**
* Initialized Bean
*
* @throws ClassNotFoundException
* @throws SQLException
* @throws IOException
*/
public void init() throws ClassNotFoundException, SQLException, IOException {
if (userId != null) {
// Connection var
Connection connection = null;
// Loading jdbc driver for mysql
Class.forName("com.mysql.cj.jdbc.Driver");
// Getting connection from products table
connection = DataConnect.getConnection("user" + userId);
// Prepare Statement
PreparedStatement preparedStatement = connection
.prepareStatement("SELECT * FROM feeds");
// Execute statement and get result
ResultSet resultSet = preparedStatement.executeQuery();
// If there is data to load from db
if (resultSet.next()) {
// Set feed id
feedId = resultSet.getInt("id");
// Get and store the file in class
if (resultSet.getBytes("content") != null) {
// Get long blob
content = resultSet.getBytes("content");
}
}
// Closing connections
resultSet.close();
preparedStatement.close();
DataConnect.close(connection);
// If content isn't null
if (content != null) {
// Send file
Faces.sendFile(content, feedId + ".csv", true);
}
}
}
/**
* @return the userId
*/
public String getUserId() {
return userId;
}
/**
* @param userId the userId to set
*/
public void setUserId(String userId) {
this.userId = userId;
}
/**
* @return the feedId
*/
public int getFeedId() {
return feedId;
}
/**
* @param feedId the feedId to set
*/
public void setFeedId(int feedId) {
this.feedId = feedId;
}
/**
* @return the content
*/
public byte[] getContent() {
return content;
}
/**
* @param content the content to set
*/
public void setContent(byte[] content) {
this.content = content;
}
}
|
2024-01-30T01:26:36.242652
|
https://example.com/article/8003
|
---
abstract: |
Kaluza-Klein (KK) parity can be violated in five-dimensional universal extra dimensional model with boundary-localized (kinetic or mass) terms (BLTs) at the fixed points of $S^1/Z_2$ orbifold. In this framework we study the resonant production of Kaluza-Klein excitations of the neutral electroweak gauge bosons at the LHC and their decay into an electron-positron pair or a muon-antimuon pair. We use the results (first time in our knowledge) given by the LHC experiment to constrain the mass range of the first KK-excitation of the electroweak gauge bosons ($B^1\ \textrm{and} \ W_3^1$). [It is interesting to note that the LHC result puts an upper limit on the masses of the $n=1$ KK-leptons for positive values of BLT parameters and depending upon the mass of $\ell^{+}\ell^{-}$ resonance.]{}\
`PACS Nos: 11.10.Kk, 14.80.Rt, 13.85.-t `\
`Key Words: Universal Extra Dimension, Kaluza-Klein, LHC`
---
[**KK-parity non-conservation in UED confronts LHC data** ]{}\
[ [Avirup Shaw[^1]]{} ]{}\
\
Introduction
============
Discovery of the Higgs boson at the Large Hadron Collider (LHC) at CERN is a milestone in the success of Standard Model (SM). However, there are still many unanswered questions and unsolved puzzles, ranging from dark matter to the hierarchy problem to the strong-CP problem. But there is no experimental result that can explain such unsolved problems with standard particle physics. Out of various interesting alternatives, supersymmetry (SUSY) and extra dimensional models are the most popular frameworks for going beyond the SM of particle physics. In this work we consider a typical extra-dimensional model where all SM particles can access an extra space-like dimension $y$. We use the results [@atlas8T] presented by the ATLAS Collaborations of search for a high-mass resonances decaying into the $\ell^{+}\ell^{-}$ ($\ell \equiv e \ \textrm{or} \ \mu$) pair to constrain the parameter space of such a model where the lowest ($n = 1$) KK-excitations are unstable due to lack of any specified symmetry.
We are interested in a specific framework, called the Universal Extra Dimension (UED) [@acd] scenario, characterised by a single flat extra space like dimension $y$ which is compactified on a circle $S^1$ of radius $R$ and has an imposed $Z_2$ symmetry ($y \rightarrow-y$) to accommodate chiral fermions, hence the compactified space is called $S^1/Z_2$ orbifold. From a four-dimensional viewpoint, every field will then have an infinite tower of KK-modes, the zero modes being identified as the SM states. In this orbifold a $\pi R$ amount of translation in $y$ direction leads to a conserved KK-parity given by $(-1)^n$. The conservation of KK-parity ensures that the lightest $n = 1$ KK-particle called Lightest Kaluza-Klein (LKP) is absolutely stable and hence is a potential dark matter candidate. As the masses of the SM particles being small compared to $1/R$, hence this scenario leads to an almost degenerate particle spectrum at each KK-level. This mass degeneracy could be lifted by radiative corrections. Being an extra dimensional theory and hence being non-renormalizable, this can only be an effective theory characterised by a cut-off scale $\Lambda$. So at the two fixed points ($y = 0$ and $y = \pi R$) of $S^1/Z_2$ orbifold, one can include four-dimensional kinetic and/or mass terms for the KK-states. These terms are also required as counterterms for cut-off dependent loop-induced contributions [@georgi] of the five-dimensional theory. In the minimal Universal Extra-Dimensional Models (mUED) these terms are fixed by requiring that the five-dimensional loop contributions [@cms1; @cms2] are exactly cancelled at the cut-off scale $\Lambda$ and the boundary values of the corrections, e.g., logarithmic mass corrections of KK-particles, can be taken to be zero at the scale $\Lambda$. There are several existing literature [@acd], [@nath]-[@flacke2] in which we can find how the experimental results constrain the values of the two basic parameters ($R$ and $\Lambda$) of mUED theory.
In this work we generate non-conservation of KK-parity[^2] by adding unequal boundary terms at the two fixed boundary points. Consequently $n = 1$ KK-states are no longer stable. Hence the single production of $n = 1$ KK-states and its subsequent decay into $n = 0$ states would be possible via this non-conservation of KK-parity. We will utilise this KK-parity-non-conserving coupling of the $B^1 (W_3^1)$ to a pair of SM fermions ($n =0$ states) [@ddrs] to calculate the (resonance) production cross section of $B^1 (W_3^1)$ in $pp$ collisions at the LHC (8 TeV) and its subsequent decays to $e^+ e^-$/$\mu^+ \mu^-$, assuming $B^1\ \textrm{and} \ W_3^1$ to be the lightest KK-particles. Once $B^1\ \textrm{and} \ W_3^1$ are produced via KK-parity-non-conserving coupling, the KK-parity-conserving decaying mode being kinematically disallowed, thus the $B^1\ \textrm{and} \ W_3^1$ decay to a pair of zero-mode fermions via the same KK-parity-non-conserving coupling. A search for high-mass resonances based on 8 TeV LHC $pp$ collision data collected by the ATLAS and CMS have been reported in [@atlas8T] and [@cms8T] respectively. Refs. [@atlas8T] and [@cms8T] present the expected and observed exclusion upper limits on cross section times branching ratio at 95% C.L. for the combined dielectron and dimuon channels for resonance search. In this article we have used the above results to constrain the masses of the $n = 1$ level KK-fermions and $B^1\ (\ W_3^1)$ of the model. In an earlier article [@drs] we have reported the production of $n=1$ KK-excitation of gluon and its subsequent decay to $t\bar{t}$ pair at the LHC. Both the production and decay are governed by KK-parity-non-conserving interaction. Constraints have been also derived by comparing the $t\bar{t}$ cross section with LHC data from CMS [@tt_cms8T] and ATLAS [@tt_atlas8T] Collaborations.
The plan of this article is as follows. At first we present the relevant couplings and masses in the framework of UED with asymmetric boundary localized kinetic terms. We then review the expected $\ell^{+}\ell^{-}$ signal from the combined production of the $B^1\ \textrm{and} \ W_3^1$ at the LHC and their subsequent decay. This is compared with the ATLAS [@atlas8T] 8 TeV results and the restrictions on the couplings and KK-excitation masses are exhibited. Finally we will summarise the results in section V.
KK-parity-non-conserving UED in a nutshell
==========================================
In non-minimal version of five-dimensional UED theory, we put boundary-localized kinetic terms (BLKTs) [@ddrs], [@Dvali] - [@asesh] at the orbifold fixed points ($y=0$ and $y=\pi R$). If $\Psi_{L,R}$ are the free fermion fields, zero modes of which are the chiral projections of the SM fermions. In presence of BLKTs, the five-dimensional action can be written as [@ddrs], [@schwinn]:
$$\begin{aligned}
S & = \int d^4x ~dy \left[ \bar{\Psi}_L i \Gamma^M \partial_M \Psi_L
+ r^a_f \delta(y) {\phi} ^\dagger _L i \bar \sigma^\mu \partial_\mu \phi_L
+ r^b_f \delta(y - \pi R) {\phi} ^\dagger _L i \bar \sigma^\mu
\partial_\mu \phi_L
\right. \nonumber \\
& \left. + \bar {\Psi} _R i \Gamma^M \partial_M \Psi_R
+ r^a_f \delta(y) {\chi} ^\dagger _R i {\sigma}^\mu \partial_\mu \chi_R
+ r^b_f \delta(y - \pi R) {\chi} ^\dagger _R i {\sigma}^\mu
\partial_\mu \chi_R
\right] .
\label{faction}\end{aligned}$$
With $\sigma^\mu \equiv (I, \vec{\sigma})$ and $\bar{\sigma}^\mu
\equiv (I, -\vec{\sigma})$, $\vec{\sigma}$ being the $(2 \times
2)$ Pauli matrices. $r^a_f, r^b_f$ are the free BLKT parameters which are equal for $\Psi_L$ and $\Psi_R$ for the purpose of illustration.
The KK-decomposition of five-dimensional fermion fields using two component chiral spinors are introduced as[^3] [@ddrs], [@schwinn]:
$$\Psi_L(x,y) = \pmatrix{\phi_L(x,y) \cr \chi_L(x,y)}
= \sum^{\infty}_{n=0} \pmatrix{\phi_n(x) f_L^{n}(y) \cr \chi_n(x) g_L^{n}(y)}
\;\; ,
\label{fiveDL}$$
$$\Psi_R(x,y) = \pmatrix{\phi_R(x,y) \cr \chi_R(x,y)}
= \sum^{\infty}_{n=0} \pmatrix{\phi_n(x) f_R^{n}(y) \cr \chi_n(x) g_R^{n}(y)}
\;\; .
\label{fiveDR}$$
Using appropriate boundary conditions [@ddrs], we can have the solutions for $f_L^n$ and $g_R^n$ which are simply denoted by $f$ and $g$ for illustrative purposes.: $$\begin{aligned}
f^n(y) &=& N_n \left[ \cos (m_n y) - \frac{r_f^a m_n}{2} \sin (m_n
y) \right] \;,\;\; 0 \leq y < \pi R, \nonumber \\
f^n(y) &=& N_n \left[ \cos (m_n y) + \frac{r_f^a m_n}{2} \sin (m_n
y) \right] \;,\;\; -\pi R \leq y < 0.
\label{sol1}\end{aligned}$$ Where the KK-masses $m_n$ for $n = 0,1, \ldots$ are solutions of the transcendental equation [@carena]: $$(r^a_f r^b_f ~m_n^2 - 4) \tan(m_n \pi R)= 2(r^a_f + r^b_f) m_n \;.
\label{trans1}$$
The non-trivial wave-functions are combinations of a sine and a cosine function which are different from case of mUED where they are either only sine or cosine function. The departure of wave functions from mUED theory and the fact that the KK-masses are solutions of Eq. (\[trans1\]) rather than just $n/R$ are the key features of this non-minimal Universal Extra Dimensional (nmUED) model.
In our analysis we study the KK-parity-non-conserving UED in two ways. In the first case, we take equal strength of BLKTs (at two fixed point $y = 0$ and $y = \pi R$) for fermion, i.e., $r^a_f = r^b_f \equiv r_f$, while the other case has the BLKT at one of the fixed points only: $r^a_f \neq 0, ~r^b_f = 0$. In the later situation Eq. (\[trans1\]) becomes: $$\tan(m_n \pi R)=-\frac{r^a_f m_n}{2} .
\label{trans3f}$$
[In both cases the mass eigenvalues can be solved from the transcendental equations (Eqs. \[trans1\] and \[trans3f\]) using numerical technique.]{}
[For small values of $\frac{r^a_f}{R}$ $(<<1)$ the approximate KK-mass formula becomes (using Eq. \[trans3f\]):]{}
$${
m_n\approx\frac{n}{R}\left(\frac{1}{1+\frac{r^a_f}{2\pi R}}\right)\approx\frac{n}{R}\left(1-\frac{r^a_f}{2\pi R}\right).}
\label{apprx}$$
[It is clear from the above expression that for $r^a_f>0$, the KK-mass diminishes with $r^a_f$. This result also holds good when the BLKTs are present at both the boundary points.]{}
$N_n$ being the normalisation constant and determined from orthonormality condition [@ddrs]:
$$\int dy \left[1 + r^a_f \delta(y) + r^b_f \delta(y - \pi R)
\right] ~f^n(y) ~f^m(y) = \delta^{n m},
$$
and is given by: $$N_n = \sqrt{\frac{2}{\pi R}}\left[ \frac{1}{\sqrt{1 + \frac{r_f^2 m_n^2}{4}
+ \frac{r_f}{\pi R}}}\right],
\label{norm1}$$ for equal strength of boundary terms ($r^b_f = r^a_f\equiv r_f$).
And for the other situation when $r^b_f = 0$ and we use $r^a_f \equiv r_f$ one has: $$N_n = \sqrt{\frac{2}{\pi R}}\left[ \frac{1}{\sqrt{1 + \frac{r_f^2 m_n^2}{4}
+ \frac{r_f}{2 \pi R}}}\right].
\label{norm2}$$
Now it is evident from the Eqs. \[norm1\] and \[norm2\] that, for $\frac{r_f}{R}<-\pi$ (for double brane set up) and $\frac{r_f}{R}<-2\pi$ (for single brane set up) the squared norm of zero mode solutions become negative. Moreover for $\frac{r_f}{R}=-\pi$ (for double brane set up) and $\frac{r_f}{R}=-2\pi$ (for single brane set up) the solutions become divergent. Beyond these region the fields become ghost like consequently the values of $\frac{r_f}{R}$ beyond these should be avoided. However for simplicity we stick to positive values of BLKTs only in the rest of our analysis.
Our concern here only with the zero modes and the $n=1$ KK-wave-functions of the five-dimensional fermion fields.
Masses and $y$- dependent wave functions for the electroweak gauge bosons are very similar to the fermions and can be obtained[^4] in a similar manner. We do not repeat these in this article. This can be readily available in [@ddrs].
As KK-masses obtained from transcendental equations are similar for fermions and gauge bosons, so we use $r_\alpha^a, r_\alpha^b$ to pameterised the strengths of BLKT with $\alpha = f$ (fermions) or $V$ (gauge bosons) for the purpose of discussions. It has been assumed in the following that the KK-quarks are either mass degenerate or heavier than the KK-leptons. However they do not enter in our analysis. For simplicity we have assumed that BLKTs for U(1) and SU(2) gauge bosons are same, so that $B^1$ and $W_3^1$ are degenerate in mass. We are only interested in the $n = 1$ state.
![Left panel: Dependence of $M_{(1)}\equiv m_{\alpha^{(1)}} R$ with respect to $R_\alpha \equiv r_\alpha^a/R$ when $r_\alpha^a =
r_\alpha^b$. In the inset is shown the variation of $M_{(1)}$ on ${\Delta R_\alpha} \equiv (r_\alpha^b - r_\alpha^a)/R$ for two different $R_\alpha$. Right panel: $M_{(1)}$ with respect to $R_\alpha$ when the BLKT is present only at the $y = 0$ fixed point. The inset shows a magnified portion of the variation which gives the actual range of $R_\alpha$ that is considered later. The insets of both panels shows small variation of $M_{(1)}$ with respect to BLKTs. Here $\alpha = f$ (fermions) and $V$ (gauge bosons).[]{data-label="KKmass"}](mdr.ps "fig:") ![Left panel: Dependence of $M_{(1)}\equiv m_{\alpha^{(1)}} R$ with respect to $R_\alpha \equiv r_\alpha^a/R$ when $r_\alpha^a =
r_\alpha^b$. In the inset is shown the variation of $M_{(1)}$ on ${\Delta R_\alpha} \equiv (r_\alpha^b - r_\alpha^a)/R$ for two different $R_\alpha$. Right panel: $M_{(1)}$ with respect to $R_\alpha$ when the BLKT is present only at the $y = 0$ fixed point. The inset shows a magnified portion of the variation which gives the actual range of $R_\alpha$ that is considered later. The insets of both panels shows small variation of $M_{(1)}$ with respect to BLKTs. Here $\alpha = f$ (fermions) and $V$ (gauge bosons).[]{data-label="KKmass"}](mass.ps "fig:")
In Fig. \[KKmass\] we have shown in plots a dimensionless quantity $M_{(1)}
\equiv m_{\alpha^{(1)}} R$, in the two different cases. The left panel reflects the mass profile for $n = 1$ KK-excitation when the BLKTs are presents at the two fixed points ($y=0$ and $y=\pi R$), while the right panel shows the case when the BLKTs are present only at $y = 0$. In both cases the KK-mass decreases with the increasing values of BLKT parameter. The detailed illustrations of this non-trivial KK-mass dependence has been discussed in a previous article and can be found in [@drs].
Interacting coupling of with zero-mode fermions
===============================================
Coupling of the states $B^1$ or $W_3^1$ to two zero-mode fermions $f^0$ is given by, $$\begin{aligned}
g_{V^{1}f^{0}f^{0}} &=&
g_5(G) ~\int^{\pi R}_{0}
(1+r_{f}\{\delta(y)+\delta(y-\pi R)\})
f_{L}^{0}f_{L}^{0}a^{1} dy, \nonumber \\
&=& g_5(G) ~\int^{\pi R}_{0} (1+r_{f}\{\delta(y)+\delta(y-\pi R)\})
g_{R}^{0}g_{R}^{0}a^{1} dy .
\label{coup0}\end{aligned}$$ Further, the five-dimensional gauge couplings $g_{5}(G)$ which appears above is related to the usual coupling $g$ through $$g_{5}(G) = g ~\sqrt{\pi R \left(1+\frac{R^a_V+ R^b_V}{2\pi}\right)}.$$ We denote the zero-mode fermion wave-functions by $f_L^0$ and $g_R^0$ while the KK ($n = 1$)-gauge boson wave functions are denoted by $a^1$ depending on the values of chosen BLKTs.
Let us first discuss the case in which BLKTs are presented at both the fixed points. Here we assume for the fermions : $r_f^a = r_f^b = r_f$, but for the gauge bosons : $r_V^a \neq r_V^b$. Using $y$-dependent wave-functions and proper normalisation [@ddrs] we get:
$$\begin{aligned}
g_{V^{1}f^{0}f^{0}} &=&
\frac{g_{5}(G)}{\left(1+\frac{R_{f}}{\pi}\right)}
\;N^1_G\;\left[\frac{\sin(\pi M_{(1)})}
{\pi M_{(1)}}\left\{1-\frac{M_{(1)}^{2}R^{a}_VR_{f}}{4}\right\}\right.
\nonumber \\
&&
\left. +\frac{R^{a}_V}{2\pi}\left\{\cos(\pi M_{(1)})-1\right\}+
\frac{R_{f}}{2\pi}\left\{\cos( \pi M_{(1)})+1\right\}\right] ,
\label{coup1}\end{aligned}$$
which vanishes[^5] when $\Delta R_V = 0$.
Where $M_{(1)} \equiv m_{V^{(1)}} R$ is the scaled KK-mass, and $R_f \equiv r_f/R, \;\; R^a_V \equiv r^a_V/R, \;\; {\rm and} \;\;
R^b_V \equiv r^b_V/R$ are the scaled dimensionless variables defined earlier.
Now we turn to the case which could be considered the most asymmetric one, namely, the BLKT for the fermion and the gauge boson are present only at the $y=0$ fixed point. We obtain for this case [@ddrs]:
$$\begin{aligned}
g_{V^{1}f^{0}f^{0}} &=&
\frac{\sqrt{2} ~g\sqrt{\left(1+\frac{R_{V}}{2\pi}\right)} }
{\left(1+\frac{R_{f}}{2\pi}\right)
\sqrt{1+\left(\frac{R_V M_{(1)}}{2}\right)^2+\frac{R_V}{2\pi}}}
\left(\frac{R_{f}-R_V}{2\pi}\right) \;,
\label{coup2}\end{aligned}$$
and this becomes zero if we put $R_V = R_f$. Here[^6] $R_V \equiv r_V/R$ and $R_f \equiv r_f/R$.
The Fig. \[KKcoupling\] depicts the KK-parity-non-conserving coupling strength in the two different cases. In the left panel (BLKTs are present at two fixed points $y=0$ and $y=\pi R$) we plot the square of the coupling for a fixed value[^7] of $R^a_V$ = 10 as a function of $R_f$ for several choices of $\Delta R_V$. The right panel shows the same thing with respect to $R_f$ (BLKTs are present only at the $y = 0$) for different values of $R_V$. In both cases the KK-parity-non-conserving coupling decreases with the increasing values of fermion BLKT parameters. The detailed analysis of this coupling strength with respect to BLKT parameters can be found in a previous article [@drs].
![Left panel: Dependence of the squared value of scaled KK-parity-non-conserving coupling between $B^1 (W_3^1)$ and a pair of zero-mode fermions with $R_f \equiv R_f^a = R_f^b$ for different $\Delta R_V$, for $R^a_V=10$. Right panel: Dependence of the same coupling with $R_f$ for different choices of $R_V$ when the fermion and gauge boson BLKTs are present only at the $y = 0$ fixed point.[]{data-label="KKcoupling"}](rg_10_cop_v.ps "fig:") ![Left panel: Dependence of the squared value of scaled KK-parity-non-conserving coupling between $B^1 (W_3^1)$ and a pair of zero-mode fermions with $R_f \equiv R_f^a = R_f^b$ for different $\Delta R_V$, for $R^a_V=10$. Right panel: Dependence of the same coupling with $R_f$ for different choices of $R_V$ when the fermion and gauge boson BLKTs are present only at the $y = 0$ fixed point.[]{data-label="KKcoupling"}](c_rf_v.ps "fig:")
Production and decay of via KK-parity-non-conservation
======================================================
We are now in a position to discuss the main result of this paper. From now onwards for the SM particles we will not explicitly write the KK-number $(n = 0)$ as a superscript. At the LHC we study the resonant production of $B^1 (W_3^1)$, via the process $p p ~(q \bar q) \rightarrow B^1 (W_3^1)$ followed by $B^1 (W_3^1) \rightarrow \ell^{+}\ell^{-}$. This results into an $\ell^{+}\ell^{-}$ resonance at the $B^1 (W_3^1)$ mass.
The final state leads to two leptons $(e ~{\rm or} ~\mu)$, with invariant mass peaked at $m_{V^{(1)}}$ which is the KK-mass ($n=1$) of gauge bosons. It should be noted that both the production and the decay of $n=1$ KK-excitations of electroweak gauge bosons are driven by KK-parity-non-conserving couplings which depend on $R_f$, $R^a_V$ and $\Delta R_V$ ($R_f$, $R_V$ when BLKTs are present at only one fixed point). If in future such a signature is observed at the LHC, then it would be a good channel to measure such KK-parity-non-conserving couplings.
Both ATLAS [@atlas8T] and CMS [@cms8T] Collaborations have looked for a resonance decaying to $e^{+}e^{-}$/$\mu^{+}\mu^{-}$ pair in $pp$ collisions at 8 TeV in the LHC experiment. From the lack of observation of such a signal at 95% C.L., upper bounds have been put on the cross section times branching ratio of such a final state as a function of the mass of the resonance. The calculated values of event rate in the KK-parity-non-conserving framework when compared to the experimental data set limits on the parameter space of the model. To get the most up-to-date bounds we use the latest 8 TeV results[^8] from ATLAS [@atlas8T].
Production of $B^1$ ($W_3^1$) (which we generically denote by $V^1$) in $pp$ collisions is driven $q
\bar q$ fusion. A compact form of the production cross section in proton proton collisions can be written as [@ddrs]:
$$\sigma (p p \rightarrow V^{1} + X) = \frac{4 \pi^2}{3 m_{V^{(1)}}^3}\;\sum_i
\Gamma(V^{1} \rightarrow q_i \bar q_i)\;\int_\tau ^1 \frac{dx}{x}\;
\left[f_{\frac{q_{i}}{p}}(x,m_{V^{(1)}}^2)
f_{\frac{{\bar q_{i}}}{p}}(\tau/x,m_{V^{(1)}}^2) +
q_i \leftrightarrow \bar q_i \right].
\label{x-sections}$$
Here, $q_i$ and $\bar{q_i}$ denote a generic quark and the corresponding antiquark of the $i$-th flavour respectively. $f_{\frac{q_{i}}{p}}$ ($f_{\frac{{\bar q_{i}}}{p}}$) is the parton distribution function for quark (antiquark) within a proton. We define $\tau \equiv {m_{V^{(1)}}^2 / S_{PP}}$, where $\sqrt{S_{PP}}$ is the proton-proton centre of momentum energy. $\Gamma(V^{1} \rightarrow q_i \bar q_i)$ represents the decay width of $V^1$ into the quark-antiquark pair and is given by $\Gamma = \left[\frac{{g^{2}_{V^{1}q q}}}{32\pi}\right]\left[(Y^{q}_L)^2 + (Y^{q}_R)^2 \right]m_{B^{(1)}}$ (with $Y^q _L$ and $Y^q _R$ being the weak-hypercharges for the left- and right-chiral quarks) for $B^1$ and $\Gamma = \left[\frac{{g^{2}_{V^{1}q q}}}{32\pi}\right]m_{W_3^{(1)}}$ for the $W_3^1$. Here $g^{}_{V^1 q q}$ is the KK-parity-non-conserving coupling of the $V^1$ with the SM quarks – see Eqs. (\[coup1\]) and (\[coup2\]).
We use a parton-level Monte Carlo code with parton distribution functions as parametrised in CTEQ6L [@CTEQ] for determination of the numerical values of the cross sections. In our analysis we set the $pp$ centre of momentum energy at 8 TeV and the factorisation scales (in the parton distributions) at $m_{V^{(1)}}$. To obtain the event rate one must multiply the cross sections with appropriate branching ratio[^9] of $B^1$ or $W_3^1$ into $e^{+}e^{-}$/$\mu^{+}\mu^{-}$. [Here we have assumed without any loss of generality that $B^1$ and $W_3^1$ are lighter than the $n=1$ KK-excitation of the fermions. Which implies that they are the lightest KK-particle and they can decay only to a pair of SM particles via KK-parity-non-conserving coupling–see Eqs. (\[coup1\]) and (\[coup2\]).]{}
At this end, let us comment about the values of the BLKT parameters used in our analysis. The BLKTs imposed in Eq. \[faction\] are not five-dimensional operators in four-dimensional effective theory but some sort of boundary conditions on the respective fields at the orbifold fixed points. The masses (solutions of transcendental equations) and profiles in the $y$-directions for the fields are consequences of these boundary conditions. In fact, four-dimensional effective theory only contains the [*canonical* ]{} kinetic terms for the fields and their KK-excitations along with their mutual interactions. The effect of BLKTs only shows up in modifications of some of these couplings via an overlap integral ( see Eq. \[coup0\]) and also in deviations of the masses from UED values of $n/R$ (in the $n$-th KK-level). So as long as these overlap integrals are not very large $( \lesssim 1 )$ we do not have any problem with the convergence of perturbation series. In Fig. \[KKcoupling\], we have shown that the values of the overlap integrals (involves in the couplings determined by the five-dimensional wave functions) are $\lesssim 1$ for the entire range of the strengths of the BLKTs which have used in this article and never grow with these strengths. Furthermore it has been shown in [@L_BLKTs] that theories with large strength of the BLKTs (relative to their natural cutoff scale, $\Lambda$) were found to be perturbatively consistent and are thus favoured. Such results in Ref. [@L_BLKTs] is in agreement with our observation that the numerical values of the overlap integral diminishes with increasing magnitude of BLKT coefficients ($r_{i}$’s).
We now present the main numerical results for two distinct cases, either BLKTs are present at both fixed points or only at one of the two, in following subsections.
BLKTs are present at and
-------------------------
In Fig. \[contours\] we present the results for the case when the fermion BLKTs are symmetric at the two fixed points but unequal values of the gauge BLKTs break the KK-parity. Here we show the region of parameter space excluded by the ATLAS 8 TeV data [@atlas8T] for two different choices of $R_V^a$. Each panel depicts that the region to the left of a curve in the $m_{V^{(1)}}-R_f$ plane is excluded by the ATLAS data.
For a chosen $R^a_V$ there is an one-to-one correspondence of $m_{V^{(1)}}$ with $1/R$ which is shown on the upper axis of the panels, as the KK-mass is rather insensitive to $\Delta R_V$. Also, for any displayed value of $1/R$ we can estimate the first excitation of fermion KK-mass $M_{f^{(1)}} = m_{f^{(1)}} R$ ( plotted on right-side axis) which is determined by $R_f$.
The exclusion plots can be understood easily in conjunction with Fig. \[KKmass\] and Fig. \[KKcoupling\]. For a given $\Delta R_V$ and $R^a_V$ the KK-parity-non-conserving couplings are almost insensitive to $R_f$. Thus $R_f$ has no steering on the production of $e^{+}e^{-}$/$\mu^{+}\mu^{-}$. The signal rate thus solely depend on $R^a_V$ and $\Delta R_V$. Coupling (and inturn signal strength) increases with $\Delta R_V$. Thus with higher and higher strength of KK-parity non-conservation one can exclude higher and higher masses (and higher values of $1/R$) as revealed in Fig. \[contours\].
![95% C.L. exclusion plots in the $m_{V^{(1)}} - R_f$ plane for several choices of $\Delta R_V$. Each panel corresponds to a specific value of $R^a_V$. The region to the left of a given curve is excluded from the non-observation of a resonant $\ell^{+}\ell^{-}$ signal running at 8 TeV by ATLAS data [@atlas8T]. $1/R$ and $M_{f^{(1)}} =
m_{f^{(1)}} R$ are displayed in the upper and right-side axes respectively (see text).[]{data-label="contours"}](rg_10_mp_v.ps "fig:") ![95% C.L. exclusion plots in the $m_{V^{(1)}} - R_f$ plane for several choices of $\Delta R_V$. Each panel corresponds to a specific value of $R^a_V$. The region to the left of a given curve is excluded from the non-observation of a resonant $\ell^{+}\ell^{-}$ signal running at 8 TeV by ATLAS data [@atlas8T]. $1/R$ and $M_{f^{(1)}} =
m_{f^{(1)}} R$ are displayed in the upper and right-side axes respectively (see text).[]{data-label="contours"}](rg_14_mp_v.ps "fig:")
BLKTs are present only at
--------------------------
Now let us concentrate on the case of fermion and gauge BLKTs at only one fixed point. In this case we display the exclusion curves in the $m_{V^{(1)}}-R_f$ plane for several choices of $R_V$ in Fig. \[contoursS\]. The region below a curve has been disfavoured by the ATLAS data.
![95% C.L. exclusion plots in the $m_{V^{(1)}} - R_f$ plane for several choices of $R_V$. The region below a specific curve is ruled out from the non-observation of a resonant $\ell^{+}\ell^{-}$ signal in the 8 TeV run of LHC by ATLAS [@atlas8T]. $1/R$ and $M_{f^{(1)}} = m_{f^{(1)}} R$ are displayed in the upper and right-side axes respectively (see text). []{data-label="contoursS"}](single_v.ps)
One can explain the Fig. \[contoursS\] on the basis of Fig. \[KKmass\] and Fig. \[KKcoupling\]. It is revealed in the left panel of Fig. \[KKmass\], $M_{(1)}
\equiv m_{V^{(1)}} R$ has mild variation with $R_V$. So we can take the mass of $V^1$ to be approximately proportional to $1/R$ (the relevant values of $1/R$ are displayed in the upper axis of the panel in Fig. \[contoursS\]). In our model we estimate the cross section times branching ratio corresponding to any $m_{V^{(1)}}$, and comparing this with the ATLAS data we can have a specific value of $(R_V, R_f)$ pair on each curve via KK-parity-non-conserving coupling. Alternatively, it is evident from the Fig. \[contoursS\], as $m_{V^{(1)}}$ increases, the production of the $B^1 (W_3^1)$ decreases. As a compensation, the KK-parity-non-conserving coupling must increase as we increase the $m_{V^{(1)}}$. So it is clear from the right panel of Fig. \[KKcoupling\], increasing value of KK-parity-non-conserving coupling is achieved by the higher values of $R_V$ for a fixed value of $R_f$. In this case also, the KK-fermion mass of first excitation can be obtained in a correlated way from the right-side axis of this plot.
[Let us pay some attention to Fig. \[contoursS\]. For a given curve (specified by a $R_V$), the allowed area in $m_{V^{(1)}} - R_f$ plane is bounded by the curve itself and a line parallel to $m_{V^{(1)}}$ axis corresponding to the value of $R_f$ determined by the specific value of $R_V$ of that curve. The choice of the $R_f<R_V$ ensures mass hierarchy among KK-electroweak gauge boson and KK-leptons. So the bounded region implies that for a given value of $m_{V^{(1)}}$ , $R_f$ is bounded from below which in turn imposes an upper limit on the mass of the $n = 1$ KK-lepton. ]{}
Conclusions
===========
In summary, we have investigated the phenomenology of KK-parity non-conservation in the UED model where all the SM fields propagate in 4+1 dimensional space time. We have achieved this non-conservation due to inclusion of asymmetric[^10] BLTs at the two fixed points of this orbifold. These boundary (kinetic in our case) terms can be thought of as a cut-off ($\Lambda$) dependent log divergent radiative corrections [@cms1] which remove the degeneracy in the KK-mass spectrum of the effective 3+1 dimensional theory.
With positive values of BLKTs, we have studied electroweak interaction, in two alternative ways. In the first case we put equal strengths of fermion BLKTs at the two fixed points and parametrised by $r_f$, while for electroweak gauge boson we have considered unequal strengths of BLKTs $(r_V^a \neq r_V^b)$. Equal strengths of electroweak gauge boson BLKTs would preserve the $Z_2$-parity. In the other situation we have considered the fermion and electroweak gauge boson BLKTs are present only at the $y = 0$ fixed point. These BLKTs modify the field equations and the boundary conditions of the solutions lead to the non-trivial KK-mass excitations and wave-functions of fermions and the electroweak gauge bosons in the $y$-direction in both cases. In this platform we have calculated KK-parity-non-conserving coupling between the $n = 1$ KK-excitation of the electroweak gauge bosons and pair of SM fermions ($n = 0$) in terms of $r_f, r^a_V, r^b_V ~{\rm and} ~1/R$ when BLKTs are present at both fixed points and $r_f, r_V, ~{\rm and} ~1/R$ for the other case. This driving coupling vanishes in the $\Delta R_V = 0$ limit in the first case and for $R_f = R_V$ in the second.
Finally we estimate the single production of $V^1$ at the LHC and its subsequent decay to $\ell^{+}\ell^{-}$, both the production and decay are controlled by the KK-parity-non-conserving coupling. We compare our results with the $\ell^{+}\ell^{-}$ resonance production signature at the LHC running at 8 TeV $pp$ centre of momentum energy [@atlas8T; @cms8T]. The lack of observation of this signal with 20 $fb^{-1}$ accumulated luminosity by ATLAS collaboration [@atlas8T] at the LHC already excludes a large part of the parameter space (spanned by $r_f, r^a_V, r^b_V$ and $1/R$ in one case and $r_f,
r_V$ and $1/R$ in the other). Here we consider the $B^1 (W_3^1)$ is lighter than the corresponding fermion and the bounds on the mass of the former are the same as that on the $\ell^{+}\ell^{-}$ resonance from the data.
At the end, we also like to point out another important observation regarding the excluded parameter space of this model that the $\ell^{+}\ell^{-}$ resonance search disfavoured more parameter space in comparison to the $t\bar{t}$ resonance search which we performed in our previous article [@drs].
[**Acknowledgements**]{} The author thanks Anindya Datta, Amitava Raychaudhuri and Ujjal Kumar Dey for many useful discussions. He is grateful to Debabrata Adak for carefully reading the manuscript and several illuminating suggestions. He is the recipient of a Senior Research Fellowship from the University Grants Commission.
[99]{}
The ATLAS Collaboration, ATLAS-CONF-2013-017.
T. Appelquist, H. C. Cheng and B. A. Dobrescu, Phys. Rev. D [**64**]{} (2001) 035002 \[arXiv:hep-ph/0012100\].
H. Georgi, A. K. Grant and G. Hailu, Phys. Lett. B [**506**]{} (2001) 207 \[arXiv:hep-ph/0012379\].
H.C. Cheng, K.T. Matchev and M. Schmaltz, Phys. Rev. D [**66**]{} (2002) 036005 \[arXiv:hep-ph/0204342\].
H. C. Cheng, K. T. Matchev and M. Schmaltz, Phys. Rev. D [**66**]{} (2002) 056006 \[arXiv:hep-ph/0205314\].
P. Nath and M. Yamaguchi, Phys. Rev. D [**60**]{} (1999) 116006 \[arXiv:hep-ph/9903298\].
I. Antoniadis, Phys. Lett. B [**246**]{} (1990) 377.
P. Dey and G. Bhattacharyya, Phys. Rev. D [**70**]{} (2004) 116012 \[arXiv:hep-ph/0407314\]; P. Dey and G. Bhattacharyya, Phys. Rev. D [**69**]{} (2004) 076009 \[arXiv:hep-ph/0309110\].
D. Chakraverty, K. Huitu and A. Kundu, Phys. Lett. B [**558**]{} (2003) 173 \[arXiv:hep-ph/0212047\].
A.J. Buras, M. Spranger and A. Weiler, Nucl. Phys. B [**660**]{} (2003) 225 \[arXiv:hep-ph/0212143\]; A.J. Buras, A. Poschenrieder, M. Spranger and A. Weiler, Nucl. Phys. B [**678**]{} (2004) 455 \[arXiv:hep-ph/0306158\].
K. Agashe, N.G. Deshpande and G.H. Wu, Phys. Lett. B [**514**]{} (2001) 309 \[arXiv:hep-ph/0105084\]; U. Haisch and A. Weiler, Phys. Rev. D [**76**]{} (2007) 034014 \[hep-ph/0703064\]. J. F. Oliver, J. Papavassiliou and A. Santamaria, Phys. Rev. D [**67**]{} (2003) 056002 \[arXiv:hep-ph/0212391\]. T. Appelquist and H. U. Yee, Phys. Rev. D [**67**]{} (2003) 055002 \[arXiv:hep-ph/0211023\]; G. Belanger, A. Belyaev, M. Brown, M. Kakizaki and A. Pukhov, EPJ Web Conf. [**28**]{} (2012) 12070 \[arXiv:1201.5582 \[hep-ph\]\]. T.G. Rizzo and J.D. Wells, Phys. Rev. D [**61**]{} (2000) 016007 \[arXiv:hep-ph/9906234\]; A. Strumia, Phys. Lett. B [ **466**]{} (1999) 107 \[arXiv:hep-ph/9906266\]; C.D. Carone, Phys. Rev. D [ **61**]{} (2000) 015008 \[arXiv:hep-ph/9907362\].
I. Gogoladze and C. Macesanu, Phys. Rev. D [**74**]{} (2006) 093012 \[arXiv:hep-ph/0605207\]. T. Rizzo, Phys. Rev. D [**64**]{} (2001) 095010 \[arXiv:hep-ph/0106336\]; C. Macesanu, C.D. McMullen and S. Nandi, Phys. Rev. D [**66**]{} (2002) 015009 \[arXiv:hep-ph/0201300\]; Phys. Lett. B [**546**]{} (2002) 253 \[arXiv:hep-ph/0207269\]; H.-C. Cheng, Int. J. Mod. Phys. A [**18**]{} (2003) 2779 \[arXiv:hep-ph/0206035\]; A. Muck, A. Pilaftsis and R. Rückl, Nucl. Phys. B [**687**]{} (2004) 55 \[arXiv:hep-ph/0312186\]; B. Bhattacherjee and A. Kundu, J. Phys. G [**32**]{}, 2123 (2006) \[arXiv:hep-ph/0605118\]; B. Bhattacherjee and A. Kundu, Phys. Lett. B [**653**]{}, 300 (2007) \[arXiv:0704.3340 \[hep-ph\]\]; G. Bhattacharyya, A. Datta, S. K. Majee and A. Raychaudhuri, Nucl. Phys. B [**821**]{} (2009) 48 \[arXiv:hep-ph/0608208\]; P. Bandyopadhyay, B. Bhattacherjee and A. Datta, \[arXiv:0909.3108 \[hep-ph\]\]; B. Bhattacherjee, A. Kundu, S. K. Rai and S. Raychaudhuri, \[arXiv:0910.4082 \[hep-ph\]\]; B. Bhattacherjee and K. Ghosh, Phys. Rev. D [**83**]{} (2011) 034003 \[arXiv:1006.3043 \[hep-ph\]\].
A. Datta and S. Raychaudhuri, Phys. Rev. D [**87**]{} (2013) 035018 \[arXiv:1207.0476 \[hep-ph\]\]; U. K. Dey and T. S. Ray, arXiv:1305.1016 \[hep-ph\]; K. Nishiwaki, et al.\[arXiv:1305.1686 \[hep-ph\]\]’\[arXiv:1305.1874 \[hep-ph\]\]; G. Bélanger, A. Belyaev, M. Brown, M. Kazikazi, and A. Pukhov, \[arXiv:1207.0798 \[hep-ph\]\]; A. Belyaev, M. Brown, J. M. Moreno, C. Papineau, \[arXiv:1212.4858 \[hep-ph\]\].
G. Bhattacharyya, P. Dey, A. Kundu and A. Raychaudhuri, Phys. Lett. B [**628**]{}, 141 (2005) \[arXiv:hep-ph/0502031\]; B. Bhattacherjee and A. Kundu, Phys. Lett. B [**627**]{}, 137 (2005) \[arXiv:hep-ph/0508170\]; A. Datta and S. K. Rai, Int. J. Mod. Phys. A [**23**]{}, 519 (2008) \[arXiv:hep-ph/0509277\]; B. Bhattacherjee, A. Kundu, S. K. Rai and S. Raychaudhuri, Phys. Rev. D [**78**]{}, 115005 (2008) \[arXiv:0805.3619 \[hep-ph\]\]; B. Bhattacherjee, Phys. Rev. D [**79**]{}, 016006 (2009) \[arXiv:0810.4441 \[hep-ph\]\]. L. Edelhauser, T. Flacke, and M. Krëmer, JHEP [**1308**]{} (2013) 091 \[arXiv:1302.6076v2 \[hep-ph\]\].
A. Datta, U. K. Dey, A. Shaw, and A. Raychaudhuri, Phys. Rev. D [**87**]{} (2013) 076002 arXiv:1205.4334 \[hep-ph\].
The CMS Collaboration, CMS PAS EXO-12-061.
A. Datta, A. Raychaudhuri, and A. Shaw, Phys. Lett. B [**[730]{}**]{}, 42 (2014) \[arXiv:1310.2021 \[hep-ph\]\].
The CMS Collaboration, \[arXiv:1309.2030v1\].
The ATLAS Collaboration, \[arXiv:1310.0486v2\].
G. R. Dvali, G. Gabadadze, M. Kolanovic and F. Nitti, Phys. Rev. D [**64**]{} (2001) 084004 \[arXiv:hep-ph/0102216\].
M. S. Carena, T. M. P. Tait and C. E. M. Wagner, Acta Phys. Polon. B [**33**]{} (2002) 2355 \[arXiv:hep-ph/0207056\]. F. del Aguila, M. Perez-Victoria and J. Santiago, JHEP [**0302**]{} (2003) 051 \[hep-th/0302023\]; \[hep-ph/0305119\].
F. del Aguila, M. Perez-Victoria and J. Santiago, Acta Phys. Polon. B [**34**]{} (2003) 5511 \[hep-ph/0310353\].
T. Flacke, A. Menon and D. J. Phalen, Phys. Rev. D [**79**]{} (2009) 056009 \[arXiv:0811.1598 \[hep-ph\]\].
For a discussion of BLKT in extra-dimensional QCD, see A. Datta, K. Nishiwaki and S. Niyogi, JHEP [**1211**]{} (2012) 154 \[arXiv:1206.3987 \[hep-ph\]\].
C. Schwinn, Phys. Rev. D [**69**]{} (2004) 116005 \[arXiv:hep-ph/0402118\].
J. Pumplin [*et al.*]{}, JHEP [**07**]{} (2002) 012 \[arXiv:hep-ph/0201195\].
E. Ponton and E. Poppitz, JHEP [**0106**]{} (2001) 019 \[arXiv:hep-ph/0105021\]
G. Servant and T. M. P. Tait, Nucl. Phys. B [**650**]{} (2003) 391, \[arXiv: hep-ph/0206071\]; D. Majumdar, Mod. Phys. Lett. A [**18**]{} (2003) 1705; K. Kong and K. T. Matchev, JHEP [**0601**]{} (2006) 038 \[arXiv: hep-ph/0509119\];F. Burnell and G. D. Kribs, Phys. Rev. D [**73**]{} (2006) 015001 \[arXiv:hep-ph/0509118\]; G.Belanger, M. Kakizaki and A. Pukhov, JCAP [**1102**]{} (2011) 009, \[arXiv:1012.2577 \[hep-ph\]\].
A. Datta, U. K. Dey, A. Raychaudhuri, and A. Shaw, Phys. Rev. D [**88**]{} (2013) 016011 \[arXiv:1305.4507 \[hep-ph\]\].
[^1]: email: avirup.cu@gmail.com
[^2]: This is equivalent to R-parity violation in supersymmetry.
[^3]: We use the chiral representation with $\gamma_5 = diag(-I, I)$.
[^4]: The KK-modes of gauge bosons also receive a contribution to their masses from spontaneous breaking of the electroweak symmetry, but we have not considered that contribution as they are negligible with respect to extra-dimensional contribution.
[^5]: see Fig. 3 in [@ddrs].
[^6]: As the BLKTs are present at only one fixed point so we use $R_f$ and $R_V$ with no superscript for fermions and gauge bosons respectively.
[^7]: We have checked that the results are quite similar for the other value of $R^a_V$ that we consider later.
[^8]: ATLAS results have been used in this paper as it used a higher accumulated data set. However we have checked that the limits derived from CMS [@cms8T] data are almost the same.
[^9]: The branching ratio of $B^1\ (W_3^1)$ to $e^{+}e^{-}$ and $\mu^{+}\mu^{-}$ is approximately $\frac{30}{103}$ ($\frac{2}{21}$).
[^10]: Symmetric BLTs leads to conserved $Z_2$ symmetry, hence $n = 1$ KK-particles is stable and can be a dark matter candidate [@dm; @ddrs_dm].
|
2023-11-29T01:26:36.242652
|
https://example.com/article/6454
|
The anti-trp RNA-binding attenuation protein (Anti-TRAP), AT, recognizes the tryptophan-activated RNA binding domain of the TRAP regulatory protein.
In Bacillus subtilis, the trp RNA-binding attenuation protein (TRAP) regulates expression of genes involved in tryptophan metabolism in response to the accumulation of l-tryptophan. Tryptophan-activated TRAP negatively regulates expression by binding to specific mRNA sequences and either promoting transcription termination or blocking translation initiation. Conversely, the accumulation of uncharged tRNA(Trp) induces synthesis of an anti-TRAP protein (AT), which forms a complex with TRAP and inhibits its activity. In this report, we investigate the structural features of TRAP required for AT recognition. A collection of TRAP mutant proteins was examined that were known to be partially or completely defective in tryptophan binding and/or RNA binding. Analyses of AT interactions with these proteins were performed using in vitro transcription termination assays and cross-linking experiments. We observed that TRAP mutant proteins that had lost the ability to bind RNA were no longer recognized by AT. Our findings suggest that AT acts by competing with messenger RNA for the RNA binding domain of TRAP. B. subtilis AT was also shown to interact with TRAP proteins from Bacillus halodurans and Bacillus stearothermophilus, implying that the structural elements required for AT recognition are conserved in the TRAP proteins of these species. Analyses of AT interaction with B. stearothermophilus TRAP at 60 degrees C demonstrated that AT is active at this elevated temperature.
|
2023-09-07T01:26:36.242652
|
https://example.com/article/7139
|
636 F.2d 1202
Lee, In re
80-3049
UNITED STATES COURT OF APPEALS Second Circuit
10/7/80
MANDAMUS DENIED
|
2024-07-11T01:26:36.242652
|
https://example.com/article/4649
|
Trevor Noah Mocks Hillary Clinton for Pandering to Millennials with Lena Dunham
"If you can’t get excited, be pragmatic and do it anyway."
Trevor Noah continued his "war on bullshit" during his second episode of The Daily Show, calling out Ben Carson and Hillary Clinton for inauthentically aligning with Kanye West and Lena Dunham.
Calling it "Panderdemic 2016," Noah aired clips of politicians' recent tendency for "pretending to like young people things," including Marco Rubio sharing his thoughts on the Biggie and Tupac feud, and Carson's advice for West to record uplifting music.
"Wow, Ben Carson is giving Kanye West music advice," said Noah, then joking of a monotone Carson-West mixtape.
And of Dunham's recent interview with Clinton, in which he highlighted moments of forced enthusiasm, Noah pointed to Clinton's own words to sum it all up: " 'If you can’t get excited, be pragmatic and do it anyway,' " he quoted. "That is the worst hype speech I’ve ever heard in my life!"
Watch the video below.
|
2024-05-01T01:26:36.242652
|
https://example.com/article/1252
|
Q:
changing a picker to table view OR having multiple table views on the same view
My iPad app was rejected due to my use of a picker. The picker was used to control a table view. In my view, a picker was displaying a series of items and when one of those items was selected, it used that selection to populate a table with data. (hopefully that makes sense). Now I need to do this without the picker so I need to have the data that was in the picker be represented in a table view.
My question, is how do I have multiple tableViews in the same view?
is it as simple as having separate delegate methods for each tableview like this?
-(NSInteger)numberOfSectionsInTableView:(UITableView *)tableView1
{
return [xxx count];
}
-(NSInteger)numberOfSectionsInTableView:(UITableView *)tableView2
{
return [yyy count];
}
A:
The names of the delegate methods are fixed. So you can either
Use two different delegate instances, or
Identify the table within the method, e.g.
-(NSInteger)numberOfSectionsInTableView:(UITableView *)tableView {
if (tableView.tag == 114)
return [xxx count];
else
return [yyy count];
}
|
2024-07-31T01:26:36.242652
|
https://example.com/article/8335
|
package com.tencent.mm.plugin.wenote.model.nativenote.b;
public interface b {
void ok(boolean z);
void ol(boolean z);
void om(boolean z);
void on(boolean z);
}
|
2024-02-23T01:26:36.242652
|
https://example.com/article/7493
|
Pages
Friday, January 9, 2009
a visit from the 818
"do you love your life? you love your life."
the valley dialogue is a dialogue within itself.
to know it is to love it.
to speak it is to understand it.
"how was the flight? Did you get your own tv screen?"
"I flew on miles. I'm lucky the plane had wings."
the drive home is full of run on sentences, sarcasm and laughter
we talk in tones and references and metaphors
switching from high pitched excitement to the LA droll in the back of our throats
our valley childhoods, our LA life, our hollywood wisdom manifests in our speech
sharp, happy, cynical, funny, and don't forget the wit
i can't explain how amazing it felt to reconnect with this fellow valley girl
and also to get to share a part of my life with someone from home
she is the first person from home that has seen it
and she is the perfect person to have seen it
"so nice seeing you, linds"
we squeeze goodbye and i am reminded of how i miss being called "linds"
she will do great things and i will be happy to pay $15 to see her movies in the future.
|
2024-01-25T01:26:36.242652
|
https://example.com/article/2627
|
Moving window cross validation: a new cross validation method for the selection of a rational number of components in a partial least squares calibration model.
A new cross validation method called moving window cross validation (MWCV) is proposed in this study, as a novel method for selecting the rational number of components for building an efficient calibration model in analytical chemistry. This method works with an innovative pattern to split a validation set by a number of given windows that move synchronously along proper subsets of all the samples. Calculations for the mean value of all mean squares error in cross validations (MSECVs) for all splitting forms are made for different numbers of components, and then the optimal number of components for the model can be selected. Performance of MWCV is compared with that of two cross validation methods, leave-one-out cross validation (LOOCV) and Monte Carlo cross validation (MCCV), for partial least squares (PLS) models developed on one simulated data set and two real near-infrared (NIR) spectral data sets. The results reveal that MWCV can avoid a tendency to over-fit the data. Selection of the optimal number of components can be easily made by MWCV because it yields a global minimum in root MSECV at the optimal number of components. Changes in the window size and window number of MWCV do not greatly influence the selection of the number of components. MWCV is demonstrated to be an effective, simple and accurate cross validation method.
|
2024-02-23T01:26:36.242652
|
https://example.com/article/9173
|
843 P.2d 645 (1992)
SANDSTROM & SONS, INC., an Alaska corporation, Appellant,
v.
STATE of Alaska, Appellee.
No. S-4608.
Supreme Court of Alaska.
December 24, 1992.
*646 James T. Stanley and Susan D. Mack, James T. Stanley Corp., P.C., Anchorage, for appellant.
James F. Klasen, Asst. Atty. Gen., Anchorage, Charles E. Cole, Atty. Gen., Juneau, for appellee.
Before RABINOWITZ, C.J., and BURKE, MATTHEWS, COMPTON and MOORE, JJ.
OPINION
BURKE, Justice.
I. INTRODUCTION
Sandstrom & Sons, Inc. sued the State of Alaska for breach of contract. During the course of the litigation, Sandstrom failed to comply with a superior court order requiring Sandstrom to produce discoverable materials. It also failed to oppose in a timely fashion the State's motion for summary judgment. As a sanction, the superior court dismissed Sandstrom's suit with prejudice. Sandstrom appeals. We remand.
II. FACTS
Sandstrom sued the State over a road construction contract dispute on September 27, 1989. The superior court placed the case on the "fast track" pursuant to Civil Rule 16.1. Civil Rule 16.1(k) required Sandstrom to produce certain documents not later than 75 days after service of the summons and complaint.[1] It is undisputed that Sandstrom failed to comply with this rule.
On August 17, 1990, the superior court moved the case to the inactive calendar, warning Sandstrom that it would be dismissed "unless prior to the 61st day [after August 17] a valid motion to Set Trial and Certificate are filed." On October 16, Sandstrom filed its Motion to Set Trial and Certificate. In the motion, Sandstrom claimed, incorrectly, that it was in the process of complying with Civil Rule 16.1(k).
On December 12, the State submitted eleven interrogatories and a request for production of documents to Sandstrom.[2] Although the answers and production were due on January 11, 1991,[3] Sandstrom never responded to the interrogatories and failed to produce all the requested documents.[4]
*647 On February 6, the State filed a motion to compel Sandstrom to comply. Sandstrom never responded to the State's motion to compel.
On February 19, the State filed a motion for summary judgment. On February 20, Sandstrom moved to allow Sandstrom's attorney, Craig Schmidt, to withdraw from representing Sandstrom. On March 4, the superior court granted Sandstrom's motion allowing Schmidt to withdraw, but ordered Sandstrom to immediately retain another attorney: "New counsel for the corporate plaintiff shall enter [an] appearance immediately." At the same time, the superior court granted the State's motion to compel, ordering Sandstrom to comply with the State's discovery requests by March 25. The court also ordered Sandstrom to "file and personally serve an opposition to the state's motion for summary judgment" by March 25. The court expressly warned Sandstrom that it would dismiss Sandstrom's complaint if Sandstrom did not oppose the State's motion for summary judgment: "Failure of the plaintiff to oppose the state's motion for summary judgment within 20 days from the date of this order shall result in the dismissal of the plaintiff's complaint."
Despite the superior court's order to immediately retain another attorney, Sandstrom did not begin looking for another attorney until March 11, and did not retain another attorney until March 26, one day after the court's deadline for Sandstrom to respond to the State's discovery requests and to oppose the State's motion for summary judgment. Even after retaining another attorney, Sandstrom did not respond to the State's discovery requests, and did not oppose the State's motion for summary judgment. Instead, on March 29 Sandstrom requested a sixty day extension of time to oppose the State's motion for summary judgment "with the appropriate extensions for discovery." In response to Sandstrom's motion for extensions of time, the State asked the superior court to dismiss Sandstrom's action as a Civil Rule 37(b) sanction for Sandstrom's failure to comply with the court's discovery order.
The superior court did not explicitly address Sandstrom's March 29 motion. Instead, on April 24 the superior court dismissed Sandstrom's complaint as a sanction for Sandstrom's noncompliance with the court's March 4 order. Specifically the superior court stated:
The court finds that the plaintiff has failed to comply with the court's order of March 4, regarding discovery owed to the state, plaintiff has failed to timely oppose [the state's] summary judgment motion as per the March 4, 1991 order, and that the plaintiff has offered no adequate justification for that failure and further that the plaintiff's repetitious conduct in failing to provide discovery shows a willfulness to violate the court's orders and the civil rules, [sic] therefore the court hereby dismisses the plaintiff's complaint with prejudice as a sanction for failing to comply with the court's order of March 4, 1991.
The superior court denied Sandstrom's motion for reconsideration. Sandstrom appeals.
III. DISCUSSION
Civil Rule 37(b)(2)(C) authorizes the superior court to dismiss an action if a party fails to comply with a discovery order.[5] However, since the law disfavors litigation ending sanctions, the superior court has the discretion to impose such sanctions only in "extreme circumstances." Otis Elevator Co. v. Garber, 820 P.2d 1072, 1074 (Alaska 1991). We have held that "a party should not be barred from his or her day in court where an alternative remedy would suffice to make the adverse party whole." Power Constructors v. Acres American, 811 P.2d 1052, 1055 (Alaska 1991). Thus, "the record [must] clearly indicate a reasonable exploration of *648 possible and meaningful alternatives to dismissal." Id.
Additionally, for Civil Rule 37(b) sanctions to be appropriate, a party's failure to comply with a court order must be willful. Rohweder v. Fleetwood Homes of Oregon, 767 P.2d 187, 190 (Alaska 1989). "Willfulness" is defined as "a conscious intent to impede discovery." Hawes Firearms Co. v. Edwards, 634 P.2d 377, 378 n. 2 (Alaska 1981).
In the case at bar, Sandstrom failed to comply with the superior court's order compelling it to respond to the State's discovery requests and the State's motion for summary judgment. By failing to comply with the discovery order, Sandstrom violated Civil Rule 37(b).
Sandstrom argues that the superior court's dismissal with prejudice denied it procedural due process because the superior court did not hold a specific dismissal hearing. However, almost two months before the dismissal, in its March 4 discovery order, the superior court explicitly forewarned Sandstrom that it would face dismissal with prejudice if it failed to comply with the order. This order afforded Sandstrom notice and an adequate opportunity to be heard on the dismissal issue. The superior court therefore afforded Sandstrom procedural due process. Graham v. State, 633 P.2d 211, 216 (Alaska 1981) (procedural due process requires the State to afford a person an opportunity for a hearing before the State deprives that person of a protected property interest).[6]
The only explanation that Sandstrom offered in its brief and at oral argument to justify its misconduct is that it was without counsel from March 4, 1991 until March 26, 1991. This does not explain Sandstrom's failure to comply with the superior court's order after March 26. Moreover, it does not adequately explain Sandstrom's failure to comply with the superior court's order between March 4 and March 26.[7]
While Sandstrom's conduct deserves sanction, we remand the case because the superior court failed to explore any sanctions other than dismissal. In Power Constructors, we held that before dismissing a case with prejudice the superior court must examine less drastic sanctions:
We do not require the court to make explicit findings concerning alternative sanctions, nor do we require it to examine every single alternate remedy to dismissal. We require only that the record clearly indicate a reasonable exploration of possible and meaningful alternatives to dismissal.
811 P.2d at 1055 (citations omitted). In Power Constructors, we found evidence of such a "reasonable exploration" since the superior court rejected the plaintiff's offer to pay for the cost of deposing out of state witnesses and its offer to pay a fine to avoid dismissal. Id.
In the present case, the record contains no evidence that the superior court considered alternative sanctions. The State suggests that "the trial court considered and rejected non-litigation ending sanctions in the court's rejection of Sandstrom's motion for extension of time and in its rejection of Sandstrom's motion for reconsideration of the court's order to dismiss." Our examination of the record does not support this contention. Thus, we must remand the case for a "reasonable exploration" of alternative *649 sanctions.[8] We express no view at this time as to whether the imposition of a litigation ending sanction of dismissal with prejudice is warranted.
REMANDED for further proceedings as required by this opinion.
NOTES
[1] Civil Rule 16.1(k) required in part that Sandstrom furnish the State with all documents regarding the interpretation of their contract and all documents evidencing damages by December 19, 1989.
[2] Many of the items requested by the State were due a year earlier pursuant to Civil Rule 16.1(k).
[3] Civil Rules 33(a) and 34(b) provide that a party has 30 days to respond to interrogatory and production of document requests.
[4] On January 22, 1991, Sandstrom responded to the State's request for production by indicating that the documents requested were available for copying. However, when the State reviewed the documents it discovered that "numerous categories of documents were completely missing including employee and equipment time cards, accounting ledgers, payroll records and all other documents verifying the claimed damages."
[5] We review a trial court's choice of Rule 37 sanctions for abuse of discretion. Alaska Trams v. Alaska Elec. Light & Power, 743 P.2d 350, 354 (Alaska 1987).
[6] In addition, in response to Sandstrom's motion for extensions of time, the State specifically requested the superior court to dismiss Sandstrom's action as a Civil Rule 37(b) sanction for Sandstrom's failure to comply with the court's discovery order. Sandstrom had the opportunity to oppose the State's request in its reply brief. This opportunity independently afforded Sandstrom procedural due process.
[7] Sandstrom's delay in finding a new attorney was not reasonable. According to Sandstrom, sometime between December 18, 1990 and January 22, 1991, its original attorney, Craig Schmidt, "ceased practicing law." Therefore, Sandstrom should have started searching for a new attorney on January 22, at the latest. However, according to Sandstrom it did not start looking for a new attorney until March 11. This occurred twenty days after Sandstrom filed its motion to recuse Schmidt and seven days after the superior court granted that motion.
[8] We note that Power Constructors addressed dismissal under Civil Rule 41(e), whereas the present case concerns dismissal under Civil Rule 37(b)(2)(C). The Power Constructors requirement that the court examine alternative sanctions applies with equal force to Rule 37(b) since the results of the two Rules are the same: A party is barred from his or her day in court. Such an "extreme sanction" should always require an examination of alternative sanctions.
|
2023-11-09T01:26:36.242652
|
https://example.com/article/7684
|
Q:
Is it possible to include a Bash script within a gem?
I'm creating a Ruby gem which I intend to publish on rubygems. Unfortunately, there's one thing I can't achieve with Ruby and that needs to be done with Bash (controlling RVM from script).
Is it possible to include a Bash script within a gem and if yes, how would I run the script from Ruby in the context of a gem?
A:
It is possible, but the script can be executed only on unix-like environments, which include bash. You can put the .sh into bin/ or share/ folders, and just call:
name = 'your_gem_name'
g = Gem::Specification.find_by_name( name )
system( File.join( g.full_gem_path, 'share/myscript.sh' ) )
Of course, you always could use bundler gem module to control the current gems instead of running the shell script.
|
2024-03-07T01:26:36.242652
|
https://example.com/article/6062
|
FoxNext
FoxNext, LLC is a video game, virtual reality and theme park unit of 20th Century Fox, now known as 20th Century Studios. It was established in 2017 prior to Disney's acquisition of Fox, and operates under 20th Century Studios and the Fox Networks Group. It handles the development and publishing of video games, virtual reality and augmented reality titles, as well as the development of 20th Century Studios's theme and amusement parks. The division's president is Salil Mehta, a former executive from NBCUniversal and The Walt Disney Company, who has been with Fox since 2013 who later returned to Disney after Disney acquired Fox in 2019.
Background
Virtual Reality
Fox Innovation Lab was the source for the division's VR subdivision with its “The Martian VR Experience” 2016 released which was had a low review and highly discounted later. In January 2017 at CES, Fox Innovation Lab announced a “Planet of the Apes” VR experience with Imaginati Studio as producer.
Theme Parks
Twentieth Century Fox Consumer Products announced a series of Twentieth Century Fox World theme park in Asia in early to mid-2010s. Fox and Genting Malaysia Berhad agreed in 2013 to build a Twentieth Century Fox World theme park, the first such branded park. With Village Roadshow Theme Parks in 2014, Fox agreed to build a Fox World in South Korea. In November 2015, Fox and Al Ahli Holding Group agreed to build a 20th Century Fox World near Dubai in United Arab Emirates under an agreement that would allow Al Ahli to build a total of four Fox Worlds outside of the US.
Video Games
Fox Interactive (later sold to Vivendi Universal Games in 2003, after taking over publishing rights in 2001, later dissolved in 2006) was 20th Century Fox's first video game division when it was founded in 1994 by former Time Warner Interactive executive Ted Hoff. And Fox Digital Entertainment was the second Fox video game division when it was founded in 2010, but it solely focused on making games for mobile devices.
History
FoxNext was formed by January 18, 2017 with the announcement of Salil Mehta as division president transferring from his prior post as president of content management for Twentieth Century Fox Film. The division president would answer to Chairman and CEO of Fox Networks Group, and Chairman and CEO of Twentieth Century Fox Film, who at the time were Peter Rice and Stacey Snider, respectively. The two video gaming units responsible for The Simpsons: Tapped Out mobile game, Fox Digital Entertainment, and the Alien: Isolation console/PC game would become a single unit under FoxNext. The division also gain the over site of the existing 20th Century Fox World theme park project under development as part of its location-based entertainment business transferred from Fox Consumer Products.
FoxNext on January 19, 2017 announced a VR slate with Chris Milk's and former Googler Aaron Koblin's Within VR company, which was founded in 2014 as VRSE with funding from Fox, Legendary Pictures and others. This slate, which would be available via the Within app, included another ”Planet of the Apes”, original works from Milk, Spike Jonze and Megan Ellison and Annapurna Pictures. On June 6, 2017, it acquired Aftershock Studios (formerly Kabam's Los Angeles and San Francisco studios) with Aftershock head Aaron Loeb becoming president of studios for FoxNext Games.
On June 1, 2017, FoxNext announced that veteran marketing executive James Finn has been named executive VP and head of marketing for FoxNext. FoxNext added Marc Zachary as FoxNext Destinations' senior vice president of business development.
On July 27, 2017, FoxNext Games announced that they were developing an action/RPG multiplayer mobile game, Marvel Strike Force, in conjunction with Marvel Entertainment and Aftershock Studios on the Marvel Universe. Released on March 28, 2018, Marvel Strike Force brought in $150 million in revenue over its first year.
FoxNext also published game by other studios including Futurama: Worlds of Tomorrow (2017) and The X-Files: Deep State (2018). The games division formed in March 2018 Fogbank Entertainment in San Francisco splitting them off from Aftershock Studios.
FoxNext acquired in January 2018 Cold Iron Studios from Perfect World Entertainment games publisher. On April 26, 2018, FoxNext opened its first virtual-reality experience location-based, “Alien: Descent”, at The Outlets at Orange mall in Orange County, California.
On 29 April 2018, the Dubai park was put on indefinite hold by the Al Ahli Group amid concerns that there was a "serious supply" of theme parks in Dubai. In late 2018 Genting Malaysia and FoxNext started legal actions against each other over 20th Century Fox World delays. The two parties settled out of court in July 2019.
FoxNext indicated on February 7, 2019, the opening of a development fund to assist indie developers with resources and support. Altered Matter's Etherborn game is the first to join FoxNext Games indie games portfolio.
FoxNext was one of the properties acquired by The Walt Disney Company upon its acquisition of 21st Century Fox. In September 2019, Disney indicated it was looking to sell or shuttering parts of FoxNext. In the past Disney, led by CEO Bob Iger, has eliminated in-house video game development and relying on third-parties to develop games based on its IP, after shutting down Disney Interactive Studios back in 2016. Disney sold the FoxNext Games division, which included FoxNext Games Los Angeles, Cold Iron Studios and Aftershock, to mobile game developer Scopely in January 2020 for an undisclosed amount; Scopely stated it later plans to divest itself of Cold Iron Studios as they develop games for consoles and personal computers. The deal includes most of the IP developed by the studios excluding properties specifically owned by Fox distinct from the Disney acquisition. Fogbank Entertainment was shuttered later in January 2020.
Divisions
FoxNext Games
FoxNext Games Los Angeles (January 2020) sold to Scopely
Aftershock (June 2017—January 2020) sold to Scopley
Cold Iron Studios (January 2018—January 2020) sold to Scopely
Fogbank Entertainment (March 2018-January 2020) closed by Disney
FoxNext VR Studio
FoxNext Destinations
Cancelled theme parks
20th Century Fox World (Dubai)
20th Century Fox World (Malaysia)
Twentieth Century Fox Consumer Products and Genting Malaysia Berhad agreed in 2013 to build a Twentieth Century Fox World theme park, the first such branded park. Genting is funding at $300 million the 25 acre park which would consist of 25 rides and attractions based on Fox films. 20th Century Fox issued a default notice in regards to its licensing agreement for the under construction 20th Century Fox World theme park in Malaysia by Genting Malaysia Bhd. In November 2018 Genting Malaysia filed suit in response and included soon to be parent The Walt Disney Company. The two parties settled out of court in July 2019 in which the Fox name would be dropped from the park while certain Fox properties would be available for Genting to finish the park with the addition of non-Fox properties.
20th Century Fox World (South Korea)
With Village Roadshow Theme Parks in 2014, Fox agreed to build a 75-acre Fox World in 700-acre Ungdong Entertainment Complex, Changwon City, South Korea. Village Roadshow would operate the park. Fox may have back off from the Ungdong location due to the investigation into South Gyeongsang Governor Hong Joon-pyo. By May 16, 2015, Fox Global Location Based Entertainment was looking at building a theme park on Yeongjong Island, Incheon with Incheon Metropolitan Government as a potential investor.
Virtual reality
“Crisis on the Planet of the Apes (April 3, 2018) game for Oculus Rift, HTC Vive and PlayStation VR; inherited from Fox Innovation Lab with Imaginati Studio as producer
“Alien: Descent” (April 26, 2018—) location base experience at The Outlets, Orange mall, Orange County, California.
Video games
Marvel Strike Force mobile game (March 2018) FoxNext Games LA
Futurama: Worlds of Tomorrow mobile game (June 29, 2017) TinyCo (Jam City), Groening and his Curiosity Co. and animation studio Rough Draft Studios
The X-Files: Deep State mystery-investigation puzzle game (February 6, 2018) Estonia-based game studio Creative Mobile
Alien: Blackout mobile game (January 2019) D3 Go!, Rival Games
Storyscape - Fogbank Entertainment
References
External links
Category:The Walt Disney Company subsidiaries
Category:Disney acquisitions
Category:Amusement park developers
Category:Entertainment companies of the United States
Category:Video game publishers
Category:Video game companies established in 2017
Category:American companies established in 2017
Category:Video game companies of the United States
|
2024-06-18T01:26:36.242652
|
https://example.com/article/5715
|
Q:
Where to copy woocommerce files to in my custom theme to avoid editing the core plugin?
I want to change the loop-start.php so I have copies the entire woocommerce plugin into my theme folder. Then started editing templates/loop/loop-start.php but it does not reflect in my front end. Am I doing something wrong?
A:
To override WooCommerce (WC) templates, put your modified templates in
custom_theme/woocommerce/template-category/template-name.php
Example: To override the admin order notification, copy:
wp-content/plugins/woocommerce/templates/emails/admin-new-order.php
to
wp-content/themes/yourtheme/woocommerce/emails/admin-new-order.php
WC Documentation Reference
|
2024-06-29T01:26:36.242652
|
https://example.com/article/8348
|
Black Mirror, Charlie Brooker’s very weird, very wonderful Twitter Twilight Zone, will be back on BBC4 Christmas day. And if you were worried that the show might lose its gloomy viciousness, fear not: Brooker said he’s looking to make it a cross between the traditional “ghost story at Christmas” and the Amicus’ compendium horror movies of the 70s.
If you aren’t familiar with Amicus Productions, they are responsible for the maybe-canon Doctor Who movies starring Peter Cushing, which is a thing that happened, but are better known for Tales from the Crypt, Asylum and Vault of Horror.
So… this episode will be just like that, but with snide observations about these kids and their damn smart phones.
In reality, though, this is strangely fun. The British tradition of airing an extra episode on Christmas day of some of the country’s top shows always seemed a little weird, and often it’s an excuse to get away with telling a sappy story because it’s Christmas after all. Then all the characters can forget the lessons they learned by the time the season picks up again normally.
But I wouldn’t really have expected Brooker to offer a cuter, cuddlier version of this bleak series, which is an interesting prospect when otherwise faced with a landscape of lumpy red sweaters and togetherness and singing.
Let’s just hope he leaves the ham alone this time.
|
2023-11-17T01:26:36.242652
|
https://example.com/article/1459
|
Macleay College
Established in 1988, Macleay College is an Australian accredited higher education provider located in Surry Hills, Sydney. It offers two-year Bachelor degrees in advertising and media, digital media, journalism and business; and one-year Diploma courses in journalism, advertising and media, digital media, marketing and business management, with specialisations available in event management, entrepreneurship, real estate, public relations, travel and tourism or sports business.
In 2015 Macleay opened a Melbourne campus located at Swanston Street in the Melbourne CBD.
Since its founding Macleay College has been a family owned business, transferring ownership to current CEO Bill Sweeney in 2011. Bill Sweeney has been an advocate for higher education. He was Executive Chairman of Australian Institute of Music before purchasing the Australian College of the Arts (Collarts) and Macleay College and is also a director of the National Indigenous Culinary Institute an industry inspired program of national significance to create highly skilled Indigenous chefs.
Courses
Diploma of Journalism
Diploma of Advertising & Media
Diploma of Digital Media
Diploma of Marketing
Diploma of Marketing (Real Estate)
Diploma of Business Management (Sports Business)
Diploma of Business Management (Entrepreneurship)
Diploma of Business Management (Event Management)
Diploma of Business Management (Travel & Tourism)
Diploma of Business Management (Public Relations)
Bachelor of Journalism
Bachelor of Advertising & Media
Bachelor of Digital Media
Bachelor of Business
Academics
Teaching staff include Tracey Holmes.
Alumni
Yalda Hakim, broadcast journalist
Raffaele Marcellino, music composer
Jeni Mawter, children's author
Andrew Orsatti, sports journalist
Catriona Rowntree, television presenter
David Smiedt, journalist, author and comedian
Paul Burns, radio journalist
Tara Rushton, sports presenter and journalist
Accreditation
Registered Higher Education Provider under Commonwealth legislation, regulated by the Tertiary Education Quality and Standards Agency (TEQSA) and listed on the National Register of Higher Education Providers.
Approved for FEE-HELP and a member of the Australian Council for Private Education and Training (ACPET) which includes the Australian Student Tuition Assurance Scheme (ASTAS), the largest Australian private sector scheme ensuring full protection for Macleay College students.
Approved education provider for international students (CRICOS provider 00899G).
Registered Training Organisation (RTO No 7096) under Commonwealth legislation, regulated by the Australian Skills Quality Authority (ASQA) and its qualifications listed on Training.gov.au, the official National Register of information on Training Packages, Qualifications, Courses, Units of Competency and Registered Training Organisations.
References
External links
http://teqsa.gov.au/sites/default/files/auditreport_Macleay_2012.pdf
Category:Educational institutions in Australia
Category:Educational institutions established in 1988
Category:Education in New South Wales
|
2024-07-13T01:26:36.242652
|
https://example.com/article/7579
|
963 N.E.2d 1035 (2011)
Gayane ZOKHRABOV, Plaintiff-Appellant,
v.
JEUNG-HEE PARK, Special Administrator of the Estate of Hiroyuki Joho, Defendant-Appellant.
No. 1-10-2672.
Appellate Court of Illinois, First District, Fifth Division.
December 23, 2011.
*1037 Robert J. Rooth, The Rooth Law Firm P.C., Leslie J. Rosen, Leslie J. Rosen Attorney at Law, Chicago, for appellant.
Robert K. Scott, Matthew R. Bloom, Scott, Halsted & Babetch, P.C., Chicago, for appellee.
OPINION
Justice McBRIDE delivered the judgment of the court, with opinion.
¶ 1 Hiroyuki Joho was killed when he was struck by an Amtrak train at the Edgebrook Metra station at Lehigh and Devon Avenues in Chicago. Joho's accident occurred just before 8 a.m. on Saturday, September 13, 2008, when the 18-year-old man was crossing in a designated crosswalk from the eastside passenger platform where Metra commuter trains arrive from Chicago, to the westside passenger *1038 platform where Metra commuter trains depart toward Chicago. Joho was about five minutes early for the next scheduled Metra departure to Chicago. The sky was overcast and it was raining heavily as he proceeded west across the double set of tracks, holding an open, black umbrella over his head and a computer bag on a strap across his shoulder. The Metra station was not a destination for the Amtrak train that was traveling south at 73 miles an hour, and the engineer in the bright blue locomotive maintained speed, but sounded a whistle which triggered automatic flashing headlamps. Witnesses, nonetheless, disagreed as to whether Joho realized the train was approaching. He was smiling at the commuters standing on the southbound platform when the train hit him. A large part of his body was propelled about 100 feet onto the southbound platform where it struck 58-year-old Gayane Zokhrabov from behind, knocking her to the ground. She sustained a shoulder injury, a leg fracture, and a wrist fracture.
¶ 2 Zokhrabov sued Joho's estate in the circuit court of Cook County seeking damages on the ground that his negligence caused her injuries. She alleged he owed a duty of care to her while walking in and around the Metra station and breached that duty when he: "(a) carelessly and negligently failed to keep a proper lookout for approaching trains; (b) carelessly and negligently ran in the path of an approaching [Amtrak] train; or (c) carelessly and negligently failed to yield the right-of-way to approaching trains." Joho's mother, Jeung-Hee Park, defended her son's estate. When Zokhrabov motioned for partial summary judgment as to proximate causation, Park cross-motioned for summary judgment on the ground that her son owed no actionable duty to Zokhrabov, and the court ruled in Park's favor. Zokhrabov appeals. She contends the trial court recognized the governing principles of law, but failed to apply them correctly.
¶ 3 The entry of summary judgment is addressed de novo on appeal. Vega v. Northeast Illinois Regional Commuter R.R. Corp., 371 Ill.App.3d 572, 577, 309 Ill.Dec. 101, 863 N.E.2d 733, 737 (2007). Summary judgment should be granted when the pleadings, deposition transcripts, admissions, and affidavits show that there is no genuine issue of material fact and that the moving party is entitled to judgment as a matter of law. Vega, 371 Ill.App.3d at 577, 309 Ill.Dec. 101, 863 N.E.2d at 737 (quoting 735 ILCS 5/2-1005(c) (West 2000)). To prevail on a negligence claim, a plaintiff must establish that the defendant owed a duty of care to the plaintiff, the defendant breached this duty, and the plaintiff incurred injury proximately caused by the breach. Vega, 371 Ill.App.3d at 577, 309 Ill.Dec. 101, 863 N.E.2d at 737. Thus, if there is no duty to the plaintiff, the defendant cannot be found liable for negligence. Vega, 371 Ill. App.3d at 577, 309 Ill.Dec. 101, 863 N.E.2d at 737; Tesar v. Anderson, 2010 WI App. 116, ¶ 5 n. 7, 329 Wis.2d 240, 789 N.W.2d 351 ("No duty, no negligence. Breach, cause and damage immaterial."). The existence of a duty is a question of law, which a court may appropriately resolve in a summary judgment proceeding. Vega, 371 Ill.App.3d at 577, 309 Ill.Dec. 101, 863 N.E.2d at 737.
¶ 4 It is axiomatic that pedestrians on or near active train tracks are at great risk of suffering severe, even fatal, injuries. This court recently held that the personal danger posed by stepping in front of a moving train is an open and obvious danger. Park v. Northeast Illinois Regional Commuter R.R. Corp., 2011 IL App (1st) 101283, ¶ 19, 355 Ill.Dec. 882, 889, 960 N.E.2d 764, 771. The law generally assumes *1039 that persons who encounter obvious, inherently dangerous conditions will take care to avoid the danger. Park, 2011 IL App (1st) 101283, ¶ 19, 355 Ill.Dec. at 889, 960 N.E.2d at 771. "`The open and obvious nature of the condition itself gives caution * * *; people are expected to appreciate and avoid obvious risks.'" Park, 2011 IL App. (1st) 101283, ¶ 17, 355 Ill. Dec. at 888, 960 N.E.2d at 770 (quoting Bucheleres v. Chicago Park District, 171 Ill.2d 435, 448, 216 Ill.Dec. 568, 665 N.E.2d 826 (1996)). When a railroad employee in charge of a moving train gives the usual and proper signals that the train is approaching, the employee is generally not required to slacken speed or stop the train absent circumstances indicating people will not or cannot get out of harm's way. See Higgins v. Baltimore & Ohio R.R. Co., 16 Ill.App.2d 227, 231, 147 N.E.2d 714 (1958) (rejecting rule that "a train must make an emergency stop every time a pedestrian is seen on or near the tracks"); Maxwell v. Illinois Central Gulf R.R., 513 So.2d 901, 905 (Miss.1987) (if a trespasser on the tracks is an adult and apparently in possession of his faculties, the engineer is entitled to expect the person to hear the warning signals and remove himself from danger; the speed of the train need not be slackened until circumstances indicate the person will probably not seek safety in time).
¶ 5 Numerous cases indicate that death or great bodily harm is the likely outcome of failing to exercise due care when walking on or near active train tracks. See e.g., Chiriboga v. National R.R. Passenger Corp., No. 08-C-7293, 2011 WL 4738318 (N.D.Ill. Oct. 7, 2011) (pedestrian attempting to cross tracks via pedestrian crosswalk in order to meet scheduled Metra train at Edgebrook station was struck and killed by onrushing Amtrak train); Eskew v. Burlington Northern & Santa Fe Ry. Co., 2011 IL App (1st) 093450, 354 Ill.Dec. 683, 958 N.E.2d 426 (pedestrian attempting to cross in designated crosswalk from one passenger platform to the other at Metra's Berwyn station was struck and killed by the arriving train); McDonald v. Northeast Illinois Regional Commuter R.R. Corp., 2011 IL App (1st) 102766, ___ Ill.Dec. ___, ___ N.E.2d ___ (pedestrian in crosswalk at Metra's North Glenview Station was struck and seriously injured by Metra train that was running express through the station); Graves v. Norfolk Southern Ry. Co., No. 2:09-CV-401, 2011 WL 2146757 (N.D.Ind. May 21, 2011) (pedestrian at 169th Street station in Hobart, Indiana, ran across street and one set of tracks in order to beat oncoming train, and then had to dive across second set of tracks to avoid being hit by second train); Shaffer v. CSX Transportation Inc., No. 3:09-CV-2068, 2010 WL 4923098 (N.D.Ohio Nov. 29, 2010) (where one intoxicated trespasser looked over his shoulder, became aware of train, and stepped outside of tracks, but second intoxicated trespasser continued to walk inside the rails, first trespasser returned and reached out to pull his companion to safety, and both men were struck and killed); Weaver v. Conrail, Inc., No. 09-5592, 2010 WL 2773382 (E.D.Pa. July 13, 2010) (when impatient pedestrian started to cross between two cars of what seemed to be a standing train, the train lurched forward, knocked her to the ground, ran over one leg, and instantly amputated her lower leg and caused substantial soft tissue damage to her thigh and hip). See also Calhoun v. CSX Transportation, Inc., 331 S.W.3d 236 (Ky.2011) (car driver crossing single set of tracks in Bullitt County, Kentucky, was unaware of oncoming train, train struck the vehicle's rear quarter panel, she was ejected and suffered serious injuries).
¶ 6 In addition to these cases indicating that active trains pose an open and *1040 obvious danger to pedestrians, there is an Illinois statute regarding pedestrian rights and duties which states: "No pedestrian shall enter, remain upon or traverse over a railroad grade crossing or pedestrian walkway crossing a railroad track when an audible bell or clearly visible electric or mechanical signal device is operational giving warning of the presence, approach, passage, or departure of a railroad train [or railroad track equipment]." 625 ILCS 5/11-1011(c) (West 2006). Breach of a statute enacted to protect human life or property, which is the obvious purpose of this statute, is an indication that a person has acted with less than reasonable care. Feldscher v. E & B, Inc., 95 Ill.2d 360, 370, 69 Ill.Dec. 644, 447 N.E.2d 1331, 1336 (1983) (a statute enacted to protect human life or property is relevant to whether the defendant acted with less than reasonable care; however, the statute does not create a duty of care to the plaintiff where none existed or indicate the defendant's conduct proximately caused the plaintiff's injury).
¶ 7 Thus, the precedent and statute indicate that Joho failed to act with due regard for his own safety and self-preservation. The record indicates the Amtrak engineer triggered an audible warning whistle and flashing headlamps before proceeding through the Edgebrook Metra station. Even if Joho mistook the Amtrak train which was not stopping at the station for the Metra train which he intended to board, the record indicates he failed to exercise reasonable care for his own safety when he failed to look down the train tracks before attempting to cross the tracks in front of an approaching train. The question we must answer is whether Joho owed a duty of care to Zokhrabov as he approached and entered the active Edgebrook station and she stood down the tracks in the waiting area designated for intended passengers.
¶ 8 Ordinarily, a person engaging in conduct that creates risks to others has a duty to exercise reasonable care to avoid causing them physical harm. Restatement (Third) of Torts § 6, cmt. b (2010); Karas v. Strevell, 227 Ill.2d 440, 451, 318 Ill.Dec. 567, 884 N.E.2d 122, 129 (2008) ("every person owes a duty of ordinary care to guard against injuries to others"). The general rule is that one must act as would a prudent and reasonable person under the circumstances. Restatement (Third) of Torts, § 7, Reporter's Note, at 85 (2010) (and cases cited therein); Nelson v. Union Wire Rope Corp., 31 Ill.2d 69, 86, 199 N.E.2d 769, 779 (1964) ("every person owes to all others a duty to exercise ordinary care to guard against injury which naturally flows as a reasonably probable and foreseeable consequence of his act, and * * * such duty does not depend upon contract, privity of interest or the proximity of relationship, but extends to remote and unknown persons").
"One justification for imposing liability for negligent conduct that causes physical harm is corrective justice; imposing liability remedies an injustice done by the defendant to the plaintiff. An actor who permits conduct to impose a risk of physical harm on others that exceeds the burden the actor would bear in avoiding the risk impermissibly ranks personal interests ahead of others. This, in turn, violates an ethical norm of equal consideration when imposing risks on others. Imposing liability remedies this violation.
Another justification for imposing liability for negligence is to give actors appropriate incentives to engage in safe conduct. The actor's adoption of appropriate precautions improves social welfare and thereby advances broad economic goals." Restatement (Third) of Torts § 6, cmt. d (2010).
*1041 ¶ 9 Therefore, when determining whether a duty of care exists in a particular set of circumstances, an Illinois court will consider, among other factors, the reasonable foreseeability that the defendant's conduct may injure another. Colonial Inn Motor Lodge, Inc. v. Gay, 288 Ill.App.3d 32, 40, 223 Ill.Dec. 674, 680 N.E.2d 407, 413 (1997). The court's other considerations in a duty analysis include the reasonable likelihood of an injury, the magnitude of the burden imposed by guarding against the harm, and the consequences of placing this burden on the defendant. Colonial Inn, 288 Ill.App.3d at 40, 223 Ill.Dec. 674, 680 N.E.2d at 413.
¶ 10 It is a "well-established principle of tort law that the particular manner or method by which a plaintiff is injured is irrelevant to a determination of the [defendant's] liability for negligence." Nelson v. Commonwealth Edison Co., 124 Ill.App.3d 655, 660, 80 Ill.Dec. 401, 465 N.E.2d 513, 517 (1984). The existence of a duty depends on whether there was a potential for initial contact with and thus an injury to the plaintiff, meaning that the plaintiff was a foreseeable plaintiff. Colonial Inn, 288 Ill.App.3d at 42, 223 Ill.Dec. 674, 680 N.E.2d at 414 ("Focusing on the potential for injury rather than on the specifics of the harm that did occur, we find the duty problem is relatively simple."). "It is generally accepted that where the plaintiff's injury resulted from the same physical forces whose existence required the exercise of greater care than was displayed and were of the same general sort expectable, unforeseeability of the exact developments and of the extent of loss will not limit liability." Nelson, 124 Ill.App.3d at 661, 80 Ill.Dec. 401, 465 N.E.2d at 518. "For example, if a ship owner fails to clean petroleum out of his oil barge moored at a dock, he has created an undue risk of harm through fire or explosion. The fact that a fire is ignited by the unusual event of lightning striking the barge does not relieve the ship owner from liability to foreseeable plaintiffs who are injured." Nelson, 124 Ill.App.3d at 661, 80 Ill.Dec. 401, 465 N.E.2d at 518. Thus, a foreseeable injury, even through unforeseen means, is actionable. However, in a duty analysis, we must take care to differentiate between "two distinct problems in negligence theory," the first being the foreseeable injury resulting from unforeseen means, which is an actionable injury, and the second being the unforeseen plaintiff, who is not owed a duty of care. Nelson, 124 Ill.App.3d at 660, 80 Ill.Dec. 401, 465 N.E.2d at 517.
¶ 11 Furthermore, while the foreseeability of injury to the particular plaintiff is properly considered in a duty analysis, the foreseeability of the particular injury or damages are more appropriately considered in determining the factual issue of proximate causation (Colonial Inn, 288 Ill.App.3d at 40-41, 223 Ill.Dec. 674, 680 N.E.2d at 413), and we must differentiate between these two circumstances in order to properly apply the "foreseeability" test (Nelson, 124 Ill.App.3d at 662, 80 Ill.Dec. 401, 465 N.E.2d at 519). In this case, the trial judge concluded it was not reasonably foreseeable and was instead tragically bizarre that when Joho crossed in front of the oncoming Amtrak train in Edgebrook he would be struck and thrown 100 feet to where Zokhrabov stood on the Metra customer platform.
¶ 12 The trial judge based his conclusions on Cunis v. Brennan, 56 Ill.2d 372, 308 N.E.2d 617 (1974), which involved a two-car collision in suburban La Grange, Illinois, in which a passenger was ejected and thrown 30 feet to the public parkway, where his leg was impaled on an abandoned municipal drain pipe, necessitating amputation of the limb. Cunis, 56 Ill.2d *1042 at 373, 308 N.E.2d at 618. The passenger alleged the municipality was negligent in leaving the broken drain there. Cunis, 56 Ill.2d at 374, 308 N.E.2d at 618. The likelihood that the collision would cause the passenger to be ejected and propelled 30 feet to the exact location of a broken pipe that was 4.5 feet from one curb and 5.5 feet from the other, and then impaled, seemed very remote and led the trial and supreme courts to conclude that the circumstances were "tragically bizarre" and possibly even a "unique" outcome. Cunis, 56 Ill.2d at 377, 308 N.E.2d at 620. The fact that the "misplaced drain pipe would cause any injury to someone riding in a car 30 feet away was an example of `"the freakish and the fantastic,'"" for which the village was not liable. (Emphasis in original.) Colonial Inn, 288 Ill.App.3d at 42, 223 Ill.Dec. 674, 680 N.E.2d at 413 (quoting Cunis, 56 Ill.2d at 376, 308 N.E.2d at 619 (quoting William Prosser, Palsgraf Revisited, 52 Mich. L. Rev. 1, 27 (1953))). The passenger's injury would appear to involve many variables, including the speed and weight of the two vehicles, the angle of their collision, the weather conditions, the extent and direction of any evasive maneuvers, and the passenger's height, weight, and position within the vehicle, as well as whether he was wearing a seatbelt. The supreme court affirmed the trial judge's ruling that the injured passenger had not alleged what occurred was reasonably foreseeable and therefore a basis for holding the Village of La Grange liable for negligently breaching its duty of care. Cunis, 56 Ill.2d at 378, 308 N.E.2d at 620. Thus, Cunis may be cited generally for the proposition that there is no duty to anticipate and prevent injuries that occur due to unusual and extraordinary circumstances. We do not find Cunis helpful here, however. The two-car collision, ejectment, and impalement in La Grange bear little similarity to the train-pedestrian collision in Edgebrook that caused a third, unconnected person to be struck and injured. In contrast to the complex and unique combination of factors in La Grange, the potential outcome of Joho's conduct in Edgebrook appears to be relatively limited, since the path of the train was fixed, the pedestrian crosswalk was marked, the train ran within the established speed limit, its speed, weight, and force grossly exceeded any pedestrian's, and commuters were congregating to the side of the train tracks for the next scheduled public departure. Cunis does not inform us about the factual circumstances in Edgebrookit does not indicate that what occurred at the train station was such an unusual and extraordinary combination of facts that Joho could not reasonably foresee the potential for causing injury to the waiting passengers when he decided to cross the tracks. Cunis does not suggest that what occurred in Edgebrook was similarly "freakish" "fantastic" or tragically bizarre. Cunis, 56 Ill.2d 372, 308 N.E.2d 617.
¶ 13 There are no reported cases we have found in which a pedestrian who was struck and injured by a flying body sued the deceased person's estate. There are a few cases in which a pedestrian was struck by a train or car and flung into another person. In these cases, however, the injured person sued the railroad or automobile driver. We do not find these opinions particularly helpful because they concern the alleged negligent operation of a rail yard or a train or other vehicle, which is not analogous to Joho's alleged negligence as a pedestrian traversing train tracks.
¶ 14 Examples include Evansville & T.H.R. Co. v. Welch, 25 Ind.App. 308, 58 N.E. 88, 88 (1900), in which a railroad allegedly left box and flat cars sitting on side tracks very close to an intersection in a small town in Indiana, completely obstructing *1043 sight of the main tracks, and making it dangerous for pedestrians to cross. The railroad was sued for the careless and negligent placement of its cars, as well as allowing a fast-moving and unscheduled "`wild engine'" to barrel through the intersection just before the scheduled arrival of a passenger train. Welch, 58 N.E. at 89. A man intending to catch the passenger train stepped into the path of the unscheduled locomotive, and was struck, killed, and flung into a man standing on the passenger platform, who suffered considerable personal injuries. Welch, 58 N.E. at 89. The court's analysis of the railroad's duty of care to the man standing in its designated waiting area does not help us address Joho's duty of care to Zokhrabov. The railroad's decisions about the storage and use of its railcars and whether it should have foreseen the resulting injury to the waiting man are not comparable to Joho's alleged careless and negligent act of stepping into the path of a clearly visible and audible moving train and whether he should have foreseen the resulting injury to Zokhrabov.
¶ 15 Similarly, in Wood v. Pennsylvania R. Co., 177 Pa. 306, 35 A. 699, 700 (1896), a Philadelphia railroad was sued because it failed to sound warning bells or whistles as its evening express train came into a passenger station at 50 to 60 miles an hour. However, even without an audible signal, intended passengers on the platform and in the waiting room were aware of the train's approach, because they heard its rumble or saw its headlights, and witnesses testified that the train was visible when it was still 150 to 200 yards out. Wood, 35 A. at 701. Two women who, therefore, also apparently saw and heard the incoming train tried to cross the tracks in front of it. Wood, 35 A. at 700. The first woman cleared the tracks in time but the second woman was struck, killed, and flung into a man standing on the passenger platform and the man was injured. Wood, 35 A. at 700. There was no indication that the railroad's failure to use an audible signal caused or contributed to the man's injury on the platform. Wood, 35 A. at 701. The court concluded that the second woman's negligence alone was the legal cause of the incident and that the injured man's claim against the railroad was properly nonsuited by the trial judge. Wood, 35 A. at 701. The court's discussion of the railroad's lack of liability to the man who waited on the trackside platform is inapplicable here.
¶ 16 It was alleged in Farr v. Chicago & Eastern Illinois R.R. Co., 8 Ill.App.2d 168, 131 N.E.2d 120 (1955), that a postal employee suffered crippling injuries at the commuter station in Momence, Illinois, because, without sufficient warning, a 12-car express train sped through the station as passengers were congregating for the next departure, an elderly customer who was making her way slowly across the double tracks was struck and killed by the express, and her body was flung toward the passenger platform into the postal employee, propelling him into his heavy iron mail cart. Farr, 8 Ill.App.2d at 173, 131 N.E.2d at 123. Thus, Farr involved two pedestrians and a fast moving train, but its similarities with the present case end there. The injured postal employee sued the railroad, not the elderly pedestrian or her estate. Farr, 8 Ill.App.2d 168, 131 N.E.2d 120. His allegations of negligence concerned the speed of the train as it passed through the station, particularly when passengers were congregating for a scheduled departure, and that the warnings were adequate (Farr, 8 Ill.App.2d at 172, 131 N.E.2d at 122), in contrast to the allegations here that Joho was a careless pedestrian in an active train station who acted without due regard for his own safety and the safety of his fellow commuters. In Farr, the court *1044 had no reason to consider whether the elderly pedestrian, that is, Joho's counterpart, could reasonably foresee the outcome of her decision to step into the path of the fast-moving, yet highly visible and audible express. The appellant asked the court to analyze the postal employee's contributory negligence and the adequacy of his proof of proximate causation. Farr, 8 Ill.App.2d 168, 131 N.E.2d 120. Therefore, the court never spoke to whether a pedestrian in an active train station owes a duty of care to another pedestrian.
¶ 17 We have also considered Dahlstrom v. Shrum, 368 Pa. 423, 84 A.2d 289 (1951), in which a car driver testified that he chose to pass a bus that had stopped to let out passengers, even though it was so dark he could not tell what type of vehicle he was overtaking and he then became partially blinded by the glare of its headlamps as he approached, went around the bus, and entered the intersection. Two passengers had alighted from the bus and were attempting to cross the road. The car struck the first pedestrian, and the first pedestrian's body was flung into the second pedestrian. We cannot say that the driver's decisions and the late-night collision on the quiet Pennsylvania road are comparable to Joho's conduct in Edgebrook and the injuries that he caused on the Metra passenger platform.
¶ 18 Thus, there are a few reported cases involving flying pedestrians, but none of them are analogous to Joho's conduct with respect to Zokhrabov.
¶ 19 Accordingly, rather than relying on cases which are factually and procedurally dissimilar, we apply a traditional duty analysis to determine whether Zokhrabov was a foreseeable plaintiff and thus owed a duty of care. Colonial Inn, 288 Ill.App.3d at 41-42, 223 Ill.Dec. 674, 680 N.E.2d at 414 (a duty of care exists if there was a potential for initial contact with and thus an injury to the plaintiff, meaning that the plaintiff was a foreseeable plaintiff; "[f]ocusing on the potential for injury rather than on the specifics of the harm that did occur [makes a duty analysis] relatively simple").
¶ 20 At the outset of this opinion, we cited cases regarding pedestrians struck by trains and a statute regarding pedestrian rights and safety as indicators that Joho acted without due regard for his own person and self-preservation in the active train station. We reiterate that the potential outcome of his conduct appears to be relatively limited, since the path of the train was fixed, the pedestrian crosswalk was marked, the train ran within the established speed limit, its speed, weight, and force grossly exceeded any pedestrian's, and commuters were congregating to the side of the train tracks for the next scheduled public departure. Accordingly, we further find that it was reasonably foreseeable that the onrushing Amtrak train would strike, kill, and fling his body down the tracks and onto the passenger platform where Zokhrabov was waiting for the next scheduled Metra departure. We find that the trial court erred in concluding that Joho could not reasonably foresee that his negligence in the active train station would cause injury to someone standing in the passenger waiting area.
¶ 21 Continuing with the four elements of a duty analysis, we find that the reasonable likelihood of injury occurring was great given the relative force of the approaching Amtrak train, that the magnitude of the burden imposed by guarding against the harm was insignificant, since Joho needed only to pause, look down the tracks, and then time his crossing accordingly, and that the consequences of placing the burden on Joho would have been minimal.
*1045 ¶ 22 We, therefore, find that the trial judge erred in holding that the defendant owed the plaintiff no duty of care. We reverse the entry of summary judgment as to duty and remand Zokhrabov's case for further proceedings. We express no opinion regarding the additional elements of her negligence action, including breach, proximate causation, and damages, which are issues usually decided by a jury. Belton v. Forest Preserve District of Cook County, 407 Ill.App.3d 409, 414, 347 Ill. Dec. 931, 943 N.E.2d 221, 226 (2011).
¶ 23 Reversed and remanded.
Presiding Justice QUINN and Presiding Justice R. GORDON concurred in the judgment and opinion.
|
2023-12-09T01:26:36.242652
|
https://example.com/article/4499
|
Real Madrid beat Manchester City 1-0 on aggregate in the Champions League semi-finals in 2016
Manchester City will relish the prospect of facing Real Madrid in the Champions League round of 16, according to director of football Txiki Begiristain.
City were drawn against Real on Monday with Pep Guardiola's side travelling to the Bernabeu for the first leg on February 26 before Real return to the Etihad Stadium for the second leg on March 17.
Real are the most successful side in Champions League history, having won the competition 13 times.
They also got the better of City in the 2015/16 semi-finals, with Madrid winning 1-0 on aggregate on their way to the title.
"Real Madrid are a top side, no doubt so it's a difficult draw as Madrid have won this competition 13 times so they are the best in the history of the competition," said Begiristain.
2:59 FREE TO WATCH: Highlights from Manchester City's 3-0 win against Arsenal in the Premier League FREE TO WATCH: Highlights from Manchester City's 3-0 win against Arsenal in the Premier League
"Though they were second in the group we know their history in this competition, but if you want to be the best, you have to beat the best.
"The best way to start that is with Real Madrid. It's always a pleasure to go and play against Real Madrid and also to play in the Bernabeu.
"We are happy to go there, and we know what we will face.
"They also know us, they know our manager, but it is a real pleasure to go there."
Before that City have over two months to concentrate on closing the gap on Liverpool at the top of the Premier League.
They also have a Carabao Cup quarter-final against Oxford United to look forward to, and a home third-round FA Cup tie against Port Vale in the New Year.
Begiristain is hoping they will be fighting on all four fronts when the Champions League knock-out stage comes around and that the squad will be back to full strength.
"We always have chances," added Begiristain. "We have a top side, we have to try to get players fit and back for February.
"And I think we will have our chances to beat Real Madrid. We also have to keep connected to all the competitions.
"If we are connected to all competitions then we have a chance to win one."
|
2023-08-26T01:26:36.242652
|
https://example.com/article/2781
|
Now a Brisbane based business consultant, Mr O'Chee is described by his Stratfor ''source handler'', China and International Projects Director Jennifer Richmond, as ''my Aussie intelligence source'' who is ''well-connected politically, militarily and economically''. Mr O'Chee has a Stratfor ''A'' rating for ''source reliability'', and his reports and advice are generally regarded as highly credible though at times veering into the field of ''intelligent speculation''. Mr O'Chee served as a Queensland National Party Senator from 1990 to 1999. He was the first ethnic-Chinese Australian to serve in the Australian Parliament and was also the youngest person to serve as a Senator. He remains active in the Liberal National Party in Queensland. On Monday WikiLeaks began the release of more than 5 million leaked Stratfor emails, which it said show ''how a private intelligence agency works, and how they target individuals for their corporate and government clients''. Fairfax Media has secured access to the emails through an investigative partnership with WikiLeaks. According to its website, the company, which has its headquarters in Austin, Texas, ''uses a unique, intelligence-based approach to gathering information via rigorous open-source monitoring and a global network of human sources''.
BHP Billiton, ANZ Bank, Caltex Australia and Woodside Energy are among Australian corporate subscribers to Stratfor's intelligence services. International clients include Apple, Google, American Express, Microsoft, Coca-Cola, Boeing, and Sony. Numerous government agencies also subscribe to Stratfor reports including the Australian Departments of the Prime Minister and Cabinet, Foreign Affairs and Trade, Resources and Energy and the peak intelligence body, the Office of National Assessments. When contacted by Fairfax Media, Mr O'Chee declined to comment on what he described as ''private business''. He said he had no ties to any government and his business activities ''didn't require advertising''. He said he had no contractual relationship with Stratfor and was not on the company's payroll, but declined to respond when asked about whether he received any payment for his prolific reporting or analysis. Mr O'Chee's primary reporting for Stratfor has been focused on the Chinese economy, especially Chinese demand for iron ore and coal, and draws heavily upon his own business activities and contacts in China and Australia. He has also reported on Chinese investment in Australia with one assessment titled ''Insight — China/mining'', suggesting that Chinese firms are unable to overcome habitual corruption when doing business in Australia. ''Where foreign companies do get access to tenements, they always seem to lose out because the mining sector in China is one of the most corrupt sectors of all,'' Mr O'Chee observed. ''This corruption is one of the impediments to Chinese interests not having accumulated even greater stakes in the resources sector in Australia.''
They simply cannot get it in their heads that the rule of law applies to mining projects in Australia. They refuse to believe that they have a right to receive a mining lease subject only to complying with relevant environmental permitting conditions. They think you have no credibility unless you tell them they need to bribe someone!!!'' Mr O'Chee has also reported on domestic Australian political developments including mining tax issues and the 2010 federal election, on one occasion revealing his partisan instincts when describing Treasurer Wayne Swan as ''not terribly smart'' and ''the most appalling grub you have ever met''. More significantly Mr O'Chee passed to Stratfor advance information relating to President Obama's 2011 speech to the Australian Parliament obtained from what he described as a source ''in a very high govt position''. This included confirmation that the President's visit would be accompanied by agreements on ''pre-positioning US equipment in Australia, increasing access to test ranges bases and conducting more joint exercises and training''. ''The US want increased military access and co-operation that will allow the US to broaden its posture in the region. The shared base idea is part of US efforts to diversify its Asian military footprint in a politically agreeable way,'' Mr O'Chee reported. Mr O'Chee's ''source handler'', Ms Richmond, directed that she be consulted on any use of the information and that there be ''no attribution with any publication''.
|
2023-08-28T01:26:36.242652
|
https://example.com/article/3015
|
GPU-accelerated FDTD modeling of radio-frequency field-tissue interactions in high-field MRI.
The analysis of high-field RF field-tissue interactions requires high-performance finite-difference time-domain (FDTD) computing. Conventional CPU-based FDTD calculations offer limited computing performance in a PC environment. This study presents a graphics processing unit (GPU)-based parallel-computing framework, producing substantially boosted computing efficiency (with a two-order speedup factor) at a PC-level cost. Specific details of implementing the FDTD method on a GPU architecture have been presented and the new computational strategy has been successfully applied to the design of a novel 8-element transceive RF coil system at 9.4 T. Facilitated by the powerful GPU-FDTD computing, the new RF coil array offers optimized fields (averaging 25% improvement in sensitivity, and 20% reduction in loop coupling compared with conventional array structures of the same size) for small animal imaging with a robust RF configuration. The GPU-enabled acceleration paves the way for FDTD to be applied for both detailed forward modeling and inverse design of MRI coils, which were previously impractical.
|
2023-09-09T01:26:36.242652
|
https://example.com/article/8875
|
Black Panther is easily one of the MCU’s most triumphant films to date. Cinematic spectacle aside, the film dove headfirst into a sociopolitical discussion that deserved to hit the silver screen. Black Panther approached culturally relevant topics ranging from the preservation of identity and the west’s views of Africa to the challenging of power structures, all while keeping fans suspended in anticipation and starry-eyed at the beauty of the costumes and set designs reflecting African culture.
Janelle Monáe | Kevin Mazur/Getty Images
The film won three Oscars and was nominated in the Best Picture category. The film was also recognized at the Golden Globes, yet failed to snag the award for Best Drama. Given this film’s critical success, audience adulation, and box office turnout, it should come as no surprise that Marvel is planning to release a sequel. And, one of the most well-known Marvel and DC insiders recently released a scoop concerning a character addition.
While Black Panther already features an incomparable cast, that doesn’t mean we can’t add another awesome performer to the mix. Black Panther may serve to introduce one of the most popular X-Men to the MCU, Storm. And, it looks like Janelle Monáe is at the top of Marvel Studio’s shortlist.
Mikey Sutton gave Strip Marvel the inside scoop on Storm, Janelle Monáe, and ‘Black Panther 2’
Mikey Sutton recently shared a video with his private Facebook group, Geekosity: All Things Pop Culture, where he shares the insider knowledge he acquires surrounding the MCU and DCEU. According to Sutton, and announced by Strip Marvel, Black Panther 2, set to hit theaters in May of 2022, will bring X-Men’s Storm into the MCU.
While Marvel likely has a shortlist containing a few different names for the part, it looks like Janelle Monáe is sitting at the top of the list. Ever since the Fox/Disney merger, fans have been wondering how Feige and Co. would incorporate the Fantastic Four and the X-Men into the MCU, and it looks like the plan is to incorporate the X-Men in pieces — in various different Marvel installments across time.
Deadpool will likely serve to introduce a few other X-Men into the MCU as well. However, given that Storm is one of the most pivotal mutants in the comic books, as well as in previous cinematic takes, her character’s introduction and subsequent storyline are vital. Does Monáe have what it takes to nail the part?
Can Janelle Monáe carry Storm in ‘Black Panther 2?’
Janelle Monáe may be a singer-songwriter; however, she’s had some practice honing those acting chops, and she should be able to give a convincing performance as the one and only Storm (a part closely tied to Oscar-winner Halle Berry).
Monáe recently appeared in Welcome to Marwen and stars in Harriet. She also had a lead role in the critically-acclaimed Hidden Figures and starred in Moonlight. When it comes down to it, Monáe is a major talent with experience across music and film; she’s got this under control (if Marvel chooses to move forward with her).
|
2023-10-24T01:26:36.242652
|
https://example.com/article/2107
|
>> SUPREME COURT OF THE UNITED STATES Latest News
WHEN Texas passed its new voter-identification law, in 2011, the Republicans who dominate state politics rejoiced. This, they said, would help guarantee “the integrity of state elections”.Nonsense, said Democrats, who accuse Republicans of using voter-ID laws to make it harder for poor people and minorities to vote. Republicans retort that electoral fraud is real. In 2012 Texas’s attorney-general, Greg Abbott, boasted that his office had caught more than 50 cheats between 2002 and 2012. That is not a big number, among the more than 13m registered voters in Texas. But it is not nothing.In
...
Read More
|
2023-10-03T01:26:36.242652
|
https://example.com/article/3662
|
An interesting report came out of Great Britain earlier today about John Profumo, the disgraced Secretary of State for War who resigned in 1963 after it emerged that he was having an affair with Christine Keeler, who also had sexual ties to a Russian intelligence officer. When authorities learned of the potential security threat, Profumo was interrogated, at which point he denied involvement with Keeler. When his denial was found to be false, he resigned amid the spiraling scandal.Now MI5 files have revealed that Profumo had a previous affair with a Nazi spy who may have tried to blackmail him. The woman was named Gisela Klein, and she and Profumo met at Oxford University in 1936 when he was an undergrad. During World War II she began working for Nazi intelligence, and after the war was imprisoned as a spy. However the American in charge of her jail got her released and married her. As Gisela Winegard she maintained contact with Profumo after he entered politics, and he allegedly wrote letters to her on House of Commons stationery.There's no evidence Profumo knew about his old flame's Nazi connections, but he may have learned of her blackmail schemes by becoming a target. In 1951 Winegard was living in Tangier with her husband when she applied for a visa to visit Britain and listed “Jack Profumo MP” as a reference.
Observers are speculating whether Profumo may have been under pressure to help push her application through. But the visa was eventually refused because of Winegard's Nazi past, with the head of British intelligence in Tangier also noting: “We have good reason to believe Mr. and Mrs. Winegard have recently engaged in blackmailing activities and now think it is possible their intended visit to the UK may be connected with this affair.”
Since we've mentioned the Profumo Affair several times, we found this to be an interesting footnote, especially in light of the ongoing U.S. Justice Department investigation into White House connections to Russian operatives. It's curious that Profumo's affairs would twice send him orbiting so close to spies of adversarial countries, but it doesn't seem as if the Klein/Winegard connection will produce any real smoking gun in terms of improper favors. As for Trump and Russia, that remains to be seen. You can read some previous posts on the infamous Profumo Affair here, here, and here.
We couldn't resist a comment on the recent election. Generally we keep Pulp Intl. a politics-lite zone, but every once in a while a book cover or movie pushes us in that direction, and today's has done that. Out here in the reality based world here's what the facts show: there haven't been even a hundred verified cases of voter impersonation in the U.S. since the year 2000, and of course impersonation is the only type of fraud the voter ID laws so many conservative lawmakers are pushing would prevent. So when a law is designed to stop a handful of lawbreakers (thirty-one in fifteen years according to one extensive study) at cost of the rights of millions of people, we can safely call these laws attempts to suppress the vote. At least, in the real world we can do that.
But the lies around voter impersonation continue to grow—we now hear of 3 million illegal votes cast in 2016, people bused from one state to another, etc. All of this taking place, of course, with no paper or digital trail, no sign of organization at any level, and for sure no suggestion that a single one of these alleged fraudsters voted Republican (Trump: “If you look at it they all voted for Hillary."). Meanwhile, absent actual evidence, the besmirching of the electoral system continues. It deserves to be besmirched, of course, but because of the ridiculous choices on offer, not because of fantasies of systemic fraud. Yet politicians cynically keep trying to generate mistrust. They're playing a dangerous game, and if they keep it up there will be serious consequences down the road.
If you've visited Pulp Intl. a lot you know we've spent time in some gnarlycorners of the planet. Here's how it goes: first, all losses are contested, even losses by millions of votes, and orderly transitions of power fail to occur. Second, violence at polling places becomes commonplace. Third, election seasons become destabilizing events, often requiring a police presence, which suppresses the votes of marginalized communities. Fourth, economic and diplomatic activity suffers as the country is perceived by the international community to be a bad place for investment. And mixed in throughout are the passing of laws ostensibly designed to fix the system, but really meant to consolidate power. The cycle, once established, repeats and worsens. If you think it can't happen, consider that The Economist—that hive of leftwing villainy and scum—recently downgraded the U.S. from a “full” to a “flawed” democracy.
That's our missive from the factual universe, to be heeded or ignored as you please. Stiffs Don't Vote has nothing to do with any of that, not directly, anyway. There's a crooked political campaign involved, but the story actually deals with an axe murder investigated by the heroes Humphrey Campbell and Oscar Morgan. The book was originally titled Forty Whacks, referencing the famed Lizzie Borden rhyme, and the murder in the story constantly makes the protagonists think of Borden. The copyright on this Bantam edition is 1947, and the unusual cover art was painted by Hy Rubin, who we've never featured before, but will again, if this is any indication of his talent. We'll see what we can dig up.
Midnight claims in this issue published today in 1968 that a conspiracy was afoot to assassinate Richard Nixon during his presidential campaign, but with mid-century tabloids the question is always: Is this true? We found no mention of the plot anywhere, though Midnight is pretty authoritative in its assertions, claiming three men were involved, two of whom were in FBI custody, with the third having been picked up by Mexican police in Tijuana. But authoritative or not, the paper got this one wrong.
Weirdly, though, there may have been a plot to kill Nixon in 1968, but a week after the above Midnight hit newsstands. Though the episode is little remembered today, a man of Yemeni origin named Ahmed Rageh Namer was arrested along with his two sons Hussein and Abdo on November 12—a full eight days after Midnight made its arrest claims—and charged with conspiracy to assassinate Nixon, who had won the presidential election the previous Tuesday. You can see Namer under arrest in the photo just below.
The evidence against him and his sons was scant—an informant claimed the father possessed two rifles, had asked him join him in the killing, and had offered him money to do so. This was back before the word of a shady informant could get a person thrown in a black pit in Guantanamo for ten years, so the Namers actually got a trial and their defense lawyer of course shredded the case. All three men were acquitted in July of 1969.
But how weird is it that Midnight would fabricate an assassination story a week before the FBI uncovered what they thought was an actual assassination plot? Maybe Namer read Midnight and got the idea. Nah... he was probably just innocent in the first place. But still, how odd. Sometimes history is stranger than fiction. Elsewhere in the issue you get a bit of Hollywood gossip and a pretty cool photo of Maureen Arthur and another of Carmen Dene, below. See more Midnight at our tabloid index.
The folks at the Satanic Temple have engineered a cage fight against the political establishment once again. We wrote about how they made a group of Oklahoma lawmakers look like idiots a couple of years ago. The politicians had decided to use a legal loophole to allow a Ten Commandments monument to be placed on state property, despite the fact that it violated the federal separation of church and state requirement. But the problem with loopholes is that anyone can use them if they have the time and money. Which is exactly what the Satanic Temple did when it designed a Satanist monument for the same plot of land. Needless to say, chagrined lawmakers were left with no choice but ignominious retreat and removed their religious monument.
The Satanic Temple has now taken aim at Christian prayer clubs in public schools. The organization contacted nine school districts across the country this week seeking to launch after school Satanist prayer programs. Their reasoning is the same as before—if Christian clubs are okay on state property, then by extension Satanist clubs must be fine. After all, trenchcoated loners need a place to congregate too. With the Constitution's supremacy clause giving it legal authority over states in the matter, lawmakers have to either allow all religions, including Satanists, equal access to schools after hours, or admit that they are enforcing an unconstitutional preference for Christianity.
We get that it's disconcerting to imagine Luciferian chanting in public schools at night—we've seen our share of horror movies, after all—but even so, these politicians never learn. A charitable interpretation of their folly might be that they're so blinded by belief they've forgotten their religion is just one of many in the country, and one of thousands that have existed across time, but the truth is they're worse than blind—they're deluded. Rather than accept the undeniable fact that the country's founding fathers wanted state and religion kept separate, they've convinced themselves that Jefferson, Madison, et al simply forgot to write special standing for the Christian church into the Constitution. This despite the fact that they amended the document more than ten times, and the very first of those amendments explicitly denied Christianity and all other religions special rights.
When asked for comment, Satanic Church leader Lucien Greaves took time from etching pentagrams and deflowering virgins long enough to suggest that children being threatened with eternal hellfire need the healthy alternative belief system Satanism provides. He's being disingenuous, of course—the Satanists are really just atheists with a finely honed sense of humor. The confrontation promises to be political theater of a uniquely American sort, but it will inevitably end in judicial defeat for Christian clubs. At least until they manage to write Christianity into the U.S. Constitution—not so farfetched, considering there are politicians like Arizona's Sylvia Allen publicly pondering whether her state can force citizens to attend church. Maybe the founding fathers should have taken a tip from Satan and written the Constitution in blood. That way breaking the deal would cost politicians their souls.
Above you see photos of various people involved with the House Un-American Activities Committee, the government body that sought to ferret out communism in the U.S. beginning in 1938. The images were made today in 1951, and the men pictured are A.L. Wirin, Robert Shayne, William Wheeler, Arnold Krieger, and Morton Krieger. Wirin was a defense lawyer who later became prominent in the ACLU, Wheeler was a lead investigator for HUAC, and the others were witnesses called to testify. Some of the latter group offered varying levels of cooperation, with Morton Krieger giving up at least one name, that of Dr. Murray Abowitz, who interrogators described as “a member of one of the professional cells of the Communist Party in the field of medicine.” Abowitz was later fired from his position at Cedars of Lebanon Hospital in Los Angeles.
His destruction was indicative of the fact that the communist witch hunts which had begun in Washington, D.C. had by 1951 spread into every sector of society—the entertainment industry, the professional ranks, labor unions, and black communities such as Watts, Harlem, and Oakland. It was a disgraceful period in U.S. history. Consider—many other countries, particularly those in Europe, lived up to their democratic ideals by allowing communist parties to have a voice in the political discourse. But given free reign to disseminate their solutions, communists didn’t then and haven’t since had great success convincing significant numbers of voters to follow their path. In the U.S., by contrast, top political powers decided that Americans could not be allowed to hear such ideas at all. Thus the anti-democratic red squads were conceived and over the next two decades ruined thousands of careers and lives.
Collier’s isn’t the most visually striking of magazines, but this issue that hit newsstands today in 1954 caught our eye because it contains several nice photos of Marilyn Monroe. There’s also a bit of interesting graphic art, specifically a colorful baseball illustration by Willard Mullin. The other item that attracted us was a story called “What Price Security?” about U.S. government overreach in its search for communists. No art to speak of, but the content gives a window onto the Red Scare period of American life. Author Charlotte Knight tells readers that government efforts against communism have been “so irresponsibly administered that it may have done more harm to the United States than to its enemies.” Sound familiar?
Knight slams witch hunting Senator Joseph McCarthy, and characterizes the fervor around alleged subversives in Washington, D.C. as creating a ripe environment for paranoiacs and liars to ruin innocent people. But of course, as well written as Knight’s article is, she should not have been surprised by anything she discovered. Witch hunts always become vehicles for revenge, personal advancement, and profiteering, because society and politics become warped in such a way as to clear a path for these pursuits. History invariably judges such periods as human tragedies and political failures, though sadly, too late for the ruined and the dead. Scans below.
Mandy Rice-Davies, one of the central figures in the John Profumo Affair of 1963, died of cancer early this morning. Most accounts of the scandal describe Rice-Davies as a prostitute, and indeed Stephen Ward, one of the principals in the fiasco, was imprisoned for living off the earnings of Rice-Davies and other women—another way of saying he pimped. But Rice-Davies spent a good portion of her final years denying she was a call girl, saying she didn’t want her grandchildren to remember her that way.
Whatever her means of support during the Profumo Affair, what is certainly true is that she was young and beautiful and somehow found herself at the nexus where rich, entitled men and beautiful women always seem to meet. The Profumo Affair's world of secret parties, middle-aged male egos, and a lurking Soviet spy came into being during the most paranoid years of the Cold War, and John Profumo’s role in it cost him his position as Secretary of State for War in the British government.
After the scandal Rice-Davies sang in a cabaret in Germany, lived in Spain, moved to Israel where she opened nightclubs and restaurants in Tel Aviv, released music and books, appeared on television and in film, including the The Seven Magnificent Gladiators and Absolute Beginners, and was involved in the development of a Stephen Ward-based Andrew Lloyd Webber musical. She accomplished plenty. But as long as she is remembered it will be for Profumo, Christine Keeler, the parties and scandalous revelations, and the near-collapse of the British government in 1963. If you’re interested in reading more, we talked about Rice-Davies in a bit more detail here and here.
Yale University historian Beverly Gage has found an uncensored version of a threatening letter sent to civil rights activist Martin Luther King, Jr. that FBI director J. Edgar Hoover personally engineered. The letter, which she found as part of research into an upcoming Hoover biography and which has been confirmed as his handiwork, features a fake disgruntled supporter taunting and chastising King, and later urging him to commit suicide. The suicide part is unspoken, but the letter states:
King there is only one thing left for you to do. You know what it is. [snip] You are done. There is but one way out for you. You better take it before your filthy, abnormal self is bared to the nation.
Hoover’s brainstorm was that King would be so afraid of having his marital infidelity exposed that he’d rather die than see his reputation ruined. When King publicly declared that the FBI and Hoover were after him, the cackles of laughter from the mainstream press and general masses reached the mountaintops. And yet, as so often happens in history, it turns out the government had, in fact, acted far beyond its legal mandate, or even everyday sanity. We now know that under Hoover the FBI harassed not only King, but other political figures, various activist groups, and even harmless Hollywood performers. But this letter represents an incredible new low. More tidbits:
There’s more, but you get the gist. The word “evil” is used six times in the one page screed. To imagine the FBI reduced to such an act of impotent cowardice astonishes, but desperate times call for desperate measures—as one of only a few official apartheid nations left in the world at that time, the U.S. was taking a beating in international circles. Scenes of unarmed protesters attacked by German shepherds had played on television sets around the planet. A change had begun that some of the most powerful entities in America wanted stopped. But no smears, no threats, and not even the murder of numerous civil rights activists, including King, could stem the tide.
That swell reached a high water mark. But unhealed wounds, social polarization, regressive lunacy, and political opportunism eventually rolled it back. Today, pundits tell credulous audiences numbering in the tens of millions that the bestowing of equal rights to African Americans wasa mistake. Worse, in just the few minutes we spent looking around the internet for a bit of material to write this post we ran into so many defenses of Hoover’s actions that it made us wonder if it was 1965 again. J. Edgar would have liked that. But what he wouldn’t have liked is that his enemy is a global icon while he's a historical embarrassment.
This National Insider from today in 1964 claims that American politician Barry Goldwater had “nervous breakdowns” in 1937 and 1939, but in the midst of his run for president denied they happened. Well, who wouldn’t, right? There’s no new reporting here—Insider is merely echoing the claims of publisher Ralph Ginzburg, who had written of the breakdowns in his magazine Fact, and as evidence had referenced an interview Goldwater’s wife had given Good Housekeeping in May 1964. That’s the inspiration for the line: Barry Says “None” …Wife Says "Two.” Ginzburg was garnering attention for Fact by attacking people from all over the political spectrum, including Bobby Kennedy, and he eventually lost a libel suit regarding his Goldwater claims.
The Goldwater breakdowns are a matter of record today. Ginzburg’s libel suit hinged not on the fact of those incidents, but on embellishments such as his convoluted assessment that Goldwater was “...a man who obviously identifies with a masculine mother rather than an effeminate father.” Goldwater made Ginzburg pay for his ill-considered words, but in the end, both of their careers faltered. Goldwater was crushed in the 1964 presidential election by Lyndon Johnson, and Ginzburg went to jail—not for libel, but for obscenity related to his other magazine Eros. It’s all just another interesting story conjured by another random tabloid cover. And there are still more to come—we have about a hundred full tabloids remaining, everything from Police Gazette to Midnight. We’ll never be able to post them all, but you can bet we’ll try our damndest.
When in doubt, grin idiotically. That’s the mantra in American politics, and that’s why we were completely unsurprised when Texas governor Rick Perry’s mugshot showed him smiling like he’d just learned a dirty secret. For the most part, we think that if a person under arrest were guilty he’d be distressed he got caught, thus not smiling, and if he were innocent he’d be even more distressed to have been railroaded, thus doubly not smiling. But Perry certainly wasn’t the first politician to pull the I’m-smiling-because-I’ve-got-nothing-to-worry-about routine, which is why his photo inspired us to locate more examples. Below we have a small rogues gallery of cheerful mugshots. Charges cover a range—campaign finance violations, criminal trespass, drunk driving, drug charges, and nobody here has served prison time. Hmm, do you think they knew all along they never would? Maybe that’s the dirty secret.
German-born theoretical physicist Albert Einstein publishes his general theory of relativity. Among the effects of the theory are phenomena such as the curvature of space-time, the bending of rays of light in gravitational fields, faster than light universe expansion, and the warping of space time around a rotating body.
1931—Nevada Approves Gambling
In the U.S., the state of Nevada passes a resolution allowing for legalized gambling. Unregulated gambling had been commonplace in the early Nevada mining towns, but was outlawed in 1909 as part of a nationwide anti-gaming crusade. The leading proponents of re-legalization expected that gambling would be a short term fix until the state's economic base widened to include less cyclical industries. However, gaming proved over time to be one of the least cyclical industries ever conceived.
1941—Tuskegee Airmen Take Flight
During World War II, the 99th Pursuit Squadron, aka the Tuskegee Airmen, is activated. The group is the first all-black unit of the Army Air Corp, and serves with distinction in Africa, Italy, Germany and other areas. In March 2007 the surviving airmen and the widows of those who had died received Congressional Gold Medals for their service.
1906—First Airplane Flight in Europe
Romanian designer Traian Vuia flies twelve meters outside Paris in a self-propelled airplane, taking off without the aid of tractors or cables, and thus becomes the first person to fly a self-propelled, heavier-than-air aircraft. Because his craft was not a glider, and did not need to be pulled, catapulted or otherwise assisted, it is considered by some historians to be the first true airplane.
1965—Leonov Walks in Space
Soviet cosmonaut Aleksei Leonov leaves his spacecraft the Voskhod 2 for twelve minutes. At the end of that time Leonov's spacesuit had inflated in the vacuum of space to the point where he could not re-enter Voskhod's airlock. He opened a valve to allow some of the suit's pressure to bleed off, was barely able to get back inside the capsule, and in so doing became the first person to complete a spacewalk.
It's easy. We have an uploader that makes it a snap. Use it to submit your art, text, header, and subhead. Your post can be funny, serious, or anything in between, as long as it's vintage pulp. You'll get a byline and experience the fleeting pride of free authorship. We'll edit your post for typos, but the rest is up to you. Click here to give us your best shot.
|
2023-08-15T01:26:36.242652
|
https://example.com/article/5437
|
Hormone therapy and osteoporosis in breast cancer survivors: assessment of risk and adherence to screening recommendations.
The long-term impact of hormone therapy for breast cancer on risk of osteoporosis and the extent to which bone screening recommendations are implemented in daily practice remain unknown. We found that the aromatase inhibitor-induced risk of osteoporosis did not continue in the off-treatment follow-up. Adherence to screening recommendations was suboptimal. A case-cohort study was undertaken to better understand the impact of hormone therapy on breast cancer patients' risk of osteoporosis, and to estimate the extent to which current bone mineral density screening recommendations are implemented in real-life daily practice. This study is based on 1692 female breast cancer survivors recruited from "Leumit" healthcare fund, who were diagnosed with primary nonmetastatic invasive breast cancer between 2002 and 2012. A 20% random subcohort was sampled at baseline, and all osteoporosis cases were identified. Adjusted hazard ratios (HR) with 95% confidence intervals (CI) were estimated by weighted Cox proportional hazards models. Of 1692 breast cancer survivors, 312 developed osteoporosis during a median follow-up of 5 years. The crude cumulative incidence of osteoporosis accounting for death as a competing risk was 25.7% (95% CI, 21.9-29.5%). In multivariable analyses, osteoporosis was positively associated with the aromatase inhibitor (AI) sequential treatment after tamoxifen (HR, 3.14; 95% CI, 1.44-6.88; P = .004) but was more pronounced with AI use as upfront monotherapy (HR, 5.53; 95% CI, 1.46-20.88; P = .012). This effect did not continue in the off-treatment follow-up. In subgroup analysis by menopausal status, tamoxifen did not seem to confer a protective effect on bone health in postmenopausal patients. Adherence to screening recommendations in AI-treated postmenopausal women was suboptimal, particularly at baseline and after 48 months of continuous AI use. The natural, age-related reduction in bone density is exacerbated by breast cancer active AI treatment. Future research should focus on investigating screening adherence-related barriers/facilitators and effective strategies to bring practice in line with agreed standards.
|
2024-06-03T01:26:36.242652
|
https://example.com/article/8359
|
<!doctype html>
<html>
<head>
<meta charset="UTF-8">
<title>Aloha, Images!</title>
<script type="text/javascript">
(function(window, undefined) {
function _onCropped(image, props) {
var canvas = document.createElement('canvas'),
context = canvas.getContext("2d"),
img = image.get(0),
finalprops = {},
ratio = {img:{}, disp: {}};
ratio.img.h = img.height;// image natural height
ratio.img.w = img.width;// image natural width
ratio.disp.h = image.height(); // image diplay heigth
ratio.disp.w = image.width(); // image diplay width
ratio.h = (ratio.img.h / ratio.disp.h);
ratio.w = (ratio.img.w / ratio.disp.w);
/*
var sourceX = 150;
var sourceY = 0;
var sourceWidth = 150;
var sourceHeight = 150;
var destWidth = sourceWidth;
var destHeight = sourceHeight;
var destX = canvas.width / 2 - destWidth / 2;
var destY = canvas.height / 2 - destHeight / 2;
context.drawImage(imageObj, sourceX, sourceY, sourceWidth, sourceHeight, destX, destY, destWidth, destHeight);
*/
// props are related to displayed size of image.
// apply w/h ratio to props to get fprops which will be related to 'real' image dimensions
finalprops.x = props.x * ratio.w;
finalprops.y = props.y * ratio.h;
finalprops.w = props.w * ratio.w;
finalprops.h = props.h * ratio.h;
context.drawImage(img,
finalprops.x, finalprops.y,
finalprops.w, finalprops.h,
0,0,
// props.x2, props.y2,
props.w, props.h);
$('body').append(canvas);
}
if (window.Aloha === undefined || window.Aloha === null) {
var Aloha = window.Aloha = {};
}
Aloha.settings = {
logLevels: {'error': true, 'warn': true, 'info': true, 'debug': false},
'plugins': {
'image': {
'fixedAspectRatio': false,
'maxWidth': 1024,
'minWidth': 10,
'maxHeight': 786,
'minHeight': 10,
'globalselector': '.global'
}
}
};
})(window);
</script>
<script src="../../../../lib/require.js"></script>
<script src="../../../../lib/vendor/jquery-1.7.2.js"></script>
<script src="../../../../lib/aloha.js" data-aloha-plugins="common/ui, common/format, common/highlighteditables, common/image"></script>
<link rel="stylesheet" href="../../../../css/aloha.css" id="aloha-style-include" type="text/css">
<link rel="stylesheet" href="../../../../demo/common/index.css" type="text/css">
</head>
<body>
<div id="main">
<div id="tree-div"></div>
<h1 id="title">Aloha, Images!</h1>
<div id="bodyContent">
<div id="teaser" class="shorttext">
<p>This example will show you how to use the Image plugin found at <a href="https://github.com/alohaeditor/Aloha-Plugin-Image">https://github.com/alohaeditor/Aloha-Plugin-Image</a>.</p>
</div>
<div id="content" class="article">
<p><img src="cropnresize.jpg"></p>
<p>Click the image to start resizing right away, as a resize handle will appear in it's south-east corner.</p>
<p><em>Note:</em> This is a very simple example, that will not allow subsequent cropping actions, or cropping combined with resizing.</p>
</div>
Outside of the editable
<p><img class="global" src="cropnresize.jpg"></p>
</div>
</div>
<script type="text/javascript">
Aloha.ready( function(){
var $ = Aloha.jQuery;
$('#title').aloha();
$('#teaser').aloha();
$('#content').aloha();
});
</script>
</body>
</html>
|
2024-05-14T01:26:36.242652
|
https://example.com/article/3296
|
A flexible solution for your storage.
My Storage Pod offers a dry, secure and convenient solution to your self storage needs around North Wales, Flintshire and Chester. My Storage Pod provides a high quality and affordable indoor facility for self storage and business storage users.
Why Choose My Storage Pod?
We aim to deliver the best customer service to ensure that your experience with us is as straightforward and convenient as possible.
My Storage Pod is an easy to access facility within ten miles of Mold, Buckley, Chester, Holywell, Deeside and Flint.
Unlike outdoor containerised storage which leaves valuable items vulnerable to damp and mould My Storage Pod is a dry, clean and secure environment so you can rest assured that your belongings will stay in the same condition that you left them. Our customers are given a unique access code to allow flexible entry and the facility is easily accessible with excellent parking.
Serving the local area
My Storage Pod is located in North Wales, near Buckley, Mold, Holywell, Ewloe, Deeside, Kinnerton, Hawarden and Flint. The facility is easily accessible from the A55. We are also an eight minute drive away from Chester making us a convenient solution to your self-storage requirements.
Our prices start as low as £6 a week so it makes good sense to give us a call today on 01244 550022 to secure your private pod.
What do our customers say?
My goodness!
My goodness you could eat your dinner off the floor it is that clean in here!
– Mrs C
5/5
Really helpful & reasonably priced
Really helpful, and reasonably priced.
Process was quick, easy and hassle free – would definitely recommend to others.
Does exactly what it says on the tin!
– Luke Jones
5/5
Great teamwork
My Storage Pod have been really helpful; due to the type of work we do whenever we have needed to move they have always been very helpful and have made my life easier by helping move all our items. The teamwork between us all has been great.
– Christine at Offshore Wind Turbine Services
5/5
Lovely and clean
Lovely and clean, far better than others out there 🙂
– Gaynor Harper
5/5
The staff go out of their way to help
We chose My Storage Pod because of bad experiences we had with container storage. The facility completely opposite it is clean, and secure and importantly the staff go out of their way to help.
|
2024-05-30T01:26:36.242652
|
https://example.com/article/2394
|
The Winnipeg Jets have played two games now since Jake McCabe caught Patrik Laine with his head down and lowered the boom, leaving the young phenom with a concussion and leaving the Jets with a big hole on their first line (second line? Line 1A? 1B?). Coach Paul Maurice decided to replace Patty Boomstick’s 21 goals this season with a player who scored 21 last season and has not, to this point, come close to resembling the player he has been in the past: Drew Stafford. Let’s take a look at how Stafford has preformed in those two games.
Drew Stafford came over in the Kane/Bogosian trade in early 2015 and, prior to this season, had 30 goals and 27 assists for 57 points in 104 games for the Jets. This season, however, he had a mere 2 goals and 5 assists in 27 games and had fans clamouring to get rid of him. Stafford missed almost a month with what was listed as an upper-body injury, but has turned out to be a concussion. The veteran says he’d had some ‘minor’ concussions earlier in the year but this one was a little different.
“But this one was the first time where I was really feeling a lot of the symptoms – the mood swings, the fatigue, the disconnect,” he said. “It’s pretty scary, scary stuff. You got to make sure you take care the brain.”
Advertisement - Continue Reading Below
Prior to the game in Buffalo, he told the Olean Times Herald that he felt he was getting his timing back and that production would follow. He banged in a second period power play goal in a game that later saw Laine go down in a scary moment for Jets’ fans. With Laine out, the powers that be called up Brandon Tanev to take his spot on the roster, but promoted Drew Stafford to fill his spot in the lineup (and put Chris Thorburn in Stafford’s place, leaving young Tanev to sit in the pressbox). Jets’ fans were (once again) none too pleased at the decision making.
At least with Stafford taking Laine’s spot on the top line the Jets should’nt experience any drop off in talent. #Sarcasm — North End Rick (@NorthEndRick) January 8, 2017
Stafford has performed pretty well playing on a line with Mark Scheifele and Nikolaj Ehlers, though. In the 2-0 win over Calgary on Monday night, he notched an assist on what turned out to be the game winning goal by Dustin Byfuglien in the second period. Then again on Wednesday, in the horrific 7-4 loss on home ice to the Canadiens, Stafford managed two more assists to give him four points in his last three games.
On top of that, Stafford’s underlying numbers have been better as well. On the year, his even strength CF% has been an abysmal 45.5%. But the Calgary game saw him at 59.1% and the Montreal game had him at 63.2%.
All of this is not to say that the Jets don’t miss Laine; the kid’s a stud and we all want him back on the ice as soon as it is safe to do so. But in his absence, Stafford may help provide a little stability to two younger linemates who could use it. With Laine not making the trips out west as the team faces the Coyotes, Kings, and Sharks, it’s going to be, at the very least, three more games without the young Fin and probably more than that. And things are going to go one of two ways here really soon: either the Jets are going to make a push to the playoffs or they are not. In either situation, having Drew Stafford play well is a boon for the team. If they are to make a push, a veteran who is performing can only help the situation. If they’re out of it, Stafford is scheduled to become an unrestricted free agent at the end of the season and could be used as bait at the deadline to score some more assets for the Jets moving forward.
Advertisement - Continue Reading Below
Stafford has 6 weeks to build up some of that sweet sweet trade value. — Ryan Browning (@DJ_Biff_WPG) January 12, 2017
|
2023-08-16T01:26:36.242652
|
https://example.com/article/1061
|
static_library("clang-reorder-fields") {
output_name = "clangReorderFields"
configs += [ "//llvm/utils/gn/build:clang_code" ]
deps = [
"//clang/lib/AST",
"//clang/lib/ASTMatchers",
"//clang/lib/Basic",
"//clang/lib/Index",
"//clang/lib/Lex",
"//clang/lib/Serialization",
"//clang/lib/Tooling/Core",
"//llvm/lib/Support",
]
sources = [
"ReorderFieldsAction.cpp",
]
}
|
2023-08-29T01:26:36.242652
|
https://example.com/article/3990
|
More than two decades later, Oliver Stone’s controversial political thriller “JFK” is still generating buzz.
The director tweeted Thursday that the 1991 film, which starred Kevin Costner and followed the events leading up to President John F. Kennedy’s assassination and the subsequent alleged cover-up, will see a theatrical and Blu-ray re-release in November.
“WB is re-releasing ‘JFK’ theatrically in NY, LA, and DC 11/6–11/14. Also, at some 250+ Cinemark, Regal, and AMC theaters on 11/17 and 11/20,” Stone tweeted.
‘WB is also re-releasing ‘JFK’ on BR in a new box set on 11/12,” he added. “Included is something I think makes a difference—Ch 6 of ‘Untold History.’”
He went on to explain that the unreleased chapter isn’t exactly about the assassination, but “the big picture,” why Kennedy may have been killed and the following events.
Coincidentally, the announcement comes a day after Stone and “JFK’s” co-writer Zachary Sklar penned an op-ed in the Chicago Tribune in response to another op-ed in the paper that alleged that the film was full of “distortions and outright falsehoods.”
“JFK” is no stranger to criticism. Upon its release in 1991, several media outlets accused the film of taking creative liberties with the facts and distorting history.
However, “JFK” did well both critically and commercially, grossing $205 million worldwide and winning two Academy Awards.
|
2023-08-04T01:26:36.242652
|
https://example.com/article/2561
|
Moral development in context: Associations of neighborhood and maternal discipline with preschoolers' moral judgments.
Associations among moral judgments, neighborhood risk, and maternal discipline were examined in 118 socioeconomically diverse preschoolers (Mage = 41.84 months, SD = 1.42). Children rated the severity and punishment deserved for 6 prototypical moral transgressions entailing physical and psychological harm and unfairness. They also evaluated 3 criteria for assessing maturity in moral judgments: whether acts were considered wrong regardless of rules and wrong independent of authority, as well as whether moral rules were considered unacceptable to alter (collectively called criterion judgments). Mothers reported on their socioeconomic status, neighborhood characteristics and risk, and consistency of discipline; harsh maternal discipline was observed during a mother-child clean-up task. Structural equation modeling indicated that greater neighborhood risk was associated with less mature criterion judgments and ratings that transgressions were less serious and less deserving of punishment, particularly for children who were disciplined less harshly. Although harsh maternal discipline was associated with children's ratings of moral transgressions as more serious and deserving of punishment, this effect for severity judgments was more pronounced when mothers were inconsistent versus consistent in applying harsh discipline. Preschoolers who received consistent harsh discipline had less sophisticated moral criterion judgments than their less consistently or harshly disciplined peers. Results demonstrate the importance of social contexts in preschoolers' developing moral judgments. (PsycINFO Database Record
|
2023-08-30T01:26:36.242652
|
https://example.com/article/3990
|
Q:
How can I pass an id of one object to the controller of another object?
I know this has been asked but no solution has worked.
I'm trying to pass a group id to a procedure controller so I may make that procedure belong to that group.
Group Show View:
<%= link_to 'Create a Procedure', new_procedure_path(:group => @group.id), class: 'btn btn-default btn-small' %>
Procedure controller:
def new
@procedure = Procedure.new
@group = Group.find(params[:group])
Routes :
resources :groups, only: [:new, :create, :show, :destroy]
resources :procedures
A:
If group_id is required, make it part of the url and won't need it in the form view. You'll have group_id in the params: params[:group_id] is what the controller should expect.
resources :groups, only: [:new, :create, :show, :destroy] do
resources :procedures
end
In your controller, do this:
def new
@group = Group.find(params[:group_id])
@procedure = @group.procedures.new
end
And you'd link to the new page like this
<%= link_to 'Create a Procedure', new_group_procedure_path(@group), class: 'btn btn-default btn-small' %>
|
2024-05-31T01:26:36.242652
|
https://example.com/article/3679
|
In conventional mobile network services, Human To Human (H2H) communication occupies the main position. In the H2H communication, since two participating parties are the human being having behavior control capability, a session actually is controlled by the behavior of the human being. With the development of mobile network services and automation control technology, at present, a new mobile communication mode, i.e. Machine To Machine (M2M) communication, appears, in which two parties of the communication are machine equipment.
A narrow definition of the M2M is the communication from machine to machine, however, broadly speaking, the M2M includes networking applications and services with intelligent interaction of machine terminals as the core. The M2M can provide, based on an intelligent machine terminal, an information solution for a client with multiple communication modes as access means, so as to meet the information requirement of the client on monitoring, commanding and dispatching, data collection and measurement and so on. The M2M can be applied to industry applications (for example, traffic monitoring, alarm system, sea rescue, vending machine, driving payment and so on), home applications (for example, automatic meter reading, temperature control and so on) and personal applications (for example, life detection, remote diagnosis and so on) and the like.
Different from the H2H communication, the communication objects of the M2M are machines, and the communication behavior is automatically controlled, that is to say, initiation and termination of the communication and control of some admissions and limits during the communication procedure are automated behaviors. These behaviors depend on the restriction and control on the behavior of machines in the M2M communication (that is, terminals in the M2M communication), wherein the behavior of the terminals in the M2M communication are restricted by service subscription data and the network manages the terminals in the M2M communication according to the service subscription data.
The M2M communication also is called MTC, and the most typical example thereof is the communication between a terminal and an application server, wherein the terminal is called an MTC User Equipment (MTC UE) and the application server is called an MTC Server.
In the access of 2G/3G/Long Term Evolution (LTE), the M2M communication mainly takes a Packet Service (PS) network as an underlying bearer network to realize the service layer communication between the MTC UE and the MTC Server. FIG. 1 shows an architecture schematic diagram of the access of M2M communication entities to an Evolved Packet System (EPS).
In FIG. 1, the underlying bearer network comprises: an Evolved Universal Terrestrial Radio Access Network (E-UTRAN), a Mobility Management Entity (MME), a Serving GateWay (S-GW or SGW), a Packet Data Network GateWay (PDN GW or P-GW or PGW), a Home Subscriber Server (HSS) and a Policy and Charging Rules Function (PCRF), wherein the main network element of the E-UTRAN is Evolved NodeB (eNodeB).
In FIG. 1, the MME takes charge of the related work of control plane, such as mobility management, process of non-access layer signaling and context management in user mobility management; the S-GW is an access gateway device which is connected to the E-UTRAN, and is configured to forward data between the E-UTRAN and the P-GW and take charge of the caching of paging waiting data; the P-GW is a border gateway between the EPS and Packet Data Network (PDN) and takes charge of functions such as the access of the PDN and the data forwarding between the EPS and the PDN and so on; the PCRF is a policy and charging rules function entity which is connected with an operator Internet Protocol (IP) service network through a receiving interface Rx to acquire service information, in addition, the PCRF can be coupled with a gateway device in the network through a Gx interface to take charge of initiating establishment of IP bearer, guarantee the Quality of Service (QoS) of service data and perform charging control; and the HSS provides management of user subscription data and management of important context information about access of the user to a network.
In FIG. 1, the MTC UE accesses the EPS network through the E-UTRAN (eNodeB); after an IP address is allocated, an IP channel can be established between the MTC UE and the MTC Server to realize an upper layer service communication between the MTC UE and the MTC Server. The IP channel established between the MTC UE and the MTC Server is a logic IP channel, the physical path of which passes through the eNodeB, the S-GW and the P-GW.
At present, a method to realize the M2M communication is to establish a service layer interface protocol on the IP channel between the MTC UE and the MTC Server, through the service layer interface protocol, service data are interacted between the MTC UE and the MTC Server, meanwhile, the MTC Server also realizes the control of the MTC UE through the service layer interface protocol.
FIG. 2 shows a flow of realizing the M2M communication by using the method above. As shown in FIG. 2, in the method, the procedure that an MTC UE accesses through a PS network and establishes communication connection with an MTC Server mainly comprises the following steps.
S201: the MTC UE initiates an Attach Request to an MME.
S202: the MME receives the Attach Request above and sends a Location Update Request to the HSS. In this step, the HSS downloads subscription data of the MTC UE to the MME, wherein the subscription data include the subscription data part used for M2M access control.
S203: the MME sends a bearer establishment request to an SGW/PGW to request the SGW/PGW to establish a proper bearer for the MTC UE.
S204: if the PGW needs to acquire policy data from a PCC to establish a proper bearer according to the policy data, the PGW interacts with the PCC to acquire the PCC policy.
S205: the PGW establishes a bearer for the MTC UE and returns a bearer establishment response.
S206: the MME sends an Attach Response to the MTC UE.
After step S206, the MTC UE attaches to the PS network and is allocated with an IP address and has a proper bearer established, thus the MTC UE is able to initiate registration of a service layer to the MTC Server.
S207: the MTC UE initiates registration of the service layer to the MTC Server.
S208: the MTC Server accepts the registration of the MTC UE and returns a registration response.
S209: service data interaction with the MTC Server is performed by the MTC UE through a service layer protocol.
Through the flow shown in FIG. 2, the MTC UE accesses the PS network and establishes an IP connection with the MTC Server, thus the MTC UE can realize the subsequent service layer communication with the MTC Server. In the flow, since the MTC Server has no relation with the underlying access layer (refer to the network elements such as MME/SGW/PGW), the MTC Server can not acquire events occurring in the underlying access layer, thus the MTC Server can not judge whether the behavior of the MTC UE is normal according to these events. Therefore, some M2M services requiring the service layer to have higher control right (for example, the M2M communication with high availability, the M2M communication with intelligent management capability, etc.) can not be realized by using the access method above.
For example, in some M2M communications with high availability, for the purpose of performing intelligent management and real-time monitoring to an MTC UE, the MTC Server requires to regularly check the condition of the MTC UE accessing the network to confirm that the operation of the MTC UE is normal and no failure occurs. In another aspect, if the behavior of the MTC UE accessing the network is abnormal, the MTC Server needs to learn the abnormal condition in time so as to notify the M2M operation and maintenance personnel to perform on-site maintenance in time. Or, in a condition that the equipment might be stolen, the MTC Server needs to have the capability of detecting the probable condition of equipment being stolen and system being misappropriated in time, so as to respond in time.
Particularly, in the M2M communication with higher demand on intelligent management and real-time monitoring, in order to meet higher management requirement, the MTC Server probably needs to acquire the condition of the MTC UE accessing the network in time; typically, the MTC Server probably needs to acquire the following information related to the MTC UE:
(A) regular access monitoring: for some services, it is required to limit the time when the MTC UE accesses the network, if the access to the network occurs at a forbidden time, the MTC Server needs to learn the condition in time;
(B) area access limit: for some services, it is required to limit the location area from which the MTC UE accesses the network, if the access to the network occurs at a forbidden location area, the MTC Server needs to learn the condition in time;
(C) mobility limit: for some services, the MTC UE is allowed to move in a preset area only, or the MTC UE is not allowed to move frequently, if the forbidden mobility behaviors above occur, the MTC Server needs to learn the condition in time;
(D) SIM misappropriation check: since the fee of the M2M communication probably is lower than that of general mobile communication, if the SIM card of the MTC UE is misappropriated, the service operator would suffer great loss; in order to prevent the occurrence of these conditions, the service operator probably requires to bind the International Mobile Subscriber Identification Number (IMSI) in the SIM card and International Mobile Equipment Identity (IMEI) of the MTC UE, that is, one IMSI can only be used by the MTC UE with one specified IMEI. In this condition, the MTC server needs to verify the binding of the IMSI and the IMEI of the MTC UE.
For the service requirements above, the related information of the MTC UE can only be acquired by the underlying access layer, in the E-UTRAN access, only the MME can acquire and judge necessary information. From the architecture of the present M2M communication (refer to the communication between the MTC UE and the MTC Server) accessing the EPS, the occurrence of the limit conditions above is generated in the access layer (for example, MME, PGW), and the service layer (for example, MTC Server) can not acquire the information. Also, for a location sensitive service, the service layer (for example, MTC Server) dose not know the information of the current exact location of the MTC UE and the occurrence of location event (cell handover), however, the information must be provided by the underlying access layer, therefore, in prior art, the MTC Server can not realize the real-time control and intelligent control of the MTC UE.
Besides, in some condition, the MTC Server might not be operated by an operator and the deployment point generally is not in a core network, thus, a threat would be caused to the security of the core network when the MTC Server acquires information from the core network side.
|
2024-04-10T01:26:36.242652
|
https://example.com/article/3045
|
David Millar has been controversially omitted from the Garmin-Sharp team that will be built around Andrew Talansky at the Tour de France this year.
The 37-year-old Millar today communicated via Twitter that he would not be in the squad after being told initially that he would line-up at the Grand Depart on home turf in Yorkshire where few British professionals will be.
Defending Tour champion Froome as well as Alberto Contador (Tinkoff-Saxo) will start the Tour on Saturday as the primary overall protagonists though it was Talansky that surprisingly best the two at the Dauphine earlier this month.
The Dauphine is a good litmus test for the Tour and Talansky secured the yellow jersey there earlier this month on the final stage putting more than a minute into overnight leader Contador. Froome won the race last year before going on to claim his maiden Tour title and Bradley Wiggins did the same before him.
“Andrew’s [Dauphine] performance was really just a confirmation of what we knew was his potential and it’s a really big step for him in terms of self-belief and the belief that he can be competitive with that small group of riders,” Wegelius told Cycling Weekly prior to the Tour team announcement.
“But internally the team was always aware of that and Andrew was always in first person more than anybody aware of that so fundamentally it doesn’t actually change the structure of the [Tour] team or the strategy. Andrew was always going to be one of our main priorities. Although it’s a really welcome and positive thing so close to a race like that, it doesn’t change the structure of the team very much.”
“Andrew’s overall race is going to be a big priority and then on the side of that we’ve got Tom-Jelte Slagter. His profile as a rider suits a lot of stages in the Tour de France so he’s the next tier after that,” Wegelius said.
“The rest of the team that we’ve put together is what we hope is a mix of experienced riders able to manage certain situations on the road, riders who can get over climbs and riders who can ride on the flat. I think every single one of the riders we picked could win a stage in the Tour de France in their own right.
Hard choices to make, but the right one. Millar said he was too sick to race. Danielson & Farrar both needed to be left at home. Tom kills himself to finish 4th on a mtn stage, and Tyler crashes out a lot and will get smeared in the sprints. GO TEAM GO!!!
Peter
Some of the shine for the Tdf has gone. Would loved to see Millar ride the Tour for the last time and see him bury himself for a possible stage win.
Connect with us
Get our free email newsletter
Your email address:
By submitting your details, you will also receive emails from Time Inc. UK, publisher of Cycling Weekly and other iconic brands about its goods and services, and those of its carefully selected third parties. Please tick here if you’d prefer not to hear about:
Time Inc.'s goods & services, including all the latest news, great deals and offers
|
2023-10-25T01:26:36.242652
|
https://example.com/article/8564
|
User-created stickers on Line have racked up $12 million in sales over the first three months
The cutesy stickers that messaging app Line is famous for are not just popular — they help to rake in the money. After all, Line makes over $10 million a month just from selling stickers.
Line further rode on the potential of stickers by opening a marketplace in April that lets anyone create and sell their own stickers, with sales starting on May 8. Today it announced that the Line Creators Market has drawn over 149,000 creators from 124 different countries, who have submitted 30,000 stickers, of which 10,000 sets are currently on sale as of August 19.
What’s impressive is that 12.41 million sticker sets have been sold so far, bringing in sales of over 1.23 billion yen ($11.9 million). That’s in just three months and despite rather limited availability — as stickers from the Creators Market can only be bought in countries where the Line Web Store is operational.
In June, Line widened the reach of such user-made stickers by launching its Web store in nine more countries, including the US and the UK. It appears that Korea has been added to the list recently as well, making up a total of 14 regions where the store is available.
Creators who use the market can sell sets of 40 stickers at 100 yen (about $1) per set once the graphics are approved by Line, and they will receive 50 percent of the proceeds.
Line noted that more than half of all sticker sets have brought in sales of 10,000 yen ($97) or more, which it says “shows that more than just a few very popular sets make money and that creators can reasonably expect to make a little extra spending money with their own stickers.”
The latest figures underlie the importance of stickers to Line, which arguably pioneered the concept, and has now kicked off the idea of democratizing stickers on its platform in a bid to accelerate Line’s global expansion with further localization. The company says the total number of Line stickers sent and received in one day has reached a high of more than 1.8 billion.
|
2024-03-06T01:26:36.242652
|
https://example.com/article/8814
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.