text
stringlengths 1
2.15M
| meta
dict |
|---|---|
/**
* Copyright (C) 2015 MongoDB Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the GNU Affero General Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/platform/basic.h"
#include "mongo/db/fts/fts_language.h"
#include "mongo/db/fts/fts_unicode_tokenizer.h"
#include "mongo/unittest/unittest.h"
namespace mongo {
namespace fts {
std::vector<std::string> tokenizeString(const char* str,
const char* language,
FTSTokenizer::Options options) {
StatusWithFTSLanguage swl = FTSLanguage::make(language, TEXT_INDEX_VERSION_3);
ASSERT_OK(swl);
UnicodeFTSTokenizer tokenizer(swl.getValue());
tokenizer.reset(str, options);
std::vector<std::string> terms;
while (tokenizer.moveNext()) {
terms.push_back(tokenizer.get().toString());
}
return terms;
}
// Ensure punctuation is filtered out of the indexed document and the 's is not separated
TEST(FtsUnicodeTokenizer, English) {
std::vector<std::string> terms =
tokenizeString("Do you see Mark's dog running?", "english", FTSTokenizer::kNone);
ASSERT_EQUALS(6U, terms.size());
ASSERT_EQUALS("do", terms[0]);
ASSERT_EQUALS("you", terms[1]);
ASSERT_EQUALS("see", terms[2]);
ASSERT_EQUALS("mark", terms[3]);
ASSERT_EQUALS("dog", terms[4]);
ASSERT_EQUALS("run", terms[5]);
}
// Ensure that the tokenization still works correctly when there are leading and/or trailing
// delimiters.
TEST(FtsUnicodeTokenizer, EnglishLeadingAndTrailingDelimiters) {
std::vector<std::string> terms =
tokenizeString(" , Do you see Mark's dog running? ", "english", FTSTokenizer::kNone);
ASSERT_EQUALS(6U, terms.size());
ASSERT_EQUALS("do", terms[0]);
ASSERT_EQUALS("you", terms[1]);
ASSERT_EQUALS("see", terms[2]);
ASSERT_EQUALS("mark", terms[3]);
ASSERT_EQUALS("dog", terms[4]);
ASSERT_EQUALS("run", terms[5]);
}
// Ensure that strings containing only delimiters are properly handled.
TEST(FtsUnicodeTokenizer, OnlyDelimiters) {
std::vector<std::string> terms = tokenizeString(" ", "english", FTSTokenizer::kNone);
ASSERT_EQUALS(0U, terms.size());
}
// Ensure punctuation is filtered out of the indexed document and the 'est is separated.
TEST(FtsUnicodeTokenizer, FrenchAndNonAsciiPunctuation) {
std::vector<std::string> terms = tokenizeString(
"Voyez-vous «le chien» de Mark courante? C'est bien!", "french", FTSTokenizer::kNone);
ASSERT_EQUALS(10U, terms.size());
ASSERT_EQUALS("voi", terms[0]);
ASSERT_EQUALS("vous", terms[1]);
ASSERT_EQUALS("le", terms[2]);
ASSERT_EQUALS("chien", terms[3]);
ASSERT_EQUALS("de", terms[4]);
ASSERT_EQUALS("mark", terms[5]);
ASSERT_EQUALS("cour", terms[6]);
ASSERT_EQUALS("c", terms[7]);
ASSERT_EQUALS("est", terms[8]);
ASSERT_EQUALS("bien", terms[9]);
}
// Ensure punctuation is filtered out of the indexed document and the 'est is separated.
TEST(FtsUnicodeTokenizer, FrenchDiacriticStemming) {
std::vector<std::string> terms =
tokenizeString("parlames, parlates, parlerent, parlâmes, parlâtes, parlèrent",
"french",
FTSTokenizer::kNone);
ASSERT_EQUALS(6U, terms.size());
ASSERT_EQUALS("parlam", terms[0]);
ASSERT_EQUALS("parlat", terms[1]);
ASSERT_EQUALS("parlerent", terms[2]);
ASSERT_EQUALS("parl", terms[3]);
ASSERT_EQUALS("parl", terms[4]);
ASSERT_EQUALS("parl", terms[5]);
}
// Ensure punctuation is filtered out of the indexed document and that diacritics are not in the
// resulting tokens.
TEST(FtsUnicodeTokenizer, Turkish) {
std::vector<std::string> terms = tokenizeString(
"KAÇ YAŞINDASIN SEN, VE SEN NEREDEN VARDIR?", "turkish", FTSTokenizer::kNone);
ASSERT_EQUALS(7U, terms.size());
ASSERT_EQUALS("kac", terms[0]);
ASSERT_EQUALS("yas", terms[1]);
ASSERT_EQUALS("sen", terms[2]);
ASSERT_EQUALS("ve", terms[3]);
ASSERT_EQUALS("sen", terms[4]);
ASSERT_EQUALS("nere", terms[5]);
ASSERT_EQUALS("var", terms[6]);
}
// Ensure punctuation is filtered out of the indexed document, that diacritics are not in the
// resulting tokens, and that the generated tokens are not lowercased.
TEST(FtsUnicodeTokenizer, TurkishCaseSensitive) {
std::vector<std::string> terms = tokenizeString("KAÇ YAŞINDASIN SEN, VE SEN NEREDEN VARDIR?",
"turkish",
FTSTokenizer::kGenerateCaseSensitiveTokens);
ASSERT_EQUALS(7U, terms.size());
ASSERT_EQUALS("KAC", terms[0]);
ASSERT_EQUALS("YASINDASIN", terms[1]);
ASSERT_EQUALS("SEN", terms[2]);
ASSERT_EQUALS("VE", terms[3]);
ASSERT_EQUALS("SEN", terms[4]);
ASSERT_EQUALS("NEREDEN", terms[5]);
ASSERT_EQUALS("VARDIR", terms[6]);
}
// Ensure punctuation is filtered out of the indexed document, that diacritics are in the
// resulting tokens, and that the generated tokens are lowercased.
TEST(FtsUnicodeTokenizer, TurkishDiacriticSensitive) {
std::vector<std::string> terms =
tokenizeString("KAÇ YAŞINDASIN SEN, VE SEN NEREDEN VARDIR?",
"turkish",
FTSTokenizer::kGenerateDiacriticSensitiveTokens);
ASSERT_EQUALS(7U, terms.size());
ASSERT_EQUALS("kaç", terms[0]);
ASSERT_EQUALS("yaş", terms[1]);
ASSERT_EQUALS("sen", terms[2]);
ASSERT_EQUALS("ve", terms[3]);
ASSERT_EQUALS("sen", terms[4]);
ASSERT_EQUALS("nere", terms[5]);
ASSERT_EQUALS("var", terms[6]);
}
// Ensure punctuation is filtered out of the indexed document, that diacritics are in the
// resulting tokens, and that the generated tokens are not lowercased.
TEST(FtsUnicodeTokenizer, TurkishDiacriticAndCaseSensitive) {
std::vector<std::string> terms =
tokenizeString("KAÇ YAŞINDASIN SEN, VE SEN NEREDEN VARDIR?",
"turkish",
FTSTokenizer::kGenerateDiacriticSensitiveTokens |
FTSTokenizer::kGenerateCaseSensitiveTokens);
ASSERT_EQUALS(7U, terms.size());
ASSERT_EQUALS("KAÇ", terms[0]);
ASSERT_EQUALS("YAŞINDASIN", terms[1]);
ASSERT_EQUALS("SEN", terms[2]);
ASSERT_EQUALS("VE", terms[3]);
ASSERT_EQUALS("SEN", terms[4]);
ASSERT_EQUALS("NEREDEN", terms[5]);
ASSERT_EQUALS("VARDIR", terms[6]);
}
// Ensure punctuation is filtered out of the indexed document, that diacritics are in the
// resulting tokens, and that the generated tokens are not lowercased.
TEST(FtsUnicodeTokenizer, TurkishDiacriticAndCaseSensitiveAndStopWords) {
std::vector<std::string> terms = tokenizeString(
"KAÇ YAŞINDASIN SEN, VE SEN NEREDEN VARDIR?",
"turkish",
FTSTokenizer::kGenerateDiacriticSensitiveTokens |
FTSTokenizer::kGenerateCaseSensitiveTokens | FTSTokenizer::kFilterStopWords);
ASSERT_EQUALS(4U, terms.size());
ASSERT_EQUALS("KAÇ", terms[0]);
ASSERT_EQUALS("YAŞINDASIN", terms[1]);
ASSERT_EQUALS("NEREDEN", terms[2]);
ASSERT_EQUALS("VARDIR", terms[3]);
}
// Ensure that stop words are only removed if they contain the correct diacritics.
TEST(FtsUnicodeTokenizer, FrenchStopWords) {
std::vector<std::string> terms =
tokenizeString("Je ne vais pas etre énervé. Je vais être excité.",
"french",
FTSTokenizer::kFilterStopWords);
ASSERT_EQUALS(5U, terms.size());
ASSERT_EQUALS("vais", terms[0]);
ASSERT_EQUALS("etre", terms[1]);
ASSERT_EQUALS("enerv", terms[2]);
ASSERT_EQUALS("vais", terms[3]);
ASSERT_EQUALS("excit", terms[4]);
}
// Ensure that stop words are only removed if they contain the correct diacritics.
TEST(FtsUnicodeTokenizer, FrenchStopWordsAndDiacriticSensitive) {
std::vector<std::string> terms = tokenizeString(
"Je ne vais pas etre énervé. Je vais être excité.",
"french",
FTSTokenizer::kFilterStopWords | FTSTokenizer::kGenerateDiacriticSensitiveTokens);
ASSERT_EQUALS(5U, terms.size());
ASSERT_EQUALS("vais", terms[0]);
ASSERT_EQUALS("etre", terms[1]);
ASSERT_EQUALS("énerv", terms[2]);
ASSERT_EQUALS("vais", terms[3]);
ASSERT_EQUALS("excit", terms[4]);
}
} // namespace fts
} // namespace mongo
|
{
"pile_set_name": "Github"
}
|
Q:
Checksum issue CRC16CCITT
I have the following C-code which I am trying to re-write in java.
I would like to see similar outputs in both of them but I am getting different outputs.
This is for computation of checksum.
Here is the C-code:
#include <ctype.h>
#include <string.h>
#include <stdio.h>
/*~+:CRC Table*/
static unsigned short crctab[256] =
{
0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50A5, 0x60C6, 0x70E7,
0x8108, 0x9129, 0xA14A, 0xB16B, 0xC18C, 0xD1AD, 0xE1CE, 0xF1EF,
0x1231, 0x0210, 0x3273, 0x2252, 0x52B5, 0x4294, 0x72F7, 0x62D6,
0x9339, 0x8318, 0xB37B, 0xA35A, 0xD3BD, 0xC39C, 0xF3FF, 0xE3DE,
0x2462, 0x3443, 0x0420, 0x1401, 0x64E6, 0x74C7, 0x44A4, 0x5485,
0xA56A, 0xB54B, 0x8528, 0x9509, 0xE5EE, 0xF5CF, 0xC5AC, 0xD58D,
0x3653, 0x2672, 0x1611, 0x0630, 0x76D7, 0x66F6, 0x5695, 0x46B4,
0xB75B, 0xA77A, 0x9719, 0x8738, 0xF7DF, 0xE7FE, 0xD79D, 0xC7BC,
0x48C4, 0x58E5, 0x6886, 0x78A7, 0x0840, 0x1861, 0x2802, 0x3823,
0xC9CC, 0xD9ED, 0xE98E, 0xF9AF, 0x8948, 0x9969, 0xA90A, 0xB92B,
0x5AF5, 0x4AD4, 0x7AB7, 0x6A96, 0x1A71, 0x0A50, 0x3A33, 0x2A12,
0xDBFD, 0xCBDC, 0xFBBF, 0xEB9E, 0x9B79, 0x8B58, 0xBB3B, 0xAB1A,
0x6CA6, 0x7C87, 0x4CE4, 0x5CC5, 0x2C22, 0x3C03, 0x0C60, 0x1C41,
0xEDAE, 0xFD8F, 0xCDEC, 0xDDCD, 0xAD2A, 0xBD0B, 0x8D68, 0x9D49,
0x7E97, 0x6EB6, 0x5ED5, 0x4EF4, 0x3E13, 0x2E32, 0x1E51, 0x0E70,
0xFF9F, 0xEFBE, 0xDFDD, 0xCFFC, 0xBF1B, 0xAF3A, 0x9F59, 0x8F78,
0x9188, 0x81A9, 0xB1CA, 0xA1EB, 0xD10C, 0xC12D, 0xF14E, 0xE16F,
0x1080, 0x00A1, 0x30C2, 0x20E3, 0x5004, 0x4025, 0x7046, 0x6067,
0x83B9, 0x9398, 0xA3FB, 0xB3DA, 0xC33D, 0xD31C, 0xE37F, 0xF35E,
0x02B1, 0x1290, 0x22F3, 0x32D2, 0x4235, 0x5214, 0x6277, 0x7256,
0xB5EA, 0xA5CB, 0x95A8, 0x8589, 0xF56E, 0xE54F, 0xD52C, 0xC50D,
0x34E2, 0x24C3, 0x14A0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,
0xA7DB, 0xB7FA, 0x8799, 0x97B8, 0xE75F, 0xF77E, 0xC71D, 0xD73C,
0x26D3, 0x36F2, 0x0691, 0x16B0, 0x6657, 0x7676, 0x4615, 0x5634,
0xD94C, 0xC96D, 0xF90E, 0xE92F, 0x99C8, 0x89E9, 0xB98A, 0xA9AB,
0x5844, 0x4865, 0x7806, 0x6827, 0x18C0, 0x08E1, 0x3882, 0x28A3,
0xCB7D, 0xDB5C, 0xEB3F, 0xFB1E, 0x8BF9, 0x9BD8, 0xABBB, 0xBB9A,
0x4A75, 0x5A54, 0x6A37, 0x7A16, 0x0AF1, 0x1AD0, 0x2AB3, 0x3A92,
0xFD2E, 0xED0F, 0xDD6C, 0xCD4D, 0xBDAA, 0xAD8B, 0x9DE8, 0x8DC9,
0x7C26, 0x6C07, 0x5C64, 0x4C45, 0x3CA2, 0x2C83, 0x1CE0, 0x0CC1,
0xEF1F, 0xFF3E, 0xCF5D, 0xDF7C, 0xAF9B, 0xBFBA, 0x8FD9, 0x9FF8,
0x6E17, 0x7E36, 0x4E55, 0x5E74, 0x2E93, 0x3EB2, 0x0ED1, 0x1EF0
};
void convert_toASCII (char *buffer, int value)
{
/*
Function converts given 'value' into a 4 byte
ASCII-HEX-String (with leading zeros) to 'buffer[]'
Parameter: char *buffer, int value
Returns: none
*/
static unsigned char hex_num[] = "0123456789ABCDEF";
static unsigned char i; /* HV */
i = (char)((value & 0xf000) >> 12);
*buffer = (char)(hex_num[i]);
++buffer;
i = (char)((value & 0x0f00) >> 8);
*buffer = (char)(hex_num[i]);
++buffer;
i = (char)((value & 0x00f0) >> 4);
*buffer = (char)(hex_num[i]);
++buffer;
i = (char)(value & 0x000f);
*buffer = (char)(hex_num[i]);
}
void calc_crc(unsigned char *databuffer,unsigned int length)
{
/*~+:Modulname: calc_crc */
/*~+:Calculate serial CRC (according CCITT ) */
/*~+:The serial CRC16 is calculated for a certain length (int length) */
/*~+:over bytes in buffer (char databuffer[]) */
/*~+: */
/*~+:Input: *databuffer pointer to data string */
/*~+: laenge number of chars to build CRC for */
/*~+:Output: the CRC will be added in ASCII characters ( 4 chars) */
/*~+: at the end of the given string and terminated with '\0' */
/*~+: The buffer must be able to handle these additional */
/*~+: 5 characters */
static unsigned char tmp;
static unsigned int crc,zaehler;
crc = 0;
for (zaehler = 0;zaehler < length ;zaehler ++)
{
tmp=(unsigned char) (crc>>8) ;
crc=(crc<<8) ^ crctab[tmp] ^ *databuffer;
databuffer++;
}
printf("%u", crc);
/* convert crc -> ASCII */
/* append to string */
convert_toASCII (databuffer, crc);
}
void main(void)
{
static char Data[] = {"abcdefghij"};
static char buffer[64];
strcpy(buffer,Datensatz);
printf("Data : %s \n\r",&buffer[0]);
calc_crc(buffer,10);
printf("CRC : %s \n\r",&buffer[10]);
printf("Data mit CRC: %s \n\r",&buffer[0]);
}
The java code that I have written is:
public final class Checksum
{
public static void main(final String[] args)
{
final String checksumString = "abcdefghij";
final int checksum = calculateCRC16CCITTChecksum(checksumString);
System.out.println("Checksum integer value:" + checksum);
System.out.println("Checksum value in Hex:" + Integer.toHexString(checksum));
}
/**
* @param frame The frame for whose checksum has to be calculated.
* @return The calculated checksum.
*/
private final static int calculateCRC16CCITTChecksum(final String frame)
{
final int[] CRC16_Lookup = {0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50A5, 0x60C6, 0x70E7, 0x8108, 0x9129, 0xA14A, 0xB16B, 0xC18C, 0xD1AD, 0xE1CE, 0xF1EF, 0x1231, 0x0210, 0x3273, 0x2252,
0x52B5, 0x4294, 0x72F7, 0x62D6, 0x9339, 0x8318, 0xB37B, 0xA35A, 0xD3BD, 0xC39C, 0xF3FF, 0xE3DE, 0x2462, 0x3443, 0x0420, 0x1401, 0x64E6, 0x74C7, 0x44A4, 0x5485, 0xA56A, 0xB54B, 0x8528,
0x9509, 0xE5EE, 0xF5CF, 0xC5AC, 0xD58D, 0x3653, 0x2672, 0x1611, 0x0630, 0x76D7, 0x66F6, 0x5695, 0x46B4, 0xB75B, 0xA77A, 0x9719, 0x8738, 0xF7DF, 0xE7FE, 0xD79D, 0xC7BC, 0x48C4, 0x58E5,
0x6886, 0x78A7, 0x0840, 0x1861, 0x2802, 0x3823, 0xC9CC, 0xD9ED, 0xE98E, 0xF9AF, 0x8948, 0x9969, 0xA90A, 0xB92B, 0x5AF5, 0x4AD4, 0x7AB7, 0x6A96, 0x1A71, 0x0A50, 0x3A33, 0x2A12, 0xDBFD,
0xCBDC, 0xFBBF, 0xEB9E, 0x9B79, 0x8B58, 0xBB3B, 0xAB1A, 0x6CA6, 0x7C87, 0x4CE4, 0x5CC5, 0x2C22, 0x3C03, 0x0C60, 0x1C41, 0xEDAE, 0xFD8F, 0xCDEC, 0xDDCD, 0xAD2A, 0xBD0B, 0x8D68, 0x9D49,
0x7E97, 0x6EB6, 0x5ED5, 0x4EF4, 0x3E13, 0x2E32, 0x1E51, 0x0E70, 0xFF9F, 0xEFBE, 0xDFDD, 0xCFFC, 0xBF1B, 0xAF3A, 0x9F59, 0x8F78, 0x9188, 0x81A9, 0xB1CA, 0xA1EB, 0xD10C, 0xC12D, 0xF14E,
0xE16F, 0x1080, 0x00A1, 0x30C2, 0x20E3, 0x5004, 0x4025, 0x7046, 0x6067, 0x83B9, 0x9398, 0xA3FB, 0xB3DA, 0xC33D, 0xD31C, 0xE37F, 0xF35E, 0x02B1, 0x1290, 0x22F3, 0x32D2, 0x4235, 0x5214,
0x6277, 0x7256, 0xB5EA, 0xA5CB, 0x95A8, 0x8589, 0xF56E, 0xE54F, 0xD52C, 0xC50D, 0x34E2, 0x24C3, 0x14A0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405, 0xA7DB, 0xB7FA, 0x8799, 0x97B8, 0xE75F,
0xF77E, 0xC71D, 0xD73C, 0x26D3, 0x36F2, 0x0691, 0x16B0, 0x6657, 0x7676, 0x4615, 0x5634, 0xD94C, 0xC96D, 0xF90E, 0xE92F, 0x99C8, 0x89E9, 0xB98A, 0xA9AB, 0x5844, 0x4865, 0x7806, 0x6827,
0x18C0, 0x08E1, 0x3882, 0x28A3, 0xCB7D, 0xDB5C, 0xEB3F, 0xFB1E, 0x8BF9, 0x9BD8, 0xABBB, 0xBB9A, 0x4A75, 0x5A54, 0x6A37, 0x7A16, 0x0AF1, 0x1AD0, 0x2AB3, 0x3A92, 0xFD2E, 0xED0F, 0xDD6C,
0xCD4D, 0xBDAA, 0xAD8B, 0x9DE8, 0x8DC9, 0x7C26, 0x6C07, 0x5C64, 0x4C45, 0x3CA2, 0x2C83, 0x1CE0, 0x0CC1, 0xEF1F, 0xFF3E, 0xCF5D, 0xDF7C, 0xAF9B, 0xBFBA, 0x8FD9, 0x9FF8, 0x6E17, 0x7E36,
0x4E55, 0x5E74, 0x2E93, 0x3EB2, 0x0ED1, 0x1EF0};
// check sum for polynomial 1.x16 + 0.x15 + 0.x14 + 0.x13 + 1.x12 + 0.x11 + 0.x10 + 0.x9 + 0.x8 + 0.x7 + 0.x6 + 1.x5 + 0.x4 + 0.x3 + 0.x2 +0.x1 + 1.x0.
// 1.x16 - implies 1 multiplied by 'x' to the power of 16.
int crc = 0;
for (int i = 0, size = frame.length(); i < size; i++)
{
crc = (crc << 8) ^ CRC16_Lookup[(crc >> 8) & 0xFF] ^ (frame.charAt(i) & 0xFF);
}
return crc & 0xFFFF;
}
}
The integer value output that I get in java code is different from what the decimal value that I get in C, even the hex string conversion in java yields different results to that of hex conversion in C.
Please guide me what I am doing wrong.
Thanks for looking!!
A:
This is not strictly related to an implementation problem, but I guess it's worth mentioning anyway. Keep in mind that some communication protocols require XORing the input values and output values with some value, not to mention bit or byte reflecting of the input data. This happens in Ethernet, which uses CRC-32 for the actual calculations, but the input and output data is XORed with FF..FF (so, it's NOTed), and all the bits in the input byte (or, more naturally, nibble) are reflected. Keep that in mind - the actual calculations might be alright, but there might be something you're simply not aware of in terms of mangling the data, what leads to completely different results.
|
{
"pile_set_name": "StackExchange"
}
|
Q:
Python - using raw_input() to search a text document
I am trying to write a simple script that a user can enter what he/she wants to search in a specified txt file. If the word they searching is found then print it to a new text file. This is what I got so far.
import re
import os
os.chdir("C:\Python 2016 Training")
patterns = open("rtr.txt", "r")
what_directory_am_i_in = os.getcwd()
print what_directory_am_i_in
search = raw_input("What you looking for? ")
for line in patterns:
re.findall("(.*)search(.*)", line)
fo = open("test", "wb")
fo.write(line)
fo.close
This successfully creates a file called test, but the output is nothing close to what word was entered into the search variable.
Any advice appreciated.
A:
First of all, you have not read a file
patterns = open("rtr.txt", "r")
this is a file object and not the content of file, to read the file contents you need to use
patterns.readlines()
secondly, re.findall returns a list of matched strings, so you would want to store that. You regex is also not correct as pointed by Hani, It should be
matched = re.findall("(.*)" + search + "(.*)", line)
rather it should be :
if you want the complete line
matched = re.findall(".*" + search + ".*", line)
or simply
matched = line if search in line else None
Thirdly, you don't need to keep opening your output file in the for loop. You are overwriting your file everytime in the loop so it will capture only the last result. Also remember to call the close method on the files.
Hope this helps
|
{
"pile_set_name": "StackExchange"
}
|
Author: Ray Found
Traditionally, hops were added at three main points during the boil, the timing of which served a clear purpose– bitterness, flavor, and aroma. However, these days, IPA brewers have begun employing various techniques in an attempt to maximize hop character without overwhelming their beer with bitterness. Chief among these is the hop stand, referred to by some as a whirlpool addition, which involves hops being added to the wort at flameout and left to steep for an extended period of time. As most new brewers learn, the amount of time hops spend in the boil is positively correlated with bitterness and negatively correlated with final hop character. Given the amount of time it takes for large commercial batches to chill, it seems logical that desirable volatile compounds could be lost and bitterness gained from large additions made during the boil, hence adding those hops at flameout would allow for more control of these characteristics in hoppy styles.
But I don’t brew on a commercial system. It takes me just a few minutes to chill my wort to 120°F/49°C, and still I, like many homebrewers, have taken to utilizing the hop stand method, faithful to the promise it yields more hop flavor and aroma without excessive bitterness compared to boil additions. This despite claims that whirlpool additions made on a commercial scale are equivalent to 20 minute boil additions on the homebrew scale.
So what gives? Is there actually something to the hop stand method or can similar results be achieved using a less time consuming boil addition? Only one way to find out!
| PURPOSE |
To evaluate the differences between the same beer where one had hops added at 20 minutes left in the boil and the other received the same amount of hops for a 20 minute hop stand.
| METHOD |
I hadn’t had my favorite MACC IPA on tap for a couple months and figured it would be a great recipe for this variable.
For the sake of this particular xBmt, I made a small change to my recipe by eliminating the small 20 minute dose of Citra I usually toss in, which meant that aside from minor bittering charges of Magnum, all of the hops for each beer would be added at either 20 minutes left in the boil or flameout with a 20 minute hop stand– 340 grams of the same hops were added to each 11 gallon batch.
I started this brew a couple days ahead of time with the making of a couple starters.
I began filtering water through a reverse osmosis system the night before brewing, as it processes at a rate of approximately 3 gallons per hour.
I then moved on to weighing out and milling enough grain for 20 gallons of MACC IPA.
The following afternoon, I began heating strike water for both batches at the same time, as I would be able to chill the boil hop batch while the hop stand batch was steeping. I mashed in consecutively and hit my target temperature for both batches.
Everything was set just as it was time to leave for my daughter’s T-ball practice, so for the first time ever, I let the beers mash for an extended period of time– 3.5 hours. It actually worked out quite nicely, thanks to the great insulation on my ThermoBarrel’s, I only lost 3°F/1.7°C.
A minor adjustment to my standard batch sparge routine resulted in the collection of a tad more wort than usual…
Even FermCap-S couldn’t prevent minor boilovers from occurring in a kettle so full, but it did avert certain calamity. Each batch received a small dose of Magnum up front for bittering and the boiled hops batch was hit with a large dose of hops 40 minutes later.
I rapidly chilled the boiled hops wort at the conclusion of its 1 hour boil, finishing a few minutes before the hop stand batch’s boil was complete. Once the timer went off, I hit the flame and added an identical amount of the same hops to the hop stand wort then reset my timer for 20 minutes. During the hop stand, I collected equal amounts of wort in separate carboys from the boiled hops batch.
At the end of the 20 minute hop stand, I noted the temperature of the wort was just shy of 200°F/93°C.
I proceeded with the same chilling and carboy filling process as the hop stand batch then took hydrometer readings to discover both worts achieved an identical 1.069 OG.
I let my chamber finish chilling the worts to my target fermentation temperature of 66°F/19°C before pitching equal amounts of yeast into each. All of the beers were actively fermenting just 12 hours later.
I returned home after a 3 day work trip to find the fridge I ferment in died at some point during my absence and my fermenting beers were approaching 79°F/26°C. I took some solace in the knowledge they began their journey at my cooler target temperature and was hopeful the excessive heat wouldn’t have much impact. We haven’t put WLP090 San Diego Super Yeast through a fermentation temperature xBmt yet! Hydrometer measurements taken a couple days later revealed both batches had finished at a respectable 1.011 FG.
Since my fridge was broken, I lugged my carboys to my brother-in-law’s house where they were cold crashed and fined with gelatin. I returned later to keg the beers, bringing three home with me while leaving one behind for the toddler’s birthday party. After a few days on CO2 in my cool keezer, the beers were carbonated and ready to serve, though one difference was readily apparent.
The hop stand beer maintained a slight haze the entire time it was on tap while the boiled hops batch was brilliantly clear from the day after it was packaged.
| RESULTS |
A total of 19 people participated in this xBmt, all blind to the variable being investigated. Each taster was served 2 samples of the boiled hops beer and 1 sample of the hop stand beer in different colored opaque cups then asked to select the one they perceived as being different. Given the sample size, 11 correct responses (p<0.05) would be required to reach the threshold for statistical significance. In this case, only 9 participants (p=0.19) correctly identified the odd-beer-out. Of these 9 panelists, 4 endorsed the boiled hops beer as their most preferred, 2 liked the the hop stand beer better, and 3 indicated no preference.
In addition to the standard sensory evaluation, samples of these beers were sent to our friends at Oregon Brew Lab for IBU testing in order to glean more information on isomerization differences between a 20 minute boil addition and a 20 minute hop stand. The boiled hops beer came it at 58 IBU (±1) and the hop stand beer measured 60 IBU (±1), for a final difference of 2 IBU. I’m calling this a wash.
My Impressions: During initial non-blind tastings, I confidently perceived the hop stand beer to be slightly softer with a slightly sweet (I don’t dare say juicy) hop character, while the boiled hops version was crisper and cleaner without being obviously more bitter. However, over the course of tastings, I took the time to complete 3 “blind” triangle tests and correctly identified the unique sample only a single time, which is entirely congruent with chance. Following this performance, I’ve reluctantly admitted to myself the two beers are a very good approximation of each other and any difference is exceedingly slim. To my personal surprise, I have actually formed a preference between the two, despite my inability to distinguish between them by flavor alone, and the winner is– the boiled hops beer. As one who tastes with my eyes, the clarity difference is what swayed my opinion.
| DISCUSSION |
Hop stands have been an integral part of my IPA brewing repertoire for awhile, but I’m faced with data and experience suggesting it may have been for naught, as boiling hops for 20 minutes produced a beer that was largely indistinguishable from a beer made with a 20 minute hop stand. The only noticeable difference, interestingly enough, was in the appearance with the hop stand beer maintaining a slight haze while the boiled hops beer was brilliant. With all of this, as well as the fact that hop stands require time, I find myself considering changing my brewing practice for hoppy beers, something I’ve never done after just a single test.
In regards to the clarity difference, which left me scratching my head, I can’t help but wonder if kettle finings are the culprit, the extended time in hot wort perhaps contributing to some sort of denaturing and poorer performance. I generally add Whirlfloc with about 5 minutes remaining in the boil, maybe it’d be better to add it later when doing an extended hop stand.
These results also leave me curious about IBU formulas. The boiled hops batch was projected to be at 115 IBU compared to just 84 IBU for the hop stand beer. However, lab testing proved that not only were the beers nearly similar, but that the hop stand beer was actually slightly more bitter (by 2 IBU) than the boiled hops batch. I’ve long believed that IBU formulas are useful only for comparisons within a given brewing system, but now I’m beginning to wonder if they’re even that useful. Obviously, the way hops were added in this case dramatically changed the way the IBUs were calculated yet had little to no impact on the finished product and no appreciable impact on actual IBUs.
| BONUS DATA |
Since this was a 20 gallon batch, I dry hopped the extra boiled hops carboy with nearly 4 oz of Cascade, which I then had BeerMe Brew Club members compare side by side with the boiled hops xBmt beer dry hopped with the usual Mosaic, Amarillo, and Citra. The near universal response was shock at how different the flavor of the beers were. Although I preferred the intense fruit-punch character of the Mosaic/Amarillo/Citra version, others liked the more classic character of the Cascade version. This less-than-scientific experience confirms my personal belief that dry hopping has a substantial impact on flavor, not just aroma as is generally cited. In fact, I perceived the aroma difference to be less pronounced than the flavor difference.
Furthermore, the Cascade dry hopped sample was also sent to Oregon Brew Lab for IBU testing and it ended up with a measured 62 IBU (±1), the highest of the three and 4 IBU more than the boiled hops xBmt batch that came from the same kettle.
Indeed, this is nearly within the margin of error, but in light of Scott Janish’s recent post indicating dry hopping contributes to bitterness, my mind is swirling– the technically most bitter batch was dry hopped with a lower quantity of lower AA% hops. Could some idiosyncratic property of Cascade be the culprit or are we too close to call? Again, I’m left with more questions than answers…
If you have any thoughts about this xBmt, please do not hesitate to share in the comments section below!
New Brülosophy Merch Available Now!
Follow Brülosophy on:
If you enjoy this stuff and feel compelled to support Brulosophy.com, please check out the Support page for details on how you can very easily do so. Thanks!
Advertisements
Share this: Facebook
Twitter
Pinterest
Tumblr
Email
Like this: Like Loading...
|
{
"pile_set_name": "OpenWebText2"
}
|
---
abstract: 'Carroll symmetries arise when the velocity of light is sent to zero (ultra-relativistic limit). In this paper, we present the construction of the three-dimensional Chern-Simons supergravity theory invariant under the so-called AdS Carroll superalgebra, which was obtained in the literature as a contraction of the AdS superalgebra. The action is characterized by two coupling constants. Subsequently, we study its flat limit, obtaining the three-dimensional Chern-Simons supergravity theory invariant under the super-Carroll algebra, which is a contraction of the Poincaré superalgebra. We apply the flat limit at the level of the superalgebra, Chern-Simons action, supersymmetry transformation laws, and field equations.'
---
****
**Lucrezia Ravera**$^{\ast}$\
$^{\ast}$*INFN, Sezione di Milano,*\
*Via Celoria 16, I-20133 Milano, Italy.*\
`lucrezia.ravera@mi.infn.it`
Introduction
============
Spacetime symmetries have played a fundamental role in the understanding of diverse physical theories such as Newtonian gravity, Maxwell’s electromagnetism, special and general relativity, string and supergravity theory. Most of these models are based on relativistic symmetries. However, in the literature models with non-relativistic symmetries have also been developed and analyzed.
Concerning gravity theories, there are many different versions of non-relativistic gravity models (for a clear review see the recent paper [@Bergshoeff:2019ctr], where the authors showed that the general method of Lie algebra expansions can be applied to reconstruct several algebras and related actions for non-relativistic gravity). These non-relativistic gravity theories are all invariant under reparametrizations, but differ in the fact that they are invariant under distinct extensions of the Galilei symmetries, the latter arising when the velocity of light is sent to infinity ($c \rightarrow \infty$, non-relativistic limit). The simplest example is given by the so-called Galilei gravity theory, which is invariant under the unextended Galilei symmetries [@Bergshoeff:2017btm], while Newtonian gravity and its frame-independent reformulation, Newton-Cartan gravity, are invariant under the symmetries corresponding to a central extension of the Galilei algebra, called the Bargmann algebra [@Bargmann; @DePietri:1994je; @Andringa:2010it].
A dynamical (field theoretic) realization of Newton-Cartan geometry was formulated in [@Banerjee:2014nja] from the localization of the Galilean symmetry of non-relativistic matter field theories, leading to a theory that the authors called Galilean gauge theory of gravity. Subsequently, in [@Banerjee:2018gqz] the authors provided an exact mapping between the aforesaid Galilian gauge theory and the Poicaré gauge theory of gravity, and applied their dictionary shewing explicitly the derivation of Newtonian gravity from Einstein’s gravity.
The interest in Galilean-invariant theories with diffeomorphism invariance has increased during the years due to their relation with condensed matter systems in the context of the fractional quantum Hall effect [@Son:2005rv; @Son:2013rqa; @Geracie:2014nka] (see also [@Jensen:2014wha; @Banerjee:2015tga] and references therein).
Other non-relativistic theories such as non-relativistic superstrings and superbranes were studied as special points in the parameter space of M-theory [@Gomis:2000bd; @Danielsson:2000gi], and non-relativistic strings also attracted attention due to the fact that they appear as a possible soluble sector within string theory or M-theory [@Gomis:2004pw; @Gomis:2005pg].
On the other hand, there also exists another type of non-relativistic symmetry that has sporadically attracted some interest over recent years: The Carroll symmetries, which arise when the velocity of light is sent to zero ($c \rightarrow 0$, ultra-relativistic limit) [@LL; @Bacry:1968zf]. The Carroll group introduced by Lévy-Leblond emerged as the ultra-relativistic contraction of the Poincaré group, dual to the non-relativistic contraction leading to the Galilean group. In the Carroll case, at each point of spacetime the light cone collapses to the time axis, whereas in the Galilei case it coincides with the space axis.
Models with Carroll symmetries occurred in the study of tachyon condensation [@Gibbons:2002tv] and also appeared in the study of warped conformal field theories [@Hofman:2014loa] and in the context of tensionless strings [@Bagchi:2013bga; @Bagchi:2015nca; @Bagchi:2016yyf; @Bagchi:2017cte; @Bagchi:2018wsn].
In [@Hartong:2015xda; @Bergshoeff:2016soe] and in [@Bergshoeff:2017btm], theories of Carrollian (i.e., ultra-relativistic) gravity have been developed and analyzed. In particular, in [@Bergshoeff:2016soe] the authors focused on the construction of non- and ultra-relativistic Chern-Simons (CS) type actions in $2+1$ dimensions including a spin-3 field coupled to gravity. In [@Bergshoeff:2015wma], the geometry of flat and curved (Anti-de Sitter, AdS for short) Carroll space and the symmetries of a particle moving in such a space both in the bosonic as well as in the supersymmetric case were investigated. Afterwards, in the work [@Matulich:2019cdo], which concerns the classification of gravitational theories in $2+1$ dimensions and limits of their actions, the AdS Carroll CS gravity theory was discussed for the first time.
It has further been shown that non-relativistic symmetry groups play a remarkable role in various holography contexts [@Bagchi:2009my; @Christensen:2013lma; @Christensen:2013rfa; @Hartong:2014oma; @Bergshoeff:2014uea; @Hartong:2015wxa; @Bagchi:2010eg; @Bagchi:2012cy; @Bagchi:2016bcd; @Lodato:2016alv; @Bagchi:2019xfx; @Duval:2014uva; @Duval:2014lpa; @Ciambelli:2018xat; @Ciambelli:2018wre; @Ciambelli:2018ojf; @Campoleoni:2018ltl]. In particular, in [@Bagchi:2010eg] connections among the Bondi-Metzner-Sachs (BMS) algebra,[^1] Carrollian physics, and holography of flat space were noticed and followed up in [@Bagchi:2012cy] (see also [@Bagchi:2016bcd; @Lodato:2016alv], the latter developed in the context of supergravity, and [@Bagchi:2019xfx]). Moreover, in [@Duval:2014uva; @Duval:2014lpa] conformal extensions of the Carroll group were explored and related to the BMS group, and in [@Ciambelli:2018xat; @Ciambelli:2018wre; @Ciambelli:2018ojf; @Campoleoni:2018ltl] the authors shewed how Carrollian structures and geometry emerge in the framework of flat holography and fluid/gravity correspondence.
Motivated by all these interesting applications of Carroll symmetries and by the fact that a study of their supersymmetric extensions in the context of supergravity models is still lacking, in this work we present for the first time the construction of the three-dimensional CS supergravity theory invariant under the $\mathcal{N}=1$ AdS Carroll superalgebra (in $D=3$, where here and in the sequel with $D=3$ we mean $2+1$ dimensions) introduced in [@Bergshoeff:2015wma] (which was obtained in [@Bergshoeff:2015wma] as a contraction of the $\mathcal{N}=1$ AdS superalgebra) by applying the method of [@Concha:2016zdb]. Our result was also an open problem suggested in Ref. [@Bergshoeff:2015wma] and it represents the $\mathcal{N}=1$ supersymmetric extension of the AdS Carroll CS gravity action of [@Matulich:2019cdo].
Specifically, in [@Concha:2016zdb] the authors presented a generalization of the standard Inönü-Wigner contraction [@IW; @WW] by rescaling not only the generators of a Lie (super)algebra but also the arbitrary constants appearing in the components of the invariant tensor of the same Lie (super)algebra, the latter being the key ingredient for working out a CS action, invariant under the Inönü-Wigner contracted (super)algebra by construction. Thus, the development of any CS action based on an Inönü-Wigner contracted (super)algebra is assured.[^2] In particular, the procedure presented in [@Concha:2016zdb] allows to obtain explicitly the CS supergravity action of a contracted superalgebra, which will be our case, since the $\mathcal{N}=1$ AdS Carroll superalgebra is obtained as a contraction of the $\mathcal{N}=1$ AdS superalgebra [@Bergshoeff:2015wma].
Having constructed the three-dimensional CS supergravity theory invariant under the AdS Carroll superalgebra, we subsequently apply the flat limit ($\ell \rightarrow \infty$, being $\ell$ the length parameter) at the level of the superalgebra, CS action, gauge transformation laws, and field equations. In particular, taking the flat limit of the AdS Carroll CS supergravity action we obtain the three-dimensional CS supergravity theory invariant under the super-Carroll algebra, which is a contraction of the Poincaré superalgebra (see [@Bergshoeff:2015wma]).
AdS Chern-Simons supergravity in 2+1 spacetime dimensions {#S1}
=========================================================
It is well assumed that a three-dimensional (super)gravity theory can be described by a CS action as a gauge theory, offering an interesting toy model to approach higher-dimensional theories [@DK; @Deser; @PvN; @AT1; @RPvN; @Witten; @AT2; @NG; @Howe:1995zm; @Banados:1996hi; @Giacomini:2006dr]. In the last decades, diverse three-dimensional supergravity models have been studied, and in this context there has also been a growing interest to extend AdS and Poincaré supergravity theories to other symmetries (see [@Concha:2018jxx; @Concha:2019icz] and references therein).
In this section, we briefly review (following [@Concha:2016zdb]) the construction of the $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$ CS supergravity (three-dimensional AdS CS supergravity), and we pave the way for the development of the CS supergravity action in three spacetime dimensions invariant under the $D=3$ AdS Carroll superalgebra which will be presented in Section \[S2\].
The three-dimensional CS action is given by $$\label{genCS}
I_{CS}=\frac{k}{4 \pi} \int_\mathcal{M} \Big \langle A dA + \frac{2}{3} A^3 \Big \rangle \, ,$$ where $k=1/(4G)$ is the CS level of the theory (and for gravitational theories is related to the gravitational constant $G$), $A$ corresponds to the gauge connection $1$-form, $\langle \ldots \rangle$ denotes the invariant tensor, and the integral is over a three-dimensional manifold $\mathcal{M}$.
In the case of $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$, the connection $1$-form reads $$\label{connection}
\tilde{A} =\tilde{A}^A \tilde{T}_A = \frac{1}{2} \tilde{\omega}^{AB} \tilde{J}_{AB} + \tilde{V}^A \tilde{P}_A + \tilde{\psi}^\alpha \tilde{Q}_\alpha \, ,$$ where $\tilde{T}_A = \lbrace \tilde{J}_{AB}, \tilde{P}_A , \tilde{Q}_\alpha \rbrace$ (Lorentz generators, spacetime translations, and a $2$-components Majorana spinor charge, respectively) are the $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$ generators (with $A,B=0,1,2$ and $\alpha=1,2$) and $\tilde{\omega}^{AB}$, $\tilde{V}^A$, $\tilde{\psi}^\alpha$ are the spin connection, the dreibein, and the gravitino $1$-form fields, respectively.[^3]
The corresponding curvature $2$-form $\tilde{F}= d\tilde{A} + \tilde{A} \wedge \tilde{A}$ is[^4] $$\label{curv2f}
\tilde{F} = \tilde{F}^A \tilde{T}_A= \frac{1}{2} \tilde{\mathcal{R}}^{AB} \tilde{J}_{AB} + \tilde{R}^A \tilde{P}_A + \tilde{\Psi}^\alpha \tilde{Q}_\alpha \, ,$$ with $$\begin{split}
\tilde{\mathcal{R}}^{AB} & \equiv d \tilde{\omega}^{AB} + \tilde{\omega}^A_{\phantom{A} C} \tilde{\omega}^{CB} + \frac{1}{\ell^2} \tilde{V}^A \tilde{V}^B+ \frac{1}{2\ell} \bar{\tilde{\psi}} \Gamma^{AB} \tilde{\psi} = \tilde{R}^{AB} + \frac{1}{\ell^2} \tilde{V}^A \tilde{V}^B+ \frac{1}{2\ell} \bar{\tilde{\psi}} \Gamma^{AB} \tilde{\psi} \, , \\
\tilde{R}^A & \equiv d \tilde{V}^A + \tilde{\omega}^A_{\phantom{A}B} \tilde{V}^B - \frac{1}{2} \bar{\tilde{\psi}} \Gamma^A \tilde{\psi} = \tilde{T}^A - \frac{1}{2} \bar{\tilde{\psi}} \Gamma^A \tilde{\psi} \, , \\
\tilde{\Psi} & \equiv \tilde{\nabla} \tilde{\psi} = \tilde{D} \tilde{\psi} + \frac{1}{2 \ell} \tilde{V}^A \Gamma_A \tilde{\psi} \, ,
\end{split}$$ where $\tilde{\nabla} = d + \left[ \tilde{A}, \cdot \right]$ and where $\tilde{D}=d + \tilde{\omega}$ is the Lorentz covariant derivative.
The (anti)commutation relations for $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$ read $$\label{osp}
\begin{split}
& \left[ \tilde{J}_{AB}, \tilde{J}_{CD}\right] =\eta _{BC}\tilde{J}_{AD}-\eta _{AC}\tilde{J}_{BD}-\eta
_{BD}\tilde{J}_{AC}+\eta _{AD}\tilde{J}_{BC} \, , \\
& \left[ \tilde{J}_{AB},\tilde{P}_{C}\right] =\eta _{BC}\tilde{P}_{A}-\eta _{AC}\tilde{P}_{B} \, , \quad \quad
\left[ \tilde{P}_A , \tilde{P}_B \right] = \frac{1}{\ell^2} \tilde{J}_{AB} \, , \\
& \left[ \tilde{J}_{AB},\tilde{Q}_{\alpha }\right] =-\frac{1}{2}\left( \Gamma _{AB}\tilde{Q}\right)_{\alpha } \, , \quad \quad
\left[ \tilde{P}_{A}, \tilde{Q}_{\alpha }\right] =-\frac{1}{2 \ell} \left( \Gamma _{A}\tilde{Q}\right) _{\alpha } \, , \\
& \left\{ \tilde{Q}_{\alpha }, \tilde{Q}_{\beta }\right\} = - \frac{1}{2 \ell} \left(\Gamma^{AB} C \right)_{\alpha \beta} \tilde{J}_{AB} + \left( \Gamma ^{A}C\right) _{\alpha \beta }\tilde{P}_{A} \, ,
\end{split}$$ where $\ell$ is a length parameter, $C$ denotes the charge conjugation matrix, $\Gamma_A$ represents the Dirac matrices in three dimensions (we have $C^T=-C$ and $C \Gamma^A = (C \Gamma^A)^T$), which satisfy the Clifford algebra $\lbrace \Gamma_A, \Gamma_B \rbrace = - 2 \eta_{AB}$, and $\Gamma_{AB} = \frac{1}{2} \left[\Gamma_A, \Gamma_B \right]$.
The non-vanishing components of an invariant tensor for $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$ are given by $$\begin{split}
& \langle \tilde{J}_{AB} \tilde{J}_{CD} \rangle = \mu_0 \left( \eta_{AD} \eta_{BC} - \eta_{AC} \eta_{BD} \right) \, , \quad
\langle \tilde{J}_{AB} \tilde{P}_{C} \rangle = \frac{\mu_1}{\ell} \epsilon_{ABC} \, , \quad
\langle \tilde{P}_{A} \tilde{P}_{B} \rangle = \frac{\mu_0}{\ell^2} \eta_{AB} \, , \\
& \langle \tilde{Q}_\alpha \tilde{Q}_\beta \rangle = \frac{2 \left(\mu_1 -\mu_0 \right)}{\ell} C_{\alpha \beta} \, ,
\end{split}$$ where $\mu_0$ and $\mu_1$ are arbitrary constants and $\epsilon_{ABC}$ is the Levi-Civita symbol in three dimensions. For convenience, let us redefine the coefficients $\mu_0$ and $\mu_1$ as follows:[^5] $$\mu_0 \rightarrow \alpha_0 \, , \quad \mu_1 \rightarrow \ell \alpha_1 \, .$$ Thus, the invariant tensor takes the form $$\label{invtosp}
\begin{split}
& \langle \tilde{J}_{AB} \tilde{J}_{CD} \rangle = \alpha_0 \left( \eta_{AD} \eta_{BC} - \eta_{AC} \eta_{BD} \right) \, , \quad
\langle \tilde{J}_{AB} \tilde{P}_{C} \rangle = \alpha_1 \epsilon_{ABC} \, , \quad
\langle \tilde{P}_{A} \tilde{P}_{B} \rangle = \frac{\alpha_0}{\ell^2} \eta_{AB} \, , \\
& \langle \tilde{Q}_\alpha \tilde{Q}_\beta \rangle = 2 \left(\alpha_1 -\frac{\alpha_0}{\ell} \right) C_{\alpha \beta} \, .
\end{split}$$
Then, using the connection $1$-form and the invariant tensor in the general expression , we obtain the $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$ CS supergravity action, which reads $$\label{CSosp}
\begin{split}
I^{\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)}_{CS} & = \frac{k}{4 \pi} \int_\mathcal{M} \Bigg \lbrace \frac{\alpha_0}{2} \left( \tilde{\omega}^A_{\phantom{A} B} d \tilde{\omega}^B_{\phantom{B} A} + \frac{2}{3} \tilde{\omega}^A_{\phantom{A} C} \tilde{\omega}^C_{\phantom{C}B} \tilde{\omega}^B_{\phantom{B}A} + \frac{2}{\ell^2} \tilde{V}^A \tilde{T}_A - \frac{4}{\ell} \bar{\tilde{\psi}} \tilde{\Psi} \right) \\
& + \alpha_1 \left( \epsilon_{ABC} \tilde{R}^{AB} \tilde{V}^C + \frac{1}{3 \ell^2} \epsilon_{ABC} \tilde{V}^A \tilde{V}^B \tilde{V}^C + 2 \bar{\tilde{\psi}} \tilde{\Psi} \right) - d \left( \frac{\alpha_1}{2} \epsilon_{ABC} \tilde{\omega}^{AB} \tilde{V}^C \right) \Bigg \rbrace \, ,
\end{split}$$ where the term proportional to $\alpha_0$ is the exotic Lagrangian containing the so-called the Lorentz Lagrangian, a torsional part, and a contribution from the gravitino $1$-form field $\tilde{\psi}$ and its super field-strength. This action describes the most general $\mathcal{N} = 1$, $D = 3$ CS supergravity action (with cosmological constant) for the AdS supergroup [@Giacomini:2006dr].
Notice that in the limit $\ell \rightarrow \infty$ the components in yield the non-vanishing components of the invariant tensor for the Poincaré superalgebra (the latter arising when the limit $\ell \rightarrow \infty$ is taken in ), and the CS action reduces to $$\label{pcs}
\begin{split}
I^{\text{super-Poincar\'{e}}}_{CS} & = \frac{k}{4 \pi} \int_\mathcal{M} \Bigg \lbrace \frac{\alpha_0}{2} \left( \tilde{\omega}^A_{\phantom{A} B} d \tilde{\omega}^B_{\phantom{B} A} + \frac{2}{3} \tilde{\omega}^A_{\phantom{A} C} \tilde{\omega}^C_{\phantom{C}B} \tilde{\omega}^B_{\phantom{B}A} \right) + \alpha_1 \left( \epsilon_{ABC} \tilde{R}^{AB} \tilde{V}^C + 2 \bar{\tilde{\psi}} \tilde{D}\tilde{\psi} \right) \\
& - d \left( \frac{\alpha_1}{2} \epsilon_{ABC} \tilde{\omega}^{AB} \tilde{V}^C \right) \Bigg \rbrace \, ,
\end{split}$$ which is the three-dimensions Poincaré CS supergravity action. Notice that the gravitino does not contribute anymore to the exotic form, which reduces to the Lorentz Lagrangian, while the term proportional to $\alpha_1$ contains the Einstein-Hilbert and Rarita-Schwinger contributions plus a boundary term. Then, omitting the boundary term, we can see that the CS action reproduces the pure three-dimensional supergravity action when the exotic CS term is neglected ($\alpha_0 =0$).
Now, we can pave the way for the development of a three-dimensional CS supergravity theory invariant under the AdS Carroll superalgebra (in $D=3$) introduced in [@Bergshoeff:2015wma]. To this aim, on the same lines of [@Bergshoeff:2015wma], let us decompose the indices as $$\label{indexdec}
A \rightarrow (0,a) \, , \quad a=1,2 \, .$$ This induces the following decomposition of the generators and of the dual $1$-form fields: $$\begin{split}
& \tilde{J}_{AB} \rightarrow \lbrace \tilde{J}_{ab}, \tilde{J}_{a0} \equiv \tilde{K}_a \rbrace \, , \quad
\tilde{P}_A \rightarrow \lbrace \tilde{P}_a , \tilde{P}_0 \equiv \tilde{H} \rbrace \, ; \\
& \tilde{\omega}^{AB} \rightarrow \lbrace \tilde{\omega}^{ab}, \tilde{\omega}^{a0} \equiv \tilde{k}^a \rbrace \, , \quad
\tilde{V}^A \rightarrow \lbrace \tilde{V}^a , \tilde{V}^0 \equiv \tilde{h} \rbrace \, .
\end{split}$$ We also have $$\Gamma_{AB} \rightarrow \lbrace \Gamma_{ab} , \Gamma_{a0} \rbrace \, , \quad \Gamma_A \rightarrow \lbrace \Gamma_a , \Gamma_0 \rbrace \, .$$ Thus, the (anti)commutation relation in yield the following non-trivial ones: $$\label{ospdecomp}
\begin{split}
& \left[ \tilde{K}_a , \tilde{K}_b \right] = \tilde{J}_{ab} \, , \quad \quad
\left[ \tilde{K}_a , \tilde{J}_{bc} \right] = \delta_{ab} \tilde{K}_c - \delta_{ac}\tilde{K}_b \, , \quad \quad
\left[ \tilde{J}_{ab},\tilde{P}_{c}\right] = \delta_{bc}\tilde{P}_{a}-\delta _{ac}\tilde{P}_{b} \, , \\
& \left[ \tilde{K}_{a},\tilde{P}_{b}\right] = - \delta_{ab} \tilde{H} \, , \quad \quad
\left[ \tilde{K}_{a}, \tilde{H} \right] = - \tilde{P}_a \, , \quad \quad
\left[ \tilde{P}_a , \tilde{P}_b \right] = \frac{1}{\ell^2} \tilde{J}_{ab} \, , \quad \quad
\left[ \tilde{P}_a , \tilde{H} \right] = \frac{1}{\ell^2} \tilde{K}_{a} \, , \\
& \left[ \tilde{J}_{ab},\tilde{Q}_{\alpha }\right] = -\frac{1}{2}\left( \Gamma _{ab}\tilde{Q}\right)_{\alpha } \, , \quad \quad
\left[ \tilde{K}_{a},\tilde{Q}_{\alpha }\right] = -\frac{1}{2}\left( \Gamma _{a0}\tilde{Q}\right)_{\alpha } \, , \\
& \left[ \tilde{P}_{a}, \tilde{Q}_{\alpha }\right] = -\frac{1}{2 \ell} \left( \Gamma _{a}\tilde{Q}\right) _{\alpha } \, , \quad \quad
\left[ \tilde{H}, \tilde{Q}_{\alpha }\right] = -\frac{1}{2 \ell} \left( \Gamma _{0}\tilde{Q}\right) _{\alpha } \, , \\
& \left\{ \tilde{Q}_{\alpha }, \tilde{Q}_{\beta }\right\} = - \frac{1}{2 \ell} \left(\Gamma^{ab} C \right)_{\alpha \beta} \tilde{J}_{ab} - \frac{1}{\ell} \left(\Gamma^{a0} C \right)_{\alpha \beta} \tilde{K}_{a} + \left( \Gamma ^{a}C\right) _{\alpha \beta }\tilde{P}_{a} + \left( \Gamma ^{0}C\right) _{\alpha \beta }\tilde{H} \, .
\end{split}$$
Moreover, the connection $1$-form and the curvature $2$-form can be respectively rewritten as $$\label{conndec}
\tilde{A} = \frac{1}{2} \tilde{\omega}^{ab} \tilde{J}_{ab} + \tilde{k}^a \tilde{K}_a + \tilde{V}^a \tilde{P}_a + \tilde{h} \tilde{H} + \tilde{\psi}^\alpha \tilde{Q}_\alpha \, , \quad
\tilde{F} = \frac{1}{2} \tilde{\mathcal{R}}^{ab} \tilde{J}_{ab} + \tilde{\mathcal{K}}^a \tilde{K}_a + \tilde{R}^a \tilde{P}_a + \tilde{\mathcal{H}} \tilde{H} + \tilde{\Psi}^\alpha \tilde{Q}_\alpha \, ,$$ with $$\label{curvdec}
\begin{split}
\tilde{\mathcal{R}}^{ab} & = d \tilde{\omega}^{ab} - \tilde{k}^a \tilde{k}^b + \frac{1}{\ell^2} \tilde{V}^a \tilde{V}^b + \frac{1}{2\ell} \bar{\tilde{\psi}} \Gamma^{ab} \tilde{\psi} = \tilde{R}^{ab} + \frac{1}{\ell^2} \tilde{V}^a \tilde{V}^b + \frac{1}{2\ell} \bar{\tilde{\psi}} \Gamma^{ab} \tilde{\psi} \, , \\
\tilde{\mathcal{K}}^a & = d \tilde{k}^a + \tilde{\omega}^a_{\phantom{a} b} \tilde{k}^b + \frac{1}{\ell^2} \tilde{V}^a \tilde{h} + \frac{1}{2 \ell} \bar{\tilde{\psi}} \Gamma^{a0} \tilde{\psi} = \tilde{\mathfrak{K}}^a + \frac{1}{\ell^2} \tilde{V}^a \tilde{h} + \frac{1}{2 \ell} \bar{\tilde{\psi}} \Gamma^{a0} \tilde{\psi} \, , \\
\tilde{R}^a & = d \tilde{V}^a + \tilde{\omega}^a_{\phantom{a}b} \tilde{V}^b + \tilde{k}^a \tilde{h} - \frac{1}{2} \bar{\psi} \Gamma^a \tilde{\psi} = \tilde{T}^a - \frac{1}{2} \bar{\psi} \Gamma^a \tilde{\psi} \, , \\
\tilde{\mathcal{H}} & = d \tilde{h} + \tilde{V}^a \tilde{k}_a - \frac{1}{2} \bar{\tilde{\psi}} \Gamma^0 \tilde{\psi} = \tilde{\mathfrak{H}} - \frac{1}{2} \bar{\tilde{\psi}} \Gamma^0 \tilde{\psi} \, , \\
\tilde{\Psi} & = d \tilde{\psi} + \frac{1}{4} \tilde{\omega}^{ab} \Gamma_{ab} \tilde{\psi} + \frac{1}{2} \tilde{k}^{a} \Gamma_{a0} \tilde{\psi} + \frac{1}{2 \ell} \tilde{V}^a \Gamma_a \tilde{\psi} + \frac{1}{2 \ell} \tilde{h} \Gamma_0 \tilde{\psi} \, .
\end{split}$$
Last but not least, now the non-vanishing components of the invariant tensor takes the following form: $$\label{invtospdec}
\begin{split}
& \langle \tilde{J}_{ab} \tilde{J}_{cd} \rangle = \alpha_0 \left( \delta_{ad} \delta_{bc} - \delta_{ac} \delta_{bd} \right) \, , \quad
\langle \tilde{K}_a \tilde{K}_b \rangle = - \alpha_0 \delta_{ab} \, , \\
& \langle \tilde{J}_{ab} \tilde{H} \rangle = \alpha_1 \epsilon_{ab} \, , \quad
\langle \tilde{K}_a \tilde{P}_b \rangle = - \alpha_1 \epsilon_{ab} \, , \quad
\langle \tilde{P}_{a} \tilde{P}_{b} \rangle = \frac{\alpha_0}{\ell^2} \delta_{ab} \, , \quad
\langle \tilde{H} \tilde{H} \rangle = - \frac{\alpha_0}{\ell^2} \, , \\
& \langle \tilde{Q}_\alpha \tilde{Q}_\beta \rangle = 2 \left(\alpha_1 -\frac{\alpha_0}{\ell} \right) C_{\alpha \beta} \, ,
\end{split}$$ where $\epsilon_{ab} \equiv \epsilon_{0 ab} = \epsilon_{ab 0}$. As we will see in a while, these components will be fundamental in the construction of the AdS Carroll CS supergravity theory.
AdS Carroll Chern-Simons supergravity in 2+1 dimensions {#S2}
=======================================================
We can now move to the construction of the three-dimensional CS supergravity theory invariant under the so-called AdS Carroll superalgebra (in $D=3$) introduced in [@Bergshoeff:2015wma].
In [@Bergshoeff:2015wma] the $\mathcal{N}=1$ AdS Carroll superalgebra was obtained as a contraction of the $\mathcal{N}=1$ AdS superalgebra. In particular, as shown in [@Bergshoeff:2015wma], the AdS Carroll superalgebra is obtained by performing the indices decomposition in the AdS superalgebra, which in $D=3$ yields , and subsequently, to make the Carroll contraction, by rescaling the generators with a parameter, let us call it $\sigma$, as follows: $$\label{resc}
\tilde{H} \rightarrow \sigma H \, , \quad \tilde{K}_a \rightarrow \sigma K_a \, , \quad \tilde{Q}_\alpha \rightarrow \sqrt{\sigma} Q_\alpha \, .$$ Then, taking the limit $\sigma \rightarrow \infty$,[^6] in $D=3$ we get the following $\mathcal{N}=1$ AdS Carroll superalgebra generated by the set of generators $\lbrace J_{ab}, K_a, P_a, H, Q_\alpha \rbrace$ (spatial rotations, Carrollian boosts, space translations, time translations, and a two-components Majorana spinor charge, respectively)[^7] fulfilling the following non-trivial (anti)commutation relations: $$\label{adscarrollsuper}
\begin{split}
& \left[ K_a , J_{bc} \right] = \delta_{ab} K_c - \delta_{ac} K_b \, , \quad \quad
\left[ J_{ab}, P_{c}\right] =\delta_{bc}P_{a}-\delta _{ac}P_{b} \, , \quad \quad
\left[ K_{a}, P_{b}\right] = - \delta_{ab} H \, , \\
& \left[ P_a , P_b \right] = \frac{1}{\ell^2} J_{ab} \, , \quad \quad
\left[ P_a , H \right] = \frac{1}{\ell^2} K_{a} \, , \\
& \left[ J_{ab},Q_{\alpha }\right] =-\frac{1}{2}\left( \Gamma _{ab} Q \right)_{\alpha } \, , \quad \quad
\left[ P_{a}, Q_{\alpha }\right] =-\frac{1}{2 \ell} \left( \Gamma _{a}Q\right) _{\alpha } \, , \\
& \left\{ Q_{\alpha }, Q_{\beta }\right\} = - \frac{1}{\ell} \left(\Gamma^{a0} C \right)_{\alpha \beta} K_{a} + \left( \Gamma ^{0}C\right) _{\alpha \beta }H \, .
\end{split}$$ The corresponding connection $1$-form and curvature $2$-form respectively read $$\label{connadscarrollsuper}
A = \frac{1}{2} \omega^{ab} J_{ab} + k^a K_a + V^a P_a + h H + \psi^\alpha Q_\alpha \, , \quad
F = \frac{1}{2} \mathcal{R}^{ab} J_{ab} + \mathcal{K}^a K_a + R^a P_a + \mathcal{H} H + \Psi^\alpha Q_\alpha \, ,$$ with $$\label{curvadscarrollsuper}
\begin{split}
\mathcal{R}^{ab} & = d \omega^{ab} + \frac{1}{\ell^2} V^a V^b = R^{ab} + \frac{1}{\ell^2} V^a V^b \, , \\
\mathcal{K}^a & = d k^a + \omega^a_{\phantom{a} b} k^b + \frac{1}{\ell^2} V^a h + \frac{1}{2 \ell} \bar{\psi} \Gamma^{a0} \psi = \mathfrak{K}^a + \frac{1}{\ell^2} V^a h + \frac{1}{2 \ell} \bar{\psi} \Gamma^{a0} \psi \, , \\
R^a & = d V^a + \omega^a_{\phantom{a}b} V^b \, , \\
\mathcal{H} & = d h + V^a k_a - \frac{1}{2} \bar{\psi} \Gamma^0 \psi = \mathfrak{H} - \frac{1}{2} \bar{\psi} \Gamma^0 \psi \, , \\
\Psi & = d \psi + \frac{1}{4} \omega^{ab} \Gamma_{ab} \psi + \frac{1}{2 \ell} V^a \Gamma_a \psi \, .
\end{split}$$ Let us also mention that, considering the Bianchi identity $\nabla F =0$ ($\nabla = d + [A, \cdot]$), we obtain $$\label{bianchdscarrollsuper}
\begin{split}
d \mathcal{R}^{ab} & = \frac{2}{\ell^2} R^a V^b \, , \\
D \mathcal{K}^a & = \mathcal{R}^a_{\phantom{a} b} k^b + \frac{1}{\ell^2} R^a h - \frac{1}{\ell^2} V^a \mathcal{H} - \frac{1}{\ell} \bar{\psi} \Gamma^{a0} \Psi \, , \\
D R^a & = \mathcal{R}^a_{\phantom{a} b} V^b \, , \\
d \mathcal{H} & = R^a k_a - V^a \mathcal{K}_a + \bar{\psi} \Gamma^0 \Psi \, , \\
D \Psi & = \frac{1}{4} \mathcal{R}^{ab} \Gamma_{ab} \psi + \frac{1}{2 \ell} R^a \Gamma_a \psi - \frac{1}{2 \ell} V^a \Gamma_a \Psi \, ,
\end{split}$$ where $D=d+\omega$.
Now, in order to construct a CS action (that is an action of the form ) invariant under the super-AdS Carroll group, we require the connection $1$-form given in and the corresponding non-vanishing components of the invariant tensor.
Concerning the invariant tensor, which is the fundamental ingredient for the construction of a CS action, we now apply the method of [@Concha:2016zdb], which consists in rescaling not only the generators but also the coefficients appearing in the invariant tensor before applying a contraction, in order to end up with a non-trivial invariant tensor for the contracted (super)algebra on which the desired CS theory will be based. Precisely, we consider the non-vanishing components of the invariant tensor for $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$ given in and rescale not only the generators in compliance with but also the coefficients appearing in as follows: $$\alpha_0 \rightarrow \alpha_0 \, , \quad \alpha_1 \rightarrow \sigma \alpha_1 \, .$$ In this way, taking the limit $\sigma \rightarrow \infty$, we end up with the following non-vanishing components of the invariant tensor for the AdS Carroll superalgebra: $$\label{invadscarrollsuper}
\begin{split}
& \langle J_{ab} J_{cd} \rangle = \alpha_0 \left( \delta_{ad} \delta_{bc} - \delta_{ac} \delta_{bd} \right) \, , \quad
\langle J_{ab} H \rangle = \alpha_1 \epsilon_{ab} \, , \quad
\langle K_a P_b \rangle = - \alpha_1 \epsilon_{ab} \, , \quad
\langle P_{a} P_{b} \rangle = \frac{\alpha_0}{\ell^2} \delta_{ab} \, , \\
& \langle Q_\alpha Q_\beta \rangle = 2 \alpha_1 C_{\alpha \beta} \, .
\end{split}$$
Thus, using the connection $1$-form in and the non-vanishing components of the invariant tensor given in in the general expression , we can finally write the three-dimensional AdS Carroll CS supergravity action, which reads $$\label{CSAC}
\begin{split}
& I^{\text{super-AdS Carroll}}_{CS} = \frac{k}{4 \pi} \int_\mathcal{M} \Bigg \lbrace \frac{\alpha_0}{2} \left( \omega^a_{\phantom{a} b} R^b_{\phantom{b} a} + \frac{2}{\ell^2} V^a R_a \right) \\
& + \alpha_1 \left( \epsilon_{ab} R^{ab} h - 2 \epsilon_{ab} \mathfrak{K}^a V^b + \frac{1}{\ell^2} \epsilon_{ab} V^a V^b h+ 2 \bar{\psi} \Psi \right) - d \left( \frac{\alpha_1}{2} \epsilon_{ab} \omega^{ab} h - \alpha_1 \epsilon_{ab} k^a V^b \right) \Bigg \rbrace \, ,
\end{split}$$ written in terms of the curvatures appearing in . Notice that the term proportional to $\alpha_0$ correspond to the exotic Lagrangian involving the Lorentz contribution and a torsional piece, while it does not contain any contribution from the gravitino $1$-form field $\psi$.
The CS action is characterized by two coupling constants and it is invariant by construction under the super-AdS Carroll group. In particular, the local gauge transformations $\delta_\varrho A = d \varrho + \left[A, \varrho \right]$ with gauge parameter $$\label{gpar}
\varrho = \frac{1}{2} \varrho^{ab} J_{ab} + \kappa^a K_a + \varrho^a P_a + \tau H + \varepsilon^\alpha Q_\alpha$$ are given by $$\label{gaugetr}
\begin{split}
\delta \omega^{ab} & = d \varrho^{ab} + \frac{2}{\ell^2} V^a \varrho^b \, , \\
\delta k^a & = D \kappa^a - \varrho^a_{\phantom{a} b} k^b - \frac{1}{\ell^2} \varrho^a h + \frac{1}{\ell^2} V^a \tau - \frac{1}{\ell} \bar{\varepsilon} \Gamma^{a0} \psi \, , \\
\delta V^a & = D \varrho^a - \varrho^a_{\phantom{a} b} V^b \, , \\
\delta h & = d \tau - \varrho^a k_a + V^a \kappa_a + \bar{\varepsilon} \Gamma^0 \psi \, , \\
\delta \psi & = d \varepsilon + \frac{1}{4} \omega^{ab} \Gamma_{ab} \varepsilon - \frac{1}{4} \varrho^{ab} \Gamma_{ab} \psi - \frac{1}{2 \ell} \varrho^a \Gamma_a \psi + \frac{1}{2 \ell} V^a \Gamma_a \varepsilon \\
& = D \varepsilon - \frac{1}{4} \varrho^{ab} \Gamma_{ab} \psi - \frac{1}{2 \ell} \varrho^a \Gamma_a \psi + \frac{1}{2 \ell} V^a \Gamma_a \varepsilon \, ,
\end{split}$$ and, restricting ourselves to supersymmetry, we have $$\label{susytr}
\begin{split}
& \delta \omega^{ab} = 0 \, , \quad
\delta k^a = - \frac{1}{\ell} \bar{\varepsilon} \Gamma^{a0} \psi \, , \quad
\delta V^a = 0 \, , \quad
\delta h = \bar{\varepsilon} \Gamma^0 \psi \, , \\
& \delta \psi = d \varepsilon + \frac{1}{4} \omega^{ab} \Gamma_{ab} \varepsilon + \frac{1}{2 \ell} V^a \Gamma_a \varepsilon = D \varepsilon + \frac{1}{2 \ell} V^a \Gamma_a \varepsilon \, .
\end{split}$$ Let us also mention, for the sake of completeness, that from the gauge variation of the curvature $2$-form $F$ in , $\delta_\varrho F = \left[ F, \varrho \right] $, we can write the gauge transformations $$\label{curvtr}
\begin{split}
\delta \mathcal{R}^{ab} & = \frac{2}{\ell^2} R^a \varrho^b \, , \\
\delta \mathcal{K}^a & = \mathcal{R}^a_{\phantom{a} b} \kappa^b - \varrho^a_{\phantom{a} b} \mathcal{K}^b - \frac{1}{\ell^2} \varrho^a \mathcal{H} + \frac{1}{\ell^2} R^a \tau - \frac{1}{\ell} \bar{\varepsilon} \Gamma^{a0} \Psi \, , \\
\delta R^a & = \mathcal{R}^a_{\phantom{a} b} \varrho^b - \varrho^a_{\phantom{a} b} R^b \, , \\
\delta \mathcal{H} & = - \varrho^a \mathcal{K}_a + R^a \kappa_a + \bar{\varepsilon} \Gamma^0 \Psi \, , \\
\delta \Psi & = \frac{1}{4} \mathcal{R}^{ab} \Gamma_{ab} \varepsilon - \frac{1}{4} \varrho^{ab} \Gamma_{ab} \Psi - \frac{1}{2 \ell} \varrho^a \Gamma_a \Psi + \frac{1}{2 \ell} R^a \Gamma_a \varepsilon \, .
\end{split}$$
The equations of motion derived from the variation of the action with respect to the fields $\omega^{ab}$, $k^a$, $V^a$, $h$, and $\psi$ are $$\label{eom}
\begin{split}
& \delta \omega^{ab} \; : \quad \alpha_0 \mathcal{R}^{ab} + \alpha_1 \epsilon^{ab} \mathcal{H}= 0 \, , \quad \quad \quad
\delta k^a \; : \quad \alpha_1 R^a = 0 \, , \\
& \delta V^a \; : \quad \frac{\alpha_0}{\ell^2} R^a + 2 \alpha_1 \epsilon_{ab} \mathcal{K}^b = 0 \, , \quad \quad \quad
\delta h \; : \quad \alpha_1 \mathcal{R}^{ab} = 0 \, , \\
& \delta \psi \; : \quad \quad \alpha_1 \Psi = 0 \, ,
\end{split}$$ respectively.[^8] In particular, when $\alpha_1 \neq 0$, the equations of motion in reduce to the vanishing of the super-AdS Carroll curvature $2$-forms, namely $$\label{eomvac}
\mathcal{R}^{ab} = 0 \, , \quad \mathcal{K}^a = 0 \, , \quad R^a = 0 \, , \quad \mathcal{H}=0 \, , \quad \Psi =0 \, .$$ Let us observe that $\alpha_1 \neq 0$ is a sufficient condition to recover , meaning that one could consistently set $\alpha_0=0$, which corresponds to the vanishing of the exotic term in the CS action .
Notice also that if we restrict ourselves to the purely bosonic part of the action (that is if we neglect supersymmetry), we get $$\label{CSACbos}
\begin{split}
I^{\text{AdS Carroll}}_{CS} & = \frac{k}{4 \pi} \int_\mathcal{M} \Bigg \lbrace \frac{\alpha_0}{2} \left( \omega^a_{\phantom{a} b} R^b_{\phantom{b} a} + \frac{2}{\ell^2} V^a R_a \right) + \alpha_1 \left( \epsilon_{ab} R^{ab} h - 2 \epsilon_{ab} \mathfrak{K}^a V^b + \frac{1}{\ell^2} \epsilon_{ab} V^a V^b h \right) \\
& - d \left( \frac{\alpha_1}{2} \epsilon_{ab} \omega^{ab} h - \alpha_1 \epsilon_{ab} k^a V^b \right) \Bigg \rbrace \, ,
\end{split}$$ which is the three-dimensional CS gravity action invariant under the $D=3$ AdS Carroll algebra [@Matulich:2019cdo] (see also [@Bergshoeff:2015wma]) $$\label{adscarroll}
\begin{split}
& \left[ K_a , J_{bc} \right] = \delta_{ab} K_c - \delta_{ac} K_b \, , \quad \quad
\left[ J_{ab}, P_{c}\right] =\delta_{bc}P_{a}-\delta _{ac}P_{b} \, , \quad \quad
\left[ K_{a}, P_{b}\right] = - \delta_{ab} H \, , \\
& \left[ P_a , P_b \right] = \frac{1}{\ell^2} J_{ab} \, , \quad \quad
\left[ P_a , H \right] = \frac{1}{\ell^2} K_{a} \, ,
\end{split}$$ bosonic subalgebra of the AdS-Carroll superalgebra .
Study of the flat limit {#S3}
=======================
In the sequel, we finally study the flat limit ($\ell \rightarrow \infty$), which can be directly applied to the AdS Carroll superalgebra , to the curvature $2$-forms , to the CS action , to the transformation laws , , and , and to the field equations .
In the limit $\ell \rightarrow \infty$, the (anti)commutation relations of the superalgebra reduce to the following non-trivial ones: $$\label{adscarrollsuperF}
\begin{split}
& \left[ K_a , J_{bc} \right] = \delta_{ab} K_c - \delta_{ac} K_b \, , \quad \quad
\left[ J_{ab}, P_{c}\right] =\delta_{bc}P_{a}-\delta _{ac}P_{b} \, , \\
& \left[ K_{a}, P_{b}\right] = - \delta_{ab} H \, , \quad \quad
\left[ P_a , H \right] = \frac{1}{\ell^2} K_{a} \, , \\
& \left[ J_{ab},Q_{\alpha }\right] =-\frac{1}{2}\left( \Gamma _{ab} Q \right)_{\alpha } \, , \quad \quad
\left\{ Q_{\alpha }, Q_{\beta }\right\} = \left( \Gamma ^{0}C\right) _{\alpha \beta }H \, .
\end{split}$$ These are the (anti)commutation relations of the $\mathcal{N}=1$, $D=3$ super-Carroll algebra, which can also be obtained as a contraction of the $D=3$ super-Poincaré algebra (see [@Bergshoeff:2015wma] and references therein).
As $\ell \rightarrow \infty$, the $2$-form curvatures and the corresponding Bianchi identities become $$\label{curvadscarrollsuperF}
\begin{aligned}[c]
& \mathcal{R}^{ab} = d \omega^{ab} \, , \\
& \mathcal{K}^a = d k^a + \omega^a_{\phantom{a} b} k^b \, , \\
& R^a = d V^a + \omega^a_{\phantom{a}b} V^b \, , \\
& \mathcal{H} = d h + V^a k_a - \tfrac{1}{2} \bar{\psi} \Gamma^0 \psi = \mathfrak{H} - \tfrac{1}{2} \bar{\psi} \Gamma^0 \psi \, , \\
& \Psi = d \psi + \tfrac{1}{4} \omega^{ab} \Gamma_{ab} \psi \, ,
\end{aligned}
\quad \quad
\begin{aligned}[c]
& d \mathcal{R}^{ab} = 0 \, , \\
& D \mathcal{K}^a = \mathcal{R}^a_{\phantom{a} b} k^b \, , \\
& D R^a = \mathcal{R}^a_{\phantom{a} b} V^b \, , \\
& d \mathcal{H} = R^a k_a - V^a \mathcal{K}_a + \bar{\psi} \Gamma^0 \Psi \, , \\
& D \Psi = \tfrac{1}{4} \mathcal{R}^{ab} \Gamma_{ab} \psi \, .
\end{aligned}$$ We can also take the $\ell \rightarrow \infty$ limit of the invariant tensor , which yields $$\label{invadscarrollsuperF}
\begin{split}
& \langle J_{ab} J_{cd} \rangle = \alpha_0 \left( \delta_{ad} \delta_{bc} - \delta_{ac} \delta_{bd} \right) \, , \quad
\langle J_{ab} H \rangle = \alpha_1 \epsilon_{ab} \, , \quad
\langle K_a P_b \rangle = - \alpha_1 \epsilon_{ab} \, , \quad
\langle P_a P_b \rangle = 0 \, , \\
& \langle Q_\alpha Q_\beta \rangle = 2 \alpha_1 C_{\alpha \beta} \, .
\end{split}$$ Then, applying the $\ell \rightarrow \infty$ limit to the CS action we get $$\label{CSC}
\begin{split}
I^{\text{super-Carroll}}_{CS} & = \frac{k}{4 \pi} \int_\mathcal{M} \Bigg \lbrace \frac{\alpha_0}{2} \left( \omega^a_{\phantom{a} b} \mathcal{R}^b_{\phantom{b} a} \right) + \alpha_1 \left( \epsilon_{ab} \mathcal{R}^{ab} h - 2 \epsilon_{ab} \mathcal{K}^a V^b + 2 \bar{\psi} \Psi \right) \\
& - d \left( \frac{\alpha_1}{2} \epsilon_{ab} \omega^{ab} h - \alpha_1 \epsilon_{ab} k^a V^b \right) \Bigg \rbrace \, ,
\end{split}$$ which is now written in terms of the super-Carroll curvatures appearing in (they should not be confused with the super-AdS Carroll ones). Observe that the same action can be derived by using the non-vanishing components in and the connection $1$-form for the Carroll superalgebra in the general expression . Furthermore, we can see that the exotic term, proportional to $\alpha_0$, now reduces purely to the so-called Lorentz Lagrangian, without any contribution from the torsion or the $1$-form field $\psi$.
The CS action is invariant by construction under the super-Carroll group. Thus, by taking the flat limit of the CS supergravity action , which is invariant under the super-AdS Carroll group, we have obtained the three-dimensional CS supergravity theory invariant under the super-Carroll algebra.
In particular, concerning the flat limit of the gauge transformations , we have $$\label{gaugetrF}
\begin{split}
\delta \omega^{ab} & = d \varrho^{ab} \, , \\
\delta k^a & = D \kappa^a - \varrho^a_{\phantom{a} b} k^b \, , \\
\delta V^a & = D \varrho^a - \varrho^a_{\phantom{a} b} V^b \, , \\
\delta h & = d \tau - \varrho^a k_a + V^a \kappa_a + \bar{\varepsilon} \Gamma^0 \psi \, , \\
\delta \psi & = d \varepsilon + \frac{1}{4} \omega^{ab} \Gamma_{ab} \varepsilon - \frac{1}{4} \varrho^{ab} \Gamma_{ab} \psi = D \varepsilon - \frac{1}{4} \varrho^{ab} \Gamma_{ab} \psi \, ,
\end{split}$$ which are the super-Carroll local gauge transformations $\delta_\varrho A = d \varrho + \left[A, \varrho \right]$, where, with a little abuse of notation with respect to Section \[S2\], we have now denoted by $A$ the super-Carroll $1$-form connection and where the gauge parameter is given by ($J_{ab}$, $K_a$, $P_a$, $H$, and $Q_\alpha$ are now the generators of the Carroll superalgebra ). The restriction to supersymmetry transformations reads $$\label{susytrF}
\delta \omega^{ab} = 0 \, , \quad
\delta k^a = 0 \, , \quad
\delta V^a = 0 \, , \quad
\delta h = \bar{\varepsilon} \Gamma^0 \psi \, , \quad
\delta \psi = d \varepsilon + \frac{1}{4} \omega^{ab} \Gamma_{ab} \varepsilon = D \varepsilon \, .$$ Furthermore, the gauge transformations in the limit $\ell \rightarrow \infty$ become $$\label{curvtrF}
\begin{split}
\delta \mathcal{R}^{ab} & = 0 \, , \\
\delta \mathcal{K}^a & = \mathcal{R}^a_{\phantom{a} b} \kappa^b - \varrho^a_{\phantom{a} b} \mathcal{K}^b \, , \\
\delta R^a & = \mathcal{R}^a_{\phantom{a} b} \varrho^b - \varrho^a_{\phantom{a} b} R^b \, , \\
\delta \mathcal{H} & = - \varrho^a \mathcal{K}_a + R^a \kappa_a + \bar{\varepsilon} \Gamma^0 \Psi \, , \\
\delta \Psi & = \frac{1}{4} \mathcal{R}^{ab} \Gamma_{ab} \varepsilon - \frac{1}{4} \varrho^{ab} \Gamma_{ab} \Psi \, ,
\end{split}$$ which are now the transformations for the super-Carroll curvature $2$-forms in .
Finally, the equations of motion derived from the action (flat limit of the equations ) are $$\label{eomF}
\begin{split}
& \delta \omega^{ab} \; : \quad \alpha_0 \mathcal{R}^{ab} + \alpha_1 \epsilon^{ab} \mathcal{H}= 0 \, , \quad \quad \quad
\delta k^a \; : \quad \alpha_1 R^a = 0 \, , \\
& \delta V^a \; : \quad 2 \alpha_1 \epsilon_{ab} \mathcal{K}^b = 0 \, , \quad \quad \quad \quad \quad \quad
\delta h \; : \quad \alpha_1 \mathcal{R}^{ab} = 0 \, , \\
& \delta \psi \; : \quad \alpha_1 \Psi = 0 \, .
\end{split}$$ When $\alpha_1 \neq 0$, the equations of motion in reduce to the vanishing of the super-Carroll curvature $2$-forms given in . Let us observe that, analogously to what happened in Section \[S3\] in the case of the super-AdS Carroll CS supergravity theory, $\alpha_1 \neq 0$ is a sufficient condition to recover the vanishing of the super-Carroll curvature $2$-forms, meaning that one could consistently set $\alpha_0=0$, which corresponds to the vanishing of the exotic term (Lorentz Lagrangian) in the CS action .
We conclude noting that the restriction to the purely bosonic part of the action yields $$\label{CSCbos}
I^{\text{Carroll}}_{CS} = \frac{k}{4 \pi} \int_\mathcal{M} \Bigg \lbrace \frac{\alpha_0}{2} \left( \omega^a_{\phantom{a} b} \mathcal{R}^b_{\phantom{b} a} \right) + \alpha_1 \left( \epsilon_{ab} \mathcal{R}^{ab} h - 2 \epsilon_{ab} \mathcal{K}^a V^b \right) - d \left( \frac{\alpha_1}{2} \epsilon_{ab} \omega^{ab} h - \alpha_1 \epsilon_{ab} k^a V^b \right) \Bigg \rbrace \, ,$$ which is the three-dimensional CS gravity action invariant under the $D=3$ Carroll algebra [@LL; @Bacry:1968zf] (bosonic subalgebra of the Carroll superalgebra ), whose non-trivial commutation relations read $$\label{carroll}
\left[ K_a , J_{bc} \right] = \delta_{ab} K_c - \delta_{ac} K_b \, , \quad \quad
\left[ J_{ab}, P_{c}\right] =\delta_{bc}P_{a}-\delta _{ac}P_{b} \, , \quad \quad
\left[ K_{a}, P_{b}\right] = - \delta_{ab} H \, .$$ The CS action , as argued in [@Bergshoeff:2017btm], is equivalent to the action found in [@Bergshoeff:2017btm] if we take the $D=3$ case in the same paper.
Final remarks {#finalremarks}
=============
Motivated by the recent development of applications of Carroll symmetries (in particular, by their prominent role in the context of holography), and by the fact that, nevertheless, the study of their supersymmetric extensions in the context of supergravity models was still unexplored, in this paper we have presented, for the first time in the literature, the three-dimensional CS supergravity theory invariant under the $\mathcal{N}=1$ AdS Carroll superalgebra introduced in [@Bergshoeff:2015wma] (our result was also an open problem suggested in Ref. [@Bergshoeff:2015wma] and it represents the $\mathcal{N}=1$ supersymmetric extension of the AdS Carroll CS gravity action of [@Matulich:2019cdo]). We have obtained the three-dimensional AdS Carroll CS supergravity action by applying the method of [@Concha:2016zdb]. The aforesaid action is written in , and it is characterized by two coupling constants. The restriction to the purely bosonic part of the three-dimensional CS supergravity theory invariant under the $\mathcal{N}=1$ super-AdS Carroll algebra yields the three-dimensional CS gravity action invariant under the AdS Carroll algebra [@Matulich:2019cdo], bosonic subalgebra of the AdS Carroll superalgebra.
Subsequently, we have applied the flat limit ($\ell \rightarrow \infty$) at the level of the superalgebra, CS action, supersymmetry transformation laws, and field equations. The limit $\ell \rightarrow \infty$ of the $\mathcal{N}=1$ AdS Carroll superalgebra yields the $\mathcal{N}=1$ super-Carroll algebra and, in particular, taking the flat limit of the AdS Carroll CS supergravity action we have obtained the three-dimensional (flat) CS supergravity theory invariant under the super-Carroll algebra. Restricting ourselves to the purely bosonic part of the super-Carroll CS supergravity action, we have obtained the three-dimensional CS gravity action invariant under the Carroll algebra [@LL; @Bacry:1968zf], bosonic subalgebra of the Carroll superalgebra. This CS action is equivalent to the action found in [@Bergshoeff:2017btm] if we consider the $D=3$ case in the same paper.
This work could shed some light on the development of supersymmetric extensions of [@Bergshoeff:2016soe], and might also represents a starting point to go further in the analysis of supersymmetry invariance of flat supergravity in the presence of a non-trivial boundary, along the lines of [@Concha:2018ywv]. Furthermore, having well defined three-dimensional CS (super)gravity theories respectively invariant under the AdS-Carroll and Carroll (super)algebras, it would be intriguing to go beyond and study the asymptotic symmetry of these theories (following, for example, the prescription of [@Concha:2018zeb]). Another future work could consist in considering the $\mathcal{N}$-extended AdS Carroll superalgebras in order to build $(p,q)$-type CS supergravity models (on the same lines of what was done in [@Concha:2019icz] in the context of Maxwell supersymmetries) by adopting the same prescription followed in the present paper. Some work is in progress on these points.
Acknowledgments
===============
The author wishes to thank Laura Andrianopoli for the inspiring discussions that have aroused her interest in Carroll symmetries. The author also acknowledges enlightening dialogues with Stefan Prohazka.
E. Bergshoeff, J. M. Izquierdo, T. Ortin and L. Romano, “Lie Algebra Expansions and Actions for Non-Relativistic Gravity,” arXiv:1904.08304 \[hep-th\].
E. Bergshoeff, J. Gomis, B. Rollier, J. Rosseel and T. ter Veldhuis, “Carroll versus Galilei Gravity,” JHEP [**1703**]{} (2017) 165 \[arXiv:1701.06156 \[hep-th\]\].
V. Bargmann, “On Unitary ray representations of continuous groups,” Annals Math. **59** (1954) 1-46.
R. De Pietri, L. Lusanna and M. Pauri, “Standard and generalized Newtonian gravities as “gauge” theories of the extended Galilei group. I. The standard theory,” Class. Quant. Grav. [**12**]{} (1995) 219 \[gr-qc/9405046\].
R. Andringa, E. Bergshoeff, S. Panda and M. de Roo, “Newtonian Gravity and the Bargmann Algebra,” Class. Quant. Grav. [**28**]{} (2011) 105011 \[arXiv:1011.1145 \[hep-th\]\].
R. Banerjee, A. Mitra and P. Mukherjee, “Localization of the Galilean symmetry and dynamical realization of Newton-Cartan geometry,” Class. Quant. Grav. [**32**]{} (2015) no.4, 045010 \[arXiv:1407.3617 \[hep-th\]\].
R. Banerjee and P. Mukherjee, “Galilean gauge theory from Poincare gauge theory,” Phys. Rev. D [**98**]{} (2018) no.12, 124021 \[arXiv:1810.03902 \[gr-qc\]\].
D. T. Son and M. Wingate, “General coordinate invariance and conformal invariance in nonrelativistic physics: Unitary Fermi gas,” Annals Phys. [**321**]{} (2006) 197 \[cond-mat/0509786\].
D. T. Son, “Newton-Cartan Geometry and the Quantum Hall Effect,” arXiv:1306.0638 \[cond-mat.mes-hall\].
M. Geracie, D. T. Son, C. Wu and S. F. Wu, “Spacetime Symmetries of the Quantum Hall Effect,” Phys. Rev. D [**91**]{} (2015) 045030 \[arXiv:1407.1252 \[cond-mat.mes-hall\]\].
K. Jensen and A. Karch, “Revisiting non-relativistic limits,” JHEP [**1504**]{} (2015) 155 \[arXiv:1412.2738 \[hep-th\]\].
R. Banerjee, A. Mitra and P. Mukherjee, “General algorithm for nonrelativistic diffeomorphism invariance,” Phys. Rev. D [**91**]{} (2015) no.8, 084021 \[arXiv:1501.05468 \[gr-qc\]\].
J. Gomis and H. Ooguri, “Nonrelativistic closed string theory,” J. Math. Phys. [**42**]{} (2001) 3127 \[hep-th/0009181\].
U. H. Danielsson, A. Guijosa and M. Kruczenski, “IIA/B, wound and wrapped,” JHEP [**0010**]{} (2000) 020 \[hep-th/0009182\].
J. Gomis, K. Kamimura and P. K. Townsend, “Non-relativistic superbranes,” JHEP [**0411**]{} (2004) 051 \[hep-th/0409219\].
J. Gomis, J. Gomis and K. Kamimura, “Non-relativistic superstrings: A New soluble sector of AdS$_5$ $\times$ S$^5$,” JHEP [**0512**]{} (2005) 024 \[hep-th/0507036\].
J.-M. Levy-Leblond, “Une nouvelle limite non-relativiste du groupe de Poincaré,” Annales de l’Institut Henri Poincaré (A) Physique théorique **3** (1965) no. 1, 1-12.\
http://eudml.org/doc/75509
H. Bacry and J. Levy-Leblond, “Possible kinematics,” J. Math. Phys. [**9**]{} (1968) 1605.
G. Gibbons, K. Hashimoto and P. Yi, “Tachyon condensates, Carrollian contraction of Lorentz group, and fundamental strings,” JHEP [**0209**]{} (2002) 061 \[hep-th/0209034\].
D. M. Hofman and B. Rollier, “Warped Conformal Field Theory as Lower Spin Gravity,” Nucl. Phys. B [**897**]{} (2015) 1 \[arXiv:1411.0672 \[hep-th\]\].
A. Bagchi, “Tensionless Strings and Galilean Conformal Algebra,” JHEP [**1305**]{} (2013) 141 \[arXiv:1303.0291 \[hep-th\]\].
A. Bagchi, S. Chakrabortty and P. Parekh, “Tensionless Strings from Worldsheet Symmetries,” JHEP [**1601**]{} (2016) 158 \[arXiv:1507.04361 \[hep-th\]\].
A. Bagchi, S. Chakrabortty and P. Parekh, “Tensionless Superstrings: View from the Worldsheet,” JHEP [**1610**]{} (2016) 113 \[arXiv:1606.09628 \[hep-th\]\].
A. Bagchi, A. Banerjee, S. Chakrabortty and P. Parekh, “Inhomogeneous Tensionless Superstrings,” JHEP [**1802**]{} (2018) 065 \[arXiv:1710.03482 \[hep-th\]\].
A. Bagchi, A. Banerjee, S. Chakrabortty and P. Parekh, “Exotic Origins of Tensionless Superstrings,” arXiv:1811.10877 \[hep-th\].
J. Hartong, “Gauging the Carroll Algebra and Ultra-Relativistic Gravity,” JHEP [**1508**]{} (2015) 069 \[arXiv:1505.05011 \[hep-th\]\].
E. Bergshoeff, D. Grumiller, S. Prohazka and J. Rosseel, “Three-dimensional Spin-3 Theories Based on General Kinematical Algebras,” JHEP [**1701**]{} (2017) 114 \[arXiv:1612.02277 \[hep-th\]\].
E. Bergshoeff, J. Gomis and L. Parra, “The Symmetries of the Carroll Superparticle,” J. Phys. A [**49**]{} (2016) no.18, 185402 \[arXiv:1503.06083 \[hep-th\]\].
J. Matulich, S. Prohazka and J. Salzer, “Limits of three-dimensional gravity and metric kinematical Lie algebras in any dimension,” arXiv:1903.09165 \[hep-th\].
A. Bagchi and R. Gopakumar, “Galilean Conformal Algebras and AdS/CFT,” JHEP [**0907**]{} (2009) 037 \[arXiv:0902.1385 \[hep-th\]\].
M. H. Christensen, J. Hartong, N. A. Obers and B. Rollier, “Torsional Newton-Cartan Geometry and Lifshitz Holography,” Phys. Rev. D [**89**]{} (2014) 061901 \[arXiv:1311.4794 \[hep-th\]\].
M. H. Christensen, J. Hartong, N. A. Obers and B. Rollier, “Boundary Stress-Energy Tensor and Newton-Cartan Geometry in Lifshitz Holography,” JHEP [**1401**]{} (2014) 057 \[arXiv:1311.6471 \[hep-th\]\].
J. Hartong, E. Kiritsis and N. A. Obers, “Lifshitz space-times for Schrödinger holography,” Phys. Lett. B [**746**]{} (2015) 318 \[arXiv:1409.1519 \[hep-th\]\].
E. A. Bergshoeff, J. Hartong and J. Rosseel, “Torsional Newton-Cartan geometry and the Schrödinger algebra,” Class. Quant. Grav. [**32**]{} (2015) no.13, 135017 \[arXiv:1409.5555 \[hep-th\]\].
J. Hartong, E. Kiritsis and N. A. Obers, “Field Theory on Newton-Cartan Backgrounds and Symmetries of the Lifshitz Vacuum,” JHEP [**1508**]{} (2015) 006 \[arXiv:1502.00228 \[hep-th\]\].
A. Bagchi, “Correspondence between Asymptotically Flat Spacetimes and Nonrelativistic Conformal Field Theories,” Phys. Rev. Lett. [**105**]{} (2010) 171601 \[arXiv:1006.3354 \[hep-th\]\].
A. Bagchi and R. Fareghbal, “BMS/GCA Redux: Towards Flatspace Holography from Non-Relativistic Symmetries,” JHEP [**1210**]{} (2012) 092 \[arXiv:1203.5795 \[hep-th\]\].
A. Bagchi, R. Basu, A. Kakkar and A. Mehra, “Flat Holography: Aspects of the dual field theory,” JHEP [**1612**]{} (2016) 147 \[arXiv:1609.06203 \[hep-th\]\].
I. Lodato and W. Merbis, “Super-BMS$_{3}$ algebras from $ \mathcal{N}=2 $ flat supergravities,” JHEP [**1611**]{} (2016) 150 \[arXiv:1610.07506 \[hep-th\]\].
A. Bagchi, A. Mehra and P. Nandi, “Field Theories with Conformal Carrollian Symmetry,” arXiv:1901.10147 \[hep-th\].
C. Duval, G. W. Gibbons and P. A. Horvathy, “Conformal Carroll groups and BMS symmetry,” Class. Quant. Grav. [**31**]{} (2014) 092001 \[arXiv:1402.5894 \[gr-qc\]\].
C. Duval, G. W. Gibbons and P. A. Horvathy, “Conformal Carroll groups,” J. Phys. A [**47**]{} (2014) no.33, 335204 \[arXiv:1403.4213 \[hep-th\]\].
L. Ciambelli, C. Marteau, A. C. Petkou, P. M. Petropoulos and K. Siampos, “Covariant Galilean versus Carrollian hydrodynamics from relativistic fluids,” Class. Quant. Grav. [**35**]{} (2018) no.16, 165001 \[arXiv:1802.05286 \[hep-th\]\].
L. Ciambelli, C. Marteau, A. C. Petkou, P. M. Petropoulos and K. Siampos, “Flat holography and Carrollian fluids,” JHEP [**1807**]{} (2018) 165 \[arXiv:1802.06809 \[hep-th\]\].
L. Ciambelli and C. Marteau, “Carrollian conservation laws and Ricci-flat gravity,” Class. Quant. Grav. [**36**]{} (2019) no.8, 085004 \[arXiv:1810.11037 \[hep-th\]\].
A. Campoleoni, L. Ciambelli, C. Marteau, P. M. Petropoulos and K. Siampos, “Two-dimensional fluids and their holographic duals,” arXiv:1812.04019 \[hep-th\].
H. Bondi, M. G. J. van der Burg and A. W. K. Metzner, “Gravitational waves in general relativity. 7. Waves from axisymmetric isolated systems,” Proc. Roy. Soc. Lond. A [**269**]{} (1962) 21.
R. Sachs, “Asymptotic symmetries in gravitational theory,” Phys. Rev. [**128**]{} (1962) 2851.
G. Barnich and C. Troessaert, “Symmetries of asymptotically flat 4 dimensional spacetimes at null infinity revisited,” Phys. Rev. Lett. [**105**]{} (2010) 111103 \[arXiv:0909.2617 \[gr-qc\]\].
A. Ashtekar, “Geometry and Physics of Null Infinity,” arXiv:1409.1800 \[gr-qc\].
P. K. Concha, O. Fierro and E. K. Rodríguez, “Inönü-Wigner contraction and $D=2+1$ supergravity,” Eur. Phys. J. C [**77**]{} (2017) no.1, 48 \[arXiv:1611.05018 \[hep-th\]\].
E. Inönü, E.P. Wigner, “On the Contraction of Groups and Their Representations,” Proc. Nat. Acad. Sci USA **39** (1953) 510.
E. Weimar-Woods, “Contractions, Generalized Inönü-Wigner contractions and deformations of finite-dimensional Lie algebras,” Rev. Mod. Phys. **12** (2000) 1505.
S. Deser, J.H. Kay, “Topologically massive supergravity,” Phys. Lett. **B** 120 (1983) 97.
S. Deser, “Cosmological Topological Supergravity, Quantum Theory of Gravity: Essays in honor of the 60th Birthday of Bryce S,” (DeWitt. Published by Adam Hilger Ltd., Bristol, 1984).
P. van Nieuwenhuizen, “Three-dimensional conformal supergravity and Chern-Simons terms,” Phys. Rev. D **32** (1985) 872.
A. Achucarro, P.K. Townsend, “A Chern-Simons action for three-dimensional anti-De Sitter supergravity theories,” Phys. Lett. B **180** (1986) 89.
M. Rocek, P. van Nieuwenhuizen, “$N \geq 2$ supersymmetric Chern-Simons terms as $d = 3$ extended conformal supergravity,” Class. Quant. Grav. **3** (1986) 43.
E. Witten, “(2+1)-Dimensional gravity as an exactly soluble system,” Nucl. Phys. B **311** (1988) 46.
A. Achucarro, P.K. Townsend, “Extended supergravities in $d = (2 + 1)$ as Chern-Simons theories,” Phys. Lett. B **229** (1989) 383.
H. Nishino, S.J. Gates Jr., “Chern-Simons theories with supersymmetries in three dimensions,” Mod. Phys. A **8** (1993) 3371.
P. S. Howe, J. M. Izquierdo, G. Papadopoulos and P. K. Townsend, “New supergravities with central charges and Killing spinors in (2+1)-dimensions,” Nucl. Phys. B [**467**]{} (1996) 183 \[hep-th/9505032\].
M. Banados, R. Troncoso and J. Zanelli, “Higher dimensional Chern-Simons supergravity,” Phys. Rev. D [**54**]{} (1996) 2605 \[gr-qc/9601003\].
A. Giacomini, R. Troncoso and S. Willison, “Three-dimensional supergravity reloaded,” Class. Quant. Grav. [**24**]{} (2007) 2845 \[hep-th/0610077\].
P. Concha, D. M. Peñafiel and E. Rodríguez, “On the Maxwell supergravity and flat limit in 2 + 1 dimensions,” Phys. Lett. B [**785**]{} (2018) 247 \[arXiv:1807.00194 \[hep-th\]\].
P. Concha, “$\mathcal{N}$-extended Maxwell supergravities as Chern-Simons theories in three spacetime dimensions,” Phys. Lett. B [**792**]{} (2019) 290 \[arXiv:1903.03081 \[hep-th\]\].
P. Concha, L. Ravera and E. Rodríguez, “On the supersymmetry invariance of flat supergravity with boundary,” JHEP [**1901**]{} (2019) 192 \[arXiv:1809.07871 \[hep-th\]\].
P. Concha, N. Merino, O. Miskovic, E. Rodríguez, P. Salgado-Rebolledo and O. Valdivia, “Asymptotic symmetries of three-dimensional Chern-Simons gravity for the Maxwell algebra,” JHEP [**1810**]{} (2018) 079 \[arXiv:1805.08834 \[hep-th\]\].
[^1]: The BMS group encodes the asymptotic symmetries of asymptotically flat spacetimes along a null direction (see [@Bondi:1962px; @Sachs:1962zza; @Barnich:2009se; @Ashtekar:2014zsa]).
[^2]: Let us observe that this includes also CS theories based on degenerate, invariant bilinear forms, implying that the action is invariant under gauge transformations but it does not involve a kinematical term for each field. However, this is not the case for the AdS CS supergravity action we will present in Section \[S2\], which, as we will see, is indeed based on a non-degenerate, invariant bilinear form (i.e., an invariant metric) and involves a kinematical term for each field.
[^3]: We denote the quantities referring to $\mathfrak{osp}(2|1)\otimes \mathfrak{sp}(2)$ with a tilde symbol on the top, in order to avoid confusion with respect to the super-AdS Carroll ones, which will be introduced and treated in Section \[S3\].
[^4]: In the sequel, for simplicity, we will omit the wedge product “$\wedge$” between differential forms. We use the metric $\eta_{AB}$ with the signature $(-,+,+)$.
[^5]: This is reminiscent of what was done in [@Concha:2016zdb], since with the redefinition the coefficients appearing in the invariant tensor become dimensionful. Here, the difference is that we are also considering dimensionful generators from the very beginning, on the same lines of [@Concha:2018jxx]. Notice that, however, the connection $A$ in is still dimensionless, due to the fact that the spin connection, dreibein, and gravitino have dimensions of $(\text{length})^0$, $(\text{length})^1$, and $(\text{length})^{1/2}$, respectively.
[^6]: The limit $\sigma \rightarrow \infty$ corresponds to $\frac{1}{c} \rightarrow \infty$, being $c$ the velocity of light, that is $c \rightarrow 0$ (ultra-relativistic limit).
[^7]: As already said, we drop the tilde symbol on the quantities referring to the AdS Carroll superalgebra.
[^8]: In these calculations we have also exploited the identities $\epsilon_{ABC} \epsilon^{ADE} = - \left( \delta_B^D \delta_C^E - \delta_B^E \delta_C^D \right)$, $\epsilon_{ABC} \epsilon^{ABD} = - 2 \delta_C^D$, that is, in particular, $\epsilon_{ab} \epsilon^{ac} = - \delta_b^{c}$, and $\Gamma_{AB} = - \epsilon_{ABC}\Gamma^C$, which implies $\Gamma_{ab} = -\epsilon_{ab} \Gamma^0$, $\Gamma_{a0} = \epsilon_{ab} \Gamma^b$.
|
{
"pile_set_name": "ArXiv"
}
|
<?xml version="1.0" encoding="UTF-8"?>
<Workspace
version = "1.0">
<FileRef
location = "group:GRDBTests.xcodeproj">
</FileRef>
<FileRef
location = "group:Pods/Pods.xcodeproj">
</FileRef>
</Workspace>
|
{
"pile_set_name": "Github"
}
|
aj
ajenti.plugin.core
ajenti.plugin.filesystem
ajenti.plugin.passwd
|
{
"pile_set_name": "Github"
}
|
1. Introduction {#sec1-ijms-19-03728}
===============
There are two important biological targets related to breast cancer: Human Epidermal Growth Factor Receptor 2 (HER-2) and Epidermal Growth Factor Receptor (EGFR) \[[@B1-ijms-19-03728]\]. Overexpression of ErbB (this abbreviation is derived from the name of a viral oncogene to which these receptors are homologous: erythroblastic leukemia viral oncogene) family members has implicated in many human cancers, and HER-2 expression is predictive of recurrence of human disease and prognosis. Inhibitors of the kinase domain of EGFR and HER-2 have been approved for the treatment of cancer, for example, erlotinib, lapatinib and trastuzumab \[[@B2-ijms-19-03728]\]. Receptors of the HER (ErbB) family are critical for the development of various organs and systems. When activated, these receptors bind to dimers, transphosphorylate and become capable of transducing intracellular signals that can affect cell growth, the inhibition of apoptosis, the migration and invasiveness, and angiogenesis, among other processes that lead to progression of malignant tumors \[[@B3-ijms-19-03728]\]. The simple overexpression of HER-1 (EGFR) does not transform cells, since the HER1:HER1 dimer is only capable of being transphosphorylated when one of its extracellular ligands is coupled in its active site. HER-2, for which an extracellular ligand has not yet been described, may spontaneously form dimers, a characteristic conferred by the peculiar structure of its extracellular portion.
Usually, two copies of the HER-2 gene are found in each cell, which must produce an adequate amount of protein on the cell surface. In breast cancer, one can find 25--50 copies of the HER-2 gene and an increase of the protein amount by 40--100 times, resulting in 2 million receptors expressed in the tumor cell; the amplification is what defines a subtype of cancer, with a gene signature, and is maintained during the cancer progression \[[@B4-ijms-19-03728]\].
The protein, after binding to a ligand, is activated by means of homo- or heterodimerization, leading to a cascade of events that activate its tyrosine kinase domain and promoting the rapid cell growth, differentiation, survival and migration associated with HER-2 positive breast cancer \[[@B5-ijms-19-03728]\]. Thus, the HER2:HER2 dimer can be transphosphorylated independently of the absence of ligand, stimulating morphological transformation and cell growth, either in its mutated form or not \[[@B6-ijms-19-03728]\]. There is evidence of a preferred binding partner between HER-2 and EGFR, and the HER-2/EGFR heterodimer shows an increase in the relative signaling potency for the EGFR homodimers. In contrast to most tyrosine kinase receptors, the loop phosphorylation is not required for the kinase activation, whereas kinase is intrinsically self-inhibitory in the cell \[[@B3-ijms-19-03728]\].
It has been suggested that HER-2 can play an important role in the oncogenic activity of EGFR. Preclinical studies have shown that both EFGR and HER-2 act in a synergetic way in the cellular transformation \[[@B7-ijms-19-03728]\]. HER-2 is the main and most common partner on heterodimerization of EGFR \[[@B8-ijms-19-03728]\]. Thus, HER-2 contributes to an extension of the EGFR activity by improving the affinity by ligands \[[@B8-ijms-19-03728]\], reducing its degradation \[[@B9-ijms-19-03728]\] and increasing its predisposition recycling \[[@B10-ijms-19-03728]\]. Moulder et al. showed that specific EGFR inhibitors can reduce the HER-2 signalization and the growth of breast cancer cells that overexpress HER-2 \[[@B11-ijms-19-03728]\]. Lapatinib is a good dual inhibitor of EGFR and HER-2 and it is approved by FDA in combination with capecitabine for the treatment of patients in advanced stage or metastatic breast cancer who have not responded to other drugs. However, not all cells that overexpress HER-2 also respond to the treatment with lapatinib and some patients have presented resistance to this drug \[[@B12-ijms-19-03728]\]. Thus, the proposal of new inhibitors of both EGFR and HER-2 can be more effective than simply targeting one of them alone.
Several studies attempt to inhibit the biological targets under study and one way to study the interaction processes between HER-2/EGFR and inhibitor molecules is employing molecular modeling methods, which are often employed in medicinal chemistry \[[@B6-ijms-19-03728],[@B13-ijms-19-03728],[@B14-ijms-19-03728],[@B15-ijms-19-03728],[@B16-ijms-19-03728]\]. Using these techniques, it is possible to identify the interactions that occur between bioactive molecules and biological receptors. To quantify the structure and activity relationships of diverse compounds, two important techniques have been widely employed elsewhere: Comparative Molecular Fields Analysis (CoMFA) and Comparative Molecular Similarity Index Analysis (CoMSIA) \[[@B17-ijms-19-03728],[@B18-ijms-19-03728],[@B19-ijms-19-03728],[@B20-ijms-19-03728],[@B21-ijms-19-03728]\]. The main objective of this study was to assess the interactions that occur between HER-2/EGFR and dual inhibitors (acting on both HER-2 and EGFR) and, consequently, understand their inhibition mechanisms and propose new models of drugs to treat related diseases, such as breast cancer.
2. Results {#sec2-ijms-19-03728}
==========
2.1. Redocking and Docking Analyses {#sec2dot1-ijms-19-03728}
-----------------------------------
The best parameters chosen from redocking of HER-2, which presented the lowest RMSD (Root Mean Square Deviation) values, were: (i) definition of the active site within 5 Å of the crystallographic ligand; and (ii) Goldscore as the scoring function used to classify (rank) the conformations generated. For EGFR, the parameters chosen were: (i) definition of the active site within 5 Å of the crystallographic ligand; and (ii) Chemscore as the scoring function employed to classify (rank) the generated conformations. [Figure 1](#ijms-19-03728-f001){ref-type="fig"} shows the redocking results and the RMSD values for HER-2 and EGFR, respectively. Using these parameters, molecular docking simulations for all compounds in the dataset were carried out and the best conformation of each inhibitor at properly biological target (HER-2 and EGFR) was chosen according to the greatest number of interactions with the main residues in the active site of HER-2 and EGFR.
[Figure 2](#ijms-19-03728-f002){ref-type="fig"} shows the main interactions between the most and least active compounds in each biological target (EGFR and HER-2). [Figure 3](#ijms-19-03728-f003){ref-type="fig"} displays the molecular alignment obtained for all compounds at each biological target. Considering that the CoMFA and CoMSIA techniques are strictly dependent of the molecular alignment, in [Figure 2](#ijms-19-03728-f002){ref-type="fig"} and [Figure 3](#ijms-19-03728-f003){ref-type="fig"} we can consider the docking methodology was carried out successfully, since the main interactions described in the literature were observed in the active site of each target.
2.2. Construction and Validation of the CoMFA and CoMSIA Models {#sec2dot2-ijms-19-03728}
---------------------------------------------------------------
### 2.2.1. CoMFA {#sec2dot2dot1-ijms-19-03728}
Initially, a CoMFA model with the standard parameters was constructed. After this step, we used the option "region focus" with the aim of refining the statistical results. [Table 1](#ijms-19-03728-t001){ref-type="table"} displays the main results for the best models (according to q^2^~LOO~ values). In CoMFA model construction, two things caught the attention. First, the option "region focus" improved the statistical quality of the models. Finally, the proportion of steric/electrostatic contribution is inversed for both receptors, i.e., there is a greater electrostatic contribution for the HER-2 model and a greater steric contribution for the EGFR model.
[Figure 4](#ijms-19-03728-f004){ref-type="fig"} shows the plot that correlates experimental and predicted biological data. The predicted values are in agreement with the experimental data, indicating the statistical robustness of the 3D models. Next, the external validation step was performed, in which the activity of the test compounds was predicted from the CoMFA constructed models. [Table 2](#ijms-19-03728-t002){ref-type="table"} presents the predicted activity values for the test set compounds, as well as their residue values.
In [Table 2](#ijms-19-03728-t002){ref-type="table"}, we can observe that all calculated residues (experimental pIC~50~-predicted pIC~50~) for the models are lower than 0.03 log units and the highest prediction error obtained from the CoMFA model using the test set is 0.83/0.08 for HER-2 and 0.73/0.13 for EGFR. The mean value of the calculated residues for the CoMFA model is 0.005 for HER-2 and 0.008 for EGFR.
Another technique used for the validation of the models is progressive scrambling ([Figure S1, Supplementary Materials](#app1-ijms-19-03728){ref-type="app"}), which is implemented in Sybyl 8.1. This test was performed based on the biological activity values for HER2 and EGFR (bins) and, for each bin variation, 100 new scrambling models were generated with the aim of determining the sensitivity of the model to chance correlations. Therefore, the sensitivity index (slope value between q^2^ vs. r^2^) for HER2 is equal to 1.17 and 0.93 for EGFR (the values accepted for this index range from 0.8 to 1.2). From these statistical analyses, we can assert that these models were not obtained by chance correlations, i.e., these models can be considered statistically reliable. After all statistical analyses of the 3D constructed models taking into account the robustness and the predictive ability, 3D contour maps were generated for the most active ligand (24) and the least active one (15), as shown in [Figure 5](#ijms-19-03728-f005){ref-type="fig"}.
### 2.2.2. CoMSIA {#sec2dot2dot2-ijms-19-03728}
The strategy used for the CoMSIA analyses was similar to that used in the CoMFA ones. The first step of this analysis was the construction of several models using the standard configurations. This technique has several descriptors (electrostatics (E), stereochemical (S), hydrophobic (H), hydrogen-bonding acceptors (A) and hydrogen bonding donor (H)). These fields were combined in pairs, trios, quartets and a combination containing all fields.
The best model obtained for both targets presented satisfactory results, and the best value of the internal validation coefficient was 0.502 for the combination of E/S fields for HER-2 and E/H/D (0.457) for EGFR. Even this analysis presenting acceptable values of q^2^~LOO~, the "region focus" technique was used with the intention of optimizing the best model obtained previously. [Table 3](#ijms-19-03728-t003){ref-type="table"} presents the statistical parameters obtained with the "region focus" option. As expected, the combination that presented a greater value of the internal validation coefficient was the combination between the electrostatic and electrostatic (S/E) similarity fields for HER-2 and electrostatic, hydrophobicity and hydrogen bonding donors (E/H/D) for EGFR. The values obtained for this model of HER-2 was q^2^~LOO~ = 0.744 and r^2^ = 0.917 and, for EGFR the values, were q^2^~LOO~ = 0.718 and r^2^ = 0.968.
Using the best model generated for each target, the plots correlating experimental and predicted biological data were constructed, as shown in [Figure 6](#ijms-19-03728-f006){ref-type="fig"}.
After the construction of the best CoMSIA model using the compounds of the training set, the next step was to perform the external validation of this model using the test set, which contains 13 compounds that were not used in the construction phase of the model. [Figure 6](#ijms-19-03728-f006){ref-type="fig"} shows the plot of the experimental and predicted pIC~50~ values by the CoMSIA model for the test set and [Table 4](#ijms-19-03728-t004){ref-type="table"} displays the values of experimental and predicted pIC~50~, as well as the residual values, for the test set obtained from the CoMSIA model for both biological targets. The external validation values show a good agreement between experimental and predicted pIC~50~ values.
After the process of external validation, which confirmed the good predictive capacity of the best CoMSIA model obtained, 3D contour maps were generated. These maps allow the visualization of the regions with the main stereochemical, electrostatic, hydrophobic, hydrogen bond donor and hydrogen bond acceptor contributions. The 3D contour maps were generated for the most active ligand (24) and the least active one (15), as shown in [Figure 7](#ijms-19-03728-f007){ref-type="fig"}.
### 2.2.3. New Compounds Proposed from CoMSIA Models {#sec2dot2dot3-ijms-19-03728}
Using the results in [Figure 7](#ijms-19-03728-f007){ref-type="fig"}, we analyzed the electrostatic, hydrogen bonding, stereochemical and hydrophobic donor fields for the most and least active compounds (24 and 15, respectively). In HER-2 CoMSIA map, the blue fields suggest that substitutions by groups with positive charge density can be performed to improve the biological activity, and green fields suggest that bulky groups are well accepted. From the CoMSIA analyses for EGFR, blue fields also indicate substitutions by groups with positive charge density, yellow fields suggest substitutions related to hydrophobicity and cyan fields are related to contributions from hydrogen bonding donor atoms. Analyzing the most active compound (24), relative to HER-2, in the region of the ligand containing the ring with sulfur, the docking simulation was carried out precisely in the pocket of the active site possessing the non-polar residues, Met801 and Leu866, thus forming a site region of hydrophobic character. The pirrolidine group of the ligand is located at the entrance of the active site, which also consists of hydrophobic residues. However, according to the contribution maps, this region of the ligand presented steric problems for HER-2 and electrostatic ones for EGFR, in addition to the negative contributions to hydrogen bonding donor atoms.
For the least active compound, at the indolin-2-one region of the ligand, the maps pointed to poor hydrophobic regions close to oxygen and nitrogen, in addition to negative electrostatic contribution, for both targets. Thus, it is suggested a substitution of this region by more hydrophobic atoms/groups and with less steric hindrance to better fit the active site. In the hydroxyl region (n-ethan-1-ol), the maps suggest substitutions by less voluminous groups, pointing to problems of hydrophobicity and hydrogen bonding donors. From all the suggestions pointed by the CoMFA and CoMSIA models, we decided to propose new molecules as HER-2 and EGFR inhibitors and test them in our models. [Figure 8](#ijms-19-03728-f008){ref-type="fig"} and [Figure 9](#ijms-19-03728-f009){ref-type="fig"} illustrate the strategy used to propose the new compounds from the original chemical structure, as well as the molecular docking in the two studied targets using these compounds. In addition, four new compounds have been proposed, as shown in [Table 5](#ijms-19-03728-t005){ref-type="table"}.
According to [Table 5](#ijms-19-03728-t005){ref-type="table"}, it is possible to note that the original compound with the lowest biological activity (15) presented significant improvements from the substitutions suggested by the contribution maps, improving its pIC~50~ value from 5.638 to 7.518 for EGFR and 6.886 to 8.467 for HER-2.
[Figure 9](#ijms-19-03728-f009){ref-type="fig"} shows the docking results obtained with the four new compounds proposed from the 3D models. Even the compounds that did not present improvements in the value of biological activity showed interactions with all of the main residues at the active site, suggesting a better fit and greater stability of the compounds in the site. The increasing in the number of interactions also confirms the improved biological activity of the proposed compounds (15A and 15B) when compared to the least active compound (15). We highlight compound 15B, which has an improvement in the original activity values from 5638 nM and 6886 nM to 7340 nM and 8467 nM for EGFR and HER-2, respectively. Moreover, the number of interactions is twice as large as the original compound, especially with Met793 and Met801, which are suggested as important to the stabilization of the inhibitors in the active site. From our analyses, it is possible to rationalize the fundamental interactions to inhibit EGFR and HER-2, as well as propose molecular modifications as a useful strategy to design new drug candidates with improved biological activity.
The pharmacokinetics and toxicity properties for the new proposed compounds were predicted using the online server pkCSM \[[@B22-ijms-19-03728]\]. In addition, we compared the properties of the proposed molecules with two drugs available in the market: Lapatinib (a dual inhibitor of HER-2/EGFR) and Erlotinib (a EGFR inhibitor), calculated the same way. The obtained results (see [Tables S1 and S2 in Supplementary Materials](#app1-ijms-19-03728){ref-type="app"}) showed that Lapatinib and Erlotinib are quite different according to the predicted toxicity data and the predicted toxicity data for the new designed compounds are similar to the mentioned drugs.
3. Discussion {#sec3-ijms-19-03728}
=============
Based on the receptor-based molecular alignment ([Figure 6](#ijms-19-03728-f006){ref-type="fig"}), we performed analyses of the results for the most (compound 24) and least active (compound 15) inhibitors of HER-2 and EGFR. The poses generated in the molecular docking can provide valuable information on the key ligand--receptor interactions related to the inhibition of EGFR and HER-2 receptors. [Figure 3](#ijms-19-03728-f003){ref-type="fig"} shows that all compounds studied performed a polar interaction with Met793 at EGFR and Met801 at HER-2, which are important residues involved in the receptor--ligand crystallographic interactions. The most active compound at both targets has a large substituent group attached to the general structure, which provides a hydrophilic interaction between the aromatic system and both hydrophobic and hydrophilic pockets (according to [Figure 2](#ijms-19-03728-f002){ref-type="fig"}B). In addition, the most and the least active compounds (24 and 15, respectively) perform extra polar contact with Met793 (EGFR) and Met801 (HER-2). It is important to note that, for this active compound (24), the binding mode observed in the docking simulations is the same as that proposed by the authors who synthesized and tested the compounds \[[@B1-ijms-19-03728],[@B23-ijms-19-03728],[@B24-ijms-19-03728]\]. Alternatively, the main interactions at the active site occur between this ligand and the following residues: Met793/Thr854 and Met801/Asp863 for EGFR and HER-2, respectively. Compound 15 (the least active) exhibits only the interaction with Thr854 and it does not interact with any of the major residues. In addition, compound 15 does not perform interactions in the hinge region of EGFR.
The most robust and predictive CoMFA model can also be used to rationalize the major ligand--receptor interactions from stereochemical and electrostatic contour maps. The stereochemical maps obtained from the CoMFA analyses are shown in [Figure 8](#ijms-19-03728-f008){ref-type="fig"} and present favorable steric contributions in green and unfavorable steric contributions in yellow. Analyzing the electrostatic maps in [Figure 8](#ijms-19-03728-f008){ref-type="fig"}, we can see that, in the benzoisothiazole region, close to the nitrogen and sulfur atoms, substitutions by negative electrostatic groups are suggested, as well as *N*-hydroxypyrrolidine substituents. However, for compound 24 (the most active) at the HER-2 target, the region close to benzoisothiazole suggests a substitution by positive and negative groups. However, as in EGFR, the *N*-hydroxypyrrolidine region indicates favorable electrostatic interactions and, in fact, this region interacts with Asp863, which is a negatively charged polar residue. Compound 15 (the least active), considering its activity against EGFR, showed a favorable region in the ring containing nitrogen of the indolone group, whereas for HER-2, the electrostatic map suggests several modifications of negative character. In addition to the indolone region, close to the 7-(2-hydroxyethyl)-1-(phenylamine), the contour map also suggests substitutions by electronegative groups.
In relation to the stereochemical map, in the benzoisothiazole region, large green polyhedral are shown for both targets. These outlines indicate that, in these regions, substitutions by bulky groups can be carried out potentiating the biological activity of the compound. On the other hand, close to the 6-(2-chlorophenoxy) region, substitutions by less bulky groups are suggested. In the stereochemical analyses for both targets, it is possible to note that the maps suggest a substitution in the hydroxyl region by larger groups. Already, the position of the oxygen atom of 1-chloro-2-(cyclohexyloxy) indicates that less bulky groups would be more favorable.
4. Materials and Methods {#sec4-ijms-19-03728}
========================
4.1. Dataset {#sec4dot1-ijms-19-03728}
------------
A set containing 63 molecules with available biological data (IC~50~ values) was synthesized and tested in the same experimental conditions as Kawakita et al. and Ishikawa et al. \[[@B1-ijms-19-03728],[@B23-ijms-19-03728],[@B24-ijms-19-03728]\]. These molecules comprised three different classes of diverse structures: pyrrolo\[2,3-d\]pyrimidine, heteroaromatic, indolone, isoindolone and benzoisothiazole derivatives, whose IC~50~ values were converted into pIC~50~ (−log IC~50~, see [Tables S3 and S4 in Supplementary Materials](#app1-ijms-19-03728){ref-type="app"}). The chemical structures of the compound set and the range of the biological data guided the composition of the training and test sets. The external validation of the constructed models was made using the test set. [Figure 10](#ijms-19-03728-f010){ref-type="fig"} shows some representative chemical structures in the compound set, including the most and least active molecules, and the distribution of pIC~50~ for all compound sets (training and test).
4.2. 3D Structure of EGFR and HER-2 {#sec4dot2-ijms-19-03728}
-----------------------------------
We then selected the structure of the biological targets studied ([Figure 11](#ijms-19-03728-f011){ref-type="fig"}A) to perform the docking analyses. The search for crystallographic structures of EGFR and HER-2 was performed at Protein Data Bank (PDB) (<http://www.pdb.org/>). We selected the structure of our targets based on some quality parameters (e.g., resolution, R-value and R-free values) and the chemical similarity between the crystallographic ligand and the compounds studied here. After various analyses, we decided to employ the EGFR structure with PDB ID = 3W32 (resolution = 1.80 Å, R-value and R-free equal to 0.236 and 0.200, respectively) and the HER-2 structure with PDB ID = 3PP0 (resolution = 2.25 Å, R-value and R-free equal to 0.260 and 0.185, respectively). We also generated a hydrophobic potential based on molecular surface of these receptors using USCF Chimera 1.5 (San Francisco, California, USA) \[[@B25-ijms-19-03728]\]. [Figure 11](#ijms-19-03728-f011){ref-type="fig"}B shows the complete structure of EGFR and HER-2, as well the main polar interactions between the ligands and the binding site (generated by PyMOL software (The PyMOL Molecular Graphics System, Version 2.0 Schrödinger, LLC, New York, NY, USA), and the hydrophobic and hydrophilic surfaces of EGFR and HER-2 active site.
4.3. Redocking {#sec4dot3-ijms-19-03728}
--------------
Redocking analyses were performed since this approach aims to recover, from computational simulation, the original position of a ligand present in a crystallographic structure of a protein-ligand complex. Thus, redocking can be considered as a validation process \[[@B26-ijms-19-03728]\] and, in this study, the crystallographic structure of the HER-2/EGFR already determined was used as reference. Thus, four different scoring functions were used to obtain the most similar ligand conformation to its experimental pose.
4.4. Conformational Sampling and Alignment {#sec4dot4-ijms-19-03728}
------------------------------------------
For the tridimensional quantitative study of the relationships between structure and activity related to the dual inhibitors of EGFR and HER-2, we employed the technique known as comparative molecular field analysis (CoMFA) \[[@B27-ijms-19-03728]\] and comparative molecular similarity index analysis (CoMSIA). The three-dimensional alignment of the compound set is a prerequisite for CoMFA and CoMSIA techniques and molecular docking is one of several ways to make this, as used in some studies (e.g., \[[@B28-ijms-19-03728],[@B29-ijms-19-03728]\]). To perform the docking simulations, the selected PDB structures were prepared by adding hydrogens and charges, retaining some important water molecules ("2001; 2010" and "22", for EGFR and HER-2, respectively), and excluding all others and all ligands. A radius sphere of 5 Å was defined around the crystallographic ligand as the docking target site.
Molecular docking was performed taking into account the rigid protein structure and the flexibility of some important residues at the active site, as well as the flexibility of the ligands, using GOLD program (Cambridge, UK) \[[@B30-ijms-19-03728]\]. Each ligand pose was obtained considering Goldscore (scoring function) values for HER-2 and Chemscore for EGFR, and the main interactions described in the literature. Therefore, at the end of the docking simulations, the molecular alignment was obtained for each biological target, which is required for the analyses of the tridimensional quantitative relationships between structure and activity of the dual inhibitor series.
4.5. CoMFA and CoMSIA Analyzes {#sec4dot5-ijms-19-03728}
------------------------------
After the docking simulations, we calculated the atomic charges for all aligned compounds, employing the semi-empirical method PM3 \[[@B31-ijms-19-03728],[@B32-ijms-19-03728]\] at the MOPAC program (Colorado Springs, CO, USA). Then, we generated the three-dimensional CoMFA models \[[@B33-ijms-19-03728]\] based on electrostatic and stereochemical molecular interaction fields (MIFs). To optimize the CoMFA models, the option "region focusing" was employed which is based on the distance of 3D grid points (0.5--2.0) and standard deviation of calculated descriptors (0.3--0.7). Partial Least Squares (PLS) regression was employed to generate statistically significant models. All these programs are implemented in the package Sybyl 8.1 (Saint Louis, Missouri, USA).
In addition to the CoMFA analyses, this study also used the CoMSIA technique. In this approach, besides the electrostatic and stereochemical fields, it is possible to analyze the hydrophobic fields, hydrogen bond donors and acceptors. In this way, the CoMSIA model was generated using the same alignment obtained with the total set used in the CoMFA method. Next, the CoMSIA fields were combined in all possible ways, and the focusing technique was employed following the same parameters used with the CoMFA technique to generate the best model. Furthermore, statistical validations were performed to corroborate the quality of the models, as well as 3D contour maps were generated to indicate possible molecular modifications with the aim of proposing new candidates to inhibit EGFR and HER-2.
5. Conclusions {#sec5-ijms-19-03728}
==============
Protein kinases (in this case, HER-2 and EGFR) are involved in cancer-related diseases. Due to the deregulation of genes that control cell growth, substances that inhibit protein kinases can be employed in the treatment of breast cancer, for example. In this study, a set containing 63 dual inhibitors of HER-2 and EGFR was analyzed with the following computational approaches: molecular docking (to obtain the structural alignment at each biological target), CoMFA and CoMSIA analyses. The models obtained using these techniques presented good predictive capacity, since the internal and external validations carried out showed that these models have a good correlation between the computationally predicted and the experimental biological values.
From the CoMFA analyses, it was possible to verify that the model showed a good statistical quality for HER-2 (q^2^~LOO~ = 0.827) and EGFR (q^2^~LOO~ = 0.728). To evaluate the predictive power of the best models generated, external validation was performed using the test compounds. The significant agreement between the predicted and predicted pIC~50~ values for HER-2 (r^2^~pred~ = 0.999) and EGFR (r^2^~pred~ = 0.998) indicate the predictive capacity of the CoMFA models. For the CoMSIA models, it was verified that the model has statistical quality for HER-2 (q^2^~LOO~ = 0.744) and EGFR (q^2^~LOO~ = 0.718), indicating the predictive capacity of the CoMSIA models. After the statistical analyses and its validations, the CoMFA and CoMSIA contour maps of the most and the least active compounds at each target were analyzed, indicating the regions with better contributions to the biological activity. The analysis of these maps suggested substitutions by groups that can potentiate the biological activity of new compounds, where four new compounds were proposed, prioritizing the contribution map of each biological target, for the most and least active compounds. From this, the new compounds were aligned to the CoMFA and CoMSIA models and the values of biological activity were predicted, showing significant improvements, mainly for the least active compound. Therefore, the results obtained in this study indicate the main interactions that occur between the inhibitors studied and the biological targets and may help the proposition of new potential dual inhibitors of HER-2 and EGFR, candidates to treat breast cancer.
Supplementary Materials can be found at <http://www.mdpi.com/1422-0067/19/12/3728/s1>.
######
Click here for additional data file.
K.M.H. and R.M.d.A. conceived the experiments and reviewed the paper; R.M.d.A.; M.d.O.A. and H.d.P. performed the experiments; and R.M.d.A. and H.d.P. analyzed the data.
This research was funded by São Paulo Research Foundation (FAPESP)--grant numbers 2018/23903-0, 2018/06680-7, 2016/24524-7 and 2016/18840-3, National Council for Scientific and Technological Development (CNPq) and Coordination for the Improvement of Higher Education Personnel (CAPES).
The authors declare no conflict of interest.
CoMFA
Comparative molecular field analysis
CoMSIA
Comparative molecular similarity index analysis
EGFR
Epidermal growth factor receptor
HER-2
Human Epidermal growth factor Receptor 2
PLS
Partial least squares regression
q
2
Cross-validated correlation coefficient
q
2
LOO
Coefficient of validation using leave-one-out method
r
2
Non-cross-validated correlation coefficient
RMSD
Root mean square deviation
SEE
standard error of estimation
SEP
Standard error of prediction
{#ijms-19-03728-f001}
{#ijms-19-03728-f002}
{#ijms-19-03728-f003}
{#ijms-19-03728-f004}
{#ijms-19-03728-f005}
{#ijms-19-03728-f006}
######
CoMSIA contour maps for the most and the least active compounds (EGFR and HER-2).
{#ijms-19-03728-f008}
######
Molecular docking for the new proposed compounds (candidates to inhibit HER-2 and EGFR) from the CoMFA and CoMSIA models. The dash yellow lines indicate the interaction points between the proposed compounds and the main residues in the active sites.
{#ijms-19-03728-f010}
{#ijms-19-03728-f011}
ijms-19-03728-t001_Table 1
######
Results obtained for the CoMFA standard model and the best focused models for HER-2 and EGFR.
Statistical Parameter HER-2 EGFR
----------------------- ------- ------- ------- -------
q^2^~LOO~ 0.492 0.827 0.043 0.728
r^2^ 0.986 0.982 0.966 0.973
SEE 0.102 0.078 0.141 0.126
SEP 0.394 0.235 0.804 0.391
E 0.593 0.585 0.400 0.367
S 0.407 0.415 0.600 0.633
N 3 5 5 4
q^2^~LOO~, Coefficient of validation using leave-one-out method; SEP, standard error of prediction; N, number of principal components generated from PLS; r^2^, coefficient of correlation without validation; SEE, standard error of estimation; S, contribution of steric fields; E, contribution of electrostatic fields; *w*, standard deviation weight; *d*, grid distance factor (Å).
ijms-19-03728-t002_Table 2
######
Values of experimental and predicted pIC~50~, and residual values for the test set obtained from the CoMFA model for both biological targets.
Compound HER-2 EGFR
---------- ------- ------- -------- ------- ------- --------
51 7.824 7.827 −0.003 7.481 7.456 0.024
52 7.921 7.904 0.016 7.420 7.437 −0.017
53 7.959 7.967 −0.008 7.959 7.946 0.012
54 6.921 6.927 −0.006 6.823 6.813 0.010
55 7.585 7.579 0.005 6.537 6.547 −0.009
56 8.678 8.676 0.001 8.244 8.244 −0.007
57 8.292 8.281 0.011 7.823 7.830 −0.006
58 8.553 8.567 −0.014 8.142 8.148 −0.006
59 7.770 7.771 −0.001 7.301 7.295 0.005
60 7.854 7.854 0.000 7.301 7.256 −0.004
61 7.021 7.017 0.003 7.508 7.505 0.003
62 6.824 6.826 −0.002 6.050 6.053 −0.002
63 8.602 8.602 −0.000 7.677 7.679 −0.001
ijms-19-03728-t003_Table 3
######
Results for the best CoMSIA model (HER-2 and EGFR) using no focus and focus techniques.
Statistical Parameter HER-2 Parameter Statistical EGFR
----------------------- ------- ----------------------- ----------- ------- -------
q^2^~LOO~ 0.502 0.744 q^2^~LOO~ 0.457 0.718
r^2^ 0.942 0.917 r^2^ 0.975 0.968
SEE 0.144 0.173 SEE 0.125 0.144
SEP 0.410 0.304 SEP 0.589 0.433
E 0.716 0.651 E 0.415 0.459
S 0.284 0.349 H 0.187 0.245
D \- \- D 0.398 0.296
N 3 6 N 6 6
q^2^~LOO~, Validation coefficient using the "one-out" method; SEP, standard error of prediction; N, number of main coefficients generated from PLS; r^2^, regression coefficient without cross validation; SEE, standard non-cross validation error; S, stereochemical contributions; E, electrostatic contributions; H, hydrophobic contributions; D, contribution of hydrogen bonding donors; A, contribution of hydrogen bond acceptors.
ijms-19-03728-t004_Table 4
######
Values of experimental and predicted pIC~50~, and the residual values, for the test set obtained from the CoMSIA model for both biological targets.
Compound HER-2 EGFR
---------- ------- ------- -------- ------- ------- --------
51 7.823 8.083 −0.260 7.481 6.990 0.491
52 7.921 7.693 0.228 7.509 7.524 −0.015
53 7.959 7.066 0.893 7.959 8.526 −0.567
54 6.921 7.810 −0.889 6.824 7.222 −0.398
55 7.585 7.921 −0.336 6.229 7.164 −0.935
56 8.678 8.584 0.094 8.244 7.837 0.407
57 8.292 8.545 −0.253 7.824 7.455 0.369
58 8.553 8.195 0.358 8.142 7.984 0.158
59 7.770 7.936 −0.166 7.638 8.010 −0.372
60 7.854 7.829 0.025 7.252 7.601 −0.349
61 7.420 7.542 −0.122 7.921 8.270 −0.349
62 7.770 8.295 −0.525 7.301 7.200 0.101
63 8.602 8.141 0.461 7.678 6.733 0.945
ijms-19-03728-t005_Table 5
######
New compounds proposed from the 3D models and the predicted pIC~50~ values.
Original Compound Experimental pIC~50~ Modified Compound pIC~50~ Predicted
------------------- ---------------------- ------------------- ------------------- ------- -------
15 5.638 6.886 15A 7.518 6.356
15B 7.340 8.467
24 8.523 9.036 24A 7.744 8.126
24B 7.658 8.027
|
{
"pile_set_name": "PubMed Central"
}
|
Bring the magic back to the bullets.
Governments must act swiftly and decisively to incentivize antibiotic R&D and clarify regulations.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
# Using Overmind with Angular
To use Overmind with Angular you just have to expose the **OvermindModule** and the instance of Overmind.
Let us have a look at how you configure your app:
```marksy
h(Example, { name: "guide/usingovermindwithangular/connect" })
```
The **service** is responsible for exposing the configuration of your application. The **\*track** directive is what does the actual tracking. Just put it at the top of your template and whatever state you access will be optimally tracked. You can also select a namespace from your state to expose to the component:
```marksy
h(Example, { name: "guide/usingovermindwithangular/connect_custom" })
```
You can now access the **admin** state and actions directly with **state** and **actions**.
## NgZone
Since Overmind knows when your components should update you can safely turn **ngZone** to `"noop"`. Note that other 3rd party libraries may not support this.
## Rendering
When you connect Overmind to your component and expose state you do not have to think about how much state you expose. The exact state that is being accessed in the template is the state that will be tracked. That means you can expose all the state of the application to all your components without worrying about performance.
## Passing state as input
When you pass state objects or arrays as input to a child component that state will by default be tracked on the component passing it along, which you can also see in the devtools. By just adding the **\*tracker** directive to the child template, the tracking will be handed over:
```marksy
h(Example, { name: "guide/usingovermindwithangular/passprop" })
```
What is important to understand here is that Overmind is **not** immutable. That means if you would change any property on any todo, only the component actually looking at the todo will render. The list is untouched.
## State effects
To run effects in components based on changes to state you use the **addMutationListener** function in the lifecycle hooks of Angular.
```marksy
h(Example, { name: "guide/usingovermindwithangular/effect" })
```
|
{
"pile_set_name": "Github"
}
|
Many patients with hypertrophic cardiomyopathy have severe symptoms in spite of medical therapy with beta adrenergic blocking agents and/or calcium channel blocking agents. Recently we have been investigating the use of amiodarone, a benzofuran derivative with potent hemodynamic and antiarrhythmic properties in this same subgroup of patients and have noted an improvement in cardiac symptoms and an increase in exercise capacity. However, there remains a subgroup of patients who are intolerant of amiodarone or who do not improve on amiodarone and continue to have marked symptomatology. In response to a compelling clinical need in this subgroup of refractory patients, we felt it appropriate to explore other potential pharmacologic modalities. We have hypothesized that the functional and structural abnormalities in HCM are related to a primary membrane disorder leading to increased cytosolic calcium levels as a result of altered calcium fluxes involving both the myocardium and the vascular smooth muscle of the small intramural coronary arteries. Lidoflazine has been shown to be a potent calcium entry blocker, and has a cellular protective effect against calcium overload in vascular smooth muscle and cardiac muscle during ischemia, preventing ischemic contraction and myonecrosis. These properties of the drug afford an ideal mechanism for testing the above hypotheses, as well as offering a potentially important therapeutic alternative. The study will consist of 3 phases. The first phase to assess the clinical efficacy of the drug; the second to characterize the hemodynamic/metabolic correlates of the drug that may determine its efficacy; and the third to compare in a double blind fashion lidoflazine versus standard therapy. We have enrolled thus far 3 patients in phase I, two of whom have had symptomatic and exercise improvements.
|
{
"pile_set_name": "NIH ExPorter"
}
|
Q:
Why do fixed-width integers print out chars instead of ints?
Given the following code.
#include <cstdint>
#include <iostream>
#include <limits>
int main()
{
int8_t x = 5;
std::cout << x << '\n';
int y = 5;
std::cout << y;
std::cin.clear();
std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
std::cin.get();
return 0;
}
My output is a three-leaf clover and 5. If fixed-width integers are integers, why are they outputting their number's ASCII character symbol?
Edit: just found out this behavior only happens for 8-bit fixed-width integers? Is this compiler behavior?
A:
Well, they are integers in the sense that you can do 8 bit integer arithmetic with them.
But apparently on your system, int8_t is implemented as a typedef to signed char. This is completely legal since signed chars are also integers, but gives unexpected results since the operator<< for signed chars prints their character symbol and not their numeric value. Anything else would just be weird if someone tried to print an signed char.
If you want to see the numeric value of your int8_t, just cast to int before printing.
|
{
"pile_set_name": "StackExchange"
}
|
Significantly enhanced antibacterial activity of TiO2 nanofibers with hierarchical nanostructures and controlled crystallinity.
Recently, there has been increased interest in electrospun-titanium dioxide nanofibers (TiO2 NFs) as antibacterial agents owing to their advantages, such as simple and cost-effective fabrication processes, and high surface areas. However, the photocatalytic effects of TiO2 NFs are relatively low because of their low-ordered crystalline structure, and the antibacterial effect is only effective under UV illumination owing to their large band-gap energy. In this paper, we have demonstrated a significantly enhanced antibacterial activity of hierarchical anatase TiO2 NFs against Staphylococcus aureus in the presence of UV light. Furthermore, the uniform deposition of a large quantity of Ag nanoparticles on the surface of the TiO2 NFs ensured a significant enhancement of the antibacterial performance, even under dark conditions. These results were obtained by exploiting the enhanced photocatalytic effect achieved through control of the crystallinity, as well as the enhanced surface area of the nanomaterials.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Phase I Study of Definitive Radio-chemotherapy with Cisplatin, 5-Fluorouracil and Cetuximab for Unresectable Locally Advanced Esophageal Cancer.
Prognoses of patients receiving radio-chemotherapy with 5-fluorouracil (5-FU) and cisplatin for unresectable esophageal cancer may be improved with the addition of cetuximab. This phase I study aimed to define the maximum tolerated dose of 5-FU when combined with cisplatin, cetuximab and radiotherapy. Treatment included 59.4 Gy of radiotherapy concurrently with two courses of cisplatin (20 mg/m2, d1-4) and 5-FU (dose level 0: 500 mg/m2, dose level 1: 750 mg/m2, d1-4; dose level 2: 1,000 mg/m2, d1-4), followed by two courses of chemotherapy. Cetuximab was given for 14 weeks (400 mg/m2 loading dose followed by 250 mg/m2 weekly). At dose level 1 (n=3) and 2 (n=3), no patient experienced a dose-limiting toxicity. Minor treatment modifications were due to organization or request by physicians/patients. At dose level 2, only five grade 3 adverse events occurred. Dose level 2 appears safe and is used in a subsequent randomized phase II study.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
Are there nontrivial perfect powers of integers that are nontrivial repdigits?
For example, $6^5=7776$ is close, but not quite a repdigit. Heuristically, it seems to me that there should not be any, because the longer a number with (effectively) random digits is, the less the odds of that number being a repdigit become. So as the integer power in question gets bigger, the odds of it being a repdigit fall off quickly.
A:
I can eliminate a few cases. Repdigits look like $a(111\cdots1)$. If $a=2$, then you have
$$2(111\cdots1) = b^k.$$
Since the second factor is odd, at most one factor of $2$ appears in $b^k$, a contradiction since $k>1.$
Similarly $a$ can't be $6.$
If $a=4$, then similar reasoning forces $k=2$ and $b=2c.$ Then you have
$$4(111\cdots1) = (2c)^2$$
$$111\cdots1 = c^2$$
which is impossible the left side is congruent to $3$ modulo $4.$
If $a=8$, it (similarly) forces $k=3$ the equation reduces to
$$111\cdots1 = c^3.$$
This was proved impossible here:
https://mathoverflow.net/questions/132011/can-repunits-be-perfect-cubes
So $a$ can't be even.
Now things get fuzzy. If $a$ is odd and prime, it seems like writing
$$p(111\cdots1) = b^k$$
should get us somewhere. Certainly it shows that $p^{k-1}$ divides $111\cdots1.$ But I'm stuck there. That would eliminate $3, 5,$ and $7$.
That's all I got.
|
{
"pile_set_name": "StackExchange"
}
|
" I have found a layer of encryption." " "An oppressed soul rebel."" ""What you think you should do." "To fight against poisons the soul. "" ""There is nothing immoral - Just stuff that makes you feel good. "" "I just want to know why she got Me prosecuted." "I have nothing." " How can you afford all this?" " I am a thief." "Thereareflowersalsoinhell." "L.H. sent the passport to a Andrei Miroj to the dentist." "It is like a relay race for him." "The first murderer must prepare for the next." "We have to take him." "We need a fantasy that he can believe in." "Ensure L.H. know that what you write is credible." "How should we answer him?" "I do not think I've ever loved but later disappoint." ""Now I get up, now I go for the entire day on ... "" ""..." "I hear lake water cluck quietly against the shore klitt. "" ""Although I stand on street with noisy traffic all around ... "" ""..." "I hear it clearly in the center of the heart. "" "All right." "Who knows what this is about?" "No?" "What does he mean by "Now I get up, now I go ..."?" " P.J.?" " He wants to get out of there." " He does not like the situation." " Great." "He believes he is on the way a better place." "But what a feeling predominates?" "Yes?" "Betrayal." " Hello." " Hello." " You look like shit." "Did you sleep?" " As a child." " What do we have?" " A reply." " Tell me more." " He is testing us." "What should I write?" "In the story you wrote What were you there?" "What embarrassed you so much for you did not dare to write something?" "It must be honest." "What is the worst thing you think?" " I do not think so anymore." " We know that." "No one here will judge you." "The small girls had all of my mom's face." "Good, write it." "Come on ..." "Do you really want to do this?" " Should I say yes?" " No, say no." "Write that you hate to feel such" " And that you prefer had wanted to get rid of the feeling." "What you think should be done." "I'll let you know." " What do I respond?" " Ask him to stay." "Now the ball is in him, the pig." " What's up?" " Well, that's good." "Self?" "Go in." " How are you, my friend?" " It's the week's best days." " How's business?" " Sluggish." "But that's no problem for us?" " Who is she?" " Sofia." "She is new." " She's better than new." " Maybe, but she's taken." " Make her leave, then." " Sorry." " You're a real little pig pussy." " Place of." "I had arranged it where it went." " The second, then?" " That's my girl." "Neither she's free." "If you do not help me begins cost more." "Where is my money?" "How does it feel?" "As if I'm in heaven." "What good that you are satisfied." "I'll let you know." " Hell, what cold is." " It must be along the wall edge." "I'll check over here." "It may have been that." " What the hell is that?" " Hello?" " Check, then." " Go back and check, you." "Hell!" "Send a photo, so Josephine can check among the missing persons." " Does she have some characteristics?" " She has been emptied of blood through the ankles." " Everything?" " Almost." "Both veins appear truncated." " Some other brands?" " I'm not done." "She has scars on his left hand." "It looks a few weeks old out." "Probably a burn." "All right." "There are no traces of blood." "He has emptied her blood somewhere else." "Then he arranged this scene." "It can not be a coincidence?" "It is bizarre to not be L.H. We have to figure out what it is." " Do you have a foot fetish?" " It is antiseptic." "He washed her when he drank her blood." "He did not see the blood." "So he put her in a chair." "He pours blood into the glass, so that it looks as if she meets someone." "This means something." "Maybe she's on a date." " Now I understand why you're single." " No, it's social." "A girl with a glass of wine." "As if she's on a date with someone." "Yes ..." "Who are you talking to?" "Whyarenot you inschool?" " How do you know?" "Because I know everything." "What are you thinking?" "I think ..." "I want to get across." "I'mbusy." "But we could be seen at lunch." " I think of something better ..." "Atoneo'clock?" "You are so mean right now." "You..." " Yes?" " I like you too much, just." "Too bad I do not like at you." "You are evil, you know it, huh?" "Youhaveno idea." " We can come back." " But it would be best to talk now." "We will do everything we can to find those who did this to your daughter." "What do you know?" "She was reported missing for a month tendon" " But the notification was withdrawn." "What happened?" "One evening she did not come home." "We were worried." "Nor the next night, she came home." "So we called the police." "Then she came home." "She lived here?" "Yes." " A week later she came home." " Did she say where she had been?" "She refused." "She wanted to go away again- but I convinced her to stay." "She was such a beautiful girl." "How can people do this?" "She had scars from a burn on his left hand." "It was right again." "Do you know where it came from?" " No." " I did it to her." "What she did was a sin." "I held her hand over the stove to teach her a lesson." " Look in her room." " No." "She disliked the man went in there." "No one may go in there." "Tell me what you had done with such a girl!" "She's dead." "Are you happy now?" "Look what you've done." "This is your fault." "It's your fault." "Check here." "Oops ..." "Yes ..." "Here is her computer." "She seems to have done webcam performances." " It does not look like this room." " No." "We're sending this to Phil." "We have received the report on the red liquid on the crime scene." " Blood?" " Yes, but also linseed oil." "It is often when producing oil paint." " It's just a guess." " Think about who he imitates." " We also found traces of benzo." " Check if the blood could be someone's else." "Sure." " Keep us updated." " Can you help us with this?" "The computer belongs to a girl who had been murdered." "She had sex shows via webcam, and we must know from where." "I will try." "The chair is made of pine." "It can be purchased anywhere." "It is a standard chair." "Her dress can not be traced." "We only know it is cotton." " What's more?" " Deer ..." "Hunter sometimes hangs up deer and to empty them of blood." "It was probably what they did with her." "Check woods near where we found the body." "That was what I was thinking." "I have found the site where she ran their shows." "We can see how many shows she did." "There are many." "We need to know where she sent." "Then I have to check all the IP addresses she has logged in from." " Is it possible to do?" " Talk with the Bahnhof." " They provide servers." " But they are rock hard with anonymity." "Has someone a contact there?" "I know someone who works there." " Where are the rest?" " It is a former bunker." " What do your friends with?" " Security." "Hey." "Location?" " This is my colleague." " Conley from the New York Police Department." " Are you working with something?" " We need access to a server Where it is a cam site that we investigate." " I'll give you access?" " It's quiet?" "I'm not a cop anymore, so ..." "I can not." "I can not afford To get rid of the job again." " You're the only security guard." " No one knows what passes here." "People use us we guarantee their anonymity." "So you have the info but choose rather protecting a mass pervon?" "Is it the job or that you are not a cop?" " I'm busy." " A girl has been murdered." " Your ohjälpsamhet provokes me." " Place of." "This is vital." "There are young girls who die." "So for God's sake ..." "I have missed you have become believers." " It's about life and death." " I can not." "I can not." "I signed contracts When I started here." "These were the only one that wanted to hire me." "Then I can not do this." "One day you get the bang you deserve." "That sounds fun." "We are a party soon, huh?" "Is he your friend?" "What a fucking pig." "He betrayed you because he hides something." "No of his three apologies were credible." "Cherish you more about your friend than the next victim?" "Let be." "You taste better than you look." "But you look fantastic." "Not at all like a schoolgirl anymore." "I'm not a schoolgirl anymore." "You've turned me." " When work my plan, that is." " It seems so." " Are you hungry?" " Excuse me!" "Cheeseburgers, everything on, french fries." " And you want ..." " I'll take the same." " Drinking?" " Water." " No ..." " What?" "Well." " No." " Do you know ..." "All the guys in here would like to do what I do with you." "But ... if you want to keep doing this, why did we not come home to you?" "To this is so goddamn much more exciting." " Do you have pants on you?" " Yes." "Go into the bathroom, take off panties and came back." "No." "I do not want." " Come on." " But I do not want to." "All right." "Then I do not know what I'm doing here." "What, you want well to see me?" "Though meeting itself has the no value." "It is what one does." " Göran ..." " No, but wait." "Do not play games with me." "I come here and think that we will have fun and nice." "But you do it here to something else entirely." "I do not know what you're doing." "Sorry." "You can unsubscribe from my food." "I apologize." " Does it both?" " It gets you ask her about." "You, do not call me." "Unless you want this I do not want either." "Excuse me again." "No, I will not have anything." "Mr. Sala?" "Mr. Sala?" "My wife must not know that I have been here." "She has suffered enough." " Should we go in?" " No, we do this." "I knew that my daughter had problems." "I thought it was drugs." "I heard her voice meeting with nån" " And I followed." "This is the address." "She greeted a man outside instead." "They went in, and I followed." "There was a sex party." "The walls were covered with red silk." "All made obnoxious things In front of everyone." "I was looking for Sofia but could not find her." "Early the next morning she came home." "It was then that I burned her hand on the stove." "I did not know how I would get her to understand!" " When did this happen?" " A month ago on Friday." "Do you remember anything else of value?" "The last time we met her I heard her talking on the phone with someone named Amir." "I wanted to stop her," " But I was so disgusted what I knew she did so I let her go." "I hope this helps you to find my daughter's killer." " It does." " We'll check the address." "It will be good there." " I have a question." " I dislike questions." "When the recommended you they knew it." " Damn ..." " I have not heard of Sofia." "I worry about her." "If something her hands, I can have trouble." "I'm worried about." " Do not be." " Why not?" "There are flowers also in hell." " What the hell does that mean?" " Do you really know?" "Or do you want to do a new business?" " A new business?" " My client wants to do about it." "In the same place and for the same amount." "Come out of the shadow so we can talk some." " I do not even know what you look like!" " Do you think it is a coincidence?" " But Sophia, then?" " Forget her." "Think about the new girl." "It would be nice if she was equally delicious." "You feel you probably do not want fortsätta" " But I promise that you want." "I'll let you know." " Thank you for letting us come." " I will gladly police." " When you rented the premises at the latest?" " For more than half a year ago." "What rathole." "You have to lose a lot of money." "No, it's the boss who does." "I only manages and rents." "He owns many properties, so he can handle himself." " What you got there?" " This was stuck in the wall." " What do you say about that?" " I've never seen it." "But you know what it is?" "You have rented out the place in the evenings to earn some money." "I have no idea what you're talking about." "Do you recognize this girl?" " No." " We know she's been here." "Then she was murdered." "I had nothing to do with the parties." "Which parties?" "There came a man who asked to hire an empty room for a single night." "He paid cash so that the agreement could not be traced." "He offered me 50,000 crowns, and I just needed to let him," "and then come and unlock the next morning." " It seemed innocent." " It always does it." " I forgot to tell you something?" " I do not even know his name." " How many times?" " Three to six months." " When is the next time?" " He just pops up." " What does he look like?" " As an immigrant." "He is slim and has a suit." "He knows how to express himself." "I took the money and have thus stolen from my boss." " You can arrest me for it." " We do." "If you do not call when he hears himself." "Call, otherwise we will." " Where do we start looking?" " A guy in Bredäng owe me." "Wait." "Thank you." "Goodbye." " If you have more of these cuties?" " Of course." " How is the situation, Roushan?" " Much better before you came." " I need help." " Tomatoes, bananas Pear, pomegranate." " I need more." " I can not help you." "Sorry." "I do not owe you anything." "I have paid my debt." "You have promised." " The last time" " I promise." " You said that last time, too." "All right." "Who do you want?" "Amir." "He organizes sex parties." "It's a rotten apple." " Who is it?" " Amir Alsuwaidi." " Is that his real name?" " Yes." "You can not reach him." "He has powerful friends." "Much more powerful than you." " Where is he?" " Often on Bredängs association center." "Piece of shit." "Josephine ..." "Take out all you can Amir Alsuwaidi." "Everything you find, and so Messa a picture." "Come on." "There we have him." "Yes ..." "Come on." " Wait!" " He found me." "He sticks!" " Out of the way!" " Genskjut him!" "Out of the way!" "Move on you" " I am the police!" " Do you have him?" " Out of the way!" "Stay away!" "Do you know him?" "Up with him." "Why you chasing me?" "I have not done anything." "The murder of Sofia Sala, then?" "How was it?" "How did you do:" "You called her - it belonged to her father." "You met in an empty warehouse." "Her father saw you with her." "You will break her ankles and let her bleed to death." "You do not want to hear what you did." "This may make you remember." "I have not done anything." "You may not To ask these questions." "Sofia Was a friend." "It was not me who did this to her." " Excuse me?" " No, it's not him." "He therefore called Amir and organizes orgies." "But it was not him who rented the room?" "It is not him." "He has threatened you, huh?" "Either you acknowledge that it was male" " Or so turns me your life a living hell." "Release me, otherwise I report you." "They arranged well fancy parties?" "I did not know what it was." "I had to check it out." "You recreates fantasies in a safe neighborhood." "But security Sofia did you not care." "Tell me who killed Sophia." "We promise to protect you." "Protect?" "You have no right to ask that kind This matters." "I have not done wrong." "Do not do anything until I say so." "You said it had to do about it." "You said that." "You said I could do it again." "I can not wait." "It must be done now." "Wait!" "Hello." " Overtime again?" " It is easy to lose protocols." " But what the hell, Henry!" " I have begun to use the gym." "Make it there in a plastic bag next time." "What the hell are you doing?" "LH answered." "Come here!" " Hello." "I called you." " Yes, I saw it." " Can not we go up?" " No." " I do not like being rejected." " I know." "That's why I'm here." "Okay, but then I'll be extra clear." "If we are to continue to meet, you must let go and follow your passions." "The soul that may not be what they want is tormented." "I certainly agree with that." " Have you told your dad?" " I told you I would not." " Who have you told?" " I have not told anybody." "I have not said to anyone - I swear." " And now you want to start over?" " Yes." "Can you do something for me then?" "Follow me away for the weekend." "I would love to go away with you." "And when I ask you to do something, you do so well." "Promise that." " I promise." " Good." " I would very much follow up." " No." " Why not?" " It will be your punishment." "See you this weekend." "There is a hyperlink." "What's the worst which can happen if you open it?" "He can get access to our servers." " But what if we do not respond?" " He takes us fake." "But that is not the issue." "If L.H. have found the manager, he knows this." "Click on it." " What is it?" " The site is not up yet." " When it comes up?" " It determines the administrator." " L.H." " He's messing with us." " Just look at the page." " Ask him." "Should I understand this?" "Soon enough you will understand all." " "All of you ..."" " Can he see us?" " Maybe." " Close the server." " Now you've screwed up!" " Get out!" " Close the server."
|
{
"pile_set_name": "OpenSubtitles"
}
|
Q:
How do I convert wireshark capture files to text files?
How can I convert wirshark captures (.cap) files to text files or some format from which I can read the file and parse its contents ?
A:
Open up Wireshark, select your .cap file, and then go to File->Export and choose the options that you want.
So, if you need to do it from the command line, use tshark.exe, as follows.
>tshark -i - < "c:\filename.cap" > "c:\output.txt
If you want to write the decoded form of packets to a file, run TShark without the -w option, and redirect its standard output to the file (do not use the -w option).
A:
The -A option of tcpdump prints each packet in human readable ASCII and happily deals with wireshark files and you can do it all from the command line:
tcpdump -A -r stackoverflow.cap > stackoverflow.txt
The output looks like:
9:22:33.664874 IP 192.168.1.11.33874 > stackoverflow.com.www: Flags [P.], seq 1117095075:1117095829, ack 3371415182, win 9648, options [nop,nop,TS val 9533909 ecr 313735664], length 754
E..&..@.@../....E;...R.PB.........%........
..y...9.GET / HTTP/1.1
Host: serverfault.com
Connection: keep-alive
User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US) AppleWebKit/533.4 (KHTML, like Gecko) Chrome/5.0.375.70 Safari/533.4
Accept: application/xml,application/xhtml+xml,text/html;q=0.9,text/plain;q=0.8,image/png,*/*;q=0.5
Accept-Encoding: gzip,deflate,sdch
Accept-Language: en-US,en;q=0.8
Accept-Charset: ISO-8859-1,utf-8;q=0.7,*;q=0.3
Cookie: __qca=P0-141773580-1259521886021; __utmz=81883924.1275328201.133.5.utmcsr=google|utmccn=(organic)|utmcmd=organic|utmctr=hudson%20build%20dir; usr=t=kXSBoIG5Jk6S&s=wGmaIuhAD0eH; __utma=81883924.2034104685.1272993451.1276186265.1276193655.189; __utmc=81883924; __utmb=81883924.6.10.1276193655
If-Modified-Since: Thu, 10 Jun 2010 10:17:12 GMT
A:
I use the tshark -x -r file.pcap command line when hexdump like output is good for post processing.
|
{
"pile_set_name": "StackExchange"
}
|
On the resolution capabilities and limits of fluorescence lifetime correlation spectroscopy (FLCS) measurements.
Quantitative tests were performed in order to explore the practical limits of FLCS. We demonstrate that: a) FLCS yields precise and correct concentration values from as low as picomolar to micromolar concentrations; b) it is possible to separate four signal components in a single detector setup; c) diffusion times differing only 25% from each other can be resolved by separating a two component mixture based on the different fluorescence lifetimes of both components; d) most of the inherent technical limitations of conventional FCS are easily overcome by FLCS employing a single detector channel confocal detection scheme.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
7 Amazing Health Benefits of Mineral Water
Drinking mineral water is a wonderful way to rejuvenate your body’s minerals and improve your overall health.
What is Mineral Water?
Quite simply, mineral water is water that emerges from a natural mineral spring, which results in the water being very high in mineral content. More specifically, this mineral water typically has a higher content of calcium, iron, magnesium, potassium, and sodium than regular water. Every source of natural spring water is slightly different in composition, which may explain the slight difference in taste between the many different brands of mineral water on the market.
Mineral springs, throughout history, were places where people would go to bathe and soak in these unique waters, in an effort to improve the health of their body. Today, these mineral springs are more well known and profitable as sources for the bottle of mineral water. Some of these sparkling waters also contain high levels of compressed gas (e.g., carbonation), so they have the bubbly flavor of carbonation that so many people enjoy. Rather than drinking carbonated sodas or other beverages with added sugars or nutrients, drinking mineral water can be a healthy and enjoyable alternative.
Mineral Water Benefits
There are quite a few proven benefits of mineral water, such as:
Improving blood circulation
Replacing the body’s electrolytes
Detoxifying the body
Boosting bone mineral density
Detoxify the Body
Just like any other form of water, mineral water can help to induce urination, which is one of the best ways to detoxify the body, eliminating excess fats, salts, and toxins. This can also help to reduce strain on the kidneys and metabolism.
Weight Loss
Although there are no calories in mineral water, the additional nutrients and the carbonation can often help someone feel full as compared to regular water. For people struggling with their weight, or trying to establish a calorie deficit, drinking this sparkling water may aid weight loss efforts.
Electrolytes
Unlike regular water, mineral water contains potassium and sodium; in the best types, the sodium levels are low, while the potassium is high. This is a great way to improve nervous system function and reduce blood pressure, as potassium is a vasodilator. In other words, this carbonated water can also protect cardiovascular health.
Bone Density
With high levels of magnesium and calcium, this form of water is definitely a boost for your bone mineral density, which lowers your risk of developing osteoporosis as you age.
Cholesterol
Magnesium can help to regulate cardiovascular health in a number of ways and has been linked to lowering overall cholesterol levels. Drinking mineral waters that have high levels of magnesium can reduce your risk of atherosclerosis and heart attacks.
Neurodegenerative Diseases
When your electrolytes are well balanced, and your nervous system can function properly, there is less of a chance for chronic inflammation and oxidative stress. In turn, some studies have found that consumption of this mineral-based water can protect against certain neurodegenerative diseases, such as dementia.
Circulation
Although the primary mineral usually isn’t iron, it is present in many varieties of this specialty water. With additional iron content in your diet, your blood circulation will improve. Iron is a critical component of red blood cell production. Thus, more iron means better oxygenation, faster healing, and better organ function throughout the body.
Mineral Water vs Water
As mentioned earlier, the primary difference between regular tap water and mineral water is the content of minerals in these waters, including iron, calcium, magnesium, potassium, and sodium, among others. While tap water isn’t always pure H20, mineral water has measurable levels of minerals in every sip. Furthermore, there is no carbonation of trapped gases in tap water, whereas the mineral variety can sometimes have carbonation or “bubbles”. Finally, since mineral water tends to be gathered from the underground source, there is a much lower chance for contamination, whereas tap water in some areas is not consumed, for fear of contamination.
Mineral Water Dangers
There are clearly many benefits to this specialized type of water, but there are some side effects, including elevated blood pressure, and the risk of plastic toxicity, cancer, and artificial sweeteners.
Hypertension: Some mineral waters are high in sodium, which could cause a rise in blood pressure, particularly in those who are already struggling to balance their electrolytes.
Plastic Toxicity: If mineral water is bottled or stored improperly, there is some risk of plastic toxicity, and while this is quite rare, it is always best to consume mineral water directly from its source, if possible.
Artificial Sweeteners: Some mineral waters are further treated or processed, and may be exposed to other chemicals or sweeteners. If you want the pure benefits of mineral water, avoid anything that has been overly processed, as this could reduce the mineral content of the water.
John Staughton is a traveling writer, editor, and publisher who earned his English and Integrative Biology degrees from the University of Illinois in Champaign, Urbana (USA). He is the co-founder of a literary journal, Sheriff Nottingham, and calls the most beautiful places in the world his office. On a perpetual journey towards the idea of home, he uses words to educate, inspire, uplift and evolve.
Rate this article
Average rating 4.2 out of 5.0 based on 54 user(s).
Sign-up for our wellness newsletter
Do you want the best of science-backed health & nutrition information in your inbox? If yes, please share your email to subscribe.
|
{
"pile_set_name": "Pile-CC"
}
|
Feminism and Religion
This survey is for the purpose of my society and culture PIP. I aim to discover whether gender equality can be fully achieved in its coexistence with religious ideologies because many of the values promoted by religious institutions contradict those of feminist movements.
* Required
|
{
"pile_set_name": "OpenWebText2"
}
|
Miryang River
The Miryang River is a tributary of the Nakdong River which flows through Miryang City. It rises in Ulsan metropolitan city, on the slopes of Gohyeonsan, and flows for 101.5 kilometers before joining the Nakdong in Miryang's Samnangjin-eup. Its narrower upper reaches are often called the Miryangcheon, or "Miryang Stream."
The Miryang River watershed covers 1,421.26 km². Important tributaries include the Cheongdocheon, flowing south from Cheongdo, and the Dongchangcheon flowing out of Gyeongju.
Most of the Miryang River valley is occupied by rice fields, but great oxbow curve which flows through downtown Miryang has long been used for recreational purposes. In addition to a riverwalk and open-air arena, the river is overlooked by the famous Yeongnamnu pavilion, which dates from the Joseon Dynasty. The Arang pavilion also overlooks the river in this area, as does the Miryang City Museum. Other nearby attractions include the Yeongnam Alps, which run along the eastern flank of the river's lower reaches.
The region just above the confluence of the Miryang and Nakdong rivers is called the Miryang Plain, 4 km wide at its widest point. This area is known for its fertile soil, and is home to numerous orchards and vegetable farms in addition to rice fields.
Notes
See also
Rivers of Korea
Geography of South Korea
Category:Rivers of South Korea
Category:Rivers of South Gyeongsang Province
Category:Miryang
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Got any questions? Give us a call
01825 765 041
Accessories
Description
Rimini Kitchen doors in Moldau Acacia
Rimini from the Bella style range will match your brief completely if minimal is how you would likely depict your interior design style. Sporting the delicate detail of chamfered corners this Rimini door will have no option but to draw the focus of anyone who visits your new kitchen area. Combined with your choice of handles and available in a wide variety of colours this stunning kitchen door is a supremely stylish way to go for any kitchen space.
If you are looking for a kitchen colouring which will appear as though it has been there forever, Moldau Acacia from our Bella colour range will be a great choice. This light wood grain has a bleached feel which offers a touch of being weather-beaten, whilst still preserving a crisp brand new appearance. Overlook limed oak - Moldau Acacia is a brand new shade which presents more depth and interest.
|
{
"pile_set_name": "Pile-CC"
}
|
[Involvement of PIWI-interacting RNAs in Cancerogenesis via the Regulation of Gene Expression].
In the past few years, a number of studies have suggested that small non-coding RNAs could be promising diagnostic, prognostic and predictive biomarkers in oncology. Recently, small RNAs interacting with PIWI proteins (piRNAs) have been described. These small RNAs regulate gene expression at transcriptional and post-transcriptional levels; however, they appear to be specifically involved in silencing the transposable elements LINE and SINE and are thus considered to contribute to genomic stability. Furthermore, piRNAs participate also in other important biological processes, such as gametogenesis, chromosome segregation, and stem cell self-renewal. Although their expression was first noted in germ line cells, they are now known to be present in all tissue types and their expression is highly tissue-specific. In addition, piRNA expression is dysregulated in tumor tissues. Nevertheless, the exact function of these molecules in cancerogenesis is not known. Recently, free circulating piRNAs were reported to be stably present in body fluids, suggesting that they could serve as promising noninvasive biomarkers to enable early diagnosis, therapy response prediction, and accurate prognosis prediction of cancer patients. The aim of this review is to summarize current knowledge about piRNA biogenesis and their functions in the regulation of gene expression and transposons silencing. In addition, the review focuses on piRNAs that show dysregulated expression in different types of cancers and that could serve as potential diagnostic biomarkers and/or therapeutic targets.Key words: PIWI-interacting RNAs - piRNA - biogenesis - cancer - transposon silencing - biomarkers - therapeutic targetsThe results of this research have been acquired within CEITEC 2020 (LQ1601) project with financial contribution made by the Ministry of Education, Youths and Sports of the Czech Republic within special support paid from the National Programme for Sustainability II funds.The authors declare they have no potential conflicts of interest concerning drugs, products, or services used in the study.The Editorial Board declares that the manuscript met the ICMJE recommendation for biomedical papers.Submitted: 23. 11. 2016Accepted: 5. 12. 2016.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Aminoethylation in model peptides reveals conditions for maximizing thiol specificity.
Control of pH in aminoethylation reactions is critical for maintaining high selectivity towards cysteine modification. Measurement of aminoethylation rate constants by liquid chromatography mass spectrometry demonstrates reaction selectivity of cysteine>>amino-terminus>>histidine. Lysine and methionine were not reactive at the conditions used. For thiol modification, the acid/base property of the gamma-thialysine residue measured by NMR results in a 1.15 decrease in pK(a) (relative to a lysine residue). NMR confirms ethylene imine is the reactive intermediate for alkylation of peptide nucleophiles with bromoethylamine. Conversion of bromoethylamine into ethylene imine prior to exposure to the target thiol, provides a reagent that promotes selectivity by allowing precise control of reaction pH. Reaction selectivity plots of relative aminoethylation rates for cysteine, histidine, and N-terminus imine demonstrate increasing alkaline conditions favors thiol modification. When applied to protein modification, the conversion of bromoethylamine into ethylene imine and buffering at alkaline pH will allow optimal cysteine residue aminoethylation.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
frontpaged not sure if i should brag on facebook or if that's weird
184 shares
|
{
"pile_set_name": "OpenWebText2"
}
|
Dive Brief:
There are 15 metro areas across the country on the verge of a housing crisis based on how their markets have performed since the housing bubble burst a decade ago, according to an analysis by 24/7 Wall St. The metro areas of Greeley, CO; Denver; Fort Collins, CO; Austin, TX; and Nashville, TN are the top five most at risk.
Home values in the 15 cities are believed to be rising too high and too quickly, at an unsustainable rate. Current median prices in these cities are at least 20% above their pre-recession peak, although some of them are 50% higher.
The analysis examined median prices in 123 metro areas. It does not claim to predict a housing bubble in certain cities, but indicators suggest that the 15 cities could be the most vulnerable to hardships if an economic slowdown occurs in the coming months.
Dive Insight:
The analysis says that year-over-year growth in home value typically is considered healthy. But problems arise and the housing market can become unstable when too much growth happens too quickly. It says in some cities the rate of home value growth could prove "disastrously unsustainable."
Home prices have risen sharply in the 15 listed cities because they're attracting new residents and have growing job sectors. But growing housing demand can bump up prices and make housing less affordable, also making an area's overall cost-of-living higher.
The 24/7 Wall St. analysis illustrates that cities of all sizes can suffer from housing affordability problems. Greeley, CO, a city of about 105,000 people but 25% population growth, topped the list and other small cities such as Provo, UT (117,000 people) were listed as well. Other analyses similarly have warned that housing affordability is no longer a problem exclusive to big cities, so small and mid-sized cities should take measures to prevent a housing market collapse.
These cities might not have anticipated rapid population growth and housing price increases and therefore might have to do catch-up on researching and implementing programs to fix the problem. But taking a regional, collaborative approach to problems that don't see borders, such as housing affordability or climate change, can help.
Leaders in Salt Lake City — a city of about 200,000 people that also made the housing crisis risk list — took that approach when they passed a housing plan in December 2017 largely focused on creating more affordable housing. They encouraged neighboring cities to do the same because Salt Lake City cannot take care of the entire region's affordable housing needs alone.
Interestingly, the analysis includes cities that are already widely considered to be experiencing a housing crisis, not on the verge of one, such as No. 15 Seattle and No. 6 San Jose, part of the notoriously high-priced Silicon Valley. Those areas are known for their rapid tech sector expansion and the housing affordability trouble that has ensued in recent years.
Being aware of the problem has led both areas to undertake mitigation measures and actively seek new ones to curb sharply rising housing prices and increase housing capacity. Last month Seattle Mayor Jenny Durkan sent affordable housing legislation to the city council for consideration, following her move in February of signing an executive order to create more affordable housing. Still, these cities' experiences show how difficult it is to get a handle on housing affordability once it goes awry.
|
{
"pile_set_name": "OpenWebText2"
}
|
By Online Desk
The #MeToo movement in India in 2018 gave confidence to millions of women to report sexual harassment, abuse and assault. While some alleged that the assaults were reported way later just to gain “publicity”, this Mumbai resident proved otherwise.
Shibani, a local resident narrated her ordeal when she went to withdraw money in a Hari Om Nagar ATM to pay to an autorickshaw driver.
“It's 3 am when I'm typing this. A man just flashed me his d*** in a f****** ATM! I had gotten down to withdraw money to pay the Rick and was I was facing problems and this guy offered to pay for it but he kept touching me, inside the ATM! I decided to record him and he...(sic),” she said in one of her posts.
While the man kept touching her inappropriately and started flashing at her, she decided to film the whole incident. In her 19-second-video she is seen saying, “You know what? How about I record you, right?…Trying to hit on me in a f****** ATM, right?”
The accused, realizing being filmed, ran away.
She later narrated the whole incident on Twitter.
panicked. Luckily there was a cop car, and I showed them the video and they followed him. I don't know if they caught him, but this experience was so scary. It's sick that a man felt that it was okay to flash me inside an atm where there are cameras! When is it going to stop? — ☆SHIBANI☆ (@shibxni) May 12, 2019
The man has been identified as Sandeep Khumbharkar, was seen crying and pleading, when an official FIR was filed against him. Thanking Mumbai Police for their timely action, Shibani wrote on Twitter that he was arrested by the police.
Taking cognizance of the incident, State Bank of India replied to her tweet applauding her for her timely act and presence of mind. They also assured her that they would look into the matter.
Chinmayi Sripada, who has been the flag-bearer of the #MeToo movement in Tamil Nadu, shared Shibani's story on her Facebook page. “Not too many women have the strength and presence of mind to record this. This is what women face in public spaces that are supposed to be safe. This happens in Chennai too, in buses, trains bus stops and elsewhere. Most women complain that no one helps even if they see this. What will you do? Well done, Shibani,” she wrote.
|
{
"pile_set_name": "OpenWebText2"
}
|
The Lure for Big Fish
The “Striper / Musky Mugger” is specifically made for casting or trolling (a real killer also when down rigging!) and comes fully rigged with four (4) high impact snap swivels and a custom made three (3) inch leader with a high impact snap swivel at the end. It has juxtaposing Willow Leaf spinner blades (two Chartreuse and two Blue) on the (4) high impact snap swivels on the outer arms and comes with a singular 6 inch shad patterned swim bait on a blue Gamakatsu jig head with a Gamakatsu hook on the three (3) inch leader.
Order Yours Today
All merchandise ordered will generally ship in five (5) business days, except during the late Spring and Summer busy season. We ship them as fast as we can make them! If items are in stock they may ship quickly.
Once your items are ready to ship, they are sent 2 day priority mail USPS. If you need something in a shorter period of time, feel free to call to check stock and estimated delivery during the late Spring and Summer busy season.
|
{
"pile_set_name": "Pile-CC"
}
|
//
// Generated by class-dump 3.5 (64 bit) (Debug version compiled Oct 15 2018 10:31:50).
//
// class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2015 by Steve Nygard.
//
#import <objc/NSObject.h>
@class NSCloudKitMirroringDelegateResetRequest, NSCloudKitMirroringDelegateSerializationRequest, NSCloudKitMirroringDelegateSetupRequest, NSCloudKitMirroringExportProgressRequest, NSCloudKitMirroringExportRequest, NSCloudKitMirroringFetchRecordsRequest, NSCloudKitMirroringImportRequest, NSCloudKitMirroringInitializeSchemaRequest, NSCloudKitMirroringRequest, NSCloudKitMirroringResetMetadataRequest, NSCloudKitMirroringResetZoneRequest;
__attribute__((visibility("hidden")))
@interface NSCloudKitMirroringRequestManager : NSObject
{
NSCloudKitMirroringImportRequest *_pendingImportRequest;
NSCloudKitMirroringExportRequest *_pendingExportRequest;
NSCloudKitMirroringDelegateSetupRequest *_pendingSetupRequest;
NSCloudKitMirroringDelegateResetRequest *_pendingDelegateResetRequest;
NSCloudKitMirroringResetZoneRequest *_pendingResetRequest;
NSCloudKitMirroringFetchRecordsRequest *_pendingFetchRecordsRequest;
NSCloudKitMirroringResetMetadataRequest *_pendingResetMetadataRequest;
NSCloudKitMirroringDelegateSerializationRequest *_pendingSerializationRequest;
NSCloudKitMirroringInitializeSchemaRequest *_pendingInitializeSchemaRequest;
NSCloudKitMirroringExportProgressRequest *_pendingExportProgressRequest;
NSCloudKitMirroringRequest *_activeRequest;
}
@property(readonly, nonatomic) NSCloudKitMirroringRequest *activeRequest; // @synthesize activeRequest=_activeRequest;
@property(readonly, nonatomic) NSCloudKitMirroringExportProgressRequest *pendingExportProgressRequest; // @synthesize pendingExportProgressRequest=_pendingExportProgressRequest;
@property(readonly, nonatomic) NSCloudKitMirroringInitializeSchemaRequest *pendingInitializeSchemaRequest; // @synthesize pendingInitializeSchemaRequest=_pendingInitializeSchemaRequest;
@property(readonly, nonatomic) NSCloudKitMirroringDelegateSerializationRequest *pendingSerializationRequest; // @synthesize pendingSerializationRequest=_pendingSerializationRequest;
@property(readonly, nonatomic) NSCloudKitMirroringResetMetadataRequest *pendingResetMetadataRequest; // @synthesize pendingResetMetadataRequest=_pendingResetMetadataRequest;
@property(readonly, nonatomic) NSCloudKitMirroringFetchRecordsRequest *pendingFetchRecordsRequest; // @synthesize pendingFetchRecordsRequest=_pendingFetchRecordsRequest;
@property(readonly, nonatomic) NSCloudKitMirroringResetZoneRequest *pendingResetRequest; // @synthesize pendingResetRequest=_pendingResetRequest;
@property(readonly, nonatomic) NSCloudKitMirroringDelegateResetRequest *pendingDelegateResetRequest; // @synthesize pendingDelegateResetRequest=_pendingDelegateResetRequest;
@property(readonly, nonatomic) NSCloudKitMirroringDelegateSetupRequest *pendingSetupRequest; // @synthesize pendingSetupRequest=_pendingSetupRequest;
@property(readonly, nonatomic) NSCloudKitMirroringExportRequest *pendingExportRequest; // @synthesize pendingExportRequest=_pendingExportRequest;
@property(readonly, nonatomic) NSCloudKitMirroringImportRequest *pendingImportRequest; // @synthesize pendingImportRequest=_pendingImportRequest;
- (id)dequeueAllPendingRequests;
- (void)requestFinished:(id)arg1;
- (id)dequeueNextRequest;
- (id)duplicateRequestErrorForRequest:(id)arg1;
- (BOOL)enqueueRequest:(id)arg1 error:(id *)arg2;
- (void)dealloc;
@end
|
{
"pile_set_name": "Github"
}
|
It wasn't as well received at the box office as the pictures that preceded it or followed it, but Peter Hunt's On Her Majesty's Secret Service is one of the finest of the James Bond movies. James Bond, portrayed here by George Lazenby (in his only performance in the role) has spent nearly two years trying to track down Ernst Stavro Blofeld (Telly Savalas), the head of SPECTRE. He has been taken off the case by his chief (Bernard Lee), an action the pushes him to the point of considering resigning from Her Majesty's Secret Service, just as he opens a possible new avenue of attack on his quarry. Whilst in the field, Bond has chanced to cross paths with the Contessa Teresa Di Vicenzo (Diana Rigg), a beautiful but desperately unhappy woman, whom he rescues from one apparent suicide attempt and an embarrassing moment at a casino gaming table -- the Contessa, who prefers to be called Tracy ("Teresa was a saint"), is the daughter of Marc Ange Draco (Gabriele Ferzetti), an industrial and construction magnate and also a crime boss, who is impressed with Bond personally as well as professionally, and would like to see him marry his daughter. Bond is, at first, unwilling to involve himself with a woman -- any woman -- on that level, but Draco's underworld contacts give Bond a vital clue to Blofeld's whereabouts that get him back on the case and hot on the man's trail. Journeying incognito to Blofeld's mountaintop retreat in the Swiss Alps, Bond finds the criminal mastermind posing as a would-be nobleman and also as a philanthropist, running a clinic devoted to the treatment and eradication of allergies. It's all a front for a surprisingly sinister (and scientifically valid) plot for international blackmail that would make any previous Bond villain quake in fear. And in the process of staying alive long enough to have a chance of stopping Blofeld, Bond discovers the Tracy is truly like no woman he's ever known before -- one special enough that he finds himself willing to give up his life as a free-living, free-loving bachelor. ~ Bruce Eder, Rovi
|
{
"pile_set_name": "Pile-CC"
}
|
Create Your Own Coin
Players will be able to create and distribute their own personalised coin.
These coins can be used to tip, make purchases, and allow cosplayers to develop deeper relationships with their fans.
|
{
"pile_set_name": "OpenWebText2"
}
|
Moving data from one company to another has been pretty taxing ever since we suddenly were faced with the missing “Duplicate” feature when first diving into Dynamics AX 2012.
For a while, we’ve been using the Data import export framework (DIEF) to export entities and import them back into other companies. That worked fairly good, but now with the Microsoft Dynamics 365 for Finance and Operations, Enterprise edition Platform update 11 we have a solution for copying directly between legal entities within a solution.
I tried the concept out on a very superficial setup as there are A LOT of parameters and entities to configure and stack in the right order. I haven’t been able to do a full implementation of it to test it out in a proper scenario, but at least the concepts are looking to be working.
It can be used for copying a company to another and starting with a fresh sheet as well as making a form of virtual data exchange. This solution can be set up to work both ways.
Here goes…
Go to the Data Management Workspace.
Select the “Copy into legal entity”.
Select a source legal entity and the target legal entities. Yes, you can copy to MULTIPLE companies from one legal entity.
Add the desired entities either multiple or one by one.
The big job is now to re-arrange the different entities so that the dependent ones are read in first. You can create Execution units and levels within these and then do a resequencing. I didn’t do that in this case and did run into some dependencies afterward, but it didn’t really matter for my exploration.
I would also guess that this will be things that can be copied in or templated, as there is a template option (maybe in LCS). There would probably be something that someone would make and share once it is first done.
After this setup, I ran the import.
Once the form was refreshed a couple of times, it finished……with some errors and dependencies that were missing.
So I looked at the staging data and quickly found that I was missing an entity. I added it and ran it again.
That did it. A successful copy of data from one legal entity DIRECTLY to another. Lovely!
Making sure tasks are performed by the right person at the right time is always a hassle and we’ve got MANY places where one could organize these types of things and some are more convenient then others. I wrote about the Data Validation Checklist a few days ago and that gave us a great tooling when it comes to running through setup and effectively navigate and keep track of the process. The nice feature of that being that you could easily navigate to the task as you could associate a task with a menu item and get right to where you needed to be to perform the task.
In the latest release of Dynamics 365 for Finance and Operations, Enterprise Edition we’ve also got a new “Business processes solution” from the HR product team which is pretty similar in nature, but has some extra features that you might like. It even got THREE work centers, which is rather superfluous and could be solved with only one with a filter function.
It is obviously meant to cover Payroll and HCM processes, but can basically be used for the same thing as the Data Validation Checklist (meaning all menu objects linked to a task can be reached). The difference being that it is not global in the solution when executing and tracking the tasks, but it is however have a personal user view and you can have a due date and offset deadlines on each tasks based on that. You are also able to execute the process multiple times.
Let us take a look at how this new feature works, how to set it up and then look at executing and tracking tasks.
Setting it up
1. Create a template
A template is a set of tasks that are to be triggered at a given time. Different tasks are then distributed based on the Assigned worker with a deadline offset to the target date.
First you create a new task. I’m creating a “Montly inventory close” business process as an example. In the Contoso demo data there is an HR Audit.
Input a name, description, template owner and calendar. The template owner will be able to create new tasks after the process has been triggered in addition to the existing template tasks. The calendar will help offset task deadlines and only focus on actual open business days.
The “Process type” is always set to the module you launch it from. I would assume that there will be other modules supported in the future.
2. Create tasks
Once the template is saved you can create the tasks.
Create a name, description, Assigned worker, contact person, offset date and a task link. Note that a task can be optional.
Task links can be either a menu item or a URL.
The instructions is a nice rich text editor that works very well.
Repeat the process until you have your complete business process.
Execution and tracking
Once a template is create it is then triggered for execution by clicking “Start Process” in the action menu.
Once the process is started the system will create a business process instance with set of task for each task in the template. The status will be set to “in progress”. A Business process instance can have different statuses (“Not Started”, “In progress”, “Completed” and “Canceled”) and you can trigger multiple instances of templates and have them running at the same time.
Anyone can view the ongoing processes in the “Business processes for HR/Payroll” work space which has a filter for each process type and has the all and overdue list, while the “My business processes” work space only shows the users tasks and the templates their responsible for.
It is also possible to create new tasks for a running business process and one can create blank templates and just fill them in as you please.
The users will be able to view their assigned tasks in the “My Business Processes” work space. They can view details, change status (In progress, Completed, Canceled) and reassign the task to other workers.
Once all tasks are completed the business process instance is still set to “in progress” and you would have to mark the instance and click the “edit” button where you could change the status of the business process instance to complete.
Summary
All in all a good first feature release, but I would hope that they would move a bit closer to how other features are developed. I mean that they have relied too much on the work centers for access to data, where the work centers are used instead of feature oriented forms. I couldn’t easily find a form that showed me all tasks except in the work centers. They should quickly remove two of the work centers and add a possibility to navigate to a form instead. Also a related links in the work spaces to get to the configuration and some statistics for each task would be preferable…
I’m also missing some features that I hope will be implemented in the future. Like task dependencies and also a more role based approach among other things. Assigning templates to defaulted workers could give some headache and is a killer when moving between companies.
I am hoping this will in time also bleed in to the other task handling systems in the solution like the case management and more.
In the latest release of Dynamics 365 for Finance and Operations, Enterprise Edition there is now a check list feature for creating new setup in the system. It lets you enter a set of tasks within a configuration area and attach a menu item link for each task. Then you select the companies that this falls under and the task is then duplicated for each company and you can select the performing user for each particular company task.
I noticed the feature as it has its own Workspace and it isn’t to hard to understand, so let me run you through it real quick.
Opening up the workspace you’re faced with a page which shows you a task overview for a given DVC project.
If you tick the Project dropdown in the Contoso demo database there is already a project present which clearly shows the intent of the solution, but I’ll create one from scratch to run you through it.
Setting it up
1. Create a new DVC Project
You create a new and can copy from an existing project and select what data you want copied.
Scroll all the way to the right in the workspace and click the “Configure data validation project” link in the “Related links”.
2. Create Task areas
First create the Task Areas you need. Note that the Task Areas are global and shared between all projects. You can create multiple areas for different processes, but all will appear in this list eventually.
3. Select your Legal entities
Select the required legal entities you want to configure. You can do this later also.
4. Create your task
Add a task description, then a task area and select your menu item from the drop down tree.
The display order will let you reorganize your tasks afterwards. You can have as many numbers as you want (pretty much). It will sort numerically, so 20 comes before 100. If you want to have a 2, 20, 200 type hierarchy… It won’t work.
5. Assign resource
If you’ve added companies you can attach an employee to the task for each company selected for the Project
6. Add an attachment
You can add attachments for each company task. This is great for spreadsheets of data or other type of documents that shows what data to control against. Just click the Attachments action menu item. Once attached the binder icon will show up (green arrow).
You can add any type of attachement that is defined in the document type settings. Just click new and add it.
That basically covers the setup.
Using it
Using the feature as an end user isn’t all that intuitive. I would love to see these tasks be created as other general tasks in the system and the user can work with them as any other task. I couldn’t find out how, so if you do… please let me know.
1. Set to “in progress”
You would have to go to the task and click “Edit Task”. That opens up a dialogue box where you can select a individual company task (even if it already had that context from the table) and set a new status on it.
You can select an “Assigned to” person when doing this if it is not already assigned.
After changing the status to “In progress” for the company you would click the task name. This will open the assigned menu item and the person can perform the work.
2. Close the task
After completing the task the person can either assign a new person for control purposes or close the task. The same procedure as before will be used and select “Completed”.
The overview screen will update with the completed and in progress statuses and you’ll have a nice overview of the progression.
I think this is an awesome feature that is pretty handy to have on board and I believe that it will be improved slightly over time to be more user friendly.
I’m hoping for a “my tasks” view, but you could of cause create that yourself.
Going to a conference might look like a costly affair with attendance, travel and hotel expenses as well as being away from work with other covering the work load and missed opportunities.
However in n my experience it is what you make of it yourself. Sending someone that is hungry for information and is willing to strike up a conversation with a stranger will give you great benefits from joining a conference like Summit. In fact I would argue that it pays of many times over if you take advantage of the opportunities.
Resources at the conference
The many sessions should give you a lot of new information and inspiration to do more. Speakers will most likely have Q&A and hope you will interact with them. They also remain after their sessions so you can ask them one to one or give you their contact information, so you can get in contact with them after the conference. Use them! They want to help.
Summit has a bunch of other interaction events like round tables and let’s you hook up with other customers or partners for a talk through their portals or through different chapters. I know that Mike Ehrenberg and the rest of the executives had many sessions with customers to get direct feedback. That is a MAJOR opportunity to directly influence the direction of the product.
The MVPs at the AXUG Medic station
The MVPs that where stationed at the Medics desk and we didn’t really see that much traffic, but for those who came to have their questions answered got good help. I had a very nice lady that came back day after day, going back to her co-workers each day for more questions that needed answering and returning for a new round.
After a conference day
Many of the implementation partners and most larger ISVs have social events with their customers and other partners. This is a great way to tie closer bonds with them and talk about the products.
I observed one customer get half an hour with one of the Microsoft program managers to get the very best answers to future strategies on warehouse management implementations for the business. That is some great value and probably covered the travel in itself.
Also the bar at the hotel (if you selected one of the hotels suggested by the event) will probably let you get in contact with some other attendees in a social setting.
Bottom line
Use time to join the sessions you find interesting, but also find time to roam the ISV booths. Interact with other attendees, strike up a chat and exchange business cards. Join the user group events and get to know other partners and users by being social and open to meet new people. You’ll get your moneys worth!
If you have a suggestion for improvement or changes for Dynamics you can go to the new Ideas page and get to know the solution better. You can also go here to browse suggestions and vote them up to get the improvements that are important to YOU up on the agenda. This is a preliminary work list that actually makes it to the product. So go get your voice heard and make the application move in your direction.
The awesomeness of the HTML5 client is apparent, but it might be even clearer if you know a bit on how the URL parameters work as well. These can be used to further enhance your user experience and extend the usage of the web client.
URL parameters are additional commands you can send in the URL and can be used to affect the way the web application works. It is placed at the end of the URL string after the ? (question mark) character and each parameter is separated by an & (and) character. The parameter can be given an attribute or value and that is separated by the = (equals) character. Giving you a structure like so:
cmp=[legal entity]
You can set a default company that the user defaults to at User Options > Preferences > Startup > Company. Use this URL parameter to override this and directly access a legal entity. If you use many companies it will be easy to create shortcuts for each company for quick access.
Note: This parameter is visualized by default in the URL.
lng=[language]
You can set a default user language under User Options > Preferences > Language and country/region preferences > Language. However if you like to open the solution in another language, use this URL parameter. Great if you’re doing user training and support, work with different companies in their native languages or if you are doing a demo.
mi=[menuItem]
Use this to go directly to any of the forms in the solution. Based on your user settings you either go to DefaultDashboard, SystemAdministrationWorkspace, EssentialsDashboard or HcmEmployeeSelfServiceWorkspace. This can take you to any for like SalesTable, CustTable and so on…
Note: This parameter is visualized by default in the URL and it is easy to copy it for future use.
hideSplash=true
Want to skip the splash screen? Use that. Looks like it shaves of a millisecond or two, so it isn’t that much faster. It does however look slightly cleaner from my standpoint.
theme=[ThemeID]
The theme ID is the number of the color palette given in the user setup. This is awesome when combined with the “cmp” URL parameter. Gives you a sense of what company you’ve launched, but be aware that you can change company at any time.
limitednav=true
If you’re afraid you might accidentally navigate to a form you shouldn’t be in, you can use the “limitednav” URL parameter to minimize this risk. This parameter takes all navigation possibilities away.
density={21,30}
Working on both tablet and on a computer? There are two different types of grid density in the solution. High(21) and low(30). Select your pixel density by using this URL parameter. This is the same as selecting a different grid density in the user options.
Example: &density=21 is best suited for desktop and &density=30 is best suited for tablet/touch.
prt=[partitionID]
If you have a solution that is partitioned you can use this to quickly going to the right one. The feature is deprecated, but still works. For instance the Contoso database Public sector partition can be accessed by writing: prt=ps. You can get an overview of the partition by entering f=PartitionAdministration (replacing the mi parameter). Note that partitions have their own user access, so you would initially access it with the system master user. Thanks to Ievgen for pointing this out.
f=[formName]
Some forms doesn’t have menu items. Like “SysTableBrowser” *, “jmgClock”, “WHSWorkExecute” and “jmgWorkPlanner”. These are some forms that are in the system, but isn’t accessible through the menus. This replaces the “mi” parameter.
* Requires also to use the parameter tableName=[TableID]
q=[queryString]
If you activate the “URL manipulation” parameter under your User settings > Preferences, you’ll find that when doing a filter or record lookup you’ll get a query string directly in your URL. I assume that this is the query string that is created by the deep links generator. This is described in the Operations Wiki.https://ax.help.dynamics.com/en/wiki/how-to-create-and-use-deep-links/
Mode={trial,mobile}
The mode selector does access features that you might otherwise not have access to. The “trial” attribute starts a trial experience and the “mobile” attribute gives the user access to the mobile application builder feature.
debug=develop
This gives you the opportunity to debug the application directly in the web client. It gives you a little indicator right next to the legal entity (company) selector on the top menu bar and clicking it gives you details on the client performance.
That is the list so far. This will give to the opportunity to create direct access to the form and information you need quickly and give a better user experience. I can see great benefit in a multi company solutions.
What URL parameters do you know about that isn’t on this list?
I just got my copy of the new Scott Hamilton book! Look at how happy I am!
It is an in-depth master piece that covers all the functionality from the basics to the advanced. Organized and written in a way that everyone with basic knowledge of the subject matter and ERP can digest it. It covers all the different type of manufacturing scenarios (Discrete, Project, Process and Lean) and has a great deal of case studies that are informative and might even solve many of your known and unknown issues.
This is the go-to book for any company that is using Master planning functionality. If you’re a customer, user or partner of Dynamics AX2012 or Dynamics 365 for Operations, then you should go get this book ASAP. You’ll probably save the cost after the second chapter (As the first is the introduction)…
It will deepen the understanding of the features for people that are already up and running on the system as well as work as a reference guide. And it is a great companion and a must-read to people doing an implementation or want to simply learn the solution.
As there are many time and attendance solutions that have specialized terminal equipment available, the Dynamics AX solutions might seem like a step back in user friendliness. A way to improve the experience for end users is to launch the terminal window directly when the terminal is turned on, so they don’t need to launch the window separately.
Dynamics 365 for Operations
For Dynamics 365 for Operations it is easy to just launch the URL with the right attributes in the browser to full screen. Use either mi=JmgRegistrationJobQueue for the job card terminal or mi=JmgRegistrationTouch for the job card device and add &limitednav=true on the end to restrict navigation access.
Go to the terminal setup (Production control > Setup > Manufacturing Execution > Configure job card Terminal or Configure job card for Devices) and add the user to log in directly. On the terminal you can turn off the “prompt for production area” to further limit the interaction.
Put the shortcut in the windows “Start up” folder. An example of the shortcut could be:
A panel full of Microsoft Business Solutions MVPs today. André Arnaud de Calavon and Sohaib Cheema joins us to talk about the importance of knowing security basics. We get in to some deep dive discussions into the in details and issues with managing security and licensing both for Dynamics 365 for Operations and Dynamics AX 2012.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Kullback-Leibler divergence and mixture distributions
Let's say I have three probability densities, $h, g$, and $f$, where f is a weighted mixture of h and g, i.e.,
$$ f(x) = w\,h(x) + (1-w)\,g(x) $$
For simplicity, let's assume all densities share the same support.
Now, it seems reasonable to expect that if, say, $h$ is the "true" density, then the Kullback-Leibler divergence (KL) between $f$ and $h$ should be smaller than KL between $g$ and $h$, i.e.,
$$ KL(f,h) \leq KL(g,h) $$
as $|f(x) - h(x)| \leq |g(x) - h(x)|$ everywhere.
However, I have no idea how to prove this, and would be very happy about any suggestions (or suggestions why my intuition might be wrong).
Thanks in advance!
A:
It just came to my mind that this follows immediately from the convexity of KL divergence. It's hard to find info about it on the web, but page 6 here
http://camo.ici.ro/journal/vol11/v11d15.pdf
describes everything you need in terms of discrete relative entropy $D_\text{KL}$ (the very same concept).
In your case,
\begin{align*}
\text{KL}(h,f)
&= \text{KL}(w \cdot h + (1-w) \cdot h, \ w \cdot h + (1-w) \cdot g) \\
&\leq w \cdot \text{KL}(h,h) + (1-w) \cdot \text{KL}(h,g)
= (1-w) \cdot \text{KL}(h,g)
\end{align*}
and summarized
$$\text{KL}(h,f) \leq(1-w) \cdot \text{KL}(h,g)$$
which is an even stronger inequality than what you asked for.
My previous text: Not a full answer but my thoughts.
So you want to show
$$\text{KL}(h,f) \leq \text{KL}(h,g)$$
or rather
$$\int_\mathbb{R} h(x) \log \frac{h(x)}{w \ h(x) + (1-w)g(x)} dx
\leq \int_\mathbb{R} h(x) \log \frac{h(x)}{g(x)} dx$$
\begin{align*}
0 &\leq \int_\mathbb{R} h(x) \log \frac{w \ h(x) + (1-w)g(x)}{g(x)} dx \\
0 &\leq \int_\mathbb{R} h(x) \log\left(1-w + w\frac{h(x)}{g(x)}\right) dx
\end{align*}
Now this cannot be easy to show directly because the proof for positivity of KL-divergence (a.k.a. relative entropy) between distributions is already quite long and tricky. You could carefully read proofs of said theorem and try to adapt them to the problem at hand.
Alternatively, you could rewrite the above to
\begin{align*}
0 &\leq \int_\mathbb{R} h(x) \log \frac{h(x)}{a_w(x)} dx = \text{KL}(h,a_w)
\end{align*}
with
$$a_w(x) := \frac{1}{\frac{w}{g(x)} + \frac{1-w}{h(x)}} \ .$$
If you can show that $a_w(x)$ is a probability distribution $\forall w \in [0,1]$ (maybe it isn't, I don't know), then $0 \leq \text{KL}(h,a_w)$ and you're done.
|
{
"pile_set_name": "StackExchange"
}
|
The laboratory method as a variable in the diagnosis of hyperbilirubinemia.
Algorithms based on fractionation of bilirubin into direct-reacting and indirect-reacting fractions by diazo methods are frequently utilized for investigation of hyperbilirubinemia. Unfortunately, direct-reacting and indirect-reacting fractions do not correspond precisely with conjugated and unconjugated pigment. Advances in analytical methods allow accurate quantitation of the individual fractions of bilirubin in serum. Three cases of hyperbilirubinemia are presented in which bilirubin fractionation by diazo methods suggested an erroneous diagnosis. Analysis of the serum samples by high-performance liquid chromatography for bilirubin conjugates confirmed the correct clinical diagnosis. Diazo methods for bilirubin analysis are subject to marked discrepancies. While the new methodology utilizing high-performance liquid chromatography is not practical for routine bilirubin analysis, optimization of diazo methods utilizing rigid and meticulous protocol is suggested. Laboratories performing diazo bilirubin determinations should correlate their results with those of other laboratories and clinical data. Clinicians need to be aware of the reliability of a particular test result before embarking on a lengthy and expensive evaluation.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Divisions of the Australian House of Representatives
In Australia, electoral districts for the Australian House of Representatives are called divisions or more commonly referred to as electorates or seats. There are currently 151 single-member electorates for the Australian House of Representatives.
Constitutional and legal requirements
Section 24 of the Constitution of Australia requires that the total number of members of the Australian House of Representatives shall be "as nearly as practicable" twice as many as the number of members of the Australian Senate. The section also requires that electorates be apportioned among the states in proportion to their respective populations; provided that each original state has at least 5 members in the House of Representatives, a provision that has given Tasmania higher representation than its population would justify. There are also three electorates in the Australian Capital Territory and two in the Northern Territory.
In addition, Section 29 forbids electorate boundaries from crossing state lines, forcing populated areas along state and territory borders to be placed in different electorates, such as Albury in New South Wales being part of the electorate of Farrer, while nearby Wodonga in Victoria is part of the electorate of Indi. The same restriction does not apply to territories, and several current electoral divisions incorporate electors from multiple territories. This is currently the case for the Division of Bean (covering part of the ACT and the whole of Norfolk Island), the Division of Fenner (covering part of the ACT and the whole of Jervis Bay Territory), and the Division of Lingiari (covering part of the Northern Territory and the whole of Christmas Island and Cocos (Keeling) Islands).
The Commonwealth Electoral Act 1918 sets out further provisions.
Apportionment
The Australian Electoral Commission (AEC) determines from time to time the number of members to which each state and territory is entitled and the boundaries of each electorate, in a process known in Australia as redistribution.
Within each state and territory, electoral boundaries are redrawn from time to time. This takes place at least once every 7 years, or when the state's entitlement to the number of members of the House of Representatives changes. Boundaries are drawn by a Redistribution Committee, and apportionment within a state is on the basis of the number of enrolled voters rather than total residents or "population".
The number of enrolled voters in each division cannot vary by more than 10% from the average across a state or territory, nor can the number of voters vary by more than 3.5% from the average projected enrolment 3.5 years into the future. However, due to various reasons, larger seats like Cowper (New South Wales) contain 80% more electors than that of smaller seats like Solomon (Northern Territory).
The last redistribution was completed in 2018, in time for the 2019 federal election. In this redistribution, the AEC added a seat to Victoria and the Australian Capital Territory, and also determined that South Australia would lose a seat. The total number of seats in the House of Representatives therefore increased to 151. Seats in Victoria, Tasmania and South Australia were also abolished, in order to make way for seats in similar locations but with different names.
Naming
The Divisions of the House of Representatives are unusual in that many of them are not named after geographical features or numbered, as is the case in most other legislatures around the world. Most Divisions are named in honour of prominent historical people, such as former politicians (often Prime Ministers), explorers, artists and engineers.
In some cases where a Division is named after a geographical locality, the connection to that locality is sometimes tenuous. For instance, the Division of Werriwa, created in 1901, was named after the Aboriginal word for Lake George in the Canberra region. However, Werriwa has not contained Lake George for many decades, and has steadily moved some 200 km north to the south-western suburbs of Sydney over the past century.
List of Divisions in 2019
The lists below show the Divisions as they exist at the 2019 Australian federal election.
New South Wales
There are 47 Divisions in New South Wales:
Victoria
There are 38 Divisions in Victoria:
Queensland
There are 30 Divisions in Queensland:
Western Australia
There are 16 Divisions in Western Australia:
South Australia
There are 10 Divisions in South Australia:
Tasmania
There are 5 Divisions in Tasmania:
Australian Capital Territory
There are 3 Divisions in the Australian Capital Territory:
Northern Territory
There are 2 Divisions in the Northern Territory:
Abolished divisions
These Australian Divisions no longer exist:
Angas (1903–34) (SA)
Angas (1949–77) (SA)
Australian Capital Territory (1949–74) (ACT)
Balaclava (1901–84) (VIC)
Barrier (1901–22) (NSW)
Batman (1906–2019) (VIC)
Bland (1901–06) (NSW)
Bonython (1955–2004) (SA)
Bourke (1901–49) (VIC)
Burke (1949–55) (VIC)
Burke (1969–2004) (VIC)
Canobolas (1901–06) (NSW)
Charlton (1984–2016) (NSW)
Cook (1906–55) (NSW)
Coolgardie (1901–13) (WA)
Corinella (1901–06) (VIC)
Corinella (1990–96) (VIC)
Dalley (1901–69) (NSW)
Dampier (1913–22) (WA)
Darebin (1949–69) (VIC)
Darling (1901–77) (NSW)
Darling Downs (1901–84) (QLD)
Darwin (1903–55) (TAS)
Denison (1903–2019) (TAS)
Diamond Valley (1969–84) (VIC)
Dundas (1977–93) (NSW)
East Sydney (1901–69) (NSW)
Echuca (1901–37) (VIC)
Evans (1949–77) (NSW)
Fawkner (1906–69) (VIC)
Fraser (1974–2016) (ACT)
Grampians (1901–22) (VIC)
Gwydir (1901–2007) (NSW)
Hawker (1969–93) (SA)
Henty (1913–90) (VIC)
Higinbotham (1949–69) (VIC)
Hoddle (1949–55) (VIC)
Illawarra (1901–22) (NSW)
Isaacs (1949–69) (VIC)
Kalgoorlie (1901–2010) (WA)
Laanecoorie (1901–13) (VIC)
Lang (1901–77) (NSW)
Lawson (1949–69) (NSW)
Lowe (1949–2010) (NSW)
Martin (1922–55) (NSW)
McMillan (1949–2019) (VIC)
Melbourne Ports (1901–2019) (VIC)
Mernda (1901–13) (VIC)
Moira (1901–06) (VIC)
Murray (1949–2019) (VIC)
Namadgi (1996–98) (ACT)
Nepean (1906–22) (NSW)
Northern Melbourne (1901–06) (VIC)
Northern Territory (1922–2001) (NT)
Oxley (1901–34) (QLD)
Parkes (1901–69) (NSW)
Phillip (1949–93) (NSW)
Port Adelaide (1949–2019) (SA)
Prospect (1969–2010) (NSW)
Riverina-Darling (1984–93) (NSW)
Scullin (1955–69) (VIC)
South Australia (1901–03) (SA)
South Sydney (1901–34) (NSW)
Southern Melbourne (1901–06) (VIC)
St George (1949–93) (NSW)
Streeton (1984–90) (VIC)
Tasmania (1901–03) (TAS)
Throsby (1984–2016) (NSW)
Wakefield (1903–2019) (SA)
Watson (1934–69) (NSW)
West Sydney (1901–69) (NSW)
Wilmot (1903–84) (TAS)
Wimmera (1901–77) (VIC)
Yarra (1901–69) (VIC)
See also
List of members of the Australian House of Representatives
Australian electoral system
External links
Adam Carr's Electoral Archive: Index of House of Representatives Divisions 1901–2001
References
Category:Politics of Australia
Category:Subdivisions of Australia
Australia
Category:Australia politics-related lists
Category:Australian House of Representatives
|
{
"pile_set_name": "Wikipedia (en)"
}
|
A San Francisco transit janitor who earned more than $250,000 in one year, was caught hiding for several hours in a closet not working.
Liang Zhao Zhang, earned $57,945 in 2015 for cleaning San Francisco's Powell Street station.
But public records released by Transparent California, show that Zhang also made an additional $162,050 in overtime, bringing his total salary and benefits that year to $271,243, according to an investigation by KTVU.
Zhang's timecard data showed that he worked every day in 2015, and most days he worked overtime.
BART paid Zhang for working 17-hour days for 18 days straight in July 2015, according to the station.
San Francisco transit janitor, Liang Zhao Zhang, who earned more than $250,000 in one year, was caught hiding for several hours in a closet not working. He made $57,945 in 2015 for cleaning San Francisco's Powell Street station and an additional $160,000 in overtime
Zhang's timecard data showed that he worked every day in 2015, and most days he worked overtime. BART paid Zhang (pictured) for working 17-hour days for 18 days straight in July 2015
On the first day, Zhang appeared to go into the closet twice, for 54 minutes and 90 minutes. And on the second day, he spent 90 minutes in the closet in the afternoon, and 78 minutes later that evening
He also used some days of paid vacation and holidays in order to get paid for 365 days that year.
Over a two-day period, surveillance video from BART's security cameras, showed Zhang working and completing his daily to-do list, but it also showed him disappearing inside a storage closet for hours at a time, according to the station.
On the first day, Zhang appeared to go into the closet twice, for 54 minutes and 90 minutes. And on the second day, he spent 90 minutes in the closet in the afternoon, and 78 minutes later that evening.
BART has never investigated Zhang's time cards, despite him earning more than $705,000 between 2012 and 2015.
'It's absolutely outrageous,' Robert Fellner, with Transparent California, told KTVU. 'For Janitors that's obscene! It's unconscionable!'
However, there is an explanation, according to BART's Chief Transportation Officer Roy Aguilera.
Aguilera told KTVU that it was possible for Zhang to work that many hours because he never refuses extra work and picks up the overtime hours offered.
According to Aguilera, there is a large population of homeless people spend time in the Powell Street station, which means the janitorial staff spends much of their time cleaning up urine, feces, and needles.
BART has never investigated Zhang's time cards, despite him earning more than $705,000 between 2012 and 2015
BART administration says that Zhang's direct supervisor approved all his timesheets and overtime, and they insist he is one of their best employees
'People are not raising their hands and saying, "I want some of that overtime." Mr. Zhang has said yes, he's worked hard, he's completed his assignments, so I stand by the work he's done,' Aguilera told KTVU.
Over a two-month period, Zhang failed to clock in or out to verify his hours three times.
BART General Manager Grace Crunican said she wasn't aware of those discrepancies.
'Well, this piece is news to me, yes that would be concerning if we had an examination with the supervisor and there wasn't a good reason for that.'
Crunican told KTVU that she does not believe, based on the information she's seen, that Zhang's high pay and time sheet warrants an audit.
'We've increased the staffing two years in a row, we've reduced the overtime this past year,' she said, 'we've reduced the number of hours for overtime.'
Another 49 BART janitors who earned more than $100,000 in 2015, were not investigated or audited by the company, according to KTVU's investigation.
The agency's spokesperson, Alicia Trost, told the station in an email that there is no future audit being considering after even after the investigation.
BART administration says that Zhang's supervisor approved all of his timesheets and overtime. They also insist that he's one of their employees.
|
{
"pile_set_name": "OpenWebText2"
}
|
Links
Images
Classifications
G—PHYSICS
G06—COMPUTING; CALCULATING; COUNTING
G06F—ELECTRICAL DIGITAL DATA PROCESSING
G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
G06F3/16—Sound input; Sound output
Abstract
The present invention relates to an improved voice control system which is designed to be adaptable to existing computers so that the existing computers may be operated through the use of voice commands. In the preferred embodiment, the present invention is connected into the existing keyboard control means and the computer itself with the system including a priority switch controlled by software giving the keyboard priority over voice entries so that the keyboard may still be used even with the present invention connected into the circuit. In the preferred embodiment, voice commands are utilized so that the existing hardware with existing software incorporated therewith may be effectively operated in a foolproof manner. The present invention uses existing voice recognition chip technology and existing speech synthesizer chip technology in a new and unique way.
Description
BACKGROUND OF THE INVENTION
The present invention relates to an improved voice control system. In the prior art, systems are known which incorporate therewith voice recognition and speech synthesizer chip technology. However, to Applicant's knowledge, none of the prior art, taken either alone or in combination teaches a system which utilizes such technology in the manner contemplated by applicant. The following prior art is known to applicant:
U.S. Pat. No. 3,928,724 to Byrum, et al. discloses a voice actuated telephone directory assistance system designed to interface with the telephone wherein the user spells the name letter by letter that the user wishes to call and a voice recognition device connected with a computer recognizes the name of the person as spelled out, finds the number and audibly gives it to the user. This system is significantly different from the teachings of the present invention for many reasons including the fact that patented system does not interface between a keyboard and the computer itself, the patented system does not include a way to be preprogrammed for commands which would be utilized to operate existing software packages, the patented system does not work with storage and down loading from the existing computer's diskette to RAM storage, the patented system does not have routines in a ROM memory in order to select program commands and so as to interface with the computer via the keyboard input port and down load program from diskette to RAM memory via the keyboard port, the system requires the user to spell a name one letter at a time whereas the present invention acts to respond to spoken words, and also, the patented system does not have any ability to be "trained" to respond to entire words.
U.S. Pat. No. 4,292,470 to An discloses an audio signal recognition computer which includes a mode wherein the system is trained to recognize the voice of the user. The system includes a switching device which switches the system between the training circuit for a recognizer circuit wherein data which has been trained into the device can be recognized thereby. This system is significantly different from the present invention because the present invention is not a voice recognition system per se, but rather is a system which is electrically connected between a computer and the associated keyboard so as to provide the option of using voice commands combined with keyboard input for specific programs while retaining the option of utilizing the keyboard directly. While the present invention may utilize the electronics of this patent, the present invention uses them in a vastly different and improved way.
U.S. Pat. No. 4,388,495 to Hitchcock discloses a speech recognition microcomputer which is designated to be independent of a particular user and which identifies vowel-like fricative-like and silence signal states within a word or phrase so as to recognize a preprogrammed vocabulary. This invention utilizes templates defining the limited vocabulary with which the device may be operated with the limited vocabulary stored in the microcomputer memory. This system, while slightly improving upon the teachings of An as described hereinabove, is still significantly different from the present invention for the same reasons as set forth above regarding An. Further, it is noted that the present invention is distinct from this patent because the words which are programmed into the system in accordance with the present invention are specifically chosen so as to comprise commands to operate existing software packages.
U.S. Pat. No. 4,449,233 to Brantingham discloses a speech synthesis system with parameter lookup table which uses preprogrammed speech synthesis responses which correspond to the user's keyboard input. The system comprises a self-contained educational system but is significantly different from the teachings of the present invention because the patented device is not designed nor intended to be utilized with existing preprogrammed computer software so as to comprise commands to operate such software. Also, the patented system does not include any voice recognition capabilities.
U.S. Pat. No. 4,462,080 to Johnstone, et al. discloses a voice actuated machine control device which may be utilized so as to operate a machine tool through voice commands inputted into a microphone which are transmitted into a logic circuit. The device includes structure for interpreting commands received from the operator which structure feeds these commands to a machine tool control system which, responsive to the commands, operates the machine. The present invention is significantly different from the teachings of this patent for many reasons. Firstly, in the present invention, the inventive system is electrically connected between the keyboard and the computer of an existing system whereas this is not the case with the patented invention. Further, the present invention may be programmed to respond to a number of commands to operate existing computer software programs which is not contemplated in the patent. Further, the present invention may be preprogrammed to guide the user to train the system for the exact commands which are desired. Such is not the case in the patent. Additionally, in the present invention, voice commands are given to the computer as if they were keyboard inputs or alternatively, keyboard inputs may be used to provide the exact same commands. Other differences exist but it is believed that the above-described differences are sufficient to demonstrate that the present invention is distinct from the teachings of this patent.
Publication entitled "Key Tronic Speech Recognition in a Keyboard Peripheral" discloses a speech recognition keyboard including the speech recognition circuitry built into the keyboard itself so that if one wishes to use this device, one must replace the existing keyboard with the Key Tronic keyboard. This is different from the teachings of the present invention wherein the present invention is merely incorporated into the circuitry between the existing keyboard and computer and operates in a manner so that the keyboard functions are maintained in a superior hierarchy to the voice recognition functions so that the user may either utilize the voice recognition functions or the keyboard, whichever is desired.
Further, the Key Tronic device includes an applications mode wherein the keyboard and speech recognition unit act independently of the host computer and the host computer requires a bidirectional link during the time that the speech pattern is up loaded and down loaded. The system further includes a set-up mode which may be initiated by running a voice utility program on the host computer. This program sends various commands to the Key Tronic Keyboard and receives responses back. While in the set up mode, the user may create a vocabulary, train a vocabulary, test a vocabulary and up load/down load a vocabulary. Other aspects of the Key Tronic device should be self-evident. The Key Tronic device is significantly different from the teachings of the present invention because the present invention is easily operated merely by pressing function keys, the present invention is preprogrammed to function so as to transmit commands for specific pre-existing software programs, the present invention's training is preprogrammed, the present invention does not require replacing the keyboard but operates in conjunction with the existing keyboard and further, the present invention does not include an application program in the computer's RAM memory since everything is controlled from the ROM memory of the inventive system, thus, avoiding the necessity for the user to think.
Publication entitled "IntroVoice III, Speech recognition in an Enhanced IBM Keyboard" discloses a system quite similar to the Key Tronic system and as such is distinct from the teachings of the present invention for the same reasons as set forth hereinabove concerning the Key Tronic system.
Other voice recognition systems are known to Applicant. These systems are (1) the Vocalink Model SRB Speech Recognition Board, (2) the NEC SR-100 Voice Input Terminal, and (3) the Micromint Lis'ner 1000 Voice Recognition and Synthesis Board. Each of these systems is distinct from the present invention in that each system needs a board which is to be plugged into a computer slot in a similar manner to an input slot inside an IBM personal computer. Thus, the computer will therefore have one less slot available for other uses and further the computer will need a utility program to run in the personal computer's RAM memory in order to direct input from the specific slot, to be treated as a keyboard input. This results in the personal computer's RAM memory being at all times occupied by this utility program which means that the system cannot run programs which require this RAM memory space. These systems, additionally, are different from the present invention in that (1) in each case, a board is needed to be inserted into a slot in the computer, (2) none of the systems has preprogrammed set-ups for a specific program, (3) none of the systems may be operated by merely pressing function keys, (4) each of the systems requires an application program to reside in the computer's RAM memory at all times, (5) none of the systems utilizes a preprogrammed training mode to train the computer to receive selected commands, and (6) none of the systems up loads and down loads over the keyboard input port.
Accordingly, a need has developed for improved voice control systems which may be simply incorporated into an existing computer system, which may easily be trained and which may be used in a simple way to control a computer when using existing software packages.
SUMMARY OF THE INVENTION
Accordingly, in order to fill the needs now required in this area of technology and in order to overcome the deficiencies in the prior art devices described hereinabove, the present invention has been developed. The present invention includes the following combination of inventive features:
(a) In a first aspect of the present invention, the present invention is embodied in a system which may be easily installed in conjunction with an existing computer system including a microprocessor or computer and a keyboard inputting device. In this regard, the inventive system is incorporated in a package which may be electrically connected to the existing computer system between the keyboard inputting device and the computer or microprocessor.
(b) The present invention is intended, in the preferred embodiment, to enable the user thereof to operate existing computer disk operating systems like MS DOS™ or major software programs such as Lotus™ 1,2,3; VisiCalc™ and other known such programs. The present invention operates by enabling the user to operate these programs and operating systems through the use of voice commands, keyboard inputs or both.
(c) The present invention includes a training mode wherein the user may program their voice into the computer memory via a microphone. During the programming phase, the user speaks words which correspond to commands for operation of the software or operating systems in a predetermined sequence as preprogrammed by the computer. For example, the computer will cause the word "find" to be displayed on the associated displaying device. Then, the computer will cause the display to give an indication that the user is to speak the word "find" into the microphone. At this point, the user speaks the appropriate word into the microphone.
(d) When the word is spoken into the microphone, signals indicative of the word are received by a voice recognition chip which forms a part of the present invention. A linear predictive coding (LPC) analyzer is basically a lattice of filters that approximate a series of resonant cavities, thus simulating the vocal tract. The filter constants are sampled over the time it takes to speak the word. The unique characteristic of the spoken word is found by averaging and data compression. The result is a template representative of each word which is stored in the Voice Control System's RAM memory. This voice recognition chip is an "off-the-shelf" component which is utilized in the present invention in a new and unique way.
(e) The present invention includes a test mode wherein the user may test the quality of the templates created in the training mode. During the test phase the system will cause a command to be displayed on the screen and ask the user to say this word. If the system matches its voice recognition parameters with the word on the display, the system will give an indication that this word is correctly tested and move on to the next command. If there is no match, the system will tell the user so and ask the user to retrain this command.
(f) The present invention is preprogrammed in the preferred embodiment to include at least 64 commands for each of the desired popular software packages. These commands are stored on the system's floppy disk as templates for a common "wide user group." If the user does not choose to train the system these templates will be used.
(g) The present invention includes a control means, which is able to read the function keys on the existing keyboard. The system is turned on by holding down the function key #1 for a predetermined time. The training mode is selected
by pressing the function key #1 a second time. The existing software programs are selected by pressing the relevant function keys #2-9. The test mode is selected by pressing function key #10.
(h) The present invention has the necessary template files and command files for each of the popular software packages stored on the system's floppy disk. All the control programs reside in the system's ROM memory, which include programs to load programs from the floppy disk to the RAM memory in the system and from the system's RAM memory to the system floppy disk via the computer's keyboard input/output port.
(i) Since voice recognition systems which may be used in conjunction with the present invention have an accuracy of at least 96%, the present invention may be designed so as to be essentially foolproof. In order to ensure 100% accuracy, the present invention is preprogrammed so that the user must confirm the essential commands which have been given to the computer by saying "yes" as a confirmation before the command is undertaken. Thus, the user may speak the appropriate command, which command is then displayed on the computer display. If the displayed word corresponds to the spoken word, confirmation is given by saying "yes." If, on the other hand, the displayed word differs from the spoken word, such may also be communicated to the computer by saying "no" and the computer will then re-inquire as to the desired command.
(j) The present invention may also be utilized to move the cursor on the display. The present invention operates by enabling the user to move the cursor on the display through the use of voice commands, cursor control inputs or both. The cursor control inputs include cursor control button, the mouse, the digitizer, etc.
These and other objects, aspects and features of the present invention will be better understood from the following detailed description of the preferred embodiments when read in conjunction with the appended drawing figures.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 shows a schematic view of the present invention as connected into an existing computer system.
FIG. 2 shows a modified version of the embodiment of FIG. 1 in the situation wherein the computer system includes a "mouse."
FIG. 3 shows a block diagram of the voice control system of the present invention showing details of the microprocessor memories thereof.
FIG. 4 shows a further block diagram for the voice control system showing details of the particular components thereof.
FIGS. 5a and 5b show block diagrams of the software utilized in the present invention.
FIG. 6 shows a flow chart of the training subroutine utilized in the present invention.
FIG. 7 shows a flow chart depicting the operation of the test program of the present invention.
FIG. 8 shows a flow chart for the command subroutine of the present invention.
FIG. 9 shows a flow chart for the control program of the present invention.
FIG. 10 shows the meaning of the functions keys of the present invention.
FIG. 11 shows a flow chart for the operation of an aspect of the present invention concerning the function key #1 interrupt handler.
FIG. 12 shows a flow chart for the application program of the present invention.
FIG. 13 shows a flow chart of the operation of an aspect of the present invention concerned with the handling of voice interrupts.
FIG. 14 shows a flow chart for the operation of the cursor control program of the present invention.
SPECIFIC DESCRIPTION OF THE PREFERRED EMBODIMENTS
With reference now to FIGS. 1 and 2, the connection of the present invention into two embodiments of existing computer systems will be explained.
FIG. 1 shows in schematic form an existing computer system 10 including a keyboard 11 having function keys 13, cursor control keys 15 and other keys 17. The system 10 further includes a computer 21 including a display means 23 and a disk drive 70. The keyboard includes a connector 19 which is intended to be connected through a cable with a connector 25 in the computer 21. The present invention in FIG. 1 is designated by the reference numeral 30 and includes a housing 31 having mounted thereon a microphone 33. An on-off light 35 is provided as are connector ports 37 and 39. As seen in FIG. 1, the connector port 37 is intended to connect via a cable 41 with the port 19 on the keyboard whereas the connector portion 39 of the system 30 is intended to be connected by the cable 43 with the port 25 on the computer 21. In this way, the present invention 30 is interconnected into the existing computer system 10. The circuitry within the housing 31 is specifically designed so that the system 30 draws all of its power from the host computer system 10 and accordingly no alteration of the hardware or software of the existing system 10 is necessary. The circuitry within the housing 31 is specifically designed so that with the system 30 connected into the existing system 10, the user is still able to use the keyboard as an entry form. A priority switch (not shown) gives the keyboard the priority over the voice entry, the on-off light 35 is off when the voice entry is not used, and on when the voice entry is used. Thus, the keyboard may be used as if the system 30 were never connected into the system 10. Thus, the user may use the keys 13, 15 and 17 in the keyboard to move the cursor on the computer screen, change functions and give other commands to the computer or, if the user desires, the user may utilize voice commands via the microphone 33 to perform these functions.
Reference is now made to FIG. 2 wherein like elements and structure are given like primed reference numerals. As seen in FIG. 2, the system 10' includes a keyboard 11' having keys 13', and 17' thereon. The keyboard further has a port 19' which in the original state is connected to a connector port 25' in the computer 21' through a cable (not shown). The computer 21' also includes a display 23', a disk drive 70', and a mouse port 27 which is provided for connection with a mouse 51 as is well known in the art. The inventive system 30'includes a housing 31', connector ports 37' and 39', an on-off light 35', a microphone 33' mounted thereon and further ports 36 and 38 for a purpose to be described hereinafter. In a similar fashion to the embodiment of FIG. 1, when the system 30' is incorporated into the system 10' the ports 19' and 37' are interconnected cable 41', and the ports 39' and 25 are interconnected together by the cable 43'.
As seen in FIG. 2, as stated above, the system 10' includes a mouse 51. In order to connect the system 30' into the system 10', port 36 on the housing 31' is provided to connect with the mouse 51 via the cable 53. Further, the port 38 on the housing 31' is provided to interconnect the system 30' with the original mouse port 27 via the cable 55. Thus, the ports 36 and 38 are provided so as to enable the interconnection of the mouse 51 into the circuit including the original system 10' and the present invention 30'. The mouse 51 can be used to move the cursor on the display 23' as if the system 30' was not connected to the system 10'.
FIG. 3 shows a schematic depiction of the present invention in functional form. Some of the reference numerals in FIG. 3 correspond to those set forth in FIGS. 1 and 2 and other reference numerals in FIG. 3 not shown in FIGS. 1 and 2 depict structure not shown in FIGS. 1 and 2.
FIG. 3 shows the computer 21, the keyboard 11, a keyboard switch 14 which interfaces the keyboard and computer, a cursor control device 16, a cursor control device switch 18 which interfaces the cursor control device 15 with the computer 21, add the inventive system 30.
As seen in FIG. 3, the system 30 includes a microprocessor 42, a read only memory (ROM) 44 associated with the microprocessor 42, a random access memory (RAM) 46 associated with the microprocessor 42, the microphone 33 as seen in FIGS. 1 and 2, a voice recognizer chip 48 interposed between the microphone 33 and the microprocessor 42, a speaker 52 and a speech synthesizer chip 54 interposed between the speaker 52 and the microprocessor 42. As should be understood from FIG. 3, the control program in the read only memory 44 is provided to (1) load and run training files from the floppy disk, (2) load command files from the floppy disk and save them on the random access memory 46 of the system 30, (3) save trained templates on the floppy disk, (4) load templates from the floppy disk and save them on the RAM memory, (5) read the function keys and (6) control the computer's keyboard input/output port 25.
The random access memory 46 provides temporary and non-permanent storage of templates which have been created during the current operation of the system 30, which relates to the commands used in the popular software packages. Each template is related to a command which in turn also is stored as keypresses, so when they are sent to the computer 21, the computer 21 will think they came from the keyboard 11.
FIG. 4 is similar to FIG. 3 but shows more details of the specific electronics of the system 30. In particular, FIG. 4 shows that interposed between the microphone 33 and the microprocessor 42 are a high pass filter 59, an automatic gain control amplifier 61, an anti-aliasing filter 63, and an analog-to-digital converter 69 which may be intergrally incorporated into the microprocessor 42 if desired. FIG. 4 shows that the speaker 52 is connected to the microprocessor 42 via a digital-to-analog converter 65 and a pre-amplifier 67. As suggested by FIG. 4, the microprocessor 42 may comprise a one-chip microcomputer model number 7811 made by NEC. Further, FIG. 4 suggests that the voice recognition chip 48 may, if desired, comprise an SP1000 chip manufactured by General Instruments. This chip is also used for speech synthesis. The microcomputer 7811 includes the ROM 44 and the RAM 46 shown in FIG. 3. Of course, these are to be considered merely examples of the electronic devices which may be utilized in the present invention as many voice recognition chips and microcomputers are suitable for use with the present invention.
FIG. 5 depicts the overall blocks of software as programmed into the present invention 30. It shows: (1) the programs which are stored on the floppy disk 100; (2) the programs 101 which will be in the host computer's RAM memory at one time or another; (3) the programs which are permanently in the system's ROM memory 44; and (4) the programs which will be in the system's RAM memory 46.
The software in the floppy disk 100 includes: (1) the training program 200 for each of the various popular software packages now on the market such as VisiCalc™ and Lotus™ 1,2,3. These programs are run by the control program when the relevant function keys are pressed. The program guides the user through the training process by displaying each word which corresponds to a command in the chosen software package and asks the user to say this word; (2) the templates 203 created through the training process in 1 above for each software package as processed by the voice recognition part of the system; (3) the wide user group templates 202 for each software package which are pretrained in order to cover a wide user group with almost the same voice pattern. If the user does not train the system for a software package, these templates will be used in the application mode of operation; (4) the command program 201 which includes the commands, represented as keypresses, which relate to each template which in turn relate to each spoken word, trained by the user or pretrained from the factory. They are stored as keypresses so that when they are sent to the computer keyboard input/output port 25 the computer 21 will think they came from the keyboard 11.
The floppy disk 100 is to be inserted to the disk drive 70 in the computer 21.
The software in the computer 21 RAM memory includes: (1) the training program, 200, which is loaded down from the floppy disk by the control program 302. This program is only present here when the user has selected the training process for a specific popular software package by pressing the function key #1 twice and the function keys #2-9 of the software package of choice. This puts the system in the application mode; (2) the trained templates 203 are only here on their way from the system's RAM to the floppy disk or on the way from the floppy disk to the system's RAM. This happens only in the end of the training mode or in the set-up of the application mode; (3) the commands 201 are stored as keypresses, as they relate to each template, which are only here on their way from the floppy disk to the system's RAM memory; (4) the pretrained wide user group templates 202 which are only here on their way from the floppy disk to the system's RAM if the user does not train the commands for the software package.
No programs are present in the computer's RAM memory 21 when the system is in the application mode.
The software in the RAM memory 46 of the system 30 includes: (1) the trained templates 203 for the chosen software package, if the user has trained the words for the chosen software package; (2) the pretrained wide user group templates 203 for the chosen software package, if the user has not trained the words for the chosen software package; (3) the commands 201, stored as keypresses, for the chosen software package.
The use of a floppy disk to store all the relevant programs 200-203 allows the system to only use a very small amount of RAM 46, namely only sufficient memory to store a template file, trained or pretrained (203 or 202) and a command file 201.
The software in the ROM 44 of the system 30 includes: (1) the program 301 to read the function keys and set the system in the appropriate mode; (2) the program 302 which loads a program from the floppy disk onto the host computer's RAM memory and the reverse way; (3) the program 303 which loads a program from the host computer's RAM onto the RAM of the system 30; (4) the program 304 for loading a program from the RAM of the system 30 to the host computer's RAM; (5l) the program 305 to run programs in the host computer; (6) the program 306 which includes all the voice recognition subroutines such as: (a) creation of a template; and (b) the matching of incoming templates with stored templates; (7) the program 307 which includes all the speech synthesis subroutines such as creating sound signals from a generated synthesis signal, (8) program 308 which keeps the overall control of the systems hardware and software; (9) the program 300 which is the cursor control program, which allows the cursor control device to have priority over the spoken word by setting the cursor control switch accordingly. It further keeps track of the cursor position so it can move the cursor accordingly to the voice input.
In the training mode of the present invention, a training program 200 is preprogrammed and stored on the floppy disk of the inventive voice control system for each software package. When the training mode is selected for a software program, the training file already in the floppy disk is loaded from the floppy disk and run on the host computer. This program will be displayed on the host computer screen and will show everything the user has to do, that is, the program will instruct the user when and how they say the appropriate words so that they may be stored as templated representative of the user's voice on the floppy disk. Thus, the words will be shown on the computer display when the computer wishes the user to speak those words and an audible feedback is provided to indicate if the computer has accepted or rejected the spoken word. Since the training program is specifically designed to reside solely on the floppy disk, the training proram does not require the use of any of the RAM or ROM memory of the voice control system 30. The training program is only run when it will not intefere with other programs which the user is using on the host comptuer 21. The present invention is specifically designed so that no part of the host computer's RAM memory is being used when the user is running a program with the voice control system 30 connected into the computer system 10.
FIG. 6 shows a flow chart of the training subroutine which is utilized to save on the floppy disk the various voice commands as templates to run computer programs such as VisiCalc™ and Lotus™ 1, 2, 3. By following the routine set forth in the flow chart of FIG. 6, the commands which are needed are saved as templates on the floppy disk representative of the user's own voice.
FIG. 7 shows a flow chart for the test program which flow chart is followed so as to be able to test how well the templates that are representative of the commands for each software package work for the user. The templates can be the templates trained by the user or the pretrained wide user group templates. The test program is essentially the same as the training program, but with a different control routine.
In the preferred embodiment of the present invention, at least 64 commands from the popular software packages described above may be selected and saved on the floppy disk as templates representative of the user's own voice. These commands are translated into keypresses of the keyboard associated with the host computer as if they had been typed into the computer from the keyboard. These commands are preprogrammed and stored in a file corresponding to the software package which receives these particular commands and this file may be loaded from the floppy disk of the present invention onto the RAM memory in the host computer and further onto the RAM memory of the inventive voice control system 30 when the application mode is selected for that particular software package. An explanation of the operation of this aspect of the present invention is depicted in FIG. 8 which shows a flow chart for the command subroutine whereby the host computer receives voice commands and translates them to the corresponding keypresses. The advantage of this aspect of the present invention is that it does not require a large capacity ROM memory and RAM memory.
With reference now to FIG. 9, the operation of the control program of the present invention will now be explained. It is important to understand that the control program controls all functions of the inventive voice control system 30. The control program is preprogrammed into the ROM memory 44 of the inventive system 30. The system 30 is designed to go into a standby mode when the host computer is turned on with the inventive system preconnected thereto. What this means in actual practice is that a keyboard switch is set so that the keyboard input is sent directly to the host computer. The inventive system 30 is turned on if, for example, the function key #1 is held down for a preset length of time. This act interrupts the voice control system 30, turns it on and closes the direct path from the keyboard 11 to the host computer 21 in the keyboard switch. The voice control system 30 reads the keyboard in order to see what operation and program the user has selected by pressing the various function keys 13. The voice control system 30 will go into the next mode when the selection process has been completed. If desired, the user may cancel all selecions by holding the function key #1, for example down for a predetermined length of time which will result in the inventive voice control system 30 going back into the standby mode.
When the inventive system 30 is installed into the computer system as shown in FIGS. 1 and 2, the system 30 reads the various depressions of the function keys and if a training flag has been set by depressing function key #1 again on the keyboard 11, the voice control system 30 will then be placed in the training mode. What this means is that when the user presses the function key of the program which has been chosen, the training file for that program will then be loaded from the floppy disk of the voice control system 30 into the host computer's RAM memory and will then be run. This program will then send the user through the training process as described, for example, in FIG. 6, and when this is completed, the user's templates will be stored on the floppy disk of the voice control system 30 automatically. These templates will be retained in the RAM memory 46 of the voice control system 30 and the command file for the program of choice will then by saved on the voice control floppy disk.
If the training button on the keyboard 11 has not been pressed, but only the function key thereof for the software package of choice has been depressed, the control program will see if the user has trained the voice control system 30 for this program and will find the user's file on the floppy disk of the voice control system 30 and will load this file onto the host computer's RAM memory and further down to the voice control system 30 RAM memory 46. If the user has not trained the voice control system 30 for this program, the control program will load the "wide user group" templates for this program from the voice control system 30 diskette onto the host computer's RAM and further down to the voice control system RAM memory 46. The system will then further load the commands for the program of choice onto the host computer's RAM memory and down to the voice control system's RAM memory 46.
The control program as described in FIG. 9 also controls the switches. If a voice recognition signal is detected by the voice recognition part of the system 30, a switch will turn the keyboard off and send the keypresses which relate to this word or command out to the host computer 21. When this is done, the link is turned off from the voice control system 30 to the computer 21 and the keyboard is reconnected to the host computer. This allows the user to either voice input commands or input commands through the use of the keyboard 11.
FIG. 10 shows the meaning of the function keys in one example of the present invention. Function key #1 is used to turn the voice control system on-off and also to set it in the training mode. Function keys #2-9 are used to select the wanted software packages and set the voice control system in the application mode. The software packages shown here are only examples. Function key #10 is used to set the voice control system in the test mode.
As described above, the function key #1 on the keyboard 11 may be utilized as an "interrupt." FIG. 11 shows a flow chart describing the use of a function key #1 as an interrupt handler. FIG. 11 should be self-explanatory to those skilled in the art and explains how functional connection between the keyboard 11 and the host computer 21 may be selectively interrupted.
FIG. 12 shows a flow chart for the application program. As should be understood from FIG. 12, this program enables the system 30 to search its memory upon activation of the program to see if a particular program, the name of which has been entered, in fact exists. If the program does in fact exist in a template, the program instructs the system 30 to load the template corresponding to this program onto the RAM memory 46 of the voice control system 30. If the user template program does not exist, the pretrained wide user group template program will be used. Then, as shown in FIG. 12, the voice interrupt aspect of the present invention is appropriately set so that the system may operate.
The voice interrupt aspect is better explained with reference to FIG. 13 which shows a flow chart of the voice interrupt handler. As shown in FIG. 13, when this aspect of the present invention is initialized, a switch is activated, disconnecting the keyboard and host computer from one another and allowing voice commands from a particular program which has been entered into the system memory to be conveyed to the computer to cause the various functions to be controlled and operated.
FIG. 14 shows a flow chart which when followed results in the ability to move the cursor on the display 23 of the host computer 21 to whatever position is desired. As FIG. 14 shows, voice commands are utilized to state the specific x and y coordinates where it is desired to locate the cursor. The host computer understands these commands and moves the cursor to the desired position.
Accordingly, an invention has been disclosed herein in terms of the various aspects and embodiments thereof which achieves each and every one of the objectives set forth hereinabove. It must be understood, however, that various changes, modifications, and alterations in the teachings of the present invention may be contemplated by those skilled in the art without departing from the intended spirit and scope of the present invention. Accordingly, it is intended that the present invention only be limited by the terms of the following claims.
Claims (13)
I claim:
1. In a device including existing software programs associated with an existing computer and keyboard, the improvement comprising an apparatus for enabling a user thereof to operate said device through the use of voice commands, keyboard inputs or both, comprising:
(a) electrical circuit means for installation solely between the existing computer and keyboard;
(b) a microphone connected to said electrical circuit means for inputting voice commands to said electrical circuit means;
(c) said circuit means including voice recognition means for recognizing said voice commands;
(d) said circuit means further including a keyboard switch for adjusting priority between voice commands and keyboard entries;
(e) said circuit means further including a microprocessor for controlling receipt of voice commands and keyboard entries and for controlling transmission of said commands and entries to said existing computer as if they came from pressing keys of said keyboard, said microprocessor including a read only memory, a random access memory and an A/D converter said read only memory being preprogrammed to take over said existing computer upon activation thereof without programming said existing software of said existing computer prior to commencement of operation by voice command.
2. The invention of claim 1, further including:
(a) speech synthesis means;
(b) a D/A converter between said speech synthesis means and said microprocessor;
3. The invention of claim 1 further including a cursor control device adapted to be controlled by said voice commands to control a cursor of said existing computer as if said voice commands came from pressing cursor control keys of said keyboard.
4. The system of claim 1, 2 or 3 where the said electrical circuit means draws all its operating power from the existing computer.
5. The invention of claim 1, 2 or 3 where said electrical circuit means has associated therewith controlling means including a training program that uses templates and voice recognition techniques and wherein said templates and voice recognition techniques are programmed for each software package and may be displayed on display means associated with said existing computer.
7. The invention of claim 6 further including testing means for testing the quality of said templates.
8. The invention of claim 7 further wherein said keyboard includes function keys which may be depressed in predetermined sequence to control said apparatus, said function keys including:
(a) a first function key used to turn said apparatus on and off and further to set the apparatus in a training mode;
(b) further function keys which may be operated to select a desired software package; and
(c) Another function key which may be operated to set the apparatus in a test mode thereof.
9. The invention of claim 8 wherein said keyboard switch may be activated:
(a) when said first function key is held down for a predetermined time, or
(b) when a voice input is sensed on said microphone.
10. The system of claim 3 wherein a cursor control switch is provided in order to give priority to the cursor control device, said cursor control device being activated if a cursor command is given into the microphone.
11. The system of claim 1, 2 or 3, where data is stored on a floppy disk storage device associated with said apparatus, said data including:
(a) a training program for each software program;
(b) pretrained templates for each software program;
(c) trained templates for each software program; and
(d) commands as keypresses for each software program.
12. The system of claim 11 wherein control program in said microprocessor read only memory facilitate:
(a) the running of programs on the existing computer from said floppy disk;
(b) the loading of programs from the floppy disk to said microprocessor RAM over the existing computer keyboard via an input/output port thereof; and
(c) the saving of programs from the RAM to the floppy disk over said computer keyboard input/output port.
13. The system of claim 12 wherein said microprocessor RAM is solely utilized to store template files and command files comprising keypresses.
Voice activated system and methods to enable a computer user working in a first graphical application window to display and control on-screen help, internet, and other information content in a second graphical application window
Voice activated system and method to enable a computer user working in a first graphical application window to display and control on-screen help, internet, and other information content in a second graphical application window
Voice activated system and methods to enable a computer user working in a first graphical application window to display and control on-screen help, internet, and other information content in a second graphical application window
Voice activated system and methods to enable a computer user working in a first graphical application window to display and control on-screen help, internet, and other information content in a second graphical application window
|
{
"pile_set_name": "Pile-CC"
}
|
Treatment of herniated lumbar disk syndrome with chymopapain.
One hundred twenty-four patients with herniated lumbar disks received intradiskal injections of chymopapain before the Food and Drug Administration's withdrawal of the drug. One year after injection, 90 patients (72.6%) experienced major improvement, 21 (16.9%) had slight improvement, and 13 (10.5%) had no improvement. Of those patients who had no previous back surgery and who were not compensation cases, 77 patients (81%) had marked improvement, 13 (13.7%) had slight improvement, and five (5.3%) had no improvement. Three- to six-year follow-ups were obtained by questionnaire. Of the 114 patients responding, overall 83 patients (72.8%) had marked improvement, and 75 (83.3%) of those with no previous surgery and who were not workmen's compensation cases had major improvement. Since all patients met objective criteria for diskectomy, favorable results from chemonucleolysis spared most the trauma of surgery and its attendant convalescence. These results indicate that chemonucleolysis can and should be considered an advantageous alternative to surgery in appropriately selected patients.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
[Analyzing the posterior ethmoid sinus in Chinese-using multi planar reconstruction in spiral CT].
To study the anatomical character of the ethmoid sinus with spiral CT, and provide correlated data for diagnosis and surgery operation. One hundred patients whose vertebra artery was injected with Angiografin underwent axial consecutive computed tomography and these data were studied with multiplanar reformation. Based on the relation of posterior ethmoid sinus to sphenoid sinus, the posterior ethmoid sinus was divided into antero sphenoid types and super sphenoid types. According to the relation between the posterior ethmoid and the optic canal, the posterior ethmoid sinus was divided into antero canal, seminal abut types, canal abut types. According to the degree of the bulging of the optic canal, the posterior ethmoid sinus was divided into notch types, seminal cover types, canal cover types. Bulging of the optic canal formed on the lateral wall of the posterior ethmoid sinus was 40 sides (20%). MPR in spiral CT is powerful tool for the anatomical study of the ethmoid sinus, it could provide accuracy evaluation and analyzation, these results are helpful in directing the diagnose and therapy.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
al places?
0.000028
What is 1.246542 rounded to one dp?
1.2
What is 1.144491 rounded to 2 decimal places?
1.14
Round -551121 to the nearest one thousand.
-551000
What is 0.02427083 rounded to five decimal places?
0.02427
Round -32.8412 to 2 decimal places.
-32.84
What is 284148 rounded to the nearest 100000?
300000
Round -0.00824262 to four decimal places.
-0.0082
What is -890.3187 rounded to 0 dps?
-890
Round 73057070 to the nearest 10000.
73060000
Round 0.001139215 to 6 decimal places.
0.001139
Round 0.1484811 to four decimal places.
0.1485
What is 0.0033184391 rounded to 3 decimal places?
0.003
Round -44.6659 to the nearest 10.
-40
What is 0.0006203711 rounded to four decimal places?
0.0006
What is -36.7827 rounded to 0 dps?
-37
What is -0.1827249 rounded to four decimal places?
-0.1827
Round 216590.7 to the nearest one thousand.
217000
Round -760958.4 to the nearest one thousand.
-761000
What is 1.3324066 rounded to one dp?
1.3
Round 484.7029 to the nearest 10.
480
What is 0.1874745 rounded to two dps?
0.19
What is 1.0461262 rounded to two dps?
1.05
What is 162.8638 rounded to the nearest integer?
163
Round 0.4536847 to 4 dps.
0.4537
What is 0.000000224686 rounded to 7 dps?
0.0000002
Round 203026950 to the nearest one million.
203000000
Round 8882.14 to the nearest one hundred.
8900
What is -1.9398055 rounded to 1 dp?
-1.9
What is 275758.6 rounded to the nearest one thousand?
276000
Round 12377.75 to the nearest 10000.
10000
Round 11.82781 to 1 dp.
11.8
What is 2.997276 rounded to three decimal places?
2.997
Round -140047.5 to the nearest ten thousand.
-140000
Round 0.0000204912 to 5 dps.
0.00002
Round 91.4369 to one decimal place.
91.4
Round -0.014061347 to three dps.
-0.014
What is 2888 rounded to the nearest one hundred?
2900
Round 199958 to the nearest 100000.
200000
Round 1.21928 to two dps.
1.22
What is -23349900 rounded to the nearest one million?
-23000000
Round 351425700 to the nearest one hundred thousand.
351400000
What is -0.01196723 rounded to three decimal places?
-0.012
What is 0.4583647 rounded to one decimal place?
0.5
Round 2104400 to the nearest ten thousand.
2100000
What is -0.0003954012 rounded to five dps?
-0.0004
What is 0.0099512534 rounded to four dps?
0.01
What is -638.13617 rounded to 1 decimal place?
-638.1
Round 14916 to the nearest 10000.
10000
Round 2772716 to the nearest 100000.
2800000
Round 4645.71 to the nearest one hundred.
4600
What is -0.04401457 rounded to three decimal places?
-0.044
What is 0.0000075698 rounded to 5 decimal places?
0.00001
What is -12670.094 rounded to the nearest ten?
-12670
Round 19.327847 to one dp.
19.3
Round -0.0397576 to four decimal places.
-0.0398
What is -2498.32 rounded to the nearest 1000?
-2000
What is -0.00628866 rounded to 3 dps?
-0.006
What is -0.000548511 rounded to 5 dps?
-0.00055
What is 21.89425 rounded to one decimal place?
21.9
What is -0.0000026516788 rounded to 7 dps?
-0.0000027
What is -65221.9 rounded to the nearest 1000?
-65000
Round -1339.21 to the nearest ten.
-1340
What is -3800.81 rounded to the nearest 100?
-3800
What is -0.000775298 rounded to 6 decimal places?
-0.000775
Round 0.004796781 to 4 dps.
0.0048
Round 0.455218 to 3 decimal places.
0.455
What is -590.389 rounded to the nearest integer?
-590
Round 0.0006764317 to seven decimal places.
0.0006764
What is 0.2572523 rounded to 3 dps?
0.257
What is -269634.32 rounded to the nearest ten?
-269630
Round -37.688732 to the nearest integer.
-38
Round -94.203 to the nearest one hundred.
-100
Round -120428.7 to the nearest 1000.
-120000
Round 61867.14 to the nearest 10.
61870
Round 11998830 to the nearest ten thousand.
12000000
What is 0.0017244411 rounded to 6 decimal places?
0.001724
What is 0.000001008642 rounded to seven dps?
0.000001
What is 0.261669 rounded to two dps?
0.26
What is -0.03944 rounded to three dps?
-0.039
What is 0.000249548 rounded to five decimal places?
0.00025
Round -0.0001497722 to 5 decimal places.
-0.00015
Round 510028 to the nearest 10000.
510000
What is 0.2881321 rounded to 1 dp?
0.3
What is -1.23815 rounded to 1 decimal place?
-1.2
What is -3.02421 rounded to 2 decimal places?
-3.02
Round 0.00363075 to 3 dps.
0.004
What is -966373.6 rounded to the nearest 100?
-966400
Round 3.08167 to one dp.
3.1
Round 452773.2 to the nearest ten thousand.
450000
What is -169460280 rounded to the nearest one million?
-169000000
What is 408.635 rounded to the nearest 100?
400
Round 0.0915279 to 2 dps.
0.09
What is 0.00015724117 rounded to 7 decimal places?
0.0001572
Round 0.0000002839165 to seven dps.
0.0000003
Round 2112696.8 to the nearest ten thousand.
2110000
What is 0.21008791 rounded to three decimal places?
0.21
What is 0.000483252 rounded to 5 dps?
0.00048
What is 0.0015690334 rounded to five decimal places?
0.00157
What is -491.93 rounded to the nearest integer?
-492
What is 185643670 rounded to the nearest 100000?
185600000
Round 3160.2 to the nearest ten.
3160
What is 0.059541 rounded to 2 dps?
0.06
What is 241014.78 rounded to the nearest 1000?
241000
Round 3.571589 to one decimal place.
3.6
What is -0.3377367 rounded to 4 decimal places?
-0.3377
What is -0.000263284 rounded to 4 dps?
-0.0003
What is 1124910 rounded to the nearest one hundred thousand?
1100000
Round -0.0002074425 to 6 dps.
-0.000207
Round -0.000015210395 to six dps.
-0.000015
What is 37395.46 rounded to the nearest 10000?
40000
What is -10391.29 rounded to the nearest one thousand?
-10000
What is 6111200 rounded to the nearest one million?
6000000
Round 0.1259316 to 4 dps.
0.1259
Round -892226000 to the nearest 1000000.
-892000000
Round -7.030773 to 3 decimal places.
-7.031
What is 0.133302 rounded to 3 decimal places?
0.133
Round 1619.2092 to the nearest ten.
1620
What is -24.766567 rounded to zero decimal places?
-25
Round 0.00167456 to 5 dps.
0.00167
Round 0.0013794395 to 4 decimal places.
0.0014
What is 75799500 rounded to the nearest 1000000?
76000000
Round 0.001232657 to 5 dps.
0.00123
What is -4677.927 rounded to the nearest 100?
-4700
Round -4507.532 to the nearest ten.
-4510
Round 834018.2 to the nearest ten thousand.
830000
Round 3806.587 to the nearest 100.
3800
What is -535217700 rounded to the nearest one hundred thousand?
-535200000
Round -42836470 to the nearest ten thousand.
-42840000
What is 0.00583156 rounded to 4 decimal places?
0.0058
What is 53.35391 rounded to the nearest 10?
50
Round 105506000 to the nearest one million.
106000000
Round 0.0000422033 to 7 dps.
0.0000422
Round -630320 to the nearest ten thousand.
-630000
Round -219579300 to the nearest 1000000.
-220000000
Round 0.0617868 to 2 decimal places.
0.06
What is -81.5889 rounded to one dp?
-81.6
Round 0.00012000331 to 5 dps.
0.00012
Round -16374.279 to the nearest one hundred.
-16400
What is -2.03074 rounded to 1 dp?
-2
What is 39764870 rounded to the nearest 1000000?
40000000
Round 156477700 to the nearest 1000000.
156000000
What is 268883600 rounded to the nearest one million?
269000000
What is 322.31273 rounded to one decimal place?
322.3
Round 76.25558 to one decimal place.
76.3
What is 1.276257 rounded to 3 decimal places?
1.276
Round -0.000000889377 to seven decimal places.
-0.0000009
Round 0.026354915 to 3 dps.
0.026
Round 614537400 to the nearest one million.
615000000
What is 18832000 rounded to the nearest 1000000?
19000000
Round 0.0000002747027 to 7 dps.
0.0000003
Round 0.4346625 to 4 decimal places.
0.4347
What is -0.0770909 rounded to 2 decimal places?
-0.08
Round -500.2078 to the nearest one hundred.
-500
What is -0.000055778464 rounded to five decimal places?
-0.00006
What is 0.00052143778 rounded to 5 decimal places?
0.00052
What is 4944.8 rounded to the nearest ten thousand?
0
Round -2.404481 to two dps.
-2.4
What is 35.94139 rounded to two dps?
35.94
Round -0.000014502 to six decimal places.
-0.000015
Round 0.078960988 to 5 decimal places.
0.07896
Round -0.00015888 to five dps.
-0.00016
Round -0.002663549 to four dps.
-0.0027
Round 9168.308 to the nearest 10.
9170
Round -62337870 to the nearest 10000.
-62340000
Round 108.144 to the nearest integer.
108
Round -4162550 to the nearest 100000.
-4200000
Round 0.000015007664 to 6 dps.
0.000015
Round 10432836 to the nearest 1000.
10433000
Round -3.727622 to 3 decimal pla
|
{
"pile_set_name": "DM Mathematics"
}
|
Introduction
============
At ISICEM 2011, we reported that AN69ST showed the highest capacity to adsorb high mobility group box 1 protein (HMGB1) when compared with polymethylmethacrylate, polysulfone and high cut-off membrane \[[@B1]\]. Here we focus on whether filtration or surface heparin on AN69ST by a priming circuit with a heparinized saline contributes to HMGB1, with a heparin-binding protein, adsorption on AN69ST.
Methods
=======
The test solution contained 100 g HMGB1 and 35 g albumin in 1,000 ml substitution fluid. We executed three different experimental hemofiltrations with solution flow of 100 ml/minute and: ultrafiltrate flow 1,000 ml/hour using AN69ST primed with a heparinized saline, F(+) and H(+); ultrafiltrate flow 1,000 ml/hour using AN69ST with no heparinized saline, F(-) and H(+); and ultrafiltrate flow of 0 ml/hour using AN69ST with no heparinized saline, F(-) and H(-). In addition, AN69ST membrane was immunostained using an antibody that confirmed dying on human kidney tissue.
Results
=======
The concentration decreases of HMGB1 at 0, 60 and 360 minutes indicated no significant differences among the three different hemofiltration experiments (Figure [1](#F1){ref-type="fig"}). At 60 minutes, reduction rates of HMGB1 were: F(+) and H(+), 97.3%; F(+) and H(-), 94.8%; and F(-) and H(-), 96.4% respectively. HMGB1 was not detected in bulk layers by immunostaining (Figure [2](#F2){ref-type="fig"}).
{#F1}
{#F2}
Conclusion
==========
Surface heparin or filtration might not contribute to HMGB1 adsorption on the AN69ST membrane. Remarkable adsorption on AN69ST is likely to be influenced by material characteristics, hydrogel structure with moisture content, or negative electric charge and may occur not in bulk layers but on large surfaces of membranes.
|
{
"pile_set_name": "PubMed Central"
}
|
Livejasmine online hd KatrinBlack
Hello! you are looking for a sexy and pretty brunette? My name is Katrin, and after our privat you'll never forget me! I will not be against the beautiful man next to whom I will go my foot in the leg to the end of life and change his life for the be
|
{
"pile_set_name": "Pile-CC"
}
|
Lamotrigine: a review of clinical studies in bipolar disorders.
This article reviews published studies on the use of lamotrigine in the treatment of bipolar disorder (BD). We performed a Medline search to identify the literature data base available on double-blind, open-label studies and case series on the use of lamotrigine to treat BD. Three double-blind studies, 3 open-label studies, and 2 case series have been conducted to date (n = 401 patients). Most patients were either nonresponders or partial responders to other mood stabilizers. Overall, 50% to 83% of the patients responded to lamotrigine; doses in the studies ranged from 50 to 400 mg daily. Switching to mania while on 200 mg of lamotrigine or more was extremely rare, and there were no reports of serious adverse effects during the study periods. Lamotrigine is proving to be an effective agent in the treatment of BD and may be useful for patients who have not responded to other mood stabilizers.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
I opened your site after many attempts. Got the new codes for all my blogs and kept the same backgrounds but now sometimes they are there and sometimes the background is gone. I really do not have the time to fool with this. My blogs do not look good without the backgrounds which I really like. I am afraid I will try to find another site to get a background. It appears you have many issues.
I don't understand how to fix this because I can't open the site. Do I need to find another background site or does TCBOTB have some that I can use? OR are they no longer up and running?? THis is so confusing.
your site is down!!!! I sent you an email and I would really like a response. My blog was a paid design although the background was one of your free templates, everything on my page matches that background. please contact me. I am very upset that we only had two days notice and now we can't get to your site. I have no idea what I am going to see tomorrow morning.
still a non working site, now getting an apache server error. and no response to repeated emails I sent, since as I said I paid for my blog design. and I really can't imagine why this decision has been made with nothing but a two day warning, and technical problems, I really hope this gets rolled back to give us time to make the necessary changes and adjustments.
Yes the site is the mom..whatever but even when you get the how to the how to doesn't make sense..It say to change the photobucket part of your desing and change to the tcbotb link...there is not photobucket on my blog
I found it on my blog. In mine it was in the Java Script portion, after clicking "edit". About 5 lines down... but now my background is white...it was still showing right after I did it? Strange! I'll check back tomorrow. They are suppose to still have the old templates too...so if it didn't work I'll just go look for it and add it again.
@as Crystal World turns..thank you I found it ..I changed it as they said..it is all white now too. I'll ck tomorrow as well. If I pick a new design will it mess up the template or does that stay the same? I'm so scared that I'll lose my blog and it is about my special needs son..I would be so mad..thanks for your help.
|
{
"pile_set_name": "Pile-CC"
}
|
Insulin receptor substrate-1 and -2 mediate resistance to glucose-induced caspase-3 activation in human neuroblastoma cells.
Hyperglycemia in patients with type 2 diabetes causes multiple neuronal complications, e.g., diabetic polyneuropathy, cognitive decline, and embryonic neural crest defects due to increased apoptosis. Possible mechanisms of neuronal response to increased glucose burden are still a matter of debate. Insulin and insulin-like growth factor-1 (IGF-1) receptor signaling inhibits glucose-induced caspase-3 activation and apoptotic cell death. The insulin receptor substrates (IRS) are intracellular adapter proteins mediating insulin's and IGF-1's intracellular effects. Even though all IRS proteins have similar function and structure, recent data suggest different actions of IRS-1 and IRS-2 in mediating their anti-apoptotic effects in glucose neurotoxicity. We therefore investigated the role of IRS-1/-2 in glucose-induced caspase-3 activation using human neuroblastoma cells. Overexpression of IRS-1 or IRS-2 caused complete resistance to glucose-induced caspase-3 cleavage. Inhibition of PI3-kinase reversed this protective effect of IRS-1 or IRS-2. However, MAP-kinases inhibition had only minor impact. IRS overexpression increased MnSOD abundance as well as BAD phosphorylation while Bim and BAX levels remained unchanged. Since Akt promotes cell survival at least partially via phosphorylation and inhibition of downstream forkhead box-O (FoxO) transcription factors, we generated neuroblastoma cells stably overexpressing a dominant negative mutant of FoxO1 mimicking activation of the insulin/IGF-1 pathway on FoxO-mediated transcription. Using these cells we showed that FoxO1 is not involved in neuronal protection mediated by increased IRS-1/-2 expression. Thus, overexpression of both IRS-1 and IRS-2 induces complete resistance to glucose-induced caspase-3 activation via PI3-kinase mediated BAD phosphorylation and MnSOD expression independent of FoxO1.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
2015 Halifax train crash
On March 9, 2015, an Amtrak passenger train derailed in Halifax, North Carolina, after colliding with a truck carrying an oversize load that was obstructing the line at a grade crossing. There were no fatalities, but 55 people were injured.
Accident
At approximately 12:19 p.m., Eastern Standard Time, an Amtrak passenger train collided with a truck, which was obstructing the track on a grade crossing in Halifax, North Carolina. The train was the northbound Carolinian, from Charlotte, North Carolina to New York. There were 221 people on the train; 213 passengers and 8 crew members. Fifty-five people were injured in the accident. The locomotive and baggage car left the track when it struck the truck, which was hauling electrical equipment. GE P42DC locomotive #185 was hauling the train. The locomotive was turned on its side by the force of the accident, and one end of the baggage car was pushed into a brush-covered area next to the railroad right of way. The engineer was among those injured.
The truck, an oversize load carrying a power distribution center to New Jersey, had a combined weight of 255,000 pounds, equaling . The truck was being escorted by officers of the North Carolina State Highway Patrol. The truck driver was having trouble negotiating a turn, and spent eight minutes backing up and moving forward repeatedly in an attempt to complete the turn at the correct angle. As the Amtrak train approached, the driver realized he could not clear the track in time, and exited the vehicle. The truck driver was uninjured.
The truck's driver, 43-year-old John Devin Black of Claremont, North Carolina, had a valid commercial drivers license, which allowed him to haul the oversize load. Black had a history of 12 traffic violations prior to the accident, including excessive speed, and driving more than once using a revoked license.
At the time of the accident, the train was headed for New York City from Charlotte, North Carolina.
Aftermath
A witness told a 9-1-1 operator that she did not hear a train horn, but that the railroad crossing lights were working at the site of the accident.
Shortly after the accident North Carolina Department of Transportation (NCDOT) reported that U.S. 301, N.C. 903 and N.C. 125 were closed in all directions for emergency response, clean-up and investigation purposes. 170 of the remaining uninjured passengers were transported by bus to Richmond, Virginia to be placed on another train.
The day after the derailment, authorities stated that no charges will be filed against Black in relation to this accident.
Fate of rolling stock
AMTK 185 was repaired and put back into service.
Investigation
The National Transportation Safety Board was dispatched to the accident scene, and are investigating. The North Carolina Department of Transportation (NCDOT) released a statement on March 9, 2015 that the department would assist Amtrak with the investigation of the accident. The FRA stated it was reviewing an on-board event recorder, interviewing the train's crew, the truck driver, and the North Carolina Patrol trooper that was escorting the truck.
Investigators are also attempting to discover if proper protocol for oversized loads was being followed before the accident, as protocol calls for troopers who are escorting the vehicles to "clear their routes and inform the railroad dispatchers what they're doing".
Litigation
In May 2015, Amtrak and CSX Transportation (who owns the line) filed a civil lawsuit against Turner Transfer Company, also known as Guy M. Turner Incorporated, who operated the oversize load. The railroad companies alleged that the trucking company, and driver John Black, caused the accident by negligently hauling the oversize load across a marked railroad crossing in an unsafe manner. Both railway companies were seeking in excess of US$75,000 each.
See also
Hixon rail crash - historic case in UK that changed working practices on British railways when an oversized load under police escort was struck by a passenger train in the 1960s.
References
Category:2015 disasters in the United States
Category:2015 in North Carolina
Category:Accidents and incidents involving Amtrak
Category:Railroad crossing accidents in the United States
Category:Railway accidents in 2015
Category:Rail transportation in North Carolina
Category:Transportation in Halifax County, North Carolina
Category:Derailments in the United States
Category:Halifax, North Carolina
|
{
"pile_set_name": "Wikipedia (en)"
}
|
- 23 = -3*q. Is q a multiple of 5?
False
Suppose 0 = 3*c - c - 116. Is 9 a factor of c?
False
Let l(b) = 44*b - 44. Is 54 a factor of l(6)?
False
Let n(k) be the first derivative of -k**3/3 + 2*k**2 + 3*k + 1. Let x(l) = -l + 7. Let p be x(3). Is n(p) even?
False
Let t(b) be the first derivative of -3*b**2/2 - 2*b + 4. Does 4 divide t(-2)?
True
Let q(c) = 53*c**2 - 7*c - 5. Does 13 divide q(-2)?
True
Is 146 + -3 + 6 + -6 a multiple of 11?
True
Suppose -5*v = 4*y + 401, -31 + 334 = -3*y - 3*v. Let h = -49 - y. Let f = h + -37. Does 15 divide f?
False
Let s = -4 + 28. Let d(x) = x**2 + 7*x - 2. Let f be d(-6). Let o = s - f. Is 10 a factor of o?
False
Let f(r) = 2*r**3 + 15*r**2 + 22*r + 1. Is 4 a factor of f(-5)?
True
Suppose 0 = 3*p - 32 - 112. Is 12 a factor of p?
True
Let g(o) = -o**3 - 6*o**2 - o + 3. Let j be g(-6). Suppose 5*z - j = 36. Is 9 a factor of z?
True
Suppose 5*j - 8*j + 69 = 0. Let y be (-1 - (-4)/(-2))/(-1). Suppose -y*i + 4 = -j. Does 6 divide i?
False
Suppose 5*m = 185 + 215. Is 16 a factor of m?
True
Suppose -4*d - d - 155 = -4*i, 0 = 3*i - 5*d - 115. Is 14 a factor of i?
False
Let f = 19 + -4. Suppose 3*l - 12 = -3*n + f, 2*l - 30 = n. Does 12 divide l?
False
Suppose -6*b + 271 + 65 = 0. Is b a multiple of 8?
True
Let a be 4*(0 + (-7)/(-4)). Let x = a + -2. Is 13 a factor of 1/x - (-258)/10?
True
Let b(q) = -q**3 + 2*q**2 + 3*q - 3. Let u be b(2). Suppose 166 - 22 = u*c. Is c a multiple of 14?
False
Is (50/(-20))/(1/(-2 - 16)) a multiple of 21?
False
Suppose 2*w - u + 2*u = -1, 4*w + 5 = -5*u. Suppose 3*s + 12 = 0, 2*o - o + 2*s + 12 = w. Is 7 a factor of o/6 + (-70)/(-6)?
False
Let b(p) = p**2 - p - 5. Let t be b(-5). Let y = t + -12. Is y a multiple of 5?
False
Suppose 0 = 3*y - 295 - 269. Is y a multiple of 22?
False
Let x(t) = -1 + 7*t - 2 - 4*t. Is 6 a factor of x(9)?
True
Let n be (36 - (-2)/2) + 1. Let o = n - 26. Let w = o + -1. Is 11 a factor of w?
True
Suppose b - 45 = -z + 121, -4*z + b = -659. Is z a multiple of 40?
False
Let f be 2/(-5) + 38/(-5). Is 2 a factor of (f/10)/(2/(-10))?
True
Suppose -2*s - 258 = v + v, 2*v = 5*s - 293. Let t = v + 237. Suppose -k + 16 = 5*z, 5*k + 3*z = z + t. Is k a multiple of 13?
False
Let n(x) = -x**3 - 8*x**2 + 8*x + 4. Let i be 2 - (4/2 + 0). Suppose i*h - 9 = h. Is n(h) a multiple of 13?
True
Let c(x) = 2*x**2 - 10*x + 6. Is c(8) a multiple of 29?
False
Let h(z) be the third derivative of -z**6/120 + z**4/24 + 15*z**3/2 - 5*z**2. Is 15 a factor of h(0)?
True
Let t(k) = 2*k - 12. Let z be t(8). Let x = 12 - z. Suppose 4*h - 80 = 4*p, -h - 5*p - x = 2. Does 15 divide h?
True
Let i = -7 + 67. Suppose -10*p + 5*p + i = 0. Is p a multiple of 9?
False
Let w(t) be the third derivative of -t**6/120 - t**5/12 + t**4/24 + 2*t**3/3 - 3*t**2. Is w(-6) a multiple of 11?
False
Let s(x) = x**2 + 6*x - 9. Let w be s(-9). Let n = w - 8. Let k = n - 3. Is k a multiple of 7?
True
Let c = 0 + 30. Does 10 divide c?
True
Let s(d) be the first derivative of 3*d**4/2 - d**3 + d**2/2 + d - 1. Let t be (-6)/9*(-3)/1. Does 14 divide s(t)?
False
Suppose 3*x + x = 0. Suppose 0 = 4*f - 5*i - 41, x = -0*i + 5*i - 15. Is f a multiple of 4?
False
Suppose 200 = 6*f - 2*f. Does 24 divide f?
False
Let l = 10 + -25. Let s = l - -8. Let f(p) = -p**3 - 8*p**2 - 10*p - 10. Is 5 a factor of f(s)?
False
Suppose 0 = -4*y - 3*v + 44, v = -2*v - 12. Is y a multiple of 6?
False
Let o(u) = -1 + 5 - 2*u - 3 - 3. Suppose -g - f = -1, 5*g - 3*f + 27 = 2*g. Is 3 a factor of o(g)?
True
Let g(n) = 2*n + 2. Is 2 a factor of g(6)?
True
Suppose -a - p = a - 152, -2*a = 3*p - 156. Does 14 divide a?
False
Suppose 2*u = 5*w + 8, -9 = -3*w + 3. Does 14 divide u?
True
Suppose 25 = -9*l + 14*l. Is l a multiple of 5?
True
Suppose -5*u - 5 = -5*f, -6*u - 4 = 2*f - 2*u. Let k be (-1 + -5)*(-11 + f). Suppose -5*x = 4*g - 102, -2*x = -5*x - 4*g + k. Does 6 divide x?
True
Suppose 0 = s - 12 + 2. Does 7 divide s?
False
Suppose -2*i - i + 187 = -4*y, -5*i + 3*y = -308. Does 21 divide i?
False
Let n(g) = g**3 - 4*g**2 - 3*g + 4. Suppose 7*c - 16 = 3*c. Let o be ((-10)/c)/(2/(-4)). Does 10 divide n(o)?
False
Let s(c) = -c**3 + 5*c**2 - 2*c - 3. Let g be s(4). Suppose 2*d - g*d = h - 41, 3*d - 61 = 4*h. Does 6 divide d?
False
Let n = -19 + 21. Suppose -118 = -2*m - 3*y, -y = -3*m + n*m + 59. Does 23 divide m?
False
Let t(h) = h**2 + 5*h - 1. Let p be t(-6). Suppose 25 = r + 3*f, p = 2*r - 6*f + 3*f. Suppose 0 = 3*y + u - r, -3*u + 5 = 20. Is y a multiple of 5?
True
Suppose -2*n + 11 = 3. Suppose 23 = -n*p + 55. Is 8 a factor of p?
True
Let t(f) = -f**3 + f - 1. Let x be t(1). Let l = x - -24. Is l a multiple of 15?
False
Suppose 0*o = -5*o - y + 10, 3*o = 2*y + 6. Let u = o + 12. Is u a multiple of 7?
True
Suppose 2*p = 2*v - 16, -15 = 5*p + 10. Suppose 5*i = -2*l + 30, -i = -4*i - 2*l + 18. Suppose -i = -v*n + n. Is 3 a factor of n?
True
Let u(m) = -m**3 + 2*m**2 - 1. Let i be u(2). Let o = i - -3. Suppose o*t - t - 10 = 0. Is t a multiple of 5?
True
Suppose 10 = i - 10. Is 20 a factor of i?
True
Suppose 3*p + 10 = 55. Suppose 0*y - 3*c + p = 2*y, -4*y + 3*c = -21. Does 5 divide y?
False
Suppose 0 = -2*f, 0 = 2*p + 4*f - 54. Is p a multiple of 27?
True
Let l = -30 + 36. Let f(v) = v**3 - 5*v**2 + v - 5. Let i be f(5). Suppose -p - 1 = -r, -5*p + p + 2*r + l = i. Is 4 a factor of p?
True
Let u(o) = 4 - 1 - 1 + 2 + 10*o. Is 12 a factor of u(3)?
False
Let p(o) = -o**3 + 3*o**2 - o - 1. Let r = -3 - -5. Let x be p(r). Is x + 2 + -2 + 19 a multiple of 7?
False
Let a(m) = 13*m + 2. Let g be a(-7). Let y = -64 - g. Is 16 a factor of y?
False
Let d = -58 + 83. Is 25 a factor of d?
True
Suppose 2*w + 0*w - 20 = 0. Let l = w + 20. Is 15 a factor of l?
True
Suppose -27 = 3*w - 2*w. Let j = w - -90. Does 21 divide j?
True
Let q(o) = 34*o**2 + 9*o - 5. Is q(2) a multiple of 6?
False
Let t(b) = b**3 + 5*b**2 - 6*b + 6. Let q be t(-6). Let f(v) = -v**2 + 8*v - 4. Let s be f(q). Let l = s + -5. Is 2 a factor of l?
False
Suppose 5*h = 2*h - 3*k + 90, 2*h + 5*k - 72 = 0. Suppose -3*c + h = -2*c. Is 13 a factor of c?
True
Let a(h) = 2*h**3 - h**3 + 0*h**2 - h + 8*h**2 - 8 + 8*h. Let f be a(-7). Let w = 2 - f. Does 4 divide w?
False
Suppose 2*u - 7*u = -3*k + 65, -4*k = -5*u - 70. Is 8 a factor of (-4)/u + (-340)/(-25)?
False
Let l be (139 + -1)*1/(-2). Let z be 1/(l/33 + 2). Let v = -5 - z. Is v a multiple of 6?
True
Let z = 8 - 6. Suppose 4*b = -z*f + 94, 3*f - 74 = f + b. Does 13 divide f?
True
Suppose -4*s - 785 = -4*t - 253, 0 = 4*t - 2*s - 536. Is t a multiple of 27?
True
Let m(b) = -2*b - 11. Suppose 50 = -5*q + l + 12, 34 = -4*q + 2*l. Does 2 divide m(q)?
False
Let n = -6 + 13. Let x = 73 - 43. Suppose 2*v - n*v = -x. Does 6 divide v?
True
Suppose -i - 5*u - 45 = 4*i, -3*i - 22 = 4*u. Let q = i + 21. Is 4 a factor of q?
False
Suppose -5*x = 4*t - 456, t + 153 = 5*x - 308. Is 23 a factor of x?
True
Suppose -2*n - 8*m + 7*m + 226 = 0, 234 = 2*n + 5*m. Is 6 a factor of n?
False
Is 8 a factor of (-2)/8 - (-330)/40?
True
Let m(x) = x**3 + 8*x**2 - 12*x - 3. Let l be m(-11). Is 4/(-16) + l/(-8) a multiple of 29?
True
Let v(s) be the third derivative of s**6/30 - s**5/15 + s**4/8 - s**3/6 - 2*s**2. Is v(2) a multiple of 11?
False
Suppose 0*z + 5*t + 123 = 2*z, 4*z = -4*t + 232. Does 38 divide z?
False
Let i = -5 + 8. Suppose 0 = 2*n - 0*n + 3*y - 1, -i*y + 5 = 4*n. Suppose -4*l - n*j + 6*j + 100 = 0, -j = 3. Is 11 a factor of l?
True
Let h(f) be the third derivative of f**6/120 + f**5/10 + f**4/12 - f**3 + 3*f**2. Let b be h(-5). Let s = b - 5. Is 4 a factor of s?
True
Suppose -8 = -4*a - 4*s, 3*a - 5*s = -0*s + 22. Suppose 2 = w - 2*u - 8, 2*u = a. Is w a multiple of 12?
False
Let m = 4 + -6. Let x be (1 - (m + 3)) + 6. Suppose 2*j + 0 = y - x, 0 = -2*j - 4. Does 2 divide y?
True
Suppose -5*d = x - 1, -3*d + 2*x + 2 = 4*x. Let q be 23 + 3*(d - 1). Suppose 0 = l - q - 2. Does 12 divide l?
False
Suppose 3*r - 5*k - 361 = 0, 5*r + 0*k - 5*k - 585 = 0. Is 16 a factor of r?
True
Suppose 5*h = 6*h + 12. Let i = 24 + h. Does 6 divide i?
True
Suppose 66 = 4*g - 38. Suppose g = 2*w - w. Is w a multiple of 13?
True
Let s(d) = d - 3*d + d + 8*d. Is 13 a factor of s(3)?
False
Let h(b) = -18*b + 4. Let q be h(6). Let v = q - -155. Suppose -85 = -4*k + v. Is 17 a factor
|
{
"pile_set_name": "DM Mathematics"
}
|
---
author:
- 'P. Delorme'
- 'L. Albert'
- 'T. Forveille'
- 'E. Artigau'
- 'X. Delfosse'
- 'C. Reylé'
- 'C. J. Willott'
- 'E. Bertin'
- 'S. M. Wilkins'
- 'F. Allard'
- 'D. Arzoumanian'
bibliography:
- 'bib.bib'
title: |
Extending the Canada-France brown Dwarfs Survey to the near-infrared:\
first ultracool brown dwarfs from CFBDSIR [^1]
---
Introduction
============
The significant improvement in detector technology, data storage, and analysis facilities in the past decade has made it possible to carry out wide-field surveys covering a large fraction of the sky instead of targeting specific sources. The wealth of data from these surveys necessitate a complex dedicated computer analysis to single out relevant scientific information. These surveys, such as DENIS [@Epchtein.1997], SDSS [@York.2000], 2MASS [@Skrutskie.2006], UKIDSS [@Lawrence.2007], and CFBDS [@Delorme.2008b] contain hundreds of millions of astrophysical sources and led to many advances in various fields, notably to identify extremely rare objects and build robust statistical studies.
The survey we are presenting here, the Canada-France Brown Dwarfs Survey-InfraRed aims at finding ultracool brown dwarfs (T$_{eff}<$ 650K) of which only 6 are currently published by @Warren.2007 [@Delorme.2008a; @Burningham.2008; @Burningham.2009; @Burningham.2010sub]. @Lucas.2010sub have very recently identified a probably even cooler object. These rare objects are in many ways the intermediate “missing link" between the cold atmospheres of the Solar System’s giant planets and cool stellar atmospheres. The physics and chemistry of their atmospheres, dominated by broad molecular absorption bands, are very planetary-like [see @Kulkarni.1997 for instance] and the cool brown dwarfs spectra are the key to constraining planetary and stellar atmosphere models. Nowadays, the Teff$<$700K atmosphere temperature regime is troublesome for modellers. A few ultracool late T brown dwarfs have now been discovered with effective temperatures below 650K. These discoveries step into unexplored territory and a new generation of models is emerging. It is facing several difficulties. 1) Out-of-equilibrium chemistry plays an important role, resulting for instance in NH$_3$ being less prevalent than expected [@Cushing.2006]. 2) Fine details of convection control both the L/T transition and the dredge up of hot chemical species in late T atmospheres. 3) Water cloud formation and dust nucleation play important roles. 4) Line opacities of several molecules, in particular NH$_3$ and, to a lesser extent, CH$_4$ are unknown and cause important spectroscopic feature mismatches. As a good example of the need for refined models, @Burningham.2009 have recently determined that a T8.5 dwarf companion to an M star was actually $\sim$15% cooler than model fitting would have predicted and @Dupuy.2009 and @Liu.2008 reached similar conclusions when studying brown dwarf binaries with dynamical masses.
Under those circumstances, observations are key to the development of the models. Only five brown dwarfs with temperatures below 650K (T8.5) are currently known from recent discoveries by UKIDSS and CFBDS, and this small number prevents discerning general trends from individual peculiarities. @Kirkpatrick.1999 and @Burgasser.2002 could rely on samples of 20-25 objects to respectively define the L and T spectral types. In this article we present the CFBDSIR, a near infrared (hereafter NIR) extension to the CFBDS that will provide a WIRCAM [@Puget.2004] $J$-band coverage down to $J_{vega}=20.0$ for 10$\sigma$ detections atop 335 square degrees of CFBDS MegaCam [@Boulade.2003proc] $z'$-band imaging with a 5$\sigma$ detection limit of $z'_{AB}$=23.25-24.05. All optical magnitudes presented in this article are AB magnitudes, while all NIR magnitudes are Vega magnitudes. When the CFBDSIR is complete, we hope to achieve a threefold increase in sample size to 15-20 characterised ultracool brown dwarfs and possibly find a few substellar objects significantly cooler than 500K of which none is known yet outside the solar system. This will define general trends and dispersions around them, permitting the study of ultracool dwarfs not only as individual interesting objects, but as a population. This will help define the T/Y spectral transition that is expected to occur in this temperature range. In section 1 we present the rationale of this new wide-field survey and the observations at its core. In section 2 we describe the data reduction and the data analysis methods we used to identify ultracool brown dwarfs candidates. Finally, we present the spectra and the photometry of the first ultracool brown dwarf identified with CFBDSIR in section 3.
Observations
============
Far-red and near infrared photometric properties of brown dwarfs
----------------------------------------------------------------
Field brown dwarfs are cool objects, with a temperature range that currently extends from $\sim$2500K (early L) to $\sim 525$K [latest objects identified, e.g. @Leggett.2009]. Even cooler, and still to be found, brown dwarfs should close the temperature gap between late type T-dwarfs and solar system Jovian planets($\sim$110K). These objects do exist [see @Burgasser.2009proc for instance] because low-mass brown dwarfs already observed in young clusters must cool down to this temperature range when they age. Brown dwarfs spectra differ significantly from a black body, and have considerable structure from deep absorption lines and bands. The spectral energy distribution of 500K brown dwarfs peaks in the in the $J$ band in the near infrared (even colder objects should emit more energy in the mid-infrared), and they are therefore most easily detected in that wavelength range. Their NIR $JHK$ colours are, however, not distinctive at a modest signal-to-noise ratio [see @Metchev.2008 for instance], and brown dwarfs are more easily recognised by including at least one photometric band blueward of 1 $\mu$m. At those wavelengths the steep slope of their spectra stands out, and they have very distinctively red $i'-z'$ and $z'-J$ colours. The CFBD Survey [@Delorme.2008b] took advantage of their distinctive $i'-z'$ colours to identify hundreds of L and T-dwarfs. However, the reddest and coolest brown dwarfs have extremely red $z'-J$ colours and are much easier to detect in the NIR than on original CFBDS far-red images. A WIRCam $J$-band coverage of CFBDS fields is a straightforward and efficient way to cumulate both the very effective selection criteria using far-red colour information and the NIR detection sensitivity to ultracool brown dwarfs. Since the overlap of CFBDS with existing NIR surveys with a relevant depth [such as UKIDSS, @Lawrence.2007] is marginal, it was impossible to rely on archive data.
The resulting survey, CFBDSIR, identifies astrophysical sources on $J$-band WIRCam [@Puget.2004] images and selects ultracool brown dwarfs candidates depending upon their $z'-J$ colours, using $z'$ magnitudes from CFBDS MegaCam [@Boulade.2003proc] images. The $z'-J$ colour has a wide range for brown dwarfs, varying from 2.6 for mid-L types to over 4.5 for late-T types (Fig. \[zJspT\]). It therefore provides (at least at a good signal-to-noise ratio) a good selection criteria to identify ultracool brown dwarfs. They usually have $z'-J>$3.8, as confirmed by atmosphere models such as BT-Settl [@Allard.2007], synthetic MegaCam/WIRCam colours derived from known objects [@Delorme.2008b] and direct observational data [@Delorme.2008a; @Burningham.2008; @Burningham.2009]. Models suggest that cooler objects, not yet discovered (T$<$500K), are even redder. Figure \[zJspT\] however shows that the colour-spectral type relation for late T-dwarfs has a wide spread, meaning that this $z'-J$ colour range also contains some warmer mid-T dwarfs. Follow-up photometry of candidates in $H$ and $K_{\rm s}$ band easily distinguishes the relatively blue very late T from the redder mid-T-dwarfs [see @Lodieu.2007 for instance]. Only very rare astrophysical objects share the same $z'JHK$ colour range: very high-redshift starburst-galaxies, extremely red Balmer break galaxies, and atypical broad absorption-lines quasars at moderately high redshift ($z\geq 2$), such as those described in @Hall.2002. However, those objects can be differenciated from brown dwarfs using only photometry: they are not as red in $i'-z'$ as ultracool brown dwarfs and will appear in the $i'$ CFBDS images whereas brown dwarfs will not. Quasars with redshift z$>$7 cannot be distinguished from cool brown dwarfs using the CFBDSIR $i',z',J$ and optical photometry, but we would be lucky to find just one of these extremely interesting objects. None has been discovered yet, and extrapolation of the z$=$6 luminosity function [@Willott.2010] suggests that wider or/and deeper surveys will be needed to find one. Other possible contaminants are detector artefacts and variable objects whose luminosity changed between $z'$ and $J$ exposures.
The survey
----------
[**WIRCam NIR data.**]{} This article focuses on the results obtained from a 66 square degrees pilot subset of CFBDSIR whose final coverage is expected to be 335 square degree. CFBDSIR WIRCam imaging goes to a depth of $J_{vega}=20.0$ for a point-source detection limit of 10$\sigma$, which ensures accurate photometry and rejects most spurious detections. Images were acquired at CFHT in QSO mode with seeing varying from 0.6to 1.0during semesters 2006B, 2007A, and 2009B. These WIRCam images overlap the existing $z'$-band images of CFBDS; i.e., each $\sim$ 1 square degree MegaCam field is covered by nine 21’ by 21’ WIRCam $J$-band 45-second exposures. For the sake of efficiency, no dithering is done. Instead, the 9 adjacent fields observed in sequence are used for sky construction. Each 9-field patch is actually observed twice, generally one night apart, in order to identify and remove any moving solar system object, for a total integration time of 90 seconds. The second sequence is observed with few pixels offset to average the fixed noise pattern seen on the WIRCam detectors. The 10$\sigma$ limiting depth of $J_{vega}=20.0$ ensures that all confirmed ultracool brown dwarf candidates can be observed with low-resolution spectrographs on 8-meter class telescopes.\
[**Optical data.**]{} The optical data consist of the $z'$-band images used for the CFBD Survey. This survey is made of public and P.I. data and associated 4 sub-surveys of different area shallowness, namely the Canada-France-Hawaii Telescope Legacy Survey-Very Wide,CFHTLS-Wide, CFHTLS-Deep and Red-sequence Cluster Survey-2 (RCS2), described in detail by @Delorme.2008b. The CFBDSIR only targets the 3 shallower components, as shown in Table \[maglim\]. This table compares the limiting magnitude, the maximum distances of detection for mid-L, mid T and the latest T-dwarfs, together with the areas covered by each survey. The similar table 1 in @Delorme.2008b incorrectly uses the maximal magnitude limit for the CFHTLS-WIDE, instead of the average one. The value of 23.3 stated in Table \[maglim\] here corrects this error. The 335 square degrees CFBDSIR probes about 2.8 times more volume for late T-dwarfs than the $\sim$900 square degree CFBDS, and even more for redder (and thus likely cooler) objects. Figure \[cfbdsir\_map\] shows the sky coverage of CFBDSIR as of March 2010. The optical data is public and available on the CFHT archive, while the NIR data becomes public after the standard one-year CFHT proprietary period.\
![Map of observed CFBDSIR fields as of March 2010. Dashed lines are +/-20 degrees of galactic latitude. \[cfbdsir\_map\]](14277fg1.ps){width="8cm"}
[|X|X|X|X|X|X|]{} Survey Name& $z'_{AB}$ $10\sigma$ ($5\sigma$) detection limit& mid-L maximal detection (pc) & mid-T maximal detection (pc) & T9 maximal detection (pc) & Final coverage (sq deg)\
CFBDS:RCS-2 & 22.5 (23.25) & 185 & 80 &16 & 600\
CFBDS:CFHTLS-Very Wide & 22.8 (23.55) & 215 & 90 & 18 & 150\
CFBDS:CFHTLS-Wide & 23.3 (24.05) & 270 & 115 & 22 & 170\
Survey Name& $J_{vega}$ $10\sigma$ detection limit & mid-L maximal detection (pc) & mid-T maximal detection (pc)& T9 maximal detection (pc) & Final coverage(sq deg)\
CFBDSIR & 20.0 & 235 & 145 & 35 & 335\
CFBDS initial detections are made in $z'$ and only better than $10\sigma$ detections are used. CFBDSIR makes the initial detection in $J$, using only better than $10\sigma$ detections in $J$, and is only limited in $z'$ by no detections. We define any $z'$-band object with a signal below the $5\sigma$ threshold as a no detection or ”z’-dropout".
[**Survey rationale.**]{} Ultracool brown dwarfs have $z'_{AB}-J_{vega}>3.8$ for the MegaCam and WIRCam photometric systems, with some already observed at $z'-J=4.5$. Given the relative depth of the optical and NIR exposures, most of the T-dwarfs earlier than T7 detected in the $J$-band image will have a $z'$-band counterpart. The objects detected at $J$ and not at $z'$ (hereafter $z$-dropouts) are thus good candidates for some of the coolest T-dwarfs known ($>$T7), and possibly even cooler Y dwarfs.
Since our most interesting candidates are likely to only be detected in $J$-band, we need to carefully eliminate most sources of contamination in this band. The main contaminants are detectors artefacts, variable objects and asteroids. As described in detail in section \[data\_analysis\], our point spread function (hereafter PSF) analysis removes most artefacts, while all asteroids are eliminated because they move between the two exposures taken at each pointing. Supernovae and other strongly variable objects have to be rejected during the follow-up, but their numbers are kept low thanks to the relative shallowness of the survey. Since we select all PSF-looking $z'$-band dropouts, CFBDSIR also very efficiently identifies high-proper motion objects: if the proper motion is high enough that a $J$-band source cannot be cross-matched with its $z'$-band counterpart, the automatic pipeline keeps the candidate in the selection as a $z'$-band dropout. Visual examination of all selected candidates subsequently identifies those high proper motion sources easily.\
[**NIR Follow-up.**]{} The NIR follow-up of CFBDSIR candidates removes the remaining candidates but also provides an efficient characterisation of the confirmed candidates. Ultracool brown dwarfs can be singled out by their blue $J-H$ and $H-K$ colours owing to stronger H$_2$O, CH$_4$ and probably NH$_3$ absorption than earlier T dwarfs. The CFBDSIR follow-up of the first 66 square degrees from CFBDSIR required about 3.5 nights on SOFI [@Moorwood.1998] at NTT. We were able to observe all 55 T-dwarfs candidates identified and to confirm 6 of them as T-dwarfs, including 3 ultracool brown dwarfs (later than T7 dwarfs and possible Y dwarfs) candidates. The rationale of the NIR follow-up is the following.
- A short (5 to 10 minute dithered image, with 30-s individual exposures), $J$-band exposure confirms the candidate and eliminates any remaining contaminants from variable sources, such as supernovae or detector artefacts. For confirmed candidates, this image also provides good signal-to-noise (from 20 to about 100, depending on the target magnitude) $J$-band photometry, better than the photometry on the detection image.
- All candidates confirmed with this SOFI $J$ photometry are imaged in $H$-band to characterise them as ultracool brown dwarfs or earlier T-dwarfs. A 10-20 minute dithered sequence, with 20-s individual exposures, usually achieve good signal-to-noise photometry, with an accuracy better than 5%.
- All confirmed candidates with measured $J-H<$0.1 are potential ultra-cool brown dwarfs that can be further characterised by acquiring $K_{\rm s}$-band photometry, if enough observing time is available. A 15-30 minute dithered sequence, with 15-s exposures typically achieves good signal-to-noise photometry in $K_{\rm s}$.
It should be noted that this very efficient confirmation and characterisation photometric follow-up is made possible by visitor-mode observation combined with the automatic image reduction by SOFI pipeline *Gasgano*. A simple photometric analysis can be carried out by the observer only minutes after the exposures allowing $J$ and possibly $H$ and $K_{\rm s}$ photometry to be derived on-the-fly. It is then possible to choose the follow-up strategy most suited to each individual candidate. The final astrometric and photometric calibration is done using 2MASS [@Skrutskie.2006] stars in the field as references.
Survey analysis
===============
Ultracool brown dwarfs are extremely red objects 25 to 60 times (3.5 to 4.5 magnitudes) brighter in $J$-band that in $z'$ band. This means that even if our $z'$ images are about 3 to 4 magnitudes deeper than the detection $J$-band images, many of our candidates with strong $J$ band detection will not appear at all in the $z'$ images. However, a non detection in $z'$ band is a very strong sign that the candidate is a very red astrophysical source with $z'-J>3.5$, exactly what we are looking for. The other alternative is that these sources are spurious, such as unrecognised artefacts (remaining detector cross-talk, unflagged hot pixel, optical ghost, etc.) on the $J$ image. Since ultracool brown dwarfs are extremely rare ( our preliminary estimate is $\sim$ 1 per 25 square degree, so fewer than 1 per $500~000$ sources down to $J$=20.0), false detection rates of even 1 per 10$^4$ real sources would greatly outnumber true brown dwarfs. We therefore need a very robust analysis of the discovery images to tie down the number of artefacts before we finally weed them out during the photometric follow-up of the candidates.
Image reduction
---------------
The WIRCam observations targeted 335 existing MegaCam fields from CFBDS, that have already been observed in $i'$ and $z'$. The reduction of MegaCam data is described by @Delorme.2008b.
Images were run through the ‘I‘iwi Interpretor of the WIRCam Images (‘I‘iwi - [www.cfht.hawaii.edu/Instruments/Imaging/WIRCam]{}) at CFHT, which does non-linearity correction, dark subtraction, flat-fielding, sky subtraction, bad pixel masking, photometric calibration, and rough astrometric calibration. Cross-talk subtraction was also performed on the 06B and 07A data, affected by amplifier to amplifier cross-talk.
Each set of 2 times 9 WIRCam images covering one $z'$ MegaCam image was then co-aligned, using the $z'$ image used as the astrometric reference. This astrometric calibration was performed with *Scamp* [@Bertin.2006], and the images were stacked using *Swarp*[@Bertin.2002]. This produced $\sim$1 square degree WIRCam images aligned with each targeted MegaCam field.
Image analysis {#data_analysis}
--------------
Since our stacks are only 2 exposures deep, the final frame is the average of both exposures. To easily reject moving solar system objects from our detection catalogues, we also produced a ”minimum“ image of both exposures. This combined image contains the lower of the pixel values of the two exposures, and is effectively devoid of all those objects that moved by more than one FWHM between the exposures. We carried out the analysis using the double-image mode of *Sextractor* [@Bertin.1996], with source detection on the ”minimum” image and photometric measurements on the average image, using PSF fitting. The different analysis steps are described here:
- Spatially variable PSF models of the images are built with PSFex [@Bertin.2010], using single stars within the image as prototypes..
- The sources on the minimal image are identified using *Sextractor*. Their astrometry and photometry are derived by PSF fitting. (The latter is discarded from thereon, but is included in the fit). Since moving objects are at different positions in the two exposures that were stacked to produce the minimal image, they do not appear in the resulting source list.
- A flux-only PSF fitting at the position of the sources identified on the minimal sum stacked image is then carried out on the average stacked image. This step produces the final WIRCam $J$-band catalogue.
- The MegaCam $z'$-band catalogue of the corresponding field is then produced using a similar position and flux PSF fitting with *Sextractor*.
- The $J$-band and $z'$-band catalogues are cross-matched so that each source in the $J$-band catalogue is associated with a $z'$ magnitude. In case there is no $z'$-band couterpart to a $J$-band detection, which is then a “$z$-dropout", the source is given the 5 sigma detection magnitude limit of the full $z'$ image as its $z'$ magnitude and the corresponding $z'-J$ colour is then considered as a lower limit of its actual colour.
Filtering and candidate selection
---------------------------------
The selection of ultracool brown dwarfs candidates in our catalogue aims at the greatest possible completeness (i.e. finding most of the ultracool dwarfs actually detectable on the images) while keeping the number of contaminants down to an acceptable level. Contaminants are particularly critical because the most promising candidates are the $z$-dropouts for which only a $J$ magnitude and a $z'-J$ lower limit on the colour is known. To keep the number of contaminants relatively low, we only selected sources with a signal-to-noise ratio above 10 in the $J$-band stack.
As visible in Fig. \[zJspT\], brown dwarfs later than T8 populate the $z'-J>$3.8 colour range. This figure as well as Fig. \[wilkins\] make use of spectra from http://www.jach.hawaii.edu/$\sim$skl/LTdata.html [@Martin.1999; @Kirkpatrick.2000; @Geballe.2001; @Leggett.2002; @Burgasser.2003; @Knapp.2004; @Golimowski.2004; @Chiu.2006]. As described in @Delorme.2008b these colours are synthesised from the spectra using the filters, atmosphere, telescope and detector transmission and sensitivity of the instruments used in CFBDSIR. Given the large colour spread of late T-dwarfs, we set a very conservative colour selection threshold of $z'-J>$3.5, to select as many ultracool dwarfs as possible. Since the 3.5$<z'-J<$3.8 colour range is mainly populated by warmer T-dwarfs and is still very far from any densely populated colour locus, as illustrated by Fig. \[colpop\], including it in our selection does not increase the number of contaminants significantly.
![$z'-J$ colour spectral type relation. The green symbols represent synthetic MegaCam/WIRCam colours for known objects with publicly available spectra. The black dashed line is the resulting averaged colour-spectral type relation. Red points show the observational colours and spectral types of CFBDS spectroscopically confirmed T-dwarfs. \[zJspT\] ](14277fg2.ps)
In addition to this colour selection, the main filtering criterion is based on the $\chi ^2$ from PSF fitting, to distinguish point sources from galaxies and artefacts, following the same method as described in @Delorme.2008b. Since brown dwarfs are point sources, this morphological rejection of all non-point-source-like objects effectively removes many non-stellar contaminants.
This automated selection produces an average of 6 candidates per square degree. Each of these is visually examined to remove remaining contaminants. In addition to inspecting both the $z'$-band and the $J$-band images, we examine the $i'$-band image (available from the CFBDS), to reject some variable contaminants, as well as possible contamination by atypical broad absorption line quasars, none of which is known to be very red in both $z'-J$ and $i'-z'$ [P.Hall, private communication and @Hall.2002]. Since the 5$\sigma$ detection limits of the CFBDS $i'$ images (between 24.5 and 25.5) are significantly deeper than the $z'$ images, broad absorption line quasars with $z'-J>3.5$ should be visible on the $i'$ image. We identified one such object, CFBDSIR232451-045852, with $z'-J=$4.7 and $i'-z'$=0.9.
Very high-redshift (z$>$6), star-forming galaxies and evolved galaxies with strong Balmer/4000Å breaks at z$\sim$2, shown in Fig. \[wilkins\], are other possible contaminants. While the surface density of J$\sim$20 high-redshift, star-forming galaxies is unknown (the brightest of these objects discovered so far have J$_{vega}\sim$25 [@Ouchi.2009], five magnitudes fainter than our detection limit), the expected exponential cut-off in the luminosity function suggests that the probability of finding any such galaxy in CFBDSIR is extremely low. Balmer/4000Å break galaxies at z$\sim$2.5 do enter the fringe of our selected colour range; however, their $i'-J$ colour is typically below 5, ensuring they are detected in the $i'$-band CFBDS images and are then eliminated from our candidate list.
After this final visual check, we end up with about 1 ultracool brown dwarf candidate per square degree, which has to be confirmed with pointed NIR observations.
![Colour-magnitude diagram of all sources detected with a signal-to-noise greater than 10 in a 1 square-degree stacked WIRCam image from CFBDSIR. Since no other filtering is applied, these sources can be stars, galaxies, or detector artefacts. In this specific instance, none of the red objects is a brown dwarf. \[colpop\]](14277fg3.ps)
![Colour-colour diagram of known stars and brown dwarfs from spectral type O (deep-blue dots) to T (dark-red dots). The blue line shows the colours of high-redshift-starburst galaxies, while the red line refers to red Balmer-break galaxies. These lines follow a redshift evolution and specific redshift steps are indicated by numbers near the lines. The colours are synthesised from spectra, and take into account the actual transmission and detector sensitivity of the MegaCam and WIRCam instruments used in CFBDSIR. \[wilkins\]](14277fg4.ps)
Results
=======
Photometric confirmation of 3 ultracool brown dwarfs
----------------------------------------------------
The 55 candidates found in a 66 square degree subset of the data were followed-up with photometry at the ESO New Technology Telescope, using the SOFI near infrared camera during visitor mode runs 083.C-0797(A) and 082.C-0506(A), in July 2009 and March 2009. These pointed NIR observations confirm six T-dwarfs, of which 3 are robust ultracool brown dwarf candidates. Those are likely to be either very late T-dwarfs ($>$T8) or cooler Y dwarfs. The brighter 2 of the 3 earlier T candidates are re-identifications of CFBDS-discovered brown dwarfs, spectroscopically confirmed as T3.5 and T5 (Albert et al., submitted.).
The candidates identified in the remaining 269 square degrees have not yet been followed-up, and they certainly include mostly contaminants. Extrapolating the results from the 66 square degree pilot subset of CFBDSIR to the full survey, we expect to find $\sim$15 ultracool brown dwarfs. Low-resolution NIR spectroscopy of the confirmed ultracool brown dwarfs will be needed to derive spectral types and characterise their cool atmosphere physics.\
[**Photometric properties of ultra-red brown dwarf candidates**]{}
![Colour-colour diagram of some of the latest brown dwarfs known, $>$T8, later than spectrum used for up to date spectral classification scheme together with the 3 CFBDSIR ultracool dwarfs candidates. The regular T-dwarf approximate colour range is highlighted in the upper left corner. Note that given the strong dispersion in colours of T dwarfs, some mid/late T do spread out of this indicative colour range. \[zJJH\]](14277fg5.ps){width="8cm"}
After the March 2009 $J, H$, and $K_s$ follow-up observations, one candidate stood out as particularly interesting. We then obtained additional WIRCam $J, H$, and $K_s$ photometry for this object, CFBDSIR J145829+101343 (hereafter CFBDSIR1458). The resulting magnitudes are presented in Table \[mag\]. The SOFI photometry in this table has additional uncertainty because its calibration is bootstrapped from a small number of good 2MASS reference stars in the narrow field of the SOFI NTT images, especially so in the $H$ and $Ks$ bands.
CFBDSIR1458 colours are detailed in Table \[colours\] and shown in Fig. \[f\_chart\], and can be summarised as follows:
- Very red far-red colours: $z'-J=$3.94, which Table \[colours\] compares to those of other ultracool brown dwarfs;
- Very blue NIR colours, with \[$J-H$;$J-K_{\rm s}$\]=\[-0.46;-0.94\], pointing to very strong molecular absorptions in the $H$ and $K$ bands. The $J-K_{\rm s}$ colour of -0.94 approximately translates into a $J-K$ colour of -1.02 [@Stephens.2004; @Leggett.2010].
 
------------------------ ------------------------
 
A second follow-up run at NTT on July 2009, confirmed 2 other ultra-red objects, CFBDSIR221903.07+002417.92 and CFBDSIR221505.06+003053.11 (hereafter CFBDSIR2219 and CFBDSIR2215), with even redder $z'-J$ colours, typical of ultracool brown dwarfs. These objects have redder $z'-J$ than any known T8+ brown dwarf. CFBDSIR2215, however, has only a moderately blue $J-H$ colour, which would be compatible with an earlier (i.e. T5-T7) spectral type, suggesting a peculiar spectrum. The photometric properties of these objects are described in Table \[colours\] and Fig. \[zJJH\].
Filter $z'$ $J$ $H$ $K$s
-------- ---------------- ---------------- ---------------- ----------------
Mag(1) $23.60\pm$0.24 19.66$\pm$0.02 20.12$\pm$0.13 20.60$\pm$0.37
Mag(2) - 19.72$\pm$0.04 19.96$\pm$0.16 20.13$\pm$0.32
: (1) $J,~H,~Ks$ CFHT WIRCam Vega photometry and $z'_{AB}$ MegaCam photometry of CFBDSIR1458. (2)$J,~H,~Ks$ NTT SOFI Vega photometry. \[mag\]
Object $z'-J$ $J-H$ $J-K$
-------------------- --------------- ----------------- ---------------- --
ULAS0034$~^{1,3}$ 3.90$\pm$0.06 -0.28$\pm$0.05 -0.12$\pm$0.06
CFBDS0059$~^{2}$ 3.86$\pm$0.06 -0.21$\pm$0.06 -0.67$\pm$0.06
ULAS1335$~^{1,5}$ 4.14$\pm$0.10 -0.35$\pm$0.01 -0.38$\pm$0.03
2MASS0939$~^{1,4}$ - 0.18$\pm$0.181 -0.58$\pm$0.10
WOLF940B$~^{6}$ 3.99$\pm$0.13 -0.61$\pm$0.04 -0.69$\pm$0.05
CFBDSIR1458 3.94$\pm$0.24 -0.46$\pm$0.13 -1.02$\pm$0.37
CFBDSIR2219 4.45$\pm$0.10 -0.20$\pm$0.085 -
CFBDSIR2215 4.30$\pm$0.12 -0.11$\pm$0.08 -
: Colours of ultracool brown dwarfs.\[colours\]
References:
$^1$@Leggett.2009, $^2$@Delorme.2008a $^3$@Warren.2007, $^4$@Tinney.2005, $^5$@Burningham.2008, $^6$@Burningham.2009
While CFBDSIR2219 and CFBDSIR2215 are queued for NIR spectroscopic characterisation, we already obtained a spectrum of CFBDSIR1458, which we discuss in section 4.2.
[**Proper motion of CFBDSIR1458**]{}\
Since the $z'$ MegaCam image and the $J$ WIRCam image are co-aligned by the CFBDSIR pipeline the proper motion is easily measured from these 2 images. CFBDSIR1458 moves by +0.58 in RA and -0.95 in DEC between the July 15, 2004 date of the $z'$ image and April 1, 2007 date of the $J$ image. The centroiding and image alignment uncertainties are low, at 0.035, but the error budget has to include chromatic refraction and the uncertain parallactic motion. The estimated spectroscopic distance is $\sim$23pc, with a likely range of 15–30 pc (Table \[pm\]), which translates to a 0.04maximum error from the parallax. Due to the very steep spectral energy distribution in the $z'$ band, chromatic refraction here is of the order of the measurement error. We also measured the proper motion between the $J$-band WIRCam discovery image and the $J$ band NTT follow-up image, finding +0.32 in RA and -0.80 in DEC between April 1, 2007 and March 5, 2009. This second measurement has smaller centroiding and image-alignment uncertainties, 0.03, minimal chromatic refraction uncertainties since the two $J$-band observations were obtained at similar airmasses, and a small unceretainty from the parallax because the two observations were coincidentally obtained at closely matched times of the year. It is therefore our preferred proper motion measurement, and is consistent with the previous one. Table \[pm\] presents the resulting yearly motion and kinematic parameters.
RA(.yr$^{-1}$) DEC(.yr$^{-1}$) RA(km.s$^{-1}$) DEC(km.s$^{-1}$)
----------------- ----------------- ----------------- ------------------
+0.17$\pm$0.016 -0.41$\pm$0.016 18 46
: Yearly proper motion for CFBDSIR1458. \[pm\]
The systematic errors induced by chromatic refraction and parallax effects are not corrected. The estimate of the absolute tangential velocity assumes a distance of 23pc.
Spectroscopic confirmation of a new ultracool brown dwarf
---------------------------------------------------------
[**Observations and reduction**]{}
After reduction and analysis of the March 7, data, an ESO Director Discretionary Time observation request was submitted on March 20, 2009 to obtain low-resolution NIR spectroscopy of CFBDSIR1458. This proposal for 4 hours of $H$-band observation, totalling 150 minutes of exposure on target, was accepted on April 22. The first observations were acquired on May 4, and the last on September 1, on average at high airmass, varying from 1.4 to more than 2.0.
The spectrum was extracted and calibrated using our own IDL procedures. The reduction proceeded as follows. The sequence of spectral images were flat-fielded using an internal flat taken immediately after the science frames. Since the trace was too faint for its position to be accurately determined, its curvature was derived from the reference star spectrum. The frames were then pair-subtracted, effectively removing most of the sky, dark current and hot pixels contributions. Each frame was collapsed along the spectral dimension to determine the positive and negative traces positions. We then extracted the spectra using positive and negative extraction boxes that have identical but opposite integrals; this minimised the contribution from residual sky line that would have remained from the pair subtraction. The same operation was performed on the A0 telluric calibration star. Spectra derived from individual image pairs were then median-combined into final target and calibration star spectra. A telluric absorption spectrum was derived using the calibration-star spectra. A black body spectrum with a temperature of 10 000K was assumed for the A0 star and hydrogen-lines were interpolated over. The target spectrum was then divided by the derived telluric transmission spectrum. A first-order wavelength calibration was obtained from an argon-lamp spectrum, and fine-tuned by registering bright OH lines obtained from a sum of the pair of images of interest.\
[**Spectroscopic properties**]{}
The resulting spectrum (Fig.\[spectra\]) has a low signal-to-noise owing to the faintness of the target ($H_{vega}=20.12$) and its relatively high airmass at the time of the observations. We plan to obtain better signal-to-noise observations, as well as $J$ and $K$-band low-resolution spectrum, but we were already able to derive from the present $H$-band spectrum the spectroscopic indices described by @Burgasser.2006 and @Delorme.2008a, which quantify the strength of key molecular absorption bands. As shown in Table \[indices\], this classifies CFBDSIR1458 as an ultracool brown dwarf with spectral type later than T8 and a temperature in the same range ($\sim $500-600K) as the coolest brown dwarfs known. Direct comparison of the CFBDSIR1458 $H$-band spectrum with other ultracool brown dwarfs (See Figs. \[spectra\] and \[spectra\_zoom\]) visually confirms that H$_2$O and CH$_4$ absorption in its atmosphere are significantly stronger than they are on 2MASS0415 [@Burgasser.2003] the T8 spectral template. This also strongly suggests that CFBDSIR1458 is indeed a later-than-T8 ultracool brown dwarf. The comparison with even cooler objects is less clear cut, mainly because of the low signal-to-noise of the spectrum, as emphasised by the strong variations in the spectral indices for 2 different -but both sufficiently sampled- binning of CFBDSIR1458 spectrum visible in Table \[indices\]. However, both the spectrum and the indices would tend to show that CFBDSIR1458 is not cooler than the coolest brown dwarfs already known.
This intermediate spectral feature would tentatively put CFBDSIR1458 in the same class as WOLF940B, that was classified as T8.5 by @Burningham.2009 who assigned a temperature of 550-600K to this object. Given the similarities in the $H$-band indices of both objects, a reasonable estimate would put CFBDSIR1458 in the same temperature range. However, this rough estimate will need to be confirmed by higher signal-to-noise multi-bands spectroscopic observations. In particular, its very blue $J-K$ colour could be due to sub-solar metallicity [@Leggett.2010]. Additional observations would also enable looking for the NH$_3$ absorption in the CFBDSIR1458 spectrum, such as the probable absorption band identified by @Delorme.2008a. IRAC imaging in the 4.5micron channel would also be very valuable since temperature can be reliably derived from the \[$H-4.5$\] colour [@Leggett.2010].
Object Sp. Type H$_2$O-H CH$_4$-H NH$_3$-H
----------------- ---------- ---------- ---------- ----------
Gl570D T7.5 0.208 0.137 0.672
2MASS0415 T8 0.183 0.104 0.625
WOLF940B T8+/Y? 0.141 0.091 0.537
CFBDSIR1458 (1) T8+/Y? 0.149 0.046 0.568
CFBDSIR1458 (2) T8+/Y? 0.146 0.087 0.582
ULAS0034 T8+/Y? 0.133 0.096 0.516
CFBDS0059 T8+/Y? 0.119 0.084 0.526
ULAS1335 T8+/Y? 0.114 0.077 0.564
The 2 values for CFBDSIR1458 were derived using a median-binning of the spectra over (1) 17 pixels (resolution $\sim$170) (2) 6 pixels(resolution 500). The other values are from @Burgasser.2006 [@Warren.2007; @Burningham.2008; @Delorme.2008a; @Burningham.2009]
![$H$-band spectra of CFBSIR1458 compared with CFBDS0059, one the 2 coolest brown dwarfs known. Both spectra have been median-binned over 6 pixels to match the full ISAAC spectral resolution of 500. \[spectra\]](14277fg7.ps){width="8cm"}
![Zoom on the $H$-band peak of the spectra of CFBSIR1458 compared with CFBDS0059 and 2MASS0415 [@Burgasser.2003], the T8 spectral template. The CFBSIR1458 ISAAC spectrum has been median-binned to a resolution of 170. \[spectra\_zoom\]](14277fg8.ps){width="8cm"}
Conclusion
==========
We have described CFBDSIR, a new NIR survey dedicated at finding ultracool brown dwarfs and using WIRCam camera on the the CFHT. Complementing existing deep far-red data by new $J$-band observations, we select brown dwarfs candidates on their very red $z'-J$ colour. A robust PSF analysis allows us to derive reliable colours and to distinguish point-source-like brown dwarfs from most contaminants. The candidates are then confirmed by follow-up pointed NIR observations in $J$-band and confirmed ultracool brown dwarfs are imaged in $H$ and $K_{\rm s}$ bands. We used these photometric measurements to identify several new brown dwarfs, including 3 objects likely as cool as and possibly even cooler than any published brown dwarfs.
We presented CFBSIR1458, the first CFBDSIR ultracool brown dwarf confirmed by spectroscopy. The analysis of its $H$-band spectra, though at relatively low-signal-to-noise, robustly confirms it as later than T8 spectral type and hints at a temperature in the 550-600K range, so among the coolest brown dwarfs discovered. When the 335 square degree survey is completed, we expect to discover a sample of 10 to 15 ultracool brown dwarfs, more than doubling the currently known population of later than T8 objects and enabling study of them as a population rather than extreme individual objects. This will put strong constraints on cool stellar and planetary atmosphere, and with additional mid-infrared follow-up, will help to define the selection criteria for the upcoming WISE survey.
Thanks go to the queue observers at CFHT who obtained data for this paper. This research has made use of the VizieR catalogue access tool, of SIMBAD database and of Aladin, operated at CDS, Strasbourg. This research has benefitted from the M, L, and T-dwarf compendium housed at DwarfArchives.org and maintained by Chris Gelino, Davy Kirkpatrick, and Adam Burgasser. Financial support from the ”Programme National de Physique Stellaire" (PNPS) of CNRS/INSU, France, is gratefully acknowledged.
[^1]: Based on observations obtained with WIRCam, a joint project of CFHT, Taiwan, Korea, Canada, France, and the Canada-France-Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institute National des Sciences de l’Univers of the Centre National de la Recherche Scientifique of France, and the University of Hawaii. Based on observations obtained with MegaPrime/MegaCam, a joint project of CFHT and CEA/DAPNIA, at the Canada-France-Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institut National des Sciences de l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France, and the University of Hawaii. This work is based in part on data products produced at TERAPIX and the Canadian Astronomy Data Centre as part of the Canada-France-Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. Based on observations made with the ESO New Technology Telescope at the La Silla Observatory under programs ID 082.C-0506(A) and 083.C-0797(A) with SOFI at NTT and ESO VLT Director Discretionary Time program 282.C-5075 with ISAAC.
|
{
"pile_set_name": "ArXiv"
}
|
[Central pain processing in chronic low back pain. Evidence for reduced pain inhibition].
A study of patients with low back pain (LBP) had revealed altered central pain processing. At an equal pain level LBP patients had considerably more neuronal activation in the somatosensory cortices than controls. In a new analysis of this dataset, we further investigated the differences in central pain processing between LBP patients and controls, looking for possible pathogenic mechanisms. Central pain processing was studied by functional magnetic resonance imaging (fMRI), using equally painful pressure stimuli in a block paradigm. In this study, we reanalyzed the fMRI data to statistically compare pain-elicited neuronal activation of both groups. Equally painful pressure stimulation resulted in a significantly lower increase of regional cerebral blood flow (rCBF) in the periaqueductal gray (PAG) of the LBP patients. The analysis further revealed a significantly higher increase of rCBF in LBP than in HC in the primary and secondary somatosensory cortex and the lateral orbitofrontal cortex (LOFK), elicited by these same stimuli. These findings support a dysfunction of the inhibitory systems controlled by the PAG as a possible pathogenic mechanism in chronic low back pain.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
s of 764259050.
2, 5, 37, 413113
List the prime factors of 9128734.
2, 4564367
List the prime factors of 71015438.
2, 13, 1009, 2707
What are the prime factors of 56797517?
7, 19, 61007
List the prime factors of 674326519.
107, 6302117
List the prime factors of 9002623636.
2, 71, 31699379
What are the prime factors of 2596209053?
1493, 1738921
What are the prime factors of 7856493?
3, 2618831
What are the prime factors of 3245922225?
3, 5, 7, 13, 47, 3373
What are the prime factors of 799502779?
799502779
List the prime factors of 47064643.
47064643
List the prime factors of 75336227.
3253, 23159
List the prime factors of 341073684.
2, 3, 7, 67, 20201
What are the prime factors of 122775980?
2, 5, 127, 48337
What are the prime factors of 420314734?
2, 7, 163, 184187
What are the prime factors of 85410553?
61, 1400173
List the prime factors of 102547765.
5, 41, 500233
What are the prime factors of 3001999042?
2, 7, 214428503
What are the prime factors of 366076960?
2, 5, 107, 21383
List the prime factors of 2237982371.
2237982371
What are the prime factors of 67729532?
2, 13, 1302491
What are the prime factors of 24349210?
2, 5, 1289, 1889
What are the prime factors of 1687107007?
3083, 547229
List the prime factors of 5977702112.
2, 17, 1451, 7573
List the prime factors of 791102064.
2, 3, 16481293
List the prime factors of 3630085.
5, 277, 2621
List the prime factors of 130228061.
1439, 90499
List the prime factors of 6468554120.
2, 5, 7, 239, 96661
What are the prime factors of 81905410?
2, 5, 31, 264211
What are the prime factors of 386409897?
3, 19, 2259707
What are the prime factors of 260915955?
3, 5, 17394397
What are the prime factors of 69387319?
17, 4081607
What are the prime factors of 45395907?
3, 653, 23173
List the prime factors of 609422437.
13, 83, 277, 2039
What are the prime factors of 136443062?
2, 7, 163, 59791
List the prime factors of 795435184.
2, 49714699
What are the prime factors of 60027879?
3, 20009293
List the prime factors of 243219192.
2, 3, 10134133
List the prime factors of 200646579.
3, 7, 41, 397, 587
List the prime factors of 271384584.
2, 3, 11307691
List the prime factors of 358757563.
19, 251, 75227
What are the prime factors of 69479137?
7, 13, 73, 10459
List the prime factors of 28107558.
2, 3, 311, 5021
List the prime factors of 3728499351.
3, 1242833117
What are the prime factors of 534746330?
2, 5, 53474633
List the prime factors of 2576925346.
2, 1288462673
What are the prime factors of 245641580?
2, 5, 12282079
What are the prime factors of 2935279015?
5, 47, 491, 25439
List the prime factors of 7435958896.
2, 464747431
List the prime factors of 41276610.
2, 3, 5, 458629
List the prime factors of 5512029257.
7, 19, 89, 66523
What are the prime factors of 28014399?
3, 7, 71, 6263
What are the prime factors of 149116838?
2, 13, 5735263
List the prime factors of 9640669.
2381, 4049
What are the prime factors of 21098972?
2, 17, 31, 10009
What are the prime factors of 1385901520?
2, 5, 251, 69019
List the prime factors of 614989374.
2, 3, 102498229
What are the prime factors of 73556410?
2, 5, 19, 47, 8237
What are the prime factors of 13461603?
3, 17, 263953
List the prime factors of 81830602.
2, 7, 2377, 2459
List the prime factors of 12753871.
13, 981067
List the prime factors of 363895449.
3, 121298483
List the prime factors of 376490004.
2, 3, 11, 2852197
What are the prime factors of 1522523315?
5, 17, 41, 53, 8243
List the prime factors of 932859137.
7, 133265591
List the prime factors of 6080428971.
3, 23, 9791351
List the prime factors of 321824546.
2, 19, 2447, 3461
List the prime factors of 8645691.
3, 2881897
List the prime factors of 288833368.
2, 36104171
What are the prime factors of 990020968?
2, 307, 403103
List the prime factors of 877432988.
2, 149, 1472203
List the prime factors of 133932237.
3, 29, 1539451
List the prime factors of 791039765.
5, 61, 107, 24239
List the prime factors of 816472324.
2, 137, 199, 7487
What are the prime factors of 70870346?
2, 2087, 16979
What are the prime factors of 127096510?
2, 5, 19, 668929
What are the prime factors of 57111183?
3, 2115229
What are the prime factors of 2708070?
2, 3, 5, 19, 4751
What are the prime factors of 449060132?
2, 112265033
What are the prime factors of 3504183886?
2, 7, 3191, 78439
List the prime factors of 314812079.
173, 1819723
List the prime factors of 111578826.
2, 3, 821, 22651
What are the prime factors of 3457690503?
3, 17, 29, 113, 1217
List the prime factors of 30624864.
2, 3, 149, 2141
What are the prime factors of 37300909?
43, 867463
What are the prime factors of 39220988?
2, 43, 5303
List the prime factors of 2259724483.
53, 937, 45503
What are the prime factors of 4962608551?
463, 10718377
List the prime factors of 3263901458.
2, 2791, 584719
What are the prime factors of 4275155994?
2, 3, 251, 2838749
List the prime factors of 2413278513.
3, 421, 636917
What are the prime factors of 2124588326?
2, 7, 1069, 141961
What are the prime factors of 28922999?
7, 41, 179, 563
List the prime factors of 2868228108.
2, 3, 73, 1091411
What are the prime factors of 727308048?
2, 3, 67, 139, 1627
What are the prime factors of 486242550?
2, 3, 5, 1080539
List the prime factors of 93851719.
13, 751, 9613
What are the prime factors of 119993242?
2, 17, 29, 121697
What are the prime factors of 12761831?
83, 153757
List the prime factors of 95939849.
95939849
List the prime factors of 67602710.
2, 5, 7, 17, 56809
List the prime factors of 81236709.
3, 31, 71, 1367
What are the prime factors of 91113052?
2, 73, 312031
What are the prime factors of 103325798?
2, 23, 2246213
What are the prime factors of 935567132?
2, 233891783
What are the prime factors of 68956612?
2, 17239153
What are the prime factors of 21205213?
21205213
List the prime factors of 1379681915.
5, 275936383
What are the prime factors of 41111531?
29, 1417639
What are the prime factors of 4607459395?
5, 7, 11, 11967427
What are the prime factors of 109802201?
17, 6458953
List the prime factors of 387486838.
2, 151, 1283069
What are the prime factors of 66864639?
3, 22288213
List the prime factors of 117498568.
2, 11, 1335211
What are the prime factors of 2027641838?
2, 269, 349, 10799
What are the prime factors of 11179955?
5, 23, 67, 1451
List the prime factors of 222361469.
11, 1373, 14723
List the prime factors of 3513332894.
2, 5683, 309109
List the prime factors of 182971776.
2, 3, 13, 36653
List the prime factors of 337501181.
59, 827, 6917
List the prime factors of 3426156981.
3, 13, 23, 424397
List the prime factors of 2606781818.
2, 1303390909
What are the prime factors of 737896457?
737896457
What are the prime factors of 287151144?
2, 3, 7, 1709233
List the prime factors of 227029313.
7, 29, 1118371
List the prime factors of 192601199.
7, 27514457
What are the prime factors of 472648?
2, 11, 41, 131
What are the prime factors of 70738492?
2, 11, 127, 12659
List the prime factors of 3519197862.
2, 3, 586532977
What are the prime factors of 161663238?
2, 3, 11, 103, 7927
List the prime factors of 5329900119.
3, 379, 619, 7573
What are the prime factors of 440985299?
41, 89, 120851
List the prime factors of 414588535.
5, 73, 1135859
What are the prime factors of 17501842?
2, 8750921
What are the prime factors of 1096623282?
2, 3, 182770547
List the prime factors of 329441691.
3, 17, 83, 223, 349
List the prime factors of 101245730.
2, 5, 10124573
List the prime factors of 501204057.
3, 73, 2288603
List the prime factors of 189290989.
23, 199, 41357
What are the prime factors of 17135386?
2, 8567693
What are the prime factors of 90550280?
2, 5, 149, 15193
List the prime factors of 907565836.
2, 226891459
What are the prime factors of 94039912?
2, 11754989
What are the prime factors of 3189546840?
2, 3, 5, 443, 59999
List the prime factors of 85975501.
85975501
What are the prime factors of 10168211?
19, 535169
What are the prime factors of 555739882?
2, 281, 988861
What are the prime factors of 49287139?
11, 4480649
List the prime factors of 202480793.
2141, 94573
What are the prime factors of 25618839?
3, 73, 116981
What are the prime factors of 32469725?
5, 1298789
List the prime factors of 575866834.
2, 1301, 221317
What are the prime factors
|
{
"pile_set_name": "DM Mathematics"
}
|
Q:
In Lisp, how do you call a function from a macro, by name passed as an argument?
In Lisp, how do you call, from a macro, a function whose name is the symbol value of a symbol? I might be wrong but I think I'm right that a symbol is a variable.
Here is what I currently have:
(defmacro cfunc (a b) (list a b))
(defparameter foo 'my-func)
(defun my-func (data) '(some-code))
(cfunc foo data) ;does not work
(cfunc my-func data) ;works
I'm thinking I need to add some special character in front of foo to evaluate to its symbol value before being treated as a function. (cfunc foo data) creates and calls the function (foo data) instead of (my-func data). I suppose I could change the function defining in cfunc instead.
#'foo doesn't work, that gives (function foo) which cfunc returns and calls ((function foo) data). (symbol-value foo) can't work either. So I'm thinking I can't change what is given to cfunc but I can change the code of the function cfunc makes.
If someone has a specific page of a resource that tells me about evaluation and expansion using defmacro or the specifics of the special characters like # and ' or know the keywords I should be looking up, I'd appreciate it if that could be shared as well.
A:
First, in the form (cfunc foo data), to what do you expect that data refers? I don't see any definition of it here. It's only mentioned incidentally as a parameter to the my-func function, which doesn't come into play for your expansion of cfunc. Perhaps you expect data to be available later as a special variable.
In any case, the problem you're running into is that Common Lisp is a "Lisp-2"; a variable present at the head of a function form doesn't automatically have its function cell accessed to coerce it to a function. In your case, foo is not a function bound in the environment; it's a variable whose value is a symbol (my-func)—one that in turn is bound to a function. To navigate this extra level of indirection, you have to request that that symbol's function cell be accessed, either via funcall or, in other cases, function.
Here are a few observations from the REPL:
> (symbol-value 'foo)
MY-FUNC
> (ignore-errors (symbol-function 'foo))
NIL
#<UNDEFINED-FUNCTION FOO {1004E22D23}>
> (fboundp 'foo)
NIL
> (ignore-errors (symbol-value 'my-func))
NIL
#<UNBOUND-VARIABLE MY-FUNC {1005324E93}>
> (symbol-function 'my-func)
#<FUNCTION MY-FUNC>
> (fboundp 'my-func)
T
Here we see that the symbol foo has a value binding—meaning it's a variable—but it has no function binding. Following foo through to my-func, we see that my-func has no value binding, but it does have a function binding.
To wrap up, your cfunc macro needs be written as follows:
(defmacro cfunc (a b)
(list 'funcall a b))
Alternately, you can write it like this:
(defmacro cfunc (a b)
`(funcall ,a ,b))
You mentioned originally that the form
(cfunc my-func data)
works as intended. With my proposed revision above, it won't work any longer, because now my-func is being treated as a value to be evaluated as an argument to funcall, when in fact it has no value cell (as it's a function). Hence, you'll have to adapt the form to the following:
(cfunc #'my-func data)
That's saying, "Look up the symbol 'my-func' in the function namespace, grab its value, and supply that function as an argument."
For a more precise treatment on the difference in handling such symbols-pointing-to-functions in Lisp-1 and -2, see Gabriel's Technical Issues of Separation in Function Cells and Value Cells—in particular, section 5, "Notational Simplicity".
|
{
"pile_set_name": "StackExchange"
}
|
We don't run advertisements or sponsored content here, but we have bills to pay. You can help us stay 100% independent by donating just $1 a month via our Patreon. You can also make a one-off donation via Paypal.
The cover of Phantoms of Fear suggests that a more appropriate title for the book would be Pink Snot of Death. But don’t let that stop you from tackling this one if you have always wanted to play a pansy Wood Elf constantly weeping and moaning about pollution and destruction of the forests. You don’t get to use bows here, alas, but you do get some useless spells that won’t help you much in this adventure.
You are the Eldenurin – “Defender-Shaman of the Tribe” – of your fellow Wood Elves in Affen Forests, somewhere north-east in Khul. Your beloved forest, alas, is now under threat. Ishtra, a Demon Prince, has managed to open a portal into the world somewhere in the forests and now the gods have pretty much commanded that you go ahead, locate the portal, and send Ishtra back home ASAP. Of course, you have to do this alone because it is always logical to send one puny elf out there in a quest to vanquish a Demon Prince and his army.
Phantoms of Fear could have been interesting, as since you are a shaman, you have the ability to switch between traveling in real life and in the dream world. However, the end result is a mess. There is a new combat system for fights taking place in the dream world, using a Power score instead the usual Stamina score, but for some reason the author decides that it will be groovy if the hero is disadvantaged against even the lowliest enemies in the dream world. You will also need to pick up items in order to triumph – Ishtra can’t be wounded by weapons made by mortal hands – and you do this by wandering randomly through the woods hoping that you are going the right way. The whole thing is as exciting as trying to swat flies on a boring afternoon.
There are some horrible puzzles here. For example, the Trial of Ghosts is a pain in the rear end, if you ever come across it, and what could have been an interesting puzzle ends up being a chore with numbers. On the other hand, the pixies of the Riddling Reaver have a pretty amusing riddle reminiscent of Louis Carroll’s brand of riddles. There is also a monotonous feel to the story as the setting is drab and uninteresting even in the dream world. Even the confrontation with Ishtra lacks excitement. It doesn’t help that the author inserts some thinly-veiled soapbox rants against pollution and urbanization, with the hero weeping over visions of a world taken over by machines and skyscrapers. The whole thing feels like an unoriginal “save the forests” scree – but perhaps that is to be expected when pansy elves get involved.
|
{
"pile_set_name": "Pile-CC"
}
|
Over 2 million adult cases of hepatitis E virus (HEV) are thought to occur annually in India alone, and HEV accounts for the majority of acute viral hepatitis hospitalizations worldwide, yet accurate population-based estimates of HEV burden remain scant. The hallmark and most concerning aspect of HEV is a high mortality in infected pregnant women. There have been few rigorous, population-based, prospective studies of HEV incidence, immunopathogenesis and natural history among pregnant women. Our current understanding of the risk factors and host characteristics that lead to severe consequences in pregnant women and neonates is largely based on hospital-based convenience samples. There is a need to carefully define the burden of HEV infection and disease in terms of maternal and neonatal consequences in a typical, endemic resource-poor population. To characterize the population- based epidemiology of HEV and describe maternal morbidity and mortality, pregnancy outcomes, and neonatal survival, we will 1) enroll and follow ~10,000 newly pregnant women through 3 months postpartum in a representative, rural Bangladesh population to identify the trimester-specific incidence of HEV infection, rates of illness, and risk factors for infection and hepatitis E disease and 2) recruit and follow pregnant women hospitalized with acute HEV infection and/or disease to characterize the immunologic, nutritional and other host factors associated with various treatment outcomes, including vertical transmission and neonatal survival. We will also isolate and sequence HEV from acutely ill women, for insight into the molecular epidemiology of HEV. We have over a decade of HEV research experience in this endemic population partnering with the ICDDR,B's Matlab Research Center, and we have estimated, in a smaller study, an incidence of HEV in pregnancy of ~40 per 1000 person-years. Diagnostic support will be provided by one of the most reputable HEV reference laboratories: Dr. Robert Purcell's Hepatitis Laboratory at the National Institutes of Health (Bethesda, Maryland). Co-investigators with expertise in immunology and access to the Johns Hopkins Becton Dickinson Immune Function Laboratory further strengthen this applications. The proposed project will be the first to quantify and characterize HEV infections in a large cohort of rigorously monitored pregnant women, and provide precise estimates of the burden and consequences of HEV in pregnancy and to the neonate. We will clarify the burden of this under recognized contributor to maternal mortality and morbidity in endemic areas, based on large population- based data, providing important information for future prevention and vaccine efforts.
|
{
"pile_set_name": "NIH ExPorter"
}
|
Q:
Add foreign key constraint to existing table with data in a Visual Studio database project
I have a Visual Studio database project hitting a SQL Server 2014 database. I need to create a child table for an existing parent table. The parent already has the foreign key column and I need to add the constraint to the new parent table (the FK is on the child and pointing to the parent). I would like to preserve the data.
Currently, the deployment process creates the new table and the foreign key. The post deployment script adds the child records to the new child table.
My problem is that the FK fails because the child records have not been added.
I can't add the child records in pre-deployment because the table does not exist at that point.
I can't disable the constraint in the pre-deployment because it is getting created in the deployment.
This seems like a common occurrence. Is there an established way to do this?
A:
This should not be an issue. By default a database project creates constraints with the NoCheck option - meaning SQL Server will not validate the data. Then, after postDeploy it will check the constraint. Take a look at you deployment script and it will validate this.
|
{
"pile_set_name": "StackExchange"
}
|
<?xml version="1.0" ?>
<sdf version="1.4">
<model name="grey_wall">
<static>true</static>
<link name="link">
<pose>0 0 1.4 0 0 0</pose>
<collision name="collision">
<geometry>
<box>
<size>7.5 0.2 2.8</size>
</box>
</geometry>
</collision>
<visual name="visual">
<cast_shadows>false</cast_shadows>
<geometry>
<box>
<size>7.5 0.2 2.8</size>
</box>
</geometry>
<material>
<script>
<uri>model://grey_wall/materials/scripts</uri>
<uri>model://grey_wall/materials/textures</uri>
<name>vrc/grey_wall</name>
</script>
</material>
</visual>
</link>
</model>
</sdf>
|
{
"pile_set_name": "Github"
}
|
Advertisement
Friday, 15 June 2018
UPSC Exam Details: Eligibility, Qualification, Syallbus
About UPSC Exam
Union Public Service Commission (UPSC) is India’s central agency, which conducts Civil Services Examination (CSE) which is a National level competitive examination in India, conducted by the Union Public Service Commission (UPSC) for recruitment to various Civil Services of the Government of India such as IAS, IFS, NDA, CDS, SCRA etc. It is a very reputated and tough to crack exams in India. According to the latest UPSC details, there are around 980 vacancies in 2017 for UPSC Civil Services which goes on increasing or decreasing every year. In this article we will provide you all the information regarding UPSC Civil Services like UPSC eligibility, no. of attempts, exam pattern, qualification.
UPSC Exam Eligibilty
Nationality
* For the Indian Administrative Service and the Indian Police Service, the candidate must be a citizen of India.
* For other service candidate must be:
i) Candidate must be an Indian citizen.
ii) Person of Indian origin who has migrated from Pakistan, Myanmar, Sri Lanka, Kenya, Uganda, Tanzania, Zambia, Malawi , Zaire , Ethiopia or Vietnam with the intention of permanently settling in India will be eligible for UPSC Exam.
UPSC Exam Qualification
Education
* Candidate must have past their degree from Central, State or Open university.
Age
* For Other Backward Classe the upper limit is 35 years.
* For Scheduled Tribes and Scheduled Castes the upper limit is 37 years.
Number of attempts
* General category candidates = 6.
* Other Backward class candidates = 9.
* SC/ST candidates = unlimited attempts till 37 years.
UPSC Exam Syllabus
Syllabus for the IAS Exam is set by UPSC. The nodal authority of Indian Civil Service Exams conducts a single test and follows a common syllabus for IAS and rest of the services like Income Tax and the IPS.
There are three stage:
1) UPSC Prelims (also called CSAT).
2) UPSC Mains.
3) Interview.
UPSC PRELIMS (Objective type)
The first stage or the screening test of UPSC CSE is an aptitude assessment examination and the paper includes questions of ‘Reasoning and Analytical’ format.
The Prelims is divided into two papers of objective-type questions and each paper is of 200 marks, equaling a total of 400 marks. The total duration of the IAS exam prelims is 2 hours and it is mandatory for every candidate to complete both the papers.
The IAS Exam Paper 1 has topics of General Studies including history of India, economy etc.
The IAS Exam Paper 2 will be of reasoning and aptitude.
UPSC Interview format based on a Vocal Section
After completing UPSC exam. The selected candidates are called for interview by the board members where questions are directed towards assessing the social traits and current affairs aptitude of each candidate.
|
{
"pile_set_name": "Pile-CC"
}
|
Adenomyoma of the cervix: report of a case and review of the literature.
Adenomyoma of the cervix is a rare benign neoplasm, one of a group of benign endocervical lesions that may histologically be confused with an aggressive cervical carcinoma, adenoma malignum. We recently encountered a case that distorted the cervix and pushed it under the pubic symphysis. We present this case, review the literature of this rare lesion, and discuss the differential diagnosis of this group of endocervical lesions.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Demonstration of regurgitation of gut content during blood meals of the tick Ornithodoros moubata. Possible role in the transmission of pathogenic agents.
Nymphs of Ornithodoros moubata were fed tritiated ecdysteroid. These ingested hormones are conjugated to fatty acyl esters that accumulate in the midgut (Connat et al. 1988). A few months later, the same ticks which had molted, were fed on physiological medium without radiolabel. At the issue of the blood meal, the nutritive medium contained an amount of radiolabel corresponding to 0.5% of the total labelling in the animal before the blood meal; this corresponded to 1.3% of the midgut content. These results demonstrate that in addition to transmission of parasites by saliva and coxal fluid (Burgdorfer 1951), transmission through regurgitation of the blood content in the gut could occur. An equivalent quantity of radiolabel was also emitted in the feces during and after the meal, but no conclusion about parasite transmission can be drawn from these "metabolic" results.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
The interaction between ADAM 22 and 14-3-3zeta: regulation of cell adhesion and spreading.
The ADAM family consists of a number of transmembrane proteins that contain disintegrin-like and metalloproteinase-like domains. Therefore, ADAMs potentially have cell adhesion and protease activities. 14-3-3 proteins are a highly conserved family of cytoplasmic proteins that associate with several intracellular signaling molecules in the regulation of various cellular functions. Here we report the identification of a novel interaction between the ADAM 22 cytoplasmic tail and the 14-3-3zeta isoform by a yeast two-hybrid screen. The interaction between the ADAM 22 cytoplasmic tail and 14-3-3zeta was confirmed by an in vitro protein pull-down assay as well as by co-immunoprecipitation, and the binding sites were mapped to the 28 amino acid residues of the C-terminus of the ADAM 22 cytoplasmic tail. Furthermore, we found that overexpression of the ADAM 22 cytoplasmic tail in human SGH44 cells inhibited cell adhesion and spreading and that deletion or mutation of the binding site for 14-3-3zeta within the ADAM 22 cytoplasmic tail abolished the ability of the overexpressed cytoplasmic tail to alter cell adhesion and spreading. Taken together, these results for the first time demonstrate an association between ADAM 22 and a 14-3-3 protein and suggest a potential role for the 14-3-3zeta/ADAM 22 association in the regulation of cell adhesion and related signaling events.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
---
title: Changing your root password on a VPS
slug: root-password
excerpt: Learn how to change the root password of a VPS
section: Diagnostic and rescue mode
---
**Last updated 27th June 2018**
## Objective
When you install or reinstall a distribution or operating system, you are provided with a root access password. We strongly recommend that you change it, as detailed in our guide on [securing a VPS](https://docs.ovh.com/gb/en/vps/tips-for-securing-a-vps/). You may also find that you have lost this password, and need to change it. This guide will take you through both scenarios.
Learn how to change the root password of a VPS.
## Requirements
- You must be connected via SSH to your VPS (root access).
- [Reboot your VPS in rescue mode](https://docs.ovh.com/lt/vps/rescue/).
<iframe width="560" height="315" src="https://www.youtube.com/embed/ua1qoTMq35g?rel=0" frameborder="0" allow="autoplay; encrypted-media" allowfullscreen></iframe>
## Instructions
### Change the password with root user account access
If you still have your current password, the process is simpler. Log in to your server, then type the following command:
```sh
passwd
```
You must then enter your new password for the first time, and confirm it. You will then receive the following confirmation:
```sh
Enter new UNIX password:
Retype new UNIX password:
passwd: password updated successfully
```
> [!primary]
>
> On a Linux distribution, the password you enter **will not appear**.
>
### Changing a password after you have lost it
#### Step 1: Identify the mount point
The mount is created automatically on any VPS in the 2016 range, so you just need to identify where your partition is mounted. To do this, you can use two commands:
##### df -h
```sh
root@rescue-pro:~# df -h
Size Used Avail Use% Mounted on
/dev/vda1 4.7G 1.3G 3.2G 29% /
udev 10M 0 10M 0% /dev
tmpfs 774M 8.4M 766M 2% /run
tmpfs 1.9G 0 1.9G 0% /dev/shm
tmpfs 5.0M 0 5.0M 0% /run/lock
tmpfs 1.9G 0 1.9G 0% /sys/fs/cgroup
/dev/vdb1 20G 934M 18G 5% /mnt/vdb1
```
##### lsblk
```sh
root@rescue-pro:~# lsblk
NAME MAJ:MIN RM SIZE RO TYPE MOUNTPOINT
vda 254:0 0 4.9G 0 disk
└─vda1 254:1 0 4.9G 0 part /
vdb 254:16 0 20G 0 disk
└─vdb1 254:17 0 20G 0 part /mnt/vdb1
```
The image above shows that your system partition is mounted on **/mnt/vdb1**.
#### Step 2: CHROOT permissions
You now need to edit the root directory, for the changes to be applied to your system. You can do this by using the `chroot command. Please enter the following command:
```sh
root@rescue-pro:~# chroot /mnt/vdb1/
root@rescue-pro:/#
```
You can check by typing the `ls -l` command, which will list the content stored in the root directory of your system:
```sh
root@rescue-pro:/# ls -l
```
#### Step 3: change the root password
Now, you just need to change the root password with the `passwd` command:
```sh
passwd
```
```sh
Enter new UNIX password:
Retype new UNIX password:
passwd: password updated successfully
```
Finally, reboot your VPS on its drive via your OVH Control Panel.
## Go further
[Introduction to SSH](https://docs.ovh.com/lt/dedicated/ssh-introduction/)
[Activating rescue mode on VPS](https://docs.ovh.com/lt/vps/rescue/)
Join our user community on <https://community.ovh.com/en/>.
|
{
"pile_set_name": "Github"
}
|
Lead Developer. Follow us on: Twitter Facebook | Contact Support if you need help!
We're at $21,360 raised for the Child's Play charity . $3640 needs to be raised in the next 90 hours if you're keen for me to shave my head! Regardless of whether we hit 25k, though, the amount we've raised is much higher than our initial estimates and is a really amazing accomplishment thanks to you guys :DSome people have asked for a picture of what the Angelic Mask (charity purchase) looks like. The image on our front page shows it well.
Last edited by Skreeves on May 21, 2014, 2:33:43 AM
FIRST €dit: Now that I did this, I can finally die in peace. Any takers? Btw, love how the picture is named "yes_shavs_will_have_3d_art.jpg" Those wings are really gross... love em.
Sorry to say but Vaal Clarity is a bust... Nobody is really running skills they can't maintain, in spite of nerfs to (mana) leech attempting to cause that to be the case...
Vaal Clarity is gonna be so OP. You think you can't get 16 kills in 6+ seconds? Wonder how it works with increase duration....
I for one would love to have that vaal clarity, for leveling if nothing else. I've got mana issues going on at level 57 in the two week race, and something like that would help immensely.
I'm not sure what to think about those wings...
|
{
"pile_set_name": "OpenWebText2"
}
|
Pages
Tuesday, June 18, 2013
Looks Are Deceiving ... The Story Behind the Story ... The Financially Secure Old versus the Financially Insecure Young
Overall, our economy is recovering, albeit slowly. Unemployment remains unacceptably high, and government debt and unfunded pensions, Social Security, Medicare and ObamaCare obligations are at historic and unaffordable levels as well.
But that doesn't begin to capture the unfairness involving the growing financial conflict between America's old and young.
Because if we take the time to look below the surface of our recovering American economic situation, we'll see a very troubling picture. It's about what government benefits for the old are doing to the future opportunites of our young. And in my opinion, it's time we put the issue squarely on the table and out in the bright sunshine.
In other words, the unintentional but very real intergenerational conflict where the oldsters are taking advantage of the youngsters must not be ignored any longer. Let's look directly at entitlements, the effect of the housing bubble and future financing burdens being placed on the young folks. It's not fair.
The young pay for the old. That's the way our entitlements funding works. The generation at work pays for the prior generations that are retired. Pass it on, in other words. At least that's the theory and practice of funding entitlements in America until now --- when baby boomers, early retirees, generous guaranteed benefits and a declining workforce are all contributing to the financial mess in America.
As a result, government spending has grown and the economy grows at a slower pace due to the shrinkage of the private sector necessitated by the growth in the government. It's not a pretty picture, and what we're doing to the younger folks among us needs to be changed. It's not only unfair. It's also unaffordable and making a slow growing economy even slower. That means fewer jobs, less income and so forth. A vicious cycle, to be sure.
"THE total wealth of American households has recovered from the financial crisis and Great Recession, according to the Federal Reserve Board. But that recovery has not been enough to keep up with inflation, and many Americans, particularly younger adults who took on heavy debt to acquire homes before the housing bubble collapsed, are lagging.
Multimedia
The Fed said last week that household wealth rose by $3 trillion in the first quarter, to $70.3 trillion. It was the first time the total exceeded the $68.1 trillion total posted in the third quarter of 2007, before the recession began, and was the largest quarterly increase since 1999, when the stock market was rising rapidly.
In the first quarter, a third of the gain in wealth came directly from rising values of corporate stocks owned by households. That was a little more than the gain attributed to rising real estate values.
The Federal Reserve Bank of St. Louis pointed out that there are more households now than there were in 2007, and that there has been inflation as well. As can be seen in an accompanying chart, the average household wealth at the end of the quarter was $613,635, a figure that is 11 percent below the peak of $689,996 (in 2013 dollars) set in the first quarter of 2007.
Those averages are deceptive, in that they are raised by the high wealth of a relatively small number of households. A very different picture emerges from looking at the median — the level at which half the households are richer and half poorer. That statistic can be calculated from the Fed’s triennial survey of consumer finances. In the studies conducted in the 1990s, the median net wealth was about one-quarter of the average. In the 2000s, the median fell to about one-fifth of the average, and in 2010, it was down to about one-sixth of the average.
During the housing boom, said William R. Emmons, the chief economist of the Center for Household Financial Stability at the Federal Reserve Bank of St. Louis, “exactly the people you would think need to act conservatively were doing the opposite.” Homeownership rates, and mortgage debt levels, rose for younger households, as well as for less educated and minority ones. Those groups suffered more during the crisis, he said, and have been slower to recover.
Mr. Emmons compiled average wealth figures for different groups from the triennial surveys, and estimated how they have changed since the 2010 survey. . . . While all age groups have yet to recover to their 2007 wealth, when adjusted for inflation, older households are down just 3 percent on average, while those headed by middle-age people are down about 10 percent. But the decline is nearly 40 percent for the younger group.
During the housing boom, households ended up with more of their wealth in real estate than before, and mortgage debt rose to record levels relative to the size of the economy. The proportion of wealth in homes is now back to close to the level of the 1990s, but the debt levels remain high by historical standards."
Summing Up
The long lasting effects of the housing bubble on the young are tremendously negative and will be for years to come.
The American dream has turned into a nightmare for far too many Americans, and especially the younger among us.
If it's true that the truth shall set us free, and I believe it is, then taking a hard look at what government subsidies and programs are doing to the chances for younger Americans to have the same opportunities that prior generations, including mine, have enjoyed is a fundamental necessity.
As is understanding that the benefits going to the oldsters in the form or retirement income and health care are not "investments" that will make the future brighter for younger Americans.
|
{
"pile_set_name": "Pile-CC"
}
|
1. Field of the Invention
The present invention relates to a method and apparatus for determining the vulnerability of a structure to earthquake.
2. Description of the Related Art
Conventionally, as methods for determining the seismic vulnerability of a structure are used (1) a method of obtaining the natural frequency of a structure by vibrating the structure, (2) a method of evaluating the antiseismic performance of a structure using a checklist, and (3) an antiseismic diagnostic method of calculating an antiseismic index through structural computation.
In method (1), a method of obtaining the natural frequency of a structure by vibrating the structure, a structure is vibrated using a vibration generator or a weight to give a shock, and then the natural frequency of the structure is obtained based on thus generated vibration. This natural frequency is compared with a reference value to determine the antiseismic performance of the structure.
In method (2), a method of evaluating the antiseismic performance of a structure using a checklist, a structure is evaluated using a checklist containing predetermined items such as conditions of the ground underneath the structure, year of construction of the structure, and structural Specifications. The antiseismic performance of the structure is determined based on total points assigned in the case of this evaluation.
In method (3), an antiseismic diagnostic method of calculating the antiseismic index of a structure through structural computation, any of the following three methods are used, depending on the specific case. In the first method, the ultimate strength of each layer is calculated based on the cross-sectional areas of walls and columns. In the second method, the flexural strength of each layer is obtained based on the assumption that beams and floor slabs are rigid as well as on the basis of calculated bends of individual columns and walls and calculated ultimate shear strength of the layer, and subsequently the toughness of each layer is calculated based on the relationship between this flexural strength and the ultimate shear strength, quantity of reinforcing bars, and the like. In the third method, a simple nonlinear frame analysis is conducted while taking into consideration the strength and toughness of beams.
The above-mentioned methods for determining the seismic vulnerability of a structure have included the following problems.
In the method of obtaining the natural frequency of a structure by vibrating the structure, a large-scale apparatus is required for vibrating the structure, and the structure may be damaged when the apparatus is installed or when a shock is given to the structure. Also, this method requires a reference natural frequency as a basis of comparison, such as a theoretical natural frequency, an empirically derived natural frequency, or a natural frequency measured in the past.
In the method of evaluating the antiseismic performance of a structure using a checklist, the evaluation is rough and susceptible to the subjectivity of an examiner; the vibration characteristics of the structure cannot be obtained quantitatively.
In the antiseismic diagnostic method of calculating the antiseismic index of a structure through structural computation, investigation for obtaining data for use in structural computation and entry of the thus obtained data require considerable time and expenses. Further, the diagnosis requires high-level knowledge of structural computation, so participation of a specialist is indispensable.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
[Assessment of cardiorespiratory functions in patients receiving suggestive psychotherapy].
It is shown that suggestive psychotherapy based on verbal suggestions provides a tool for individual correction of the patient's functional state. It reduces sympathetic and promotes parasympathetic influences, decreases high initial level of psychoemotional tension, and normalizes relationship between cardiac and respiratory rhythms. Also, suggestive psychotherapy has beneficial effect on the psychological sphere and subjective feeling of well-being, reduces anxiety, strengthens the sense of confidence and hope for a cure.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
While loop wont end
I am running a text based game and trying to get a function to repeat itself using a while loop but when the condition is met it wont stop.
<?php
/****************************************************************/
/*********************** Created By Seker ***********************/
/**** Feel free to modify in any way, but keep this section. ****/
/****************************************************************/
session_start();
require "global_func.php";
if ($_SESSION['loggedin'] == 0)
{
header("Location: login.php");
exit;
}
$userid = $_SESSION['userid'];
require "header.php";
$h = new headers;
$h->startheaders();
include "mysql.php";
global $c;
$is =
mysql_query(
"SELECT u.*,us.* FROM users u LEFT JOIN userstats us ON u.userid=us.userid WHERE u.userid=$userid",
$c) or die(mysql_error());
$ir = mysql_fetch_array($is);
check_level();
$fm = money_formatter($ir['money']);
$cm = money_formatter($ir['crystals'], '');
$lv = date('F j, Y, g:i a', $ir['laston']);
$h->userdata($ir, $lv, $fm, $cm);
$h->menuarea();
switch ($_GET['action'])
{
case 'walk':
walk();
break;
case 'walk2':
walk();
break;
default:
home();
break;
}
function home()
{
global $ir,$h,$c,$userid;
$q=mysql_query("SELECT u.*,c.* FROM users u LEFT JOIN cities c ON u.location=c.cityid WHERE u.userid=$userid");
$r=mysql_fetch_array($q);
$city = $r['cityname'];
$trav = $ir['steps'];
echo "
<table width='70%' border='1'>
<tr>
<td align='center'>
<font size='3'><b><u>The $city Streets</u></b></font>
</td>
</tr>
<tr>
<td align='center'>
Take your chances with a walk through the $city streets!
</td>
</tr>
<tr>
<td align='center'>
Each day, you get <b>10</b> steps! <b>25</b> if you are a donator!
</td>
</tr>
<tr>
<td align='center'>
While traveling, you can find crystals, cash, or even gain experience!
</td>
</tr>
<tr>
<td align='center'>
But, be careful! There are dangers in the streets!
</td>
</tr>
</table>
";
echo "
<table width='70%' border='1'>
<tr>
<td align='center' colspan='2'>
<font size='3'><b><u>What would you like to do?</u></b></font>
</td>
</tr>
<tr>
<td align='center' colspan='2'>
You can travel <b>{$trav}</b> more times today!
</td>
</tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'>[Go For A Walk]</a>
</td>
<td align='center' width='50%'>
<a href='index.php'>[Change Your Mind]</a>
</td>
</tr>
</table>
";
}
function walk()
{
do
{
global $ir,$h,$c,$userid;
$q=mysql_query("SELECT u.*,c.* FROM users u LEFT JOIN cities c ON u.location=c.cityid WHERE u.userid=$userid");
$r=mysql_fetch_array($q);
$chance = mt_rand(1,100);
$city = $r['cityname'];
$trav = $ir['steps'];
if ($ir['steps'] <= 0)
{
echo "
You have traveled enough for today! Come back tomorrow!
<a href='index.php'>Home</a>";
exit($h->endpage());
}
if ($ir['hospital'])
{
echo "
You cannot travel while in the hospital!
<a href='index.php'>Home</a>";
exit($h->endpage());
}
if ($ir['jail'])
{
echo "
You cannot travel while in jail!
<a href='index.php'>Home</a>";
exit($h->endpage());
}
echo "
<table width=70% border='1'>
<tr>
<td align='center' width='50%'>
<font size='2'>You start your journey through the $city streets!</font>
</td>
<td align='center' width='50%'>
<font size='2'>You can travel up to <b>{$trav}</b> more times today!</font>
</td>
</tr>
<tr>";
if ($chance <= 10)
{
$rewardtok = mt_rand(5,15);
mysql_query("UPDATE users SET crystals=crystals+$rewardtok,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You found <b>$rewardtok</b> crystals while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 15) && ($chance <= 30))
{
$rewardg = mt_rand(100,5000);
$reward = money_formatter($rewardg);
mysql_query("UPDATE users SET money=money+$rewardg,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You found <b>$reward</b> while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 40) && ($chance <= 50))
{
$rewardexp = mt_rand(5,50) * ($ir['level'] /2);
mysql_query("UPDATE users SET exp=exp+$rewardexp,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You gained <b>$rewardexp<b> experience while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 55) && ($chance <= 65))
{
$rewardexp = mt_rand(5,50);
mysql_query("UPDATE users SET exp=exp+$rewardexp,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You gained <b>$rewardexp<b> experience while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 75) && ($chance <= 85))
{
$rewardtok = mt_rand(5,15);
mysql_query("UPDATE users SET crystals=crystals+$rewardtok,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You found <b>$rewardtok</b> crystals while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if ((($chance > 10) && ($chance < 15)) || (($chance > 30) && ($chance < 40)) || (($chance > 50) && ($chance < 55)) || (($chance > 65) && ($chance < 75)) || ($chance > 85))
{
$rewardtok = mt_rand(5,15);
mysql_query("UPDATE users SET steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
You found nothing while walking through the streets
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
}
while ($ir['steps'] > 0);
}
$h->endpage();
The function is supposed to run until the steps value is 0 which when the function runs once it subtracts from the total. yet it doesnt stop when it hits 0 and i get something like this "Steps: -15535"
i believe this is the "relivent code"
function walk()
{
do
{
global $ir,$h,$c,$userid;
$q=mysql_query("SELECT u.*,c.* FROM users u LEFT JOIN cities c ON u.location=c.cityid WHERE u.userid=$userid");
$r=mysql_fetch_array($q);
$chance = mt_rand(1,100);
$city = $r['cityname'];
$trav = $ir['steps'];
if ($ir['steps'] <= 0)
{
echo "
You have traveled enough for today! Come back tomorrow!
<a href='index.php'>Home</a>";
exit($h->endpage());
}
if ($ir['hospital'])
{
echo "
You cannot travel while in the hospital!
<a href='index.php'>Home</a>";
exit($h->endpage());
}
if ($ir['jail'])
{
echo "
You cannot travel while in jail!
<a href='index.php'>Home</a>";
exit($h->endpage());
}
echo "
<table width=70% border='1'>
<tr>
<td align='center' width='50%'>
<font size='2'>You start your journey through the $city streets!</font>
</td>
<td align='center' width='50%'>
<font size='2'>You can travel up to <b>{$trav}</b> more times today!</font>
</td>
</tr>
<tr>";
if ($chance <= 10)
{
$rewardtok = mt_rand(5,15);
mysql_query("UPDATE users SET crystals=crystals+$rewardtok,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You found <b>$rewardtok</b> crystals while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 15) && ($chance <= 30))
{
$rewardg = mt_rand(100,5000);
$reward = money_formatter($rewardg);
mysql_query("UPDATE users SET money=money+$rewardg,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You found <b>$reward</b> while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 40) && ($chance <= 50))
{
$rewardexp = mt_rand(5,50) * ($ir['level'] /2);
mysql_query("UPDATE users SET exp=exp+$rewardexp,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You gained <b>$rewardexp<b> experience while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 55) && ($chance <= 65))
{
$rewardexp = mt_rand(5,50);
mysql_query("UPDATE users SET exp=exp+$rewardexp,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You gained <b>$rewardexp<b> experience while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if (($chance >= 75) && ($chance <= 85))
{
$rewardtok = mt_rand(5,15);
mysql_query("UPDATE users SET crystals=crystals+$rewardtok,steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
Congratulations! You found <b>$rewardtok</b> crystals while walking through the streets!
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
if ((($chance > 10) && ($chance < 15)) || (($chance > 30) && ($chance < 40)) || (($chance > 50) && ($chance < 55)) || (($chance > 65) && ($chance < 75)) || ($chance > 85))
{
$rewardtok = mt_rand(5,15);
mysql_query("UPDATE users SET steps=steps-1 WHERE userid=$userid");
echo "
<td align='center' colspan='2'>
You found nothing while walking through the streets
</td>
</tr>
<tr>
<td align='center' width='50%'>
<a href='streets.php?action=walk'><b>[Continue Traveling]</b></a>
</td>
<td align='center' width='50%'>
<a href='streets.php'><b>[Back]</b></a>
</td>
</tr>
</table>";
}
}
while ($ir['steps'] > 0);
}
$h->endpage();
A:
$ir['steps']
is not changed/decremented anywhere.
Decrement it before at the end of the loop:
$ir['steps'] -= 1;
Just before the closing bracket of the loop.
|
{
"pile_set_name": "StackExchange"
}
|
Multidetector CT of solitary pulmonary nodules.
With the increasing use of multidetector CT, small nodules are being detected more often. Although most incidentally discovered nodules are benign, usually the sequelae of pulmonary infection and malignancy, either primary or secondary, remains an important consideration in the differential diagnosis of solitary pulmonary nodules. This article reviews the role of imaging in the detection and characterization of solitary pulmonary nodules. Strategies for evaluating and managing solitary pulmonary nodules are also discussed.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Top searches
Financial Presentations
At the December 3, 2019 Budget Committee meeting, the Committee received a presentation of the Municipality's long term debt. Please click here for the presentation.
Property Tax Receivables
At the November 19, 2019 Committee of the Whole meeting, the Committee received a presentation of the Municipality's property tax receivables. Please click here for the presentation.
Capital Funding Progress
At the December 10 and 13, 2018 Budget Committee meeting, the Committee received a presentation of the Municipality's Capital Funding Progress. Please click here for the presentation.
Water and Wastewater Utility Financial Update
At the December 10 and 13, 2018 Budget Committee meeting, the Committee received a presentation of the Municipality's Water and Wastewater Utility Financial Update. Please click here for the presentation.
Asset Management Plan Update
At the December 10 and 13, 2018 Budget Committee meeting, the Committee received a presentation of the Municipality's Asset Management Plan Update. Please click here for the presentaiton.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Error in perlipc documentation?
I'm trying to puzzle through something I see in the perlipc documentation.
If you're writing to a pipe, you should also trap SIGPIPE. Otherwise,
think of what happens when you start up a pipe to a command that
doesn't exist: the open() will in all likelihood succeed (it only
reflects the fork()'s success), but then your output will
fail--spectacularly. Perl can't know whether the command worked
because your command is actually running in a separate process whose
exec() might have failed. Therefore, while readers of bogus commands
return just a quick end of file, writers to bogus command will trigger
a signal they'd better be prepared to handle. Consider:
open(FH, "|bogus") or die "can't fork: $!";
print FH "bang\n" or die "can't write: $!";
close FH or die "can't close: $!";
That won't blow up until the close, and it will blow up with a
SIGPIPE. To catch it, you could use this:
$SIG{PIPE} = 'IGNORE';
open(FH, "|bogus") or die "can't fork: $!";
print FH "bang\n" or die "can't write: $!";
close FH or die "can't close: status=$?";
If I'm reading that correctly, it says that the first version will probably not die until the final close.
However, that's not happening on my OS X box (Perl versions 5.8.9 through 5.15.9). It blows up on the open with a "can't fork: No such file or directory" regardless of whether or not I have the $SIG{PIPE} line in there.
What am I misunderstanding?
A:
This was a change implemented back during development of 5.6 so that system() could detect when it failed to fork/exec the child
https://github.com/mirrors/perl/commit/d5a9bfb0fc8643b1208bad4f15e3c88ef46b4160
It is also documented in http://search.cpan.org/dist/perl/pod/perlopentut.pod#Pipe_Opens
which itself points to perlipc, but perlipc does seem to be missing this
|
{
"pile_set_name": "StackExchange"
}
|
Summary: A library for editing typed command lines
Name: readline
Version: 6.2
Release: 10%{?dist}.0.2
License: GPLv3+
Group: System Environment/Libraries
URL: http://cnswww.cns.cwru.edu/php/chet/readline/rltop.html
Source: ftp://ftp.gnu.org/gnu/readline/readline-%{version}.tar.gz
# upstream patches
Patch1: ftp://ftp.cwru.edu/pub/bash/readline-6.2-patches/readline62-001
Patch2: ftp://ftp.cwru.edu/pub/bash/readline-6.2-patches/readline62-003
# fix file permissions, remove RPATH, use CFLAGS
Patch20: readline-6.2-shlib.patch
# add TTY input audit support
Patch21: readline-6.1-audit.patch
# isxdigit should not be defined as macro
Patch22: readline-6.2-cppmacro.patch
# add workaround for problem in gdb
# in new version of readline needs to be deleted
Patch23: readline-6.2-gdb.patch
Patch24: readline-6.2-rl_trace.patch
BuildRequires: ncurses-devel
BuildRoot: %{_tmppath}/%{name}-%{version}-%{release}-root-%(%{__id_u} -n)
Prefix: %{_prefix}
%description
The Readline library provides a set of functions that allow users to
edit command lines. Both Emacs and vi editing modes are available. The
Readline library includes additional functions for maintaining a list
of previously-entered command lines for recalling or editing those
lines, and for performing csh-like history expansion on previous
commands.
%prep
%setup -q
%patch1 -p0
%patch2 -p0
%patch20 -p1 -b .shlib
%patch21 -p1 -b .audit
%patch22 -p1 -b .cppmacro
%patch23 -p1 -b .gdb
%patch24 -p1 -b .rl
pushd examples
rm -f rlfe/configure
iconv -f iso8859-1 -t utf8 -o rl-fgets.c{_,}
touch -r rl-fgets.c{,_}
mv -f rl-fgets.c{_,}
popd
%build
export CPPFLAGS="-I%{_includedir}/ncurses"
%configure --disable-static
make %{?_smp_mflags}
%install
make DESTDIR=$RPM_BUILD_ROOT install
%files
%defattr(-,root,root,-)
%license COPYING
%{_libdir}/libreadline*.so.*
%{_libdir}/libhistory*.so.*
%exclude %{_includedir}
%exclude %{_mandir}
%exclude %{_infodir}
%exclude %{_libdir}/*.la
%exclude %{_libdir}/*.so
%exclude %{_libdir}/pkgconfig
%changelog
* Wed May 15 2019 Michael Hart <michael@lambci.org>
- recompiled for AWS Lambda (Amazon Linux 2) with prefix /opt
* Mon Feb 13 2017 Siteshwar Vashisht <svashisht@redhat.com> - 6.2-10
- Fix for slow behaviour while pasting text
Resolves: #1300513
* Mon Mar 24 2014 Lukáš Nykrýn <lnykryn@redhat.com> - 6.2-9
- fix for CVE-2014-2524
* Fri Jan 24 2014 Daniel Mach <dmach@redhat.com> - 6.2-8
- Mass rebuild 2014-01-24
* Fri Dec 27 2013 Daniel Mach <dmach@redhat.com> - 6.2-7
- Mass rebuild 2013-12-27
* Thu Feb 14 2013 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 6.2-6
- Rebuilt for https://fedoraproject.org/wiki/Fedora_19_Mass_Rebuild
* Sat Jul 21 2012 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 6.2-5
- Rebuilt for https://fedoraproject.org/wiki/Fedora_18_Mass_Rebuild
* Wed Jan 11 2012 Lukas Nykryn <lnykryn@redhat.com> 6.2-4
- temporary fix for problem with gdb, wait for y/n (#701131)
* Wed Aug 31 2011 Lukas Nykryn <lnykryn@redhat.com> 6.2-3
- isxdigit is no longer defined as macro ic c++ (#723299)
* Tue Mar 01 2011 Miroslav Lichvar <mlichvar@redhat.com> 6.2-2
- include patch 001
* Tue Feb 15 2011 Miroslav Lichvar <mlichvar@redhat.com> 6.2-1
- update to 6.2
* Wed Feb 09 2011 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 6.1-4
- Rebuilt for https://fedoraproject.org/wiki/Fedora_15_Mass_Rebuild
* Tue Jan 18 2011 Miroslav Lichvar <mlichvar@redhat.com> 6.1-3
- include patches 001, 002 (#657758)
- add TTY input audit support (#244350)
* Wed Feb 17 2010 Lubomir Rintel <lkundrak@v3.sk> 6.1-2
- fix the version number in header
* Tue Jan 12 2010 Miroslav Lichvar <mlichvar@redhat.com> 6.1-1
- update to 6.1
* Tue Aug 25 2009 Miroslav Lichvar <mlichvar@redhat.com> 6.0-3
- include patch 004
- suppress install-info errors (#515910)
- remove dir* in infodir after install (#492097)
* Sun Jul 26 2009 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 6.0-2
- Rebuilt for https://fedoraproject.org/wiki/Fedora_12_Mass_Rebuild
* Tue Jul 14 2009 Miroslav Lichvar <mlichvar@redhat.com> 6.0-1
- update to 6.0
- include patches 001, 002, 003
* Wed Feb 25 2009 Fedora Release Engineering <rel-eng@lists.fedoraproject.org> - 5.2-14
- Rebuilt for https://fedoraproject.org/wiki/Fedora_11_Mass_Rebuild
* Sun Mar 23 2008 Jan Kratochvil <jan.kratochvil@redhat.com> - 5.2-13
- Fix the previous %%changelog entry authorship.
* Sun Mar 23 2008 Jan Kratochvil <jan.kratochvil@redhat.com> - 5.2-12
- Fix excessive prompts on CTRL-C abort while the prompt is being printed.
* Tue Feb 19 2008 Fedora Release Engineering <rel-eng@fedoraproject.org> - 5.2-11
- Autorebuild for GCC 4.3
* Fri Jan 18 2008 Miroslav Lichvar <mlichvar@redhat.com> 5.2-10
- move libreadline to /lib
* Thu Jan 03 2008 Miroslav Lichvar <mlichvar@redhat.com> 5.2-9
- include upstream patches 008-011
* Mon Nov 05 2007 Miroslav Lichvar <mlichvar@redhat.com> 5.2-8
- fix cursor position when prompt has one invisible character (#358231)
- merge review fixes (#226361)
- fix source URL
* Mon Aug 27 2007 Miroslav Lichvar <mlichvar@redhat.com> 5.2-7
- include patches 005, 006, 007
* Wed Aug 22 2007 Miroslav Lichvar <mlichvar@redhat.com> 5.2-6
- update license tag
* Tue May 29 2007 Miroslav Lichvar <mlichvar@redhat.com> 5.2-5
- include patches 5.2-003, 5.2-004
* Thu Mar 22 2007 Miroslav Lichvar <mlichvar@redhat.com> 5.2-4
- apply 5.2-002 patch
* Thu Mar 15 2007 Miroslav Lichvar <mlichvar@redhat.com> 5.2-3
- link libreadline with libtinfo (#232277)
- include upstream 5.2-001 patch
- move static libraries to -static subpackage, spec cleanup
* Thu Nov 30 2006 Miroslav Lichvar <mlichvar@redhat.com> 5.2-2
- require ncurses-devel instead of libtermcap-devel
* Mon Nov 13 2006 Miroslav Lichvar <mlichvar@redhat.com> 5.2-1
- update to 5.2 (#213795)
- use CFLAGS when linking (#199374)
- package docs and examples (#172497)
- spec cleanup
* Wed Jul 12 2006 Jesse Keating <jkeating@redhat.com> - 5.1-1.1
- rebuild
* Mon Jul 10 2006 Jindrich Novy <jnovy@redhat.com> 5.1-1
- update to readline-5.1
- apply new proposed upstream patches for 5.1 (001-004)
- drop "read -e" patch, applied upstream
* Fri Feb 10 2006 Jesse Keating <jkeating@redhat.com> - 5.0-3.2.1
- bump again for double-long bug on ppc(64)
* Tue Feb 07 2006 Jesse Keating <jkeating@redhat.com> - 5.0-3.2
- rebuilt for new gcc4.1 snapshot and glibc changes
* Fri Dec 09 2005 Jesse Keating <jkeating@redhat.com>
- rebuilt
* Wed Mar 2 2005 Tim Waugh <twaugh@redhat.com> 5.0-3
- Rebuild for new GCC.
* Tue Jan 18 2005 Tim Waugh <twaugh@redhat.com> 5.0-2
- Fix line-wrapping (bug #145329).
- Apply "read -e" patch from bash package.
* Wed Jan 12 2005 Tim Waugh <twaugh@redhat.com> 5.0-1
- 5.0 (bug #144835).
* Mon Nov 29 2004 Tim Waugh <twaugh@redhat.com> 4.3-14
- Added URL tag (bug #141106).
* Thu Sep 2 2004 Jeremy Katz <katzj@redhat.com> - 4.3-13
- rebuild so that static linking against readline will work on ppc64
without dot symbols
* Mon Jun 28 2004 Tim Waugh <twaugh@redhat.com> 4.3-12
- Build requires libtool (bug #126589).
* Tue Jun 15 2004 Elliot Lee <sopwith@redhat.com>
- rebuilt
* Tue Mar 02 2004 Elliot Lee <sopwith@redhat.com>
- rebuilt
* Fri Feb 13 2004 Elliot Lee <sopwith@redhat.com>
- rebuilt
* Fri Nov 28 2003 Thomas Woerner <twoerner@redhat.com> 4.3-9
- removed rpath
* Thu Nov 6 2003 Tim Waugh <twaugh@redhat.com> 4.3-8
- Apply upstream patches (bug #109240 among others).
* Wed Jun 25 2003 Tim Waugh <twaugh@redhat.com>
- devel package requires libtermcap-devel (bug #98015).
* Wed Jun 25 2003 Tim Waugh <twaugh@redhat.com> 4.3-7
- Fixed recursion loop (bug #92372).
* Wed Jun 04 2003 Elliot Lee <sopwith@redhat.com>
- rebuilt
* Wed Jan 22 2003 Tim Powers <timp@redhat.com>
- rebuilt
* Wed Nov 20 2002 Tim Powers <timp@redhat.com>
- rebuild in current collinst
- BuildRequires autoconf only
* Wed Aug 07 2002 Phil Knirsch <pknirsch@redhat.com> 4.3-3
- Fixed Esc-O-M stack overflow bug.
* Mon Jul 22 2002 Phil Knirsch <pknirsch@redhat.com> 4.3-1
- Updated to latest readline release 4.3
* Thu Jul 11 2002 Phil Knirsch <pknirsch@redhat.com> 4.2a-7
- Fixed problem with alpha build.
* Wed Jul 10 2002 Phil Knirsch <pknirsch@redhat.com>
- Fixed utf8 problem (originally observed in bash).
* Fri Jun 21 2002 Tim Powers <timp@redhat.com> 4.2a-6
- automated rebuild
* Thu May 23 2002 Tim Powers <timp@redhat.com> 4.2a-5
- automated rebuild
* Wed Mar 20 2002 Trond Eivind Glomsrød <teg@redhat.com> 4.2a-4
- Use autoconf 2.53, not 2.52
* Mon Mar 4 2002 Bernhard Rosenkraenzer <bero@redhat.com> 4.2a-3
- Rebuild
* Mon Nov 26 2001 Matt Wilson <msw@redhat.com> 4.2a-2
- removed the manual symlinking of .so, readline handles this by itself
- call only %%makeinstall, not %%makeinstall install install-shared as
this makes bogus .old files in the buildroot
* Tue Nov 20 2001 Bernhard Rosenkraenzer <bero@redhat.com> 4.2a-1
- 4.2a
* Tue Oct 2 2001 Bernhard Rosenkraenzer <bero@redhat.com> 4.2-4
- Work around autoconf bug
* Mon Oct 1 2001 Bernhard Rosenkraenzer <bero@redhat.com> 4.2-3
- Don't use readline's internal re-implementation of strpbrk on systems
that have strpbrk - the system implementation is faster and better maintained.
* Tue Aug 7 2001 Bernhard Rosenkraenzer <bero@redhat.com> 4.2-2
- Make sure headers can be included from C++ applications (#51131)
(Patch based on Debian's with the bugs removed ;) )
* Wed May 09 2001 Florian La Roche <Florian.LaRoche@redhat.de>
- update to 4.2 and adapt patches
* Fri Apr 6 2001 Nalin Dahyabhai <nalin@redhat.com>
- change the paths listed for the header files in the man page to reflect
the location changes from previous versions (#35073)
- note that "on" is acceptable instead of "On" in the man page (#21327)
* Thu Mar 8 2001 Preston Brown <pbrown@redhat.com>
- fix reading of end key termcap value (@7 is correct, was kH) (#30884)
* Tue Jan 30 2001 Nalin Dahyabhai <nalin@redhat.com>
- mark the man page as currently out-of-date (#25294)
* Thu Sep 7 2000 Jeff Johnson <jbj@redhat.com>
- FHS packaging (64bit systems need to use libdir).
* Thu Aug 17 2000 Jeff Johnson <jbj@redhat.com>
- summaries from specspo.
* Wed Aug 2 2000 Florian La Roche <Florian.LaRoche@redhat.com>
- use "rm -f" in specfile
* Wed Jul 12 2000 Prospector <bugzilla@redhat.com>
- automatic rebuild
* Mon Jun 5 2000 Jeff Johnson <jbj@redhat.com>
- FHS packaging.
* Tue Mar 21 2000 Bernhard Rosenkraenzer <bero@redhat.com>
- 4.1
* Thu Feb 03 2000 Nalin Dahyabhai <nalin@redhat.com>
- update to 4.0
* Fri Apr 09 1999 Michael K. Johnson <johnsonm@redhat.com>
- added guard patch from Taneli Huuskonen <huuskone@cc.helsinki.fi>
* Sun Mar 21 1999 Cristian Gafton <gafton@redhat.com>
- auto rebuild in the new build environment (release 4)
* Sun Jul 26 1998 Jeff Johnson <jbj@redhat.com>
- updated to 2.2.1
* Wed May 06 1998 Prospector System <bugs@redhat.com>
- translations modified for de, fr, tr
* Wed May 06 1998 Cristian Gafton <gafton@redhat.com>
- don't package /usr/info/dir
* Thu Apr 30 1998 Cristian Gafton <gafton@redhat.com>
- devel package moved to Development/Libraries
* Tue Apr 21 1998 Cristian Gafton <gafton@redhat.com>
- updated to 2.2
* Tue Oct 14 1997 Donnie Barnes <djb@redhat.com>
- spec file cleanups
* Fri Oct 10 1997 Erik Troan <ewt@redhat.com>
- added proper sonames
* Tue Jul 08 1997 Erik Troan <ewt@redhat.com>
- updated to readline 2.1
* Tue Jun 03 1997 Erik Troan <ewt@redhat.com>
- built against glibc
|
{
"pile_set_name": "Github"
}
|
The authors confirm that all data underlying the findings are fully available without restriction. All relevant data are within the paper and its Supporting Information files.
Introduction {#s1}
============
It is well known that the cryopreservation process negatively affects the viability and fertility of reproductive cells. There are several factors caused by cryopreservation protocols that alter sperm integrity, such as a change in the temperature of the diluents [@pone.0112382-Watson1]; osmotic and toxic stresses induced by cryoprotectants [@pone.0112382-Watson1], [@pone.0112382-Watson2]; formation/reshaping of intracellular ice during freezing and thawing [@pone.0112382-Pea1]; and dissolution of ice in the extracellular environment [@pone.0112382-Watson2]. All of these factors induce sperm volumetric changes, plasma membrane alterations, flagellum morphological defects, as well as decrease mitochondrial membrane potential, sperm motility, viability, and fertility [@pone.0112382-Watson2], [@pone.0112382-Parks1]--[@pone.0112382-Cremades1]. As a generalisation, some 40--50% of the sperm population does not survive cryopreservation even with optimised protocols [@pone.0112382-Watson2]. Thus, many of the frozen-thawed spermatozoa show a shorter life span and have difficulties in reaching the oocytes and penetrating their vestments after conventional artificial insemination [@pone.0112382-Cremades1]. Variations between individuals in sperm freezability have been reported in numerous animal species. Within this context, semen donors have routinely been categorized as "good freezers" (GF) or "bad freezers" (BF). When experiments involve comparing bulk samples before freezing and after thawing, it is difficult to know which parts of the cryopreservation procedure may be causing problems and to detect differences between individual cells [@pone.0112382-Holt2]. In boar sperm, it has been demonstrated that these consistent inter-individual variations in sperm freezability are genetically determined [@pone.0112382-Thurston1].
The understanding and prediction of the sperm functional response to cryopreservation is one of the major questions in sperm cryobiology [@pone.0112382-Petrunkina1]. For this reason, sperm morphometry classification has become an integral part of routine sperm analysis. In recent years, ASMA (Automated Sperm Morphometry Analysis) systems have been employed for determining morphometric parameters of the sperm head and midpiece to elucidate possible relations with sperm freezability [@pone.0112382-Pea1], [@pone.0112382-Esteso1]. These systems can only analyse the lengths and areas of the sperm head and midpiece, but they are unable, for example, to measure the sperm principal piece, which provides sperm motility. Thus, in order to study sperm midpiece morphometry with these systems, it is not easy to find a staining method which allows discerning this structure from the rest of the flagellum [@pone.0112382-Tuset1]. By contrast, with other software for analysis and image processing, it is possible to obtain the lengths of flagellum structures. Numerous studies argue the implications of sperm flagellum in several biological processes such as sperm velocity, male reproductive success, relationships with testicle size, and spermatogenesis [@pone.0112382-Malo1]--[@pone.0112382-Ramm1]. On the other hand, studies concerning the role played by flagellum size on sperm freezability have not yet been reported, although there is evidence of the fragility of its internal and external structures when they are exposed to the cryopreservation process [@pone.0112382-Billard1], [@pone.0112382-Domes1], [@pone.0112382-Keates1]--[@pone.0112382-FelipePrez1].
Curry et al. [@pone.0112382-Curry1] reported that the sperm area and volume have great importance for determining optimal sperm cryopreservation protocols. For this purpose, stereology is able to accurately estimate surface areas and volumes for complex shapes from two-dimensional images [@pone.0112382-Curry1]. Thereby, sperm volumes as well as the sperm head and flagellum structures can be examined. The sperm volumes of human and several mammalian species have been determined by stereological methods [@pone.0112382-Anderson2], [@pone.0112382-Curry1].
In the present study, we hypothesized that flagellum volume could predict freezability in red deer spermatozoa. For this reason, we focused on determining the volumes of the sperm flagellum, midpiece, and principal piece in fresh sperm using stereology under phase contrast microscopy. In this way, differences between males in sperm flagellum volume could be linked to sperm freezability, owing to the fragility of flagellum structures to the cryopreservation process [@pone.0112382-Billard1], [@pone.0112382-Domes1], [@pone.0112382-Holt3], and the differences observed among red deer sperm to support cryopreservation [@pone.0112382-Esteso1]. In order to determine sperm freezability, sperm samples were classified as good or bad freezers using three kinetic parameters (VAP: average path velocity, VCL: curvilinear velocity, and VSL: straight linear velocity) assessed by a CASA (Computer Assisted Sperm Analysis) system at 2 hours post-thawing and with incubation at 37°C. Sperm viability, acrosomal status, and mitochondrial activity were also determined by flow cytometry.
Materials and Methods {#s2}
=====================
Animals {#s2a}
-------
The study was approved by the "Comité de Ética en Investigación de la Universidad de Castilla-La Mancha". All animal handling was done following the Spanish Animal Protection Regulation RD 53/2013, which conforms to the European Union Regulation 2003/65. Stags were legally culled and hunted in their natural habitat in accordance with the harvest plan of the game reserve. The harvest plans were made following the Spanish Harvest Regulation, Law 2/93 of Castilla-La Mancha, which conforms to European Union regulations. Thirty-three stags (age \>4.5 years; body mass \>130 kg) of red deer (*Cervus elaphus*) were used in this study. Landowners and managers of the red deer populations gave permission to the authors to use the samples.
Stags and testes collection {#s2b}
---------------------------
Testes were recovered from adult red deer culled during the 2008 hunting season in the south of Spain. Testes, together with the scrotum, were removed and transported at approximately 20--22°C to the laboratory. The time that elapsed between animal death and sperm recovery ranged from 3 to 6 hours, an adequate and reliable time interval for evaluating sperm parameters, because a decrease in the quality of sperm traits begins to take place 12 hours after the death of a male [@pone.0112382-Garde1].
Chemicals and solutions {#s2c}
-----------------------
Unless otherwise stated, chemicals were obtained from Sigma-Aldrich (Madrid, Spain).
A Salamon\'s modified extender was prepared in two fractions, as previously described [@pone.0112382-FernndezSantos1]. Fraction A contained: Tris (2.70%, w/v), fructose (1%, w/v), citric acid (1.4%, w/v), and clarified egg yolk (20%, v/v) (pH 6.8, osmolality 300 mOsm/Kg). Fraction B differed from the Fraction A in that water was replaced (12%, v/v) with the same volume of glycerol, with a final concentration = 6% (v/v). Glutaraldehyde solution was composed of 2% glutaraldehyde (v/v), and 0.165 mol/L cacodylate/HCl buffer (pH 7.3), as previously described [@pone.0112382-FernndezSantos1]. Bovine gamete medium (BGM-3) was composed of 87 mmol/L NaCl, 3.1 mmol/L KCl, 2 mmol/L CaCl~2~, 0.4 mmol/L MgCl~2~, 0.3 mmol/L NaH~2~PO~4~, 40 mmol/L HEPES, 21.6 mmol/L sodium lactate, 1 mmol/L sodium pyruvate, 50 µg/mL kanamicine, 10 µg/mL phenol red, and 6 mg/mL BSA (Bovine Serum Albumine) (pH 7.5), as previously described [@pone.0112382-DomnguezRebolledo1].
Cryopreservation of epididymal spermatozoa {#s2d}
------------------------------------------
Post-mortem seminal recovery is the most practical option to obtain sperm samples from wild populations of red deer, with hunting representing a constant source from harvested animals [@pone.0112382-Garde2]. Spermatozoa were collected from the cauda of the epididymis by repeated longitudinal and transverse cuts with a surgical scalpel and placed in 0.5 mL of fraction A. The contents from both epididymides of each individual were pooled for processing. Afterward, a routine sperm evaluation was made. Sperm concentration was determined using a Bürker counter chamber. The percentage of motile sperm and the quality of motility (QM) were subjectively evaluated, the latter using a scale from 0 (lowest: immobile) to 5 (highest: progressive and vigorous movement). Then, the sperm motility index (SMI) was calculated according to the formula [@pone.0112382-Comizzoli1]:
Only samples with at least 60% motile sperm were used for this study ([Table S1](#pone.0112382.s003){ref-type="supplementary-material"}). The sperm cryopreservation protocol was performed as previously described [@pone.0112382-FernndezSantos1]. Briefly, the sperm mass was diluted at room temperature to 400×10^6^ spermatozoa/mL with fraction A, and then to 200×10^6^ spermatozoa/mL with fraction B. The diluted samples were refrigerated for approximately 10 min to reach 5°C and then equilibrated at the same temperature for 2 h. After equilibration, the suspended sperm was loaded into 0.25 mL plastic straws and frozen for 10 min in nitrogen vapours, 4 cm above the level of liquid nitrogen (−120°C). The straws were then immediately immersed into liquid nitrogen (−196°C) for storage.
Morphometry assessment of fresh sperm {#s2e}
-------------------------------------
Sperm samples were directly recovered from the cauda of both epididymides. Spermatozoa were fixed in glutaraldehyde solution. A sub-sample of 2 µl was used to prepare the smears. Semen smears were air-dried for one day, then immersed in the glutaraldehyde fixative solution for 5 min and immediately mounted, sealing the edges with dibutyl phthalate xylene (DPX). This method avoids floating cells on the slide ([Figure 1A](#pone-0112382-g001){ref-type="fig"}), which greatly helps sperm morphometry analysis. Sperm samples were photographed using a high-resolution camera DXM1200 (Nikon, Tokyo, Japan) under a phase-contrast microscopy using an Eclipse E600 microscope (Nikon, Tokyo, Japan), and a 40X objective (Nikon, Tokyo, Japan). The resolution of the pictures was 3840×3072 pixels (TIFF format). A scale of 10 µm (181 pixels) was used for the measurements. The pixel size was 0.055 µm in the horizontal and vertical axes. Sperm lengths were assessed using ImageJ software (National Institutes of Health, USA). The main structures of red deer spermatozoon are shown in [Figure 1B](#pone-0112382-g001){ref-type="fig"}. The following sperm morphometry parameters were determined: head width, head length, proximal midpiece width, distal midpiece width, midpiece length, flagellum length, and terminal piece length ([Table S1](#pone.0112382.s003){ref-type="supplementary-material"}). From these measurements, we calculated other morphometric parameters such as total sperm and principal piece lengths. The head area was calculated using the formula for the area of an ellipse [@pone.0112382-Hossain1], [@pone.0112382-Sanchez1]:
{#pone-0112382-g001}
Head perimeter was calculated using the Ramanujan\'s formula for calculating the perimeter of an ellipse [@pone.0112382-Ramanujan1]:
In both formulae, L and W are the semi-major and semi-minor axis of the sperm head, respectively. Twenty-five representative sperm were measured for each male as described by Malo et al. [@pone.0112382-Malo1].
### Stereology of the flagellum {#s2e1}
Sperm flagellum volume and its structures were determined using a stereology method based on Anderson et al. [@pone.0112382-Anderson2] with some modifications. Anderson et al. [@pone.0112382-Anderson2] calculated the volumes of the sperm midpiece and flagellum using the formula for the volume of a cylinder. In this study, owing to the significant differences between the proximal and distal midpiece widths (0.94 µm and 0.74 µm, respectively; p\<0.0001), we estimated sperm midpiece volume using the formula for the volume of a truncate cone:where L is the length of the midpiece, R is the half proximal midpiece width, and r is the half distal midpiece width. On the other hand, the total flagellum and principal piece volumes were determined using the formula for the volume of a cone:where R is the half midpiece width (i.e., proximal or distal) and L is the length of the flagellum or the principal plus terminal piece.
Sperm thawing and sperm quality assessment {#s2f}
------------------------------------------
The sperm straws were thawed in a water bath with a saline solution at 37°C for 30 s, and each sample was poured in a tube. The samples were incubated at 37°C and analysed for motility (subjectively and with the CASA system), viability, acrosomal status, and mitochondrial status at 0 hours (after 10 min of incubation) and after 2 hours post-thawing ([Table S2](#pone.0112382.s004){ref-type="supplementary-material"} and [Table S3](#pone.0112382.s005){ref-type="supplementary-material"}, respectively).
### CASA analysis {#s2f1}
Sperm were diluted down to 25--30×10^6^ spermatozoa/mL with fraction A solution and loaded into a Makler counter chamber (Sefi-Medical instruments, Haifa, Israel) at 37°C. The CASA system consisted of a triocular optical phase contrast microscope Eclipse 80i (Nikon, Tokyo, Japan), equipped with a warming stage at 37°C and a Basler A302fs digital camera (Basler Vision Technologies, Ahrensburg, Germany). Images were captured and analysed using the Sperm Class Analyzer software (Microptic S.L., Barcelona, Spain). The analysis was carried out using a 10X negative phase-contrast objective (Nikon, Tokyo, Japan). A total of 4 descriptors of sperm motility were recorded analysing a minimum of 250 sperm per sample: average path velocity (VAP, µm/s), curvilinear velocity (VCL, µm/s), straight linear velocity (VSL, µm/s), and amplitude of lateral head displacement (ALH, µm). The standard parameters settings were as follows: 25 frames/s; 20 to 60 µm^2^ for the head area.
### Fluorescence probes for sperm viability, acrosomal status, and mitochondrial activity {#s2f2}
Several physiological traits were assessed using fluorescent probes and flow cytometry, as previously described [@pone.0112382-DomnguezRebolledo1]. Briefly, the samples were diluted down to 10^6^ spermatozoa/mL in BGM-3 solution and stained using four fluorophores. Sperm viability was assessed with 0.1 µmol/L YO-PRO-1 (Invitrogen, Barcelona, Spain) and 10 µmol/L PI (propidium iodide). Mitochondrial activity and acrosomal status were assessed with 0.1 µmol/L Mitotracker Deep Red (Invitrogen, Barcelona, Spain) and 4 µg/mL PNA-TRITC (peanut agglutinin), respectively. The spermatozoa stained in these two solutions were incubated 20 min in the dark before being run through a flow cytometer. The sperm populations shown in this work were: YO-PRO-1-/PI- (viable spermatozoa), MT+ (Mitotracker Deep Red, spermatozoa with active mitochondria), and PNA- (spermatozoa with intact acrosome).
### Flow cytometry analysis {#s2f3}
Samples were analysed as previously described [@pone.0112382-DomnguezRebolledo1]. Briefly, a Cytomics FC500 flow cytometer (Beckman Coulter, Brea, CA, USA) was utilized, with a 488-nm Ar-Ion laser (excitation for YOPRO-1, PNA-TRITC, and PI), and a 633-nm He-Ne laser (excitation for Mitotracker Deep Red). The FSC (forward-scattered light) and SSC (side-scattered light) signals were used to gate out debris (non-sperm events). Fluorescence from YO-PRO-1 was read using a 525/25BP filter, PNA-TRITC was read using a 575/20BP filter, PI was read using a 615DSP filter, and Mitotracker Deep Red was read using a 675/40BP filter. Fluorescence captures were controlled using the RXP software provided with the cytometer. All of the parameters were read using logarithmic amplification. For each sample, 5000 spermatozoa were recorded, saving the data in flow cytometry standard (FCS) v. 2 files. The analysis of the flow cytometry data was carried out using WEASEL v. 2.6 (WEHI, Melbourne, Victoria, Australia).
Statistical analysis {#s2g}
--------------------
All statistical analyses were performed using the SPSS 20.0 statistical software package (SPSS Inc, Chicago, IL, USA). Sperm samples from thirty-three (N = 33) red deer were used for statistical analysis. The Kolmogorov-Smirnov test was used to check the normal distribution of the data. A repeated measures one-way ANOVA test was used to compare subjective motility between fresh and thawed sperm (0 and 2 hours) using the Mauchly\'s sphericity test (Greenhouse-Geisser correction) to verify homogeneity of variance. The quality of motility (QM) was not normally distributed in some groups, therefore, non-parametric Friedman test (repeated measures) was used. On the other hand, to check differences in sperm parameters (kinetics-CASA and flow cytometry) between 0 and 2 hours post-thaw we used a paired-samples t-student test (repeated measures). In order to determine sperm freezability we performed a hierarchical clustering analysis using the Euclidean distance measure after determining automatically the number of conglomerates by cluster analysis in two phases. For this purpose, we used three sperm kinetic parameters (VAP, VCL, and VSL) because they are highly related with fertility in red deer [@pone.0112382-Malo2] and are good indicators of post-thawing sperm quality [@pone.0112382-NuezMartnez1]. Sperm freezability was determined at 2 hours post-thawing to test spermatozoa thermo-resistance. The independent-samples student-t test (Levene\'s test to verify homogeneity of variance) and the Mann-Whitney U test were used to check for differences in sperm parameters between the GF and the BF.
On the other hand, since the variables of sperm velocity (VAP, VCL, VSL, ALH, and SMI) were highly correlated among themselves, we reduced the number of predictor variables using principal component analysis (PCA) to obtain an overall sperm velocity at 0 and 2 hours post-thawing, respectively. Bartlett sphericity and Keiser-Meyer-Olkin tests were assessed as measures of sampling adequacy [@pone.0112382-Budaev1]. Pearson\'s correlation test and the linear regression model were used to assess the relationship between sperm velocity and morphometric parameters. We used the RMA software to reduced major axis regression [@pone.0112382-Bohonak1]. The within male coefficient of variation (CV) in sperm morphometry was calculated to show the intra-male variability in sperm design.
Results {#s3}
=======
Effects of sperm cryopreservation {#s3a}
---------------------------------
After the freezing-thawing process, a remarkable decrease in subjective motility parameters was observed between fresh and thawed sperm, but also between 0 and 2 hours post-thawing: motile sperm, *F*(1.49, 47.55) = 94.27, p\<0.001; QM, *χ* ^2^(2, N = 33) = 37.83, p\<0.001; and SMI, *F*(1.51, 48.22) = 116.02, p\<0.001 ([Table 1](#pone-0112382-t001){ref-type="table"}). In the same way, there were significant differences for all of the CASA kinetic parameters between 0 and 2 hours post-thawing: VAP, t(32) = 9.77, p\<0.001; VCL, t(32) = 10.46, p\<0.001; VSL, t(32) = 10.29, p\<0.001; and ALH, t(32) = 10.18, p\<0.001 ([Table 2](#pone-0112382-t002){ref-type="table"}). Furthermore, sperm viability and organelle functionality showed a decrease after thawing, displaying highly significant differences between 0 and 2 hours post-thawing: YOPRO-1-/PI-, t(32) = 11.47, p\<0.001; MT+, t(32) = 6.26, p\<0.001; and PNA-, t(32) = 11.18, p\<0.001 ([Table 2](#pone-0112382-t002){ref-type="table"}). For instance, the mean percentage of sperm with active mitochondria ranged from 51.13% to 28.63% during incubation (at 0 and 2 hours, respectively).
10.1371/journal.pone.0112382.t001
###### Subjective motility of fresh and thawed red deer spermatozoa (N = 33).
{#pone-0112382-t001-1}
Sperm motility
------------------- ---------------- -------------- ---------------
Fresh sperm 81.82±11.44^a^ 2.24±0.48^a^ 63.33±9.11^a^
0 hours post-thaw 55.91±16.32^b^ 1.86±0.28^a^ 46.51±9.96^b^
2 hours post-thaw 42.57±13.52^c^ 1.43±0.21^b^ 35.61±7.71^c^
Different superscript letters within the same column differ significantly (p\<0.001). Data are shown as mean ± SD (standard deviation). QM, quality of motility; SMI, sperm motility index.
10.1371/journal.pone.0112382.t002
###### Kinetics, viability, and organelle status of red deer spermatozoa (N = 33) at 0 and 2 hours post-thaw.
{#pone-0112382-t002-2}
Assessed parameters 0 hours post-thaw 2 hours post-thaw
-------------------------------------- ------------------- ------------------- ---------------- --------------
Sperm kinetics
VAP (µm/s) 60.60±13.48^a^ 26.08-87.21 40.09±10.41^b^ 23.18--57.16
VCL (µm/s) 97.58±21.52^a^ 55.49--144.36 66.60±14.14^b^ 43.92--95.45
VSL (µm/s) 34.17±7.17^a^ 15.56--49.03 22.17±5.00^b^ 14.11--29.44
ALH (µm) 3.78±0.80^a^ 2.49--5.47 2.69±0.43^b^ 2.05--3.55
Sperm viability and organelle status
Viability (YOPRO-1-/PI-, %) 35.81±8.91^a^ 18.46--51.16 29.70±8.28^b^ 13.20--41.32
Active mitochondria (MT+, %) 51.13±13.93^a^ 26.42--78.51 28.63±19.00^b^ 0.88--56.08
Intact acrosome (PNA-, %) 83.96±6.82^a^ 67.40--93.96 69.67±11.16^b^ 50.74--90.72
Different superscript letters within the same row differ significantly (p\<0.001) between 0 and 2 hours post-thaw. SD, standard deviation; VAP, average path velocity; VCL, curvilinear velocity; VSL, straight linear velocity; ALH, amplitude of lateral head displacement.
Deer sperm freezability (GF and BF) {#s3b}
-----------------------------------
The cluster dendrogram analysis of sperm freezability is shown in [Figure 2](#pone-0112382-g002){ref-type="fig"}. Fourteen stags were clearly identified as GF, whereas nineteen were BF. Not only did the GF and the BF show clear differences in the three parameters (VAP, VCL, and VSL) used for the cluster analysis, but they also showed differences in the other sperm functionality parameters. Indeed, at 0 hours post-thawing we found significant differences in the following sperm parameters: motile sperm, t(31) = −2.23, p = 0.033; VAP, t(31) = −3.58, p = 0.001; VCL, t(31) = −4.18, p\<0.001; VSL, t(31) = −2.66, p = 0.012; ALH, t(31) = −4.30, p\<0.001; YOPRO-1-/PI-, t(27.97) = −2.82, p = 0.009; and MT+, t(26.75) = −2.30, p = 0.029 ([Table 3](#pone-0112382-t003){ref-type="table"}). The differences between the two groups of males in sperm quality were more evident across sperm incubation ([Table 3](#pone-0112382-t003){ref-type="table"}). Thus, sperm kinetics, viability, and organelle functionality were significantly different between the GF and the BF at 2 hours post-thawing as follows: motile sperm, t(31) = −3.87, p\<0.001; QM, U = 66.00, p = 0.003; SMI, t(31) = −4.62, p\<0.001; VAP, t(31) = −9.66, p\<0.001; VCL, t(19.24) = −8.28, p\<0.001; VSL, t(31) = −8.08, p\<0.001; ALH, t(31) = −7.60, p\<0.001; YOPRO-1-/PI-, t(28) = −2.67, p = 0.013; MT+, t(31) = −3.43, p = 0.002; and PNA-, t(31) = −2.69, p = 0.011 ([Table 3](#pone-0112382-t003){ref-type="table"}). On the other hand, the quality of motility, SMI, and acrosomal status were not significantly different between the GF and the BF at 0 hours post-thawing ([Table 3](#pone-0112382-t003){ref-type="table"}).
{#pone-0112382-g002}
10.1371/journal.pone.0112382.t003
###### Sperm kinetics, viability and organelle status in good freezers (GF, n = 14) and bad freezers (BF, n = 19) at 0 and 2 hours post-thaw.
{#pone-0112382-t003-3}
Assessed parameters 0 hours post-thaw 2 hours post-thaw
-------------------------------------- ----------------------- ---------------------- --------------------- ----------------------
Sperm kinetics
VAP (µm/s) 68.96±12.40^a\*\*^ 54.44±10.83^b\*\*^ 50.43±5.38^a\*\*\*^ 32.47±5.21^b\*\*\*^
VCL (µm/s) 112.40±20.13^a\*\*\*^ 86.65±15.30^b\*\*\*^ 80.37±9.70^a\*\*\*^ 56.45±5.56^b\*\*\*^
VSL (µm/s) 37.71±7.02^a\*^ 31.56±6.24^b\*^ 26.90±2.27^a\*\*\*^ 18.70±3.25^b\*\*\*^
ALH (µm) 4.34±0.78^a\*\*\*^ 3.36±0.53^b\*\*\*^ 3.08±0.32^a\*\*\*^ 2.40±0.19^b\*\*\*^
Motile sperm (%) 62.86±15.53^a\*^ 50.79±15.30^b\*^ 51.43±9.89^a\*\*\*^ 36.05±12.20^b\*\*\*^
QM (0--5) 1.89±0.19^a^ 1.83±0.33^a^ 1.55±0.11^a\*\*^ 1.34±0.22^b\*\*^
SMI (%) 50.36±9.14^a^ 43.68±9.80^a^ 41.25±5.07^a\*\*\*^ 31.45±6.63^b\*\*\*^
Sperm viability and organelle status
Viability (YOPRO-1-/PI-, %) 40.10±5.00^a\*\*^ 32.65±9.91^b\*\*^ 33.50±4.70^a\*^ 26.91±9.29^b\*^
Active mitochondria (MT+, %) 56.72±7.44^a\*^ 47.01±16.20^b\*^ 40.06±18.20^a\*\*^ 20.22±15.05^b\*\*^
Intact acrosome (PNA-, %) 86.26±6.30^a^ 82.26±6.84^a^ 75.24±9.87^a\*^ 65.57±10.45^b\*^
Different superscript letters within the same row differ significantly between GF and BF at 0 and 2 hours post-thaw, respectively (\*p\<0.05; \*\*p\<0.01; \*\*\*p\<0.001). Data are shown as mean ± SD (standard deviation). GF, good freezers; BF, bad freezers; VAP, average path velocity; VCL, curvilinear velocity; VSL, straight linear velocity; ALH, amplitude of lateral head displacement; QM, quality of motility; SMI, sperm motility index.
Sperm quality before freezing {#s3c}
-----------------------------
There were no significant differences between the GF and the BF before freezing in any of the subjective kinetics parameters evaluated. Indeed, the GF and the BF showed similar subjective motility and, therefore, were expected to have the same freezability. Motility parameters in fresh spermatozoa were: motile sperm (83.21±13.24 vs 80.79±10.17, t(31) = −0.60, p = 0.556), QM (2.25±0.51 vs 2.24±0.48, U = 127.50, p = 0.825), and SMI (64.11±10.63 vs 62.76±8.07, t(31) = −0.41, p = 0.682). Data are shown as the mean ± SD for the GF and the BF, respectively.
Sperm freezability and morphometry of fresh sperm {#s3d}
-------------------------------------------------
The descriptive statistics for the morphometric parameters are shown in [Table 4](#pone-0112382-t004){ref-type="table"}. There were no differences between the GF and the BF in any of the sperm head measurements ([Table 4](#pone-0112382-t004){ref-type="table"}). On the other hand, highly significant differences were observed between groups in regard to sperm flagellum morphometry ([Table 4](#pone-0112382-t004){ref-type="table"}). Thus, the GF exhibited a lower mean principal piece volume than the BF (6.13±0.42 µm^3^ vs. 6.61±0.49 µm^3^, t(31) = 2.93, p = 0.006). Also, the GF exhibited a smaller mean distal midpiece width than the BF (0.73±0.02 µm vs. 0.75±0.03 µm, t(31) = 2.37, p = 0.024). The data are shown as the mean ± SD for the GF and the BF, respectively. Moreover, the flagellum and midpiece volumes together with some sperm lengths (e.g., total sperm and flagellum) showed lower values in the GF than the BF, although the differences were not statistically significant ([Table 4](#pone-0112382-t004){ref-type="table"}). Sperm freezability according to the sperm principal piece volume is shown in [Figure 3](#pone-0112382-g003){ref-type="fig"}.
{#pone-0112382-g003}
10.1371/journal.pone.0112382.t004
###### Overall morphometry of fresh sperm (data derived from 825 spermatozoa from 33 red deer) and differences between good (GF) and bad freezers (BF) in sperm morphometry parameters.
{#pone-0112382-t004-4}
Assessed parameters Overall (N = 33) GF (n = 14) BF (n = 19) *P*
-------------------------------- ------------------ -------------- ------------- ------------ ------------ -----------
Sperm head
Width (µm) 5.17±0.12 4.82--5.35 2.35 5.17±0.11 5.16±0.13 0.766
Length (µm) 8.75±0.24 8.35--9.30 2.79 8.77±0.25 8.74±0.25 0.730
Area (µm^2^) 35.51±1.17 33.09--37.94 3.30 35.64±1.30 35.41±1.10 0.597
Perimeter (µm) 22.23±0.43 21.36--23.23 1.92 22.27±0.46 22.20±0.41 0.653
Flagellum and sperm length
Midpiece width, proximal (µm) 0.94±0.03 0.85--1.03 3.56 0.93±0.05 0.94±0.02 0.382
Midpiece width, distal (µm) 0.74±0.03 0.68--0.80 3.63 0.73±0.02 0.75±0.03 **0.024**
Midpiece length (µm) 12.06±0.26 11.50--12.60 2.12 12.02±0.18 12.08±0.30 0.506
Principal piece length (µm) 41.47±1.26 38.92--44.39 3.04 41.07±1.42 41.76±1.07 0.122
Terminal piece length (µm) 2.68±0.26 2.05--3.21 9.89 2.61±0.28 2.72±0.25 0.248
Flagellum length (µm) 56.20±1.29 53.56--59.05 2.29 55.71±1.41 56.57±1.09 0.057
Midpiece volume (µm^3^) 6.73±0.48 5.68--7.70 7.09 6.57±0.56 6.85±0.38 0.097
Principal piece volume (µm^3^) 6.41±0.51 5.37--7.72 7.98 6.13±0.42 6.61±0.49 **0.006**
Flagellum volume (µm^3^) 12.95±1 10.36--15.22 7.70 12.67±1.24 13.16±0.73 0.161
Sperm length (µm) 64.96±1.29 62.35--67.52 1.99 64.48±1.34 65.31±1.17 0.068
Bold letters show significant differences between GF and BF. SD, standard deviation; CV, coefficient of variation.
Sperm velocity post-thaw and its relationship with morphometry of fresh sperm {#s3e}
-----------------------------------------------------------------------------
Principal component analysis rendered only one component both at 0 and 2 hours post-thawing. The components explained 91.68% and 83.98% of the variance in sperm velocity at 0 and 2 hours post-thawing, respectively. The PCA are shown in [Table 5](#pone-0112382-t005){ref-type="table"}.
10.1371/journal.pone.0112382.t005
###### Results of principal component analysis (PCA) to determine overall sperm velocity at 0 and 2 hours post-thaw.
{#pone-0112382-t005-5}
PCA 0 hours 2 hours
-------------------------------- --------- ---------
Variables PC1 PC1
VAP 0.986 0.951
VCL 0.975 0.967
VSL 0.960 0.920
ALH 0.957 0.927
SMI 0.907 0.809
Variance explained (%) 91.676 83.978
Eigenvalue 4.584 4.199
Bartlett\'s test of sphericity 0.000 0.000
Kaiser-Meyer-Olkin test 0.795 0.744
VAP, average path velocity; VCL, curvilinear velocity; VSL, straight linear velocity; ALH, amplitude of lateral head displacement; SMI, sperm motility index.
None of the morphometric parameters of the sperm head were related with sperm velocity. In contrast, sperm velocity showed strong and negative relationships with sperm flagellum volumes, particularly with the sperm principal piece volume. Indeed, at 0 hours post-thawing, the principal piece volume was the only parameter showing a significant relationship with sperm velocity (r = −0.36; p = 0.038) ([Figure 4A](#pone-0112382-g004){ref-type="fig"}). In addition, such a relationship reached the highest values at 2 hours post-thawing (r = −0.60; p\<0.001) ([Figure 4B](#pone-0112382-g004){ref-type="fig"}). On the other hand, sperm velocity was also negatively correlated with distal midpiece width (r = −0.55; p = 0.001) ([Figure 4C](#pone-0112382-g004){ref-type="fig"}) and with midpiece and flagellum volumes (r = −0.44; p = 0.011 and r = −0.36; p = 0.038) at 2 hours post-thawing ([Figures 4D--E](#pone-0112382-g004){ref-type="fig"}, respectively).
{#pone-0112382-g004}
Discussion {#s4}
==========
In this study, for the first time, the volumes of the flagellum structures in fresh sperm have been determined to predict sperm freezability in red deer. Our results clearly show that sperm with a higher principal piece volume freeze worse, that is, the GF have a lower principal piece volume than the BF. We also found that sperm velocity is strongly and negatively related with the volumes of the flagellum structures. Sperm velocity is crucial in the process of fertilization in a large number of taxa (including fish [@pone.0112382-Gage1], birds [@pone.0112382-Birkhead1], and mammals [@pone.0112382-Malo2], [@pone.0112382-Holt4]). Moreover, VAP, VCL, and VSL have been proven to be good indicators of sperm freezability in red deer as previously described in canine sperm [@pone.0112382-NuezMartnez1], and in turn, these parameters are closely related with fertility in red deer using thawed sperm [@pone.0112382-Malo2].
The evaluation of sperm function throughout post-thawing and sperm incubation provides additional information about the quality of the spermatozoa [@pone.0112382-Bollwein1], [@pone.0112382-AnelLpez1] and is more closely related to sperm fertility than those sperm assessed immediately after thawing [@pone.0112382-Saacke1], [@pone.0112382-DelOlmo1]. According to this assumption, we found more and stronger relationships between sperm velocity and the volumes of the flagellum structures at 2 hours than at 0 hours post-thawing. For example, we did not find any differences between the GF and the BF in acrosomal status at 0 hours post-thawing, but we did at 2 hours post-thawing. This is probably because if the sperm membrane or other structures (e.g. axoneme) were disrupted, this damage was not manifested immediately upon thawing, but occurred during post-thaw re-warming within specific temperatures [@pone.0112382-Holt3]. Thus, the damage in this structure would be higher due to thermal stress during sperm incubation, inasmuch as sperm thawing is more deleterious than sperm freezing [@pone.0112382-Holt3], [@pone.0112382-Medrano1] and can result in more morphological damage [@pone.0112382-Woolley1].
In the present work, we did not find any significant differences between the GF and the BF in sperm head size, and also none of the morphometric parameters of this structure showed any relationship with sperm velocity. By contrast, Esteso et al. [@pone.0112382-Esteso1] found that sperm head size is related with sperm freezability in red deer (i.e., increased head size entails a poor sperm freezability). However, Esteso et al. [@pone.0112382-Esteso1] classified sperm donors as a GF or BF using the sperm motility index, instead of a CASA system, together with acrosomal status and membrane stability. Within this context, we found that the intact acrosome is negatively related with sperm head size at 0 hours post-thawing ([Figure S1](#pone.0112382.s001){ref-type="supplementary-material"}). On the other hand, the sperm principal piece volume and distal midpiece width showed significant differences between the GF and the BF, and they are also negatively correlated with sperm velocity. According to this fact, Peña et al. [@pone.0112382-Pea1] found that midpiece width is a predictor of post-thawing boar sperm motility. In our study, the principal piece volume is mainly determined by the distal midpiece width ([Figure S2](#pone.0112382.s002){ref-type="supplementary-material"}), which can explain their similar relationships with sperm velocity, and also the differences found between the GF and the BF in these sperm measures. The damage caused by sperm freezing protocols to the sperm head and tail membranes may occur independently: an intact tail membrane does not necessarily indicate an intact sperm head membrane and vice versa [@pone.0112382-Zhu1]. For example, after the freezing-thawing process, the disruption of the sperm head membrane occurs more easily than the tail in human and ram sperm [@pone.0112382-Holt3], [@pone.0112382-Zhu1], whereas the flagellum membrane is more vulnerable to the cryopreservation process in equine sperm [@pone.0112382-Domes1]. Sperm with an intact head membrane but a damaged flagellum are most likely immotile, explaining the low fertilization rates with frozen/thawed sperm [@pone.0112382-Domes1], [@pone.0112382-Nagy1]; therefore, these cells should be included in the dead rather than the alive category [@pone.0112382-Nagy1]. In our study, the sperm flagellum is likely more sensitive to the freezing/thawing process than the sperm head or, at least, a damaged flagellum negatively affects sperm kinetics more than a damaged sperm head.
The fragility of the sperm flagellum and its ability to withstand the freezing/thawing process has been reported in many studies. The addition of glycerol as a cryoprotectant agent alters sperm functionality, mainly during the post-thawing sperm incubation stage [@pone.0112382-MacasGarca1], showing an increase in the proportion of epididymal spermatozoa with axonemal vacuoles, damaged plasma membranes, and abnormal mitochondria when compared to media without glycerol [@pone.0112382-McClean1]. Furthermore, the cytoskeleton is responsible for the appropriate cell volume regulation and its stability is highly altered by the cryopreservation process, causing its proteins (e.g., F-actin) to become more fragile [@pone.0112382-Petrunkina1], [@pone.0112382-FelipePrez1], [@pone.0112382-Petrunkina2], [@pone.0112382-Petrunkina3]. Thus, in red deer, a higher volume of the sperm flagellum might result in an increased amount of ice crystals and increased formation of axonemal vacuoles during the freezing/thawing process, adversely affecting flagellum integrity and consequently, cell volume regulation and sperm velocity. Supporting this hypothesis, Correa et al. [@pone.0112382-Correa1] suggested a direct connection between cell volume regulation, flagellum morphology, motility, and the actin cytoskeleton in the sublethal damage that occurs during osmotic stress and, potentially, during cryopreservation. On the other hand, we did not find any significant differences between the GF and the BF in the midpiece or flagellum size which contain sperm mitochondria and the whole sperm axoneme, respectively. On the contrary, the sperm principal piece volume differs between the GF and the BF. Such a result might be related to the fibrous sheath, which is located along the principal piece and linked with sperm kinetics [@pone.0112382-Schlingmann1]. Thus, differences among males in the principal piece volume could differently affect their sperm freezability. Furthermore, it is thought that the fibrous sheath plays a mechanical role in sperm motility, providing a rigid support to the flagellum and determining its planar beat [@pone.0112382-Fawcett1], [@pone.0112382-Lindemann1]. Additionally, glycolysis is carried out along the length of the principal piece and this, instead of oxidative phosphorylation in the midpiece, is the most important source of ATP for the tail [@pone.0112382-Turner1]. At least one fibrous sheath protein may act to protect sperm from oxidative stress, which could interfere with sperm motility or cause DNA damage [@pone.0112382-Fulcher1]. Therefore, the proteome and the general structure of the fibrous sheath could be potentially damaged by the sperm freezing and thawing process, particularly in those sperm with a higher sperm principal piece volume, causing a decrease in sperm function mainly during sperm incubation.
In conclusion, our results provide evidence that the volumes of the flagellum structures are a determinant to predict post-thaw sperm velocity in red deer, and the BF have a higher sperm principal piece volume than the GF. In contrast, sperm head size is not a good predictor of post-thaw sperm velocity in red deer spermatozoa. However, further studies, including additional analyses such as freeze-fracture electron microscopy observations of spermatozoa [@pone.0112382-McClean1], [@pone.0112382-Holt5] and the evaluation of sperm tail membrane integrity by light microscopy [@pone.0112382-Nagy1] during sperm cooling and especially during sperm warming, are necessary in order to confirm our findings. On the other hand, our subsequent studies will be directed towards the use of electron microscopy, to assess sperm flagellum morphometry in more depth, and also to measure their internal structures (axoneme, fibrous sheath, etc.). Our results clearly show that a higher principal piece volume results in poor sperm freezability, and highlights the key role of the volume of flagellum structures in sperm cryopreservation success.
Supporting Information {#s5}
======================
######
**Relationships between sperm head perimeter and intact acrosome at 0 hours of sperm thawing (r = −0.365; p = 0.037).**
(JPG)
######
Click here for additional data file.
######
**Relationships between sperm principal piece volume and distal midpiece width (r = 0.93; p\<0.0001).**
(JPG)
######
Click here for additional data file.
######
**Individual mean morphometry and subjective motility of fresh red deer spermatozoa (N = 33).**
(DOC)
######
Click here for additional data file.
######
**Individual mean kinetics, viability, and organelle status of red deer spermatozoa at 0 hours post-thaw (N = 33).**
(DOC)
######
Click here for additional data file.
######
**Individual mean kinetics, viability, and organelle status of red deer spermatozoa at 2 hours post-thaw (N = 33).**
(DOC)
######
Click here for additional data file.
The assistance provided by Alfonso Bisbal, Enrique del Olmo, Mari Cruz Sotos, and Zandra Maulen is gratefully acknowledged. Eliana Pintus is acknowledged for her insightful comments. Landowners, managers, and rangers are acknowledged for facilitating access to samples.
[^1]: **Competing Interests:**The authors have declared that no competing interests exist.
[^2]: Conceived and designed the experiments: JLRS JJG. Performed the experiments: JLRS AEDR. Analyzed the data: JLRS. Contributed reagents/materials/analysis tools: JJG. Wrote the paper: JLRS. Sperm morphometry assessment: JLRS. Revised the manuscript: JLRS AEDR JJG.
|
{
"pile_set_name": "PubMed Central"
}
|
The present invention relates generally to methods and apparatus for treating fluids, and specifically relates to methods and apparatus for treating fluids through contact with a contact media. The method and apparatus of the present invention are particularly suitable for use in ion exchange operations where a fluid is contacted with a fluidizable ion exchange media such as a resin, or with filtration or absorption operations where the fluids contacted with a media such as activated carbon.
Ion exchange processes for testing fluids are well known. Such ion exchange operation may include, for example; "water softening", deionization, de-alkylizing, desilicizing, and organic scavenging. With respect to the present invention, these ion exchange processes will for convenience be discussed in terms of water treatment. It should be clearly understood, however, that the methods and apparatus of the present invention may be utilized in the treatments of many other fluids.
Typically, an ion exchange process is affected by flowing the water through a vertical column of an ion exchange contact media, typically a resin. As the water contacts the resin, ions in the water will be attracted to the resin from the water. One type of resin may be utilized to remove cations from the water and a second type of resin may be utilized to remove anions from the water. Preferably, the separate resins will be contained in separate beds. However, conventional techniques of water deionization include the use of two resins mixed in a single bed.
The softening of water by ion exchange is accomplished by replacing the calcium and magnesium ions in the water by an equivalent number of sodium ions from the resin. Resin in the bed will contain only a finite number of exchangeable sodium ions. This number defines the "capacity of the resin". When the capacity of the resin has been exhausted, i.e., when all of the exchangeable sodium ions on the resin have been replaced by calcium and magnesium ions from the water, the resin must be regenerated back to the sodium form. This regeneration is typically accomplished by passing a sodium chloride solution (a brine) through the resin. Additionally, the resin will be rinsed to remove excess brine, and will be backwashed to remove particulate matter which may have accumulated in the resin during the ion exchange step ("the service cycle").
As water flows through a bed of resin, the majority of the ion exchange will take place in the portion of the resin which is first contacted by the fluid. In an ion exchange system where the fluid flows downwardly through the bed, this exchange creates an "exhausted band" of exhausted resin which expands downwardly through the bed as the operation continues. When the band approaches the bottom of the resin bed, the bed must be regenerated as discussed above.
Additionally, a vertical column of resin operating in a service cycle has an exchange zone, or active band, starting at the top and moving down through the bed of resin. The width of the active band varies with certain operating parameters of the system. For example, as the service flow is increased the active band will spread out. The resin bed must be removed from service and regenerated before the active band reaches the bottom of the column to prevent leakage of the ions being removed from the fluid. This prevents full utilization of the resin since there is resin not fully exhausted in and below the active band. When a column of resin in normal operation is regenerated, sufficient regenerant (salt in the case of water softening) is used to regenerate the entire volume regardless of what percent of the bed was actually exhasted.
Many conventional vertical ion exchange columns are designed to function both as a column for the service cycle, i.e., for the initial ion exchange process, and for the regeneration cycle, and therefore also include provisions for backwashing, regeneration, and rinsing of the resin. This structure requires the fluid influent to be shut off from the column while the regeneration operation takes place, thereby interrupting the supply to service of treated fluid. When an uninterrupted supply of treated fluid is required, a second vertical column is typically provided. This second column will be regenerating during the service cycle of the first column and vice versa. Conventional columns typically include a shell to contain the resin, a support for the resin, and means for distributing flow both upwardly and downwardly through the resin, (for both the service cycle and the regeneration and backwashing cycles). The shell must have sufficient space above the resin to allow the resin to expand during the backwashing operation. Valves and controls are typically necessary to bypass "raw" (untreated) fluid around the column during the regeneration cycle, to inject the regeneration fluid into the column, and to reverse the direction of fluid flow for backwashing.
Conventional vertical columns may include several disadvantages. Where a single large resin bed is utilized, fluid has a tendency to channel through the bed during periods of low flow rate, thereby reducing the effective contact of the fluid with the resin. Additionally, the requirement of additional space above the resin bed to facilitate the backwashing operation adds cost to the vessel. Where uninterrupted service is required and a second unit is provided, the additional unit adds significant cost and size to the unit. A significant factor in this cost is that a control valve must be provided to switch fluid flow from one vessel to the other. This control valve must be large enough to provide a significant flow of the influent into the column without placing an excessive pressure drop in the system. Large control valves of this type typically contribute a significant portion of the cost of conventional ion exchange units. These valves still often place an undesireable pressure drop in the system.
If only one column is provided, in typical conventional systems, not only must the flow of treated water be interrupted, but untreated water must be used with the unit itself for the backwashing, regeneration, and rinsing operations. This use of untreated water will, in itself, decrease the operating efficiency of the contact media regeneration, and will therefore similarly decrease the efficiency of the ion exchange process.
Because of the deficiencies discussed above, several attempts have been made to devise methods and apparatus for an uninterrupted or, continuous ion exchange process in a single column. Typically, these processes involve the movement of the contact media downwardly through the column or ion exchange vessel while the fluid flows upwardly through the column. In some cases, the resins are actually fluidized, or suspended, in the fluid flow. This upward flow, and especially fluidization, typically provide less than optimal ion exchange. A major factor in the efficiency of ion exchange process is the physical contact of the water molecules with the resin. With a downward fluid flow, both gravity and the influent flow serve to compact the resin into a tightly formed bed. This compacting of the bed forces the fluid to flow closer to the resin beads, causing surface effects on the water and forcing fluid to flow into the pores of the beads. This compacting of the bed, therefore, increases both contact efficiency and the bed capacity. In contrast, an upward flow, as found in the prior art, causes the resin to expand, as noted above, sometimes to the point of fluidization. This unpacked state of the resin causes a reduction in contact with the water. Additionally, even when a system is designed to operate with the resin not in a state of fluidization, flow rate surges must be prevented to avoid the fluidization.
As indicated above, conventionally proposed continuous ion exchange methods and apparatus typically move the resins downwardly through the exchange vessel. When each portion of the resin reaches a predetermined location in the vessel, the resin is removed and regenerated in a separate vessel. Therefore, for efficient use of the system and the contact media, the rate of travel of the media must be regulated in response to the rate of flow of the influent.
Conventionally proposed methods and apparatus for continuous ion exchange typically provide for contacting the fluid with a single resin in a vessel. However, for operations such as water deionization or demineralization, the water is typically contacted with two ion exchange resins in two stages. In the first stage, the water contacts a first resin which will attract the cations from the water and replace them with hydrogen ions. This first resin is typically regenerated with an acid. In the second stage, the fluid is contacted with a second resin which attracts the anions from the water and replaces them with hydroxide ions. This second resin is typically regenerated with a base, such as sodium hydroxide. The hydrogen ions from the first stage and the hydroxide ions from the second stage combine to produce water. Similarly, fluid may be contacted with selected resins for other treatment operations, such as dealkylization, etc. Each of these resins will require a selected regenerization fluid. The fluid must, therefore, be treated with the different resins in different columns or with a mixture of the two resins. If a mixture of the resins is utilized, then the resins must be separated prior to regeneration.
Additionally, activated carbon is often utilized in fluid treatment operation. The activated carbon may be used to remove gases and other organic impurities giving taste and odor to drinking water. Activated carbon may be used as a pretreatment for water supplied to water softening systems to prevent organic fouling of the resin beds, and may also be utilized in waste water treatment. Although activated carbon is not susceptible to being "regenerated" per se, the carbon periodically requires backwashing to remove suspended matter and to re-grade the bed. With conventionally proposed continuous water treatment operations, an activated carbon section must be contained within a separate vessel.
Accordingly, the present invention provides a new method and apparatus for the continuous treatment of fluids in a single column wherein the contact media need not be treated until it is completely exhausted. Additionally, multiple contacting media may be utilized for different types of ionic exchange, absorption or filtration in the column, and each may be regenerated without interrupting the continuous service flow. Also, this continuous fluid treatment can be performed with an optimal downward fluid flow. The invention, thus, significantly overcomes the deficiencies presented by the prior art.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Barathea joins generation game RACING: Mating season increases anxiety for studs hoping new stallions will not stall. Sue Montgomery reports
Friday 6 January 1995 00:02 BST
Click to followThe Independent Online
Racing may be shivering in winter's icy grip, but the pulse of the Thoroughbred continues to beat. This year's foals have already started to arrive and next month the creation of the 1996 crop, the Classic contenders of 1999, begins. And the star t of the mating season on 15 February also marks the start of a new job, that of a stallion, for many of the star performers of 1994.
Success on the track, however, is no guarantee of success in the breeding shed. It is not that good racehorses do not make good stallions, for most top sires were above-average runners. But fewer than 5 per cent of colts who retire to stud make the gradein their second careers, so obscurity is likely to beckon for all bar one of the 20-odd new recruits to the stallion ranks in Britain and Ireland.
And relative merit on the racecourse is no indication of future prowess as a stallion. The likes of Barathea, Bigstone, Grand Lodge, Turtle Island and Mister Baileys, rivals in the competitive mile division, start again with a clean slate.
For the horses, the delights of consorting with the choicest brides are probably a considerable improvement on the daily routine of the training yard. But for their connections, the worries are only beginning. The business of managing a stallion is desperately competitive; there are more than 900 horses touting for business at stud in these isles. And, as those in charge of poor Mister Baileys have discovered, things can go wrong before the season even starts.
One of the most exciting prospects for 1995 is undoubtedly the Breeders' Cup hero Barathea, who has retired to Liam Cashman's Rathbarry Stud in Co Cork. The horse is talented, handsome, sound of mind and body, is by Sadler's Wells and will be supported by his shareholders with the best of mares, but Cashman is counting no chickens. He says: "You'd have to say he has all the right credentials to make it, but I've been in this business long enough to know that success is impossible to predict. All you cando is give the horse every opportunity, but in the end it's up to nature."
Barathea will cover 80 mares this spring at a cost of Ir16,000 guineas each, the fee payable if the mare is safely in foal on 1 October. He is the dearest of the first-season horses (of those he scrapped with on the track, Bigstone, Grand Lodge and Turtle Island are all priced at Ir9,000 guineas, and Mister Baileys, should he recover from sickness, will be at £6,500) but there is a waiting list stretching to next season nonetheless.
Of the middle-distance horses, Carnegie, King's Theatre and Tikkanen remain in training and Balanchine (now cantering again in Dubai) is a filly. The Royal Studs captured Ezzoud and offer him at £6,000, but the likes of Bob's Return (£2,250) and Snurge (£3,000 in France) are down towards the bargain basement, having committed the unpardonable modern crime of showing staying ability.
The retirement of the Derby winner to stud used to be something of an event, but one that has not happened here since Generous hung up his racing plates. Erhaab followed Dr Devious and Commander In Chief to Japan; the breeders there used to get Europe's stud cast-offs, but the power of the yen is such that they now have first pick. In view of the success-rate statistics, perhaps European racegoers had best.
The enterprise of making a stallion has changed out of all recognition in recent decades. The idea of the true, time-honoured syndication of a horse into 40 equal shares, with a commensurate covering fee, has tended to go by the board, and hard-sell marketing measures dictate fashion in a volatile commercial business.
Thankfully, all the hype in the world cannot make a bad horse into a good one once his offspring arrive on the track, but there is one aspect of the modern breeding industry that can do real harm. There was a time when a book of 50 mares seemed over the top, and 100 outrageous, but last year the former Coronation Cup winner Be My Native covered 325. Even the very best sires get more duds than champs - 25 per cent of the peerless Northern Dancer's stock were stakes winners, which means 75 per cent were not.
Be My Native, a jump sire in Ireland, is an extreme example. But the more mares a stallion covers, the more poor specimens he will produce, and the more his reputation will suffer, and all for the sake of short-term gain.
n Nwaamis was yesterday again backed for the 2000 Guineas. John Dunlop's colt is 16-1 (from 20-1) with William Hill. Ladbrokes said Oliver Sherwood's novice hurdler Callisoe Bay had been backed for the 1995 Champion Hurdle and have cut his odds to 16-1 from 40-1.
|
{
"pile_set_name": "Pile-CC"
}
|
An attempt to characterize by immunocytochemical methods the enkephalin-like material in oxytocin endings of the rat neurohypophysis.
An antibody raised against dynorphin 1-8 was immunoreactive in the rat neurohypophysis in vasopressin but not in oxytocin endings. Oxytocin but not vasopressin terminals were immunostained when a Met5-enkephalin, a N-terminally directed monoclonal beta-endorphin antibody and an enkephalin-Met5-Arg6-Phe7 antibody were applied. The immunocytochemical reactions indicate that oxytocin terminals and their granules store pro-enkephalin-A derived opioid peptide fragments.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
The invention relates to a method for operating an internal combustion engine especially of a motor vehicle wherein the fuel, which is to be injected for a combustion, is directly injected into a combustion chamber during an intake phase and during a compression phase. Furthermore, the invention relates to an internal combustion engine especially for a motor vehicle having an injection valve with which the fuel, which is to be injected for a combustion, can be injected directly into a combustion chamber during an intake phase and during a compression phase. The engine also includes a control apparatus for the open-loop control and/or closed-loop control of the fuel mass injected into the combustion chamber.
Systems for the direct injection of fuel into the combustion chamber of an internal combustion engine are generally known. In these systems, one differentiates a so-called stratified operation and a so-called homogeneous operation. The stratified operation is especially used for lower loads; whereas, the homogeneous operation is used for larger loads applied to the internal combustion engine.
In the stratified operation, the fuel is injected into the combustion chamber during the compression phase of the engine so that a fuel cloud is located in the immediate vicinity of a spark plug at the time point of the ignition. This injection can take place in different ways. Thus, it is possible that the injected fuel cloud is located at the spark plug already during the injection or directly after the injection and is ignited thereby. Likewise, it is possible that the injected fuel cloud is guided to the spark plug by a charge movement and is only then ignited. In both combustion processes, no uniform fuel distribution is present. Instead, there is a stratified charge.
The advantage of the stratified operation is that the applied lower loads can be handled by the engine with only a very small quantity of fuel. Larger loads can, however, not be satisfied by the stratified operation.
The fuel is injected during the intake phase of the engine in homogeneous operation provided for such larger loads so that a swirling and therefore a distribution of the fuel can still easily take place in the combustion chamber. To this extent, the homogeneous operation approximately corresponds to the operation of engines wherein fuel is injected into the intake manifold in the conventional manner. The homogeneous operation can be utilized, as required, also for lesser loads.
In the stratified operation, the throttle flap is opened wide in the intake manifold leading to the combustion chamber and the combustion is open-loop controlled and/or closed-loop controlled essentially only by the fuel mass to be injected. In the homogeneous operation, the throttle flap is opened or closed in dependence upon the requested torque and the fuel mass, which is to be injected, is open-loop controlled and/or closed-loop controlled in dependence upon the inducted air mass.
In both modes of operation, that is, in the stratified operation and in the homogeneous operation, the fuel mass, which is to be injected, is open-loop controlled and/or closed-loop controlled additionally in dependence upon a plurality of additional input quantities to an optimal value with respect to fuel saving, exhaust-gas reduction and the like. The open-loop control and/or closed-loop control is then different in the two modes of operation.
It is possible to combine the two described modes of operation with each other. This is known as a so-called double injection. For this purpose, the fuel mass is determined which in total, is to be injected. Then, a first part of the fuel mass to be injected is injected during the intake phase and the remaining second part of the fuel mass to be injected is injected into the combustion chamber directly thereafter during the compression phase. The fuel mass, which is to be injected, for one and the same combustion is therefore injected into the combustion chamber of the engine with the aid of two injections.
The advantage of a double injection of this kind is that an abrupt switchover between the two modes of operation is avoided, that is, a switchover between the homogeneous operation and the stratified operation and back. In lieu thereof, the switchover is xe2x80x9cblurredxe2x80x9d over a wide range in that, for example, the fuel mass, which is to be injected during the intake phase, is slowly reduced and the fuel mass which is to be injected during the compression phase, is slowly increased.
Likewise, it is possible to provide a tank venting for the engine. Here, the so-called regeneration gas, which is vaporized in a fuel tank, is collected and supplied to the combustion. The advantage of a tank venting of this kind is that the fuel, which is contained in the regeneration gas, does not escape to the ambient but is used by the engine.
The object of the invention is to provide a method for operating an internal combustion engine as well as to provide an internal combustion engine wherein the advantages of the double injection and the tank venting are present.
This object is achieved in accordance with the invention in a method of the kind referred to above in that a regeneration gas is supplied to the combustion chamber during the intake phase. The object according to the invention is achieved in an internal combustion engine of the kind initially mentioned above in that a regeneration gas can be supplied to the combustion chamber during the intake phase by the control apparatus.
By supplying the regeneration gas during the intake phase, the breakdown of the entire quantity of fuel to be injected to the intake phase and the compression phase is not affected or even disturbed. The accuracy especially of the fuel mass, which is to be injected during the compression phase, is therefore maintained undiminished. The advantage is achieved notwithstanding that the regeneration gas is supplied to the combustion chamber and therefore to the combustion. The invention therefore combines the advantages of the direct injection (especially of the reduced fuel consumption and the lower discharge of toxic substances of the stratified operation) with the advantages of the tank venting, especially the complete utilization also of vaporizing fuel.
It is especially advantageous when fuel is injected and regeneration gas is supplied to the combustion chamber during the intake phase and when fuel is injected into the combustion chamber during the compression phase but no regeneration gas is supplied.
In an advantageous embodiment of the invention, the fuel mass, which is supplied in total into the combustion chamber during a single combustion, is composed of a first part and a second part. The first part is supplied during the intake phase and the second part is injected during the compression phase. The first part is put together from a third injected part and from a fourth part comprising the regeneration gas.
In an advantageous embodiment of the invention, for the first part of the total mass of supplied fuel, the third injected part is reduced and the fourth part made up of the regeneration gas is increased.
In this way, it is achieved that as much vaporized fuel as possible is supplied to the combustion chamber of the engine. The use of the vaporized fuel is thereby optimized.
It is especially advantageous when so much regeneration gas is supplied to the combustion chamber that the third injected part reaches a minimum value or zero.
The realization of the method of the invention in the form of a control element is especially significant with this control element being provided for a control apparatus of an internal combustion engine, especially of a motor vehicle. A program is stored on the control element which is capable of being run in a computer apparatus and especially in a microprocessor and is suitable for carrying out the method of the invention. In this case, the invention is realized by a program stored on the control element so that this control element, which is provided with the program, can define the invention in the same manner as the method for whose execution the program is suitable. As a control element, especially an electrical storage medium can be applied, for example, a read-only-memory.
Additional features, application possibilities and advantages of the invention become apparent from the following description of the embodiments of the invention which are shown in the figures of the drawing. Here, all described or illustrated features constitute the subject matter of the invention by themselves or in any desired combination independently of their combination in the patent claims or their dependency as well as independent of their formulations or illustration in the description or in the drawing.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Techtextil 2017
2016-09-15
Techtextil Symposium 2017: call for papers
Techtextil Symposium 2017 is an informative and visionary expert forum revolving around the subjects of technical textiles, functional garment fabrics and their multifarious applications. At the 19th edition of the symposium from 9 to 12 May 2017, which is held concurrently with the two leading international trade fairs, Techtextil and Texprocess, renowned experts will present the latest research results, as well as new products and applications.
New format variety: discussions and workshops to supplement lectures
Moreover, in addition to the proven lecture format, discussions and workshops will facilitate an active exchange of ideas for the first time. Experts interested in making a contribution are invited to subject proposals for the individual formats. The closing date for receipt of proposals is 7 November 2016.
“Each area of application has specific requirements with regard to the properties and production of technical textiles. At the same time, textiles are the key to new solutions in fields such as architecture, medicine and safety”, says Michael Jänecke, Director, Technical Textiles & Textile Processing Brand Management. “The symposium permits an interactive debate about current problems and innovative visions of the future, and opens up new perspectives for participants.”
Themes and formats: The focus of Techtextil Symposiums 2017 will be on new developments, trends and potential areas of application for technical textiles and nonwovens whereby emphasis will be given to both processing and new products. Special themes include apparel textiles, including smart textiles and wearables, printing technologies, such as 3D and digital printing, and the internet of things with regard to textile machines and sustainability.
The thematic blocks:
Apparel textile / wearables
3D printing / digital printing / printed textiles
Bio materials / bio-degradable materials / sustainability
Challenges and expectations of the sector from the user perspective:
New materials / textiles
New technologies
New applications
Internet of things with regard to textile machines
Modern marketing tools for launching products onto the market
Lectures, workshops or discussions will be held depending on the theme. Proposals must be submitted in English. The lectures will be selected by the experts of the international Programme Committee.
|
{
"pile_set_name": "Pile-CC"
}
|
“There’s a lack of clarity among advertisers but also with consumers and we are aware of concerns that ads for e-cigarettes might be seen as cross-promoting tobacco and cigarettes through the back door,” the spokesman said.
Health officials in Europe and elsewhere have yet to decide whether e-cigarettes are to be deemed harmful. They have not been linked to any serious health issues, but have been widely used for only a short time. Critics have said that by appearing similar to cigarettes, they could encourage children to take up smoking and that they should be banned from restaurants and other public spaces. Those in favor of e-cigarettes have campaigned to add them to the official list of ways to quit smoking tobacco cigarettes. In Britain, e-cigarettes are expected to be licensed as medicine beginning in 2016.
On television and radio, advertisers in Britain cannot depict products that resemble cigarettes, including any design, color, imagery or logo style that might be associated with a tobacco product, the advertising regulator said.
British American Tobacco said it developed an advertising campaign that it deems to “be appropriate and responsible in the absence of clear guidelines on e-cigarette advertising.” The ad states that its Vype e-cigarette product contains nicotine and is for consumers older than 18 years. The company also said it identified, when possible, its target consumers, who are smokers or people who use rival e-cigarette products.
Initially available only online, e-cigarettes are now sold in supermarkets, corner shops, gas stations and larger concert venues. The actors Leonardo DiCaprio and Catherine Deneuve, a longtime heavy smoker, have been spotted puffing e-cigarettes. The global e-cigarette market is now valued at an estimated $3 billion, with Britain accounting for about $350 million of that, according to Damian McNeela, an analyst at Panmure Gordon.
|
{
"pile_set_name": "OpenWebText2"
}
|
In the United States Court of Federal Claims
OFFICE OF SPECIAL MASTERS
No. 13-68V
Filed: February 12, 2015
* * * * * * * * * * * * * * * * UNPUBLISHED
LORI SIMPSON *
* Special Master Gowen
Petitioner, *
* Joint Stipulation;
v. * Attorneys’ Fees and Costs;
*
SECRETARY OF HEALTH *
AND HUMAN SERVICES, *
*
Respondent. *
*
* * * * * * * * * * * * * * * *
John C. Theisen, Theisen, Bowers & Associates, Fort Wayne, IN, for petitioner.
Lynn E. Ricciardella, United States Department of Justice, Washington, DC, for respondent.
DECISION ON ATTORNEYS’ FEES AND COSTS1
On January 28, 2013, Lori Simpson (“petitioner”) filed a petition pursuant to the National
Vaccine Injury Compensation Program.2 42 U.S.C. §§ 300aa-1 to -34 (2006). Petitioner alleged
that as a result of receiving an influenza (“flu”) vaccine on December 18, 2010, she suffered a
shoulder injury. Petition at ¶¶ 1, 14. On May 8, 2013, respondent filed a Rule 4(c) Report in which
she conceded that petitioner is entitled to compensation in this case. On October 10, 2014, the
undersigned issued a decision on damages, adopting—with no objection from petitioner—
1
Because this decision contains a reasoned explanation for the undersigned’s action in this case,
the undersigned intends to post this ruling on the website of the United States Court of Federal
Claims, in accordance with the E-Government Act of 2002, Pub. L. No. 107-347, § 205, 116 Stat.
2899, 2913 (codified as amended at 44 U.S.C. § 3501 note (2006)). As provided by Vaccine Rule
18(b), each party has 14 days within which to request redaction “of any information furnished by
that party: (1) that is a trade secret or commercial or financial in substance and is privileged or
confidential; or (2) that includes medical files or similar files, the disclosure of which would
constitute a clearly unwarranted invasion of privacy.” Vaccine Rule 18(b).
2
The National Vaccine Injury Compensation Program is set forth in Part 2 of the National
Childhood Vaccine Injury Act of 1986, Pub. L. No. 99-660, 100 Stat. 3755, codified as amended,
42 U.S.C. §§ 300aa-1 to -34 (2006) (Vaccine Act or the Act). All citations in this decision to
individual sections of the Vaccine Act are to 42 U.S.C.A. § 300aa.
1
respondent’s proffer on award of compensation. See Decision on Damages, filed Oct. 10, 2014.
On February 12, 2015, the parties filed a stipulation concerning attorneys’ fees and costs.
Petitioner requests a total award of attorneys’ fees and costs in the amount of $35,067.00.
Respondent does not object to this amount. Stipulation at ¶ 3. In accordance with General Order
#9, petitioner represents that she personally incurred costs related to this proceeding in the amount
of $213.99. Stipulation at ¶ 4.
The Vaccine Act permits an award of reasonable attorneys’ fees and costs. 42 U.S.C. § 300
aa-15(e). Based on the reasonableness of petitioner’s motion, the undersigned GRANTS the
request for approval and payment of attorneys’ fees and costs.
Accordingly, an award should be made as follows:
(1) in the form of a check jointly payable to petitioner and to petitioner’s attorney, John C.
Theisen, of Theisen, Bowers & Associates, in the amount of $34,853.01, and
(2) in the form of a check payable to petitioner only in the amount of $213.99
In the absence of a motion for review filed pursuant to RCFC Appendix B, the clerk of the
court SHALL ENTER JUDGMENT in accordance herewith.3
IT IS SO ORDERED.
s/ Thomas L. Gowen
Thomas L. Gowen
Special Master
3
Pursuant to Vaccine Rule 11(a), entry of judgment is expedited by the parties’ joint filing of
notice renouncing the right to seek review.
2
|
{
"pile_set_name": "FreeLaw"
}
|
Q:
Bootstrap checkbox and radio input with font-awesome
Can anyone give me a solution to this problem on IE8. I have this:
HTML:
<label>
<input type="checkbox" checked /><i class="icon-fixed-width icon-check"></i> Three
</label>
CSS:
[type=checkbox] { display: none; }
label { cursor: pointer; }
[class*=icon-].icon-fixed-width { text-align: left; }
jQuery:
$("[type=checkbox]").change(function () {
$checkbox = $(this)
$icon = $checkbox.siblings("[class*=icon-]")
checked = $checkbox.is(":checked")
$icon.toggleClass('icon-check', checked)
.toggleClass('icon-check-empty', !checked)
});
All work fine on modern browsers but on IE8 wont work.
What is wrong here?
Fiddle:
ty.
A:
Just add a semicolon after each Javascript line. I think the IE8 Javascript engine "crashes" when you do not end your Javascript statement with ;
$("[type=checkbox]").change(function () {
$checkbox = $(this);
$icon = $checkbox.siblings("[class*=icon-]");
checked = $checkbox.is(":checked");
$icon.toggleClass('icon-check', checked).toggleClass('icon-check-empty', !checked);
});
Fiddle
|
{
"pile_set_name": "StackExchange"
}
|
Economic development leaders outline their concerns and plans for a strong 2014
What is your outlook on the economy in Greater Des Moines in 2014?
Our pipeline right now is looking really strong, at least for the first half of the year. I have every reason to believe we are going to see another banner year with economic development in the state.
Jay Byers
I think it’s going to be a strong year nationally, and I think it’s going to be an exceptionally strong year in Central Iowa. I see 2013 as a very strong year, and I see that momentum continuing full steam ahead into 2014.
Teresa Wahlert
I think our economy is diversified in Central Iowa. With the addition of the Facebook investment and of course the financial industry and insurance industry, as well as advanced manufacturing and agriculture that we have here in Central Iowa, we have a great diversification of opportunity for people. So I’m very optimistic for the Central Iowa region of our state.
Elliott Smith
On the whole, I think the state is very well-positioned among almost all of its business segments. I think in general we’re looking for an excellent 2014. ... You can only do so much in Des Moines when Washington can bring the hammer down on you and you don’t have a choice in doing some things.
If the leaders of some of the most important economic development groups in the state are correct, look for a strong year in the Greater Des Moines and Iowa economies.
The leaders of the Iowa Economic Development Authority, Greater Des Moines Partnership, Iowa Workforce Development and Iowa Business Council all feel optimistic about 2014.
That doesn’t mean the state is without issues. Leaders routinely point out the state’s challenges in supplying and developing the workforce. Many of the initiatives these organizations are involved in are designed to help alleviate that problem.
Overall, they say, there are reasons to believe 2014 will be a year of growth in Des Moines and Iowa.
Debi Durham, director
Iowa Economic Development Authority
Top goals and initiatives
Durham highlighted a couple of state initiatives that could help build the state’s workforce. One is the Home State Iowa initiative, which is meant to connect military veterans with jobs in the state. The initiative will target veterans nationwide.
The other is a push for more apprenticeship programs in the state. Gov. Terry Branstad called for an Iowa Apprenticeship and Job Training Act in his Condition of the State address.
Durham pointed out that apprenticeships could be set up in sectors that people wouldn’t traditionally think of, such as manufacturing and information technology.
IEDA will administer that program, provided it is enacted by the Iowa Legislature.
Biggest challenges facing the state
The biggest challenge, Durham said, is the a shortage in specific fields of the state’s workforce. Many places around Iowa are nearing full employment. Part of the solution is bringing in workers to increase the talent pool in the state. Part of it is training people in new skills to fill the middle-skills gap that has been identified as a problem in Iowa.
Potential opportunities
Durham sees renewed opportunities in manufacturing, as a lot of companies are now “reshoring,” she said. The bright spots in the state continue to be in the finance and insurance sector and in the information technology sector.
One thing businesses should know about the Iowa economy
Playing off Branstad’s Condition of the State theme, Durham said, “Iowa is working.” The economic development plan that Branstad brought in when he took over office is working, she said. “You can count on us to have a pro-business approach to how we do things,” Durham said.”
Jay Byers, CEO
Greater Des Moines Partnership
Top goals and initiatives ahead
The Capital Crossroads planning initiative is set to play a key role in the Partnership’s plans this year, Byers said. Part of those plans:• The Partnership plans to roll out a branding strategy for the Capital Corridor between Des Moines and Ames, intended to strengthen the biosciences industry cluster identified in Capital Crossroads.• To help strengthen the finance and insurance industry cluster, the Partnership will help host a global insurance symposium in May. The symposium is designed to bring in renowned industry keynote and panel speakers to talk about the challenges facing the global insurance industry.•Market Street Services, the firm that helped in the early stages of Capital Crossroads planning, will do a mid-plan evaluation. •The Partnership will put together and roll out a regional workforce and education initiative.
Biggest challenges facing the organization
2013 was such a good year, Byers said, that one of the biggest challenges facing the Partnership is to not get complacent. Paul Schickler, the 2014 Partnership chair, also identified that as a challenge at the group’s annual dinner.
Biggest challenges facing the state
The biggest challenges, Byers said, mostly have to do with outside forces. Those include federal government policies and the world economy.
Potential opportunities
Beyond executing the Partnership’s goals, Byers sees all the projects going on in the area as opportunities for the region – projects such as renovating Walnut Street downtown and the convention hotel. Those are coupled with “quality of life” investments that are continuing to come to fruition, such as the Greater Des Moines Botanical Garden renovation and NASCAR’s purchase of Iowa Speedway in Newton.Byers also sees an opportunity to further market the region to businesses that might potentially move or expand to the area.
One thing businesses should know about the Iowa economy
“The Greater Des Moines economy is more globally connected than most people realize, and getting more so every day,” Byers said.Iowa
Teresa Wahlert, director
Workforce Development
Top goals and initiatives
Home Base Iowa is also one of the key initiatives of Iowa Workforce Development (IWD), Wahlert said, as is the Skilled Iowa Initiative, which aims to teach potential employees skills that employers need. One push for Skilled Iowa this year will be assisting schools in finding opportunities to train students.
Wahlert said that IWD will continue its focus on STEM (science, technology, engineering and mathematics) strategies.
Biggest challenges facing IWD
About 80 percent of IWD’s budget comes from the federal government, meaning that the agency is often at the mercy of money decisions it can’t control. Last year, the federal sequestration forced IWD to quickly adjust how it was spending money.
Biggest challenge facing the state
The population is not growing fast enough, Wahlert said.
“I think we are losing economic opportunities because of our labor force,” she said.
Unemployment is low, which is good, but that can limit expansion because there often aren’t enough workers. That has been a problem particularly in the technology field, as many leaders have identified a tech worker shortage.
“It’s important that we continue to supply the labor force with the correct foundational skills,” Wahlert said.
Potential opportunities
A big opportunity for IWD, Wahlert said, is assisting the underemployed – people who lost their jobs during the recession and are now working in jobs that pay less. Helping people learn the skills that can get them higher-paying jobs is a goal of her agency, she said.
A big opportunity for the state, she said, will be the recently announced Advance Southwest Iowa Corp., which is a partnership between Iowa and Nebraska to develop the Omaha-Council Bluffs region and bring companies to the area.
One thing businesses should know about the Iowa economy
Businesses that are looking to locate to Iowa should know that the state has a fiscally sound government that listens to businesses, Wahlert said. There is a lot of stability in the state, and as the economy continues to rebound, businesses should feel confident in investing in Iowa.
Elliott Smith, executive director
Iowa Business Council
Top goals and initiatives
Smith also listed workforce development as a top goal for the Iowa Business Council, which is made up of top executives in the state. That includes the Home Base Iowa initiative, and continued investment in the STEM programs that are currently going on.
Wellness is also a priority for the executives who make up the council, Smith said, and many of the companies are actively involved in the Healthiest State Initiative.
Biggest challenges facing IBC
Smith listed three challenges that directly affect the organization:
•Making sure that the education reform passed last year gets carried through. “You hear rumblings of small pockets of policy-makers who would like to see the Iowa core go away. That’s essentially the foundation of this whole reform effort,” Smith said. “We’re keeping an eye on those activities.”•The workforce. CEOs have serious needs for highly educated people as well as middle-skill-level workers.•Continuing to move forward in the Gallup Healthways Well-Being Index. Iowa was No. 9 in the index as of 2012.
Biggest challenges facing the state
Smith also listed three challenges facing the state:
•The state is behind in the number of “knowledge jobs,” or high-skill jobs.•Iowa is trailing most states in population growth and net overall migration.•Going back to the health component, the obesity rate in the state is too high. In addition to concerns about overall health of students and workers, that raises insurance rates.
Potential opportunities
The state has a real opportunity to market itself not only to people living here, but also to people and businesses that might look to move here. Smith points to all the best-of lists that routinely spotlight Des Moines and other Iowa cities.
One thing businesses should know about the Iowa economy
The Iowa economy has been very resilient, he said, largely because of the diversity of its industries. The state entered the recession in a better position relative to others and has come out of it relatively better as well.
|
{
"pile_set_name": "Pile-CC"
}
|
San Francisco appeals panel reinstates 2016 judgment that found no proof 1971 song breached copyright of Taurus by Randy Wolfe
This article is more than 6 months old
This article is more than 6 months old
A US appeals court has reinstated a ruling that British rockers Led Zeppelin did not steal part of their song Stairway to Heaven from another band.
The San Francisco 11-judge panel affirmed a 2016 judgment that found no proof the classic 1971 Zeppelin song breached the copyright of Taurus, written by Randy Wolfe from a Los Angeles band called Spirit.
In 2018 that ruling was overturned by a three-judge panel in San Francisco, which said certain instructions to the district court jury had been “erroneous and prejudicial”, and failed to clarify that the arrangement of elements in the public domain could be considered original.
Stairway to court: US judges order new Led Zeppelin plagiarism trial Read more
Led Zeppelin took the case to a larger panel whose decision on Monday, based on the 1909 Copyright Act, put the original ruling back in place.
Stairway to Heaven is estimated to have grossed $3.4m during the five-year period that was at issue in the earlier civil trial.
The Led Zeppelin guitarist Jimmy Page – who was sued along with the group’s singer Robert Plant and another surviving bandmate, John Paul Jones – testified in 2016 that the chord sequence in question had “been around forever”.
But Wolfe’s trustee, Michael Skidmore, said the songs had similar chord progressions and Page may have written Stairway to Heaven after hearing Taurus while Led Zeppelin and Spirit toured together.
“Obviously the court got it wrong,” said the trustee’s lawyer, Francis Malofiy. “This is a big loss for creators, those who copyright laws are meant to protect.” Malofiy said he may appeal to the US supreme court.
Expert testifies Stairway to Heaven chord progression used 300 years ago Read more
Lawyers for Led Zeppelin did not immediately respond to requests for comment.
The decision in the five-year-old case was a victory for a music industry still combating fallout from a 2015 verdict that Robin Thicke and Pharrell Williams’ 2013 hit Blurred Lines copied Marvin Gaye’s 1977 hit Got To Give It Up.
Jurors awarded Gaye’s children $7.4m, which was later reduced to $5.3m. The singer Katy Perry is appealing against a $2.8m verdict reached last August in a copyright case over her song Dark Horse.
|
{
"pile_set_name": "OpenWebText2"
}
|
Mutant epidermal stem cells lose the connections to their neighbours (red, right) compared to normal stem cells (red, left). Credit: CNIO
The human body is daily exposed to external assaults such as bacteria, ultraviolet light or chemical agents. Skin, the largest organ of the body, is the first line of defense against these agents. Skin performs this function thanks to the close connections established between its cells (e.g. adherens junctions). The loss of cell adhesion between these cells is related to inflammatory diseases and cancer, hence the special interest in this area of research over the past years.
A study by the Spanish National Cancer Research Centre (CNIO), featured on the cover of the Journal of Cell Biology, shows how interactions between skin stem cells—the cells responsible for the constant renewal of skin—maintain the architecture of this organ. "We knew that these junctions were important in skin stem cells but the cellular components involved in their structure and function were not yet understood", says Mirna Pérez-Moreno, head of the Epithelial Cellular Biology Group that led the study.
Using skin cells derived from mice, researchers have discovered that one of the key elements in the formation and stabilisation of these junctions are microtubules, tubular structures that are part of all cells and that serve as pillars to maintain their form and function.
"We have seen for the first time that skin stem-cell microtubules connect with cell-cell junctions to form velcro-like structures that hold the cells together", says Marta Shahbazi, a researcher on Pérez-Moreno's team and the first author of the study.
The connection between these two cellular components—microtubules and cell-cell junctions—occurs via the interaction between the CLASP2 and p120 catenin proteins, linked to microtubules and cell junctions respectively.
"We found that the abscence of CLASP2 or p120 catenin in epidermal stem cells caused a loss of their adhesion, and therefore the structure of these cells", says Shahbazi.
"Our results will open up new paths for exploring how these proteins regulate skin physiology", says Pérez-Moreno, adding that this knowledge will be "important for the possible development of future regenerative or anti cancer therapies".
Explore further Adult stem cells found to suppress cancer while dormant
Provided by Centro Nacional de Investigaciones Oncologicas (CNIO)
|
{
"pile_set_name": "OpenWebText2"
}
|
"At the beginning of the 21st century the Umbrella Corporation had become the largest commercial entity in the U.S." "Nine out of every ten homes contain its products." "lts political and financial influence is felt everywhere." "In public, it is the world's leading supplier of... computer technology, medical products and healthcare." "Unknown even to its own employees, its massive profits are generated by... military technology, genetic experimentation and viral weaponry." "All Umbrella staff must wear their identity tags... at all times." "All radiation badges... will be collected at 5 this afternoon." "Thank you!" "God!" "Some people." " Don't show me." " Why not?" "Because I'm busy." "It's nothing." "Fire drill." " What is that?" " Fire drill." " Shit!" " What's going on?" " Get the computers covered!" "Move it!" " I'm trying!" "Move the experiments!" "Shouldn't the doors open or something?" "It's supposed to take us to the nearest floor." "Hello?" "Hello?" "What's happening?" "Line's dead." "Is that a dill?" "Come on!" " What's the problem?" " The doors won't open." " The ones at the back?" " Locked as well." "There's no fire here!" "No fire!" " there's no fire here!" "No fire!" " The code doesn't work!" " What's wrong with you?" " The door won't open!" " And this water isn't going anywhere." " What?" "It's a sealed room." " Help me with the door!" " Fuck the doors!" "We have to get out of here." "What's going on?" "Has this happened before?" "We have to get out of here." " Take it easy." " You take it easy!" "Quiet!" "Quiet." "What is that?" "Oh, my God!" "Halon!" "Stop it!" "Stop it!" "Stop!" "Let me see." "We have to get out of here." "We have to get out of this building." "Here, give me a hand." "That's as far as they'll go." "They're caught on something." "That's wide enough." "I can squeeze through." "I'll get help." "I'm stuck." "You'll have to push." "That's it." "A bit more." "What was that?" "Oh, Christ!" "It's the brakes!" " Get out!" "We have to get out!" " I can't move!" "I can't move!" "Oh, my God!" " Push her out of the way!" " Pull me back inside!" "Pull me back inside!" "Pull me back inside!" "Today all your dreams come true." "Today all your..." "Hello?" "Hello?" "Who are you?" "Don't touch me." "Get away from me!" "Down!" "What are you doing?" "I'm a cop!" "I told you." "I'm a cop." "You're beaking my arm." "Report." "Report now." "What?" "I want you report, soldier." "I don't know what you're talking about." "Sir, the house's primary defenses were activated." "She's pobably suffering side effects." " What are you doing with us?" " What about the cop?" "Matthew Addison." "I'm not getting a match." "Who are you?" "I just transferred." "They probably don't have me on file yet." "The locals are inefficient." "It's possible." "Should I secure him here?" "No." "We take him with us." "You can't do this." "Blow me." "Prep for entry to the Hive." " Power's down." " So fix it." "I'm on it." "Are you done yet?" "Jumpy!" "Stand clear!" " You got a problem?" " How's that door?" " Sealed shut." " Let me." "Jumpy?" "Lie still." "Lie still!" "Watch this light." "Follow it." " How many fingers?" " Three." "Good." "Tell me your name." "I don't know." "He's fine." "Memory loss, like the other one." "Let's open that door." "I want to know who you people are and what's going on here." "Now!" "You and I have the same employer." "We work for the Umbrella Corporation." "The mansion above is an emergency entance to the Hive." "You were security operatives placed three to protect that entrance." "What about this?" "Your marriage is a fake." "Just your cover to protect the secrecy of the Hive." "And what is the Hive?" "Show them." "Accessing schematic of the Hive." "Raccoon City, nearest urban center." "The mansion, where we found you and gained access to the train... which, in turn, brought us to the Hive." "The Hive is located underground... deep beneath the streets of Raccoon City." "A secret research facility owned and operated by the Umbrella Corporation..." "The Hive houses over 500 technicians, scientists and support staff." "They live and work underground." "Their research is of the highest importance." "Its nature is classified." "Our position on the map is indicated by heat signature." "Why can't I remembe anything?" "The Hive has its own defense mechanisms, all computer-controlled." "A nerve gas was released into the house." "Primary effect of the gas:" "Complete unconsciousness lasting up to four hours." "Secondary effects can include acute memory loss." " For how long?" " Subjective." "An hour, day, week." "So, this place was attacked?" "I'm afraid things are a little more complicated than that." "Sir, we've breached the Hive." "J.D." "Got it." "Halon has dissipated." "Easier to work undeground, thinking there's a view." "Looks like we're taking the stairs." "Status." "Red Queen's locked on to us." "She knows we're here." "Who's the Red Queen?" "State-of-the-art artificial intelligence." "The computer that controls the Hive." "This will slow us down." "Our route to the Queen takes us straight through these labs." "Rain, J.D., see how bad the flooding is." "Kaplan, find an alternate route." "What happened here?" "Five hours ago, Red Queen went homicidal." "Sealed the Hive and killed everyone here." "Jesus." "When we realized what happened, we were dispatched to shut her down." " Why did she do it?" " We don't know." "But outside interference is a possibility." "Jesus!" "You okay?" "Here." " No, I'm fine." " It's cold in here." "Are you...?" "Do you remember anything from... before this?" "No, nothing before the train." "And you?" "Nothing." "I found an alternate route but it will cost us time." "If we double back, cut through Dining Hall B, we're right on track." "Sir, no go." "The whole level's flooded." "All ight, we're behind schedule." "So let's move it." "Come on." "Poor bastards." "Kaplan?" "Dining Hall B. That's what's on the map." "Maybe you're reading it wrong." "Maybe the Corporation keeps secrets here, something you're not supposed to see." "J.D., you and Rain keep the prisoner here and secure the exit." "Halon levels are nonexistent." "I think the system malfunctioned." "There may be survivos." "Give me a search line but keep it tight." "Move it." " I said keep it tight." " Sorry." "I'm not sure I want to remember what went on down here." "I don't blame you." " What the hell do they keep in these?" " How do I know?" "What's taking so long?" "Red Queen's defenses are in place." "She's making it difficult." "Let's pack it up." "You." "Stay here." "The lights are automated." "Nothing to worry about." " Transmitter in position." " Roger." "Running a bypass." "Checkmate." "Move up." "What is that?" "That will shut the Queen down." "Delivers a massive electrical charge." "Forces the mainframe to reboot." "Kaplan!" "A dormant defense mechanism." "We must've tripped it." " Put it back to sleep." " Working on it." " Open that door." " I'm trying." "Hold your positions." "Stay calm." "What's that?" " Get them out!" " Something's happening in there." " Come on." " Help them!" "Down!" "Get down!" " Something's killing them!" " Don't do this!" "Medic!" "Medic!" " Open the door!" " I'm trying!" "You're going into shock." "Stay awake!" "Almost there." "It's coming back!" " Open it!" " I'm trying!" "Try harder!" "It's coming back!" "Oh, God!" " Do it!" " Almost there." "Come on!" " Shit." " Got it." "All right." "Let's do it." " Do what?" " We have to complete the mission." "No way I'll go down there." "Her defenses are down." "Déja vu, anyone?" "Keep going." "Give me a hand." "Get out!" "You can't be in here." "Don't listen." "She's a holographic representation of the Red Queen." "Get out!" "Modeled after the programmer's daughter." "She'll deceive us, confuse us." "I wouldn't advise this." "Disabling me will result in loss of primary power." "She'll say anything to stop us from shutting her down." "I implore you." " Implore away." " Please?" "Please?" "You're all going to die down here." "That pulse forces the circuit breaker to shut down her mainframe for 30 seconds." "After that, if I don't have her boards, he can reboot." "They're late." "I'm on it." "J.D., we got a survivor!" "We're here to help." "You seem to be in some sort of..." "Get off!" "Get off of me!" "Get her off me before I stab her ass." "You okay?" "She bit me, man." "She took a chunk right out of me." "Stay back." "I'm warning you, stay down!" "She's crazy." "Come any closer and I'll fire." "I mean it!" "Damn you!" "I shot her five times." "How was she still standing?" "Bitch isn't standing now." " What was all the shooting?" " We found a survivor." " And you shot him?" " She was crazed." "She bit me." "She's gone." "She's gone!" "Bullshit!" "She fell right here but she's gone!" "Look at this." "There's blood, but it's not much." "Looks coagulated." "Yeah." "It's not possible." "Why not?" "Blood doesn't do that till after you're dead." "Can we go now?" "Not till the rest of the team get here." "There's no one else coming." " What the fuck you talking about?" " Wait." "Quiet." " Fuck!" " Don't come any closer!" "They're behind us!" "Jesus!" "They're everywhere." "They're everywhere." "They're all around us." "I said stay back!" "Why aren't they dying?" "Watch the tank!" "The tank!" " Let's go!" " Hurry up!" " Wait!" " Come on!" "Move!" "Come on!" "Move." "I can help you get the virus." "I have security codes... surveillance plans, the works." "Shit." " We lost the others." " Keep moving." " You waited?" " Didn't know the code." "Come on." " Shit!" " Come on!" " Hurry up." " Shit!" " Come on." " Shit!" " What's taking so long?" " I'm trying!" "Come on." " Move!" "What's the code?" " Hurry, I'm running out of ammo!" "0-4-3-2..." "No, fuck!" " What?" "!" " 0-4-3..." " What is the code?" " 0-4... 0-3-1... 9-6-5." " Got it?" " See how easy that was?" "Shit!" "Grab my hand, man!" "Don't let go!" "Where are the bodies?" "Where did they go?" "Fuck!" "Whatever they are, there's too many." "Whatever they are?" "It's pretty obvious what they are." "Lab coats, badges..." "Those people used to work here." "All the people working here are dead." "That isn't stopping them from walking around." "Where did they come from?" "Why didn't we see them on the way in?" "When you cut the power, you unlocked the doors." "You let them out." "We're never gonna make it to the surface." "You are security operatives... placed there to protect that entrance." "Lisa." "I've got one in the breech." "And an extra mag." "I can help you get the virus." "I have access to security codes... surveillance plans, the works." "But?" " But there will be a price." " Name it." " Who was she?" " My sister." "Corporations like Umbrella... think they're above the law." "But they're not." "There are hundreds of thousands of us who think the same all over the world." "Some of us provide information." "Others give their support." "Some take more direct action." "Like you." "If your friends had been more thorough, they would've seen through my false I.D." "Then all the red flags would've gone off." "Quantico, NSA, ViCAP, all the rest." "There's no way I could've infiltrated the Hive." "So you sent your sister." "We needed something concrete, anything to expose Umbrella to the press." "Proof of the research going on down here." "What kind of research?" "The illegal kind." "Genetic." "Viral." "My sister was going to smuggle out a sample of the virus they were developing." "How was she going to make it out?" "She had a contact within the Hive, someone I never met." "They had access to security codes, surveillance, every thing she needed." "So why didn't she make it?" "Maybe she trusted the wrong person." "Maybe they set her up." "Kept the virus fo themselves." "Do you have any idea what the T-virus would be worth on the open market?" "Worth all this?" "Yeah." "To someone." " Don't shoot!" " Close that door!" " They're right behind us!" " Close that door!" "Get off!" "Son of a bitch!" "You okay?" "Yeah." "Right behind us." "What about this door?" "They'e waiting there too." "And that way?" "Dead end." "There's no way out of the Queen's chamber." "So we wait." "Someone doesn't hear fom you... they'll send backup or something." "Right?" "What?" "What's wrong?" " We don't have much time." " Those blast doors we passed... on the way in from the mansion, they seal shut in under an hour." "If we're not out by then, we're not getting out." "What are you talking about?" "They can't just bury us alive down here." "Containing the incident is the only fail-safe plan they had... against possible contamination." "And you're telling us this now, when we're trapped... half a mile underground?" "We have to find a way out of this room." "What are you doing?" " Where are you taking those?" " I'm turning her back on." " That's not a good idea." " She'll know a way out of here." "That homicidal bitch killed my team." "That homicidal bitch may be our only way out of here." "Considering the way she's been treated," "I'm sure she's real happy to help us out." "That circuit breaker you were talking about." "Can you bypass it?" " Yeah?" " So do it." "Cicuit breaker's disabled." "This time, if I hit the switch, she won't shut down." "She'll fry." "The charge must've damaged her boards." "There you are." "Things, I gather, have gone out of control." "Give me that switch right now." "I'll fry your ass!" "I did warn you, didn't I?" " Tell us what's going on down here." " Research and development." "What about the T-vius?" "The T-virus was a major medical breakthrough." "Although it clearly also possessed... highly profitable military applications." "How does it explain those things out there?" "Even in death, the human body remains active." "Hair and fingernails continue to grow." "New cells are produced." "And the brain holds a small electrical charge that takes months to dissipate." "The T-virus provides a massive jolt, both to cellular growth... and to those trace electrical impulses." "Put quite simply, it reanimates the body." "It brings the dead back to life?" "Not fully." "The subjects have the simplest of motor functions." "Perhaps a little memory." "Virtually no intelligence." "They are driven by the basest of impulses, the most basic of needs." " Which is?" " The need to feed." "How do you kill them?" "Severing the top of the spinal column... or massive trauma to the brain are the most effective methods." "You mean shoot them in the head." "Why did you kill every body down here?" "The T-virus escaped into the air conditioning system." "And an uncontrolled pattern of infection began." "The virus is protean, changing from liquid to airborne to blood transmission... depending on its environment." "It's almost impossible to kill." "I couldn't allow it to escape from the Hive." "So, I took steps." " Steps?" " You must understand... those who become infected, I can't allow you to leave." " We're not infected." " Just one bite... one scratch from these creatures is sufficient... and then you become one of them." "A check of my systems indicates my main drive circuit breaker... has been disabled." "May I ask why?" "Insurance." "We need a way out of here." "If you refuse to help, we flip the switch." "Understand?" "After you." "What the hell is this place?" "The utility tunnels." "They run underneath the Hive fo wate, gas and power lines." " Been in here before." " Keep moving!" " Going ound in circles." " This is the route the computer gave." " I don't know why you listen to her." " Enough!" "We have no choice but to keep moving because those things are behind us, got it?" "That mesh won't hold." "Keep moving." "Jesus Christ!" " Hold it!" " There's too many of them!" "Fuck!" "Up on the pipes." "Up on the pipes!" "Quickly, everyone, up on the pipes!" " Let's go!" " Come on, there's a way up!" "Keep them back!" "Go on up, move it!" "Look out!" "Get over here." "There's too many of them!" "Go, go, go!" "Go on!" "I can manage!" "Go!" "JD?" "What?" "We have to do something about your wounds." "I'm fine." "I said I'm fine." "You like that, don't you?" "You like the way it tastes, don't you?" "Like the taste of that?" "She was right." " We're all going to die down here." " No." "We're getting out." "All of us." "You okay?" "God!" "Get away!" " Hold on!" " Come on!" "Help him." " I can't." " What are you waiting for?" "I can't focus." "I can't see!" " Go up!" " Climb up there!" "You gotta keep going!" " Come on!" " Go!" " You can do it!" "Move!" " You got it!" " Stay there." " We'll get you." "We need to cut this wire and throw it to him." "Then we'll get him." "Hold on." "That's lucky." "I want you to go." " I'm not leaving you." " Yes, you are." "You can't kill all of them." "I'm not going anywhere." "I want you to go, now!" "Please, just do it." "Just do it now!" "Please!" "Go!" "You'll have to work for your meal!" "Come on." "Give me your arm, okay?" "Over my shoulder." "Ready?" "Here we go." "When I get out of here..." "I think I'll get laid." "You might want to clean up first." "Wait." "Are you okay?" "Blue for the virus, green for the antivirus." "Blue for the virus, green for the antivirus." " There's a cure." " What are you talking about?" "There's a cure." "The process can be reversed." "There's a cure!" "You'll be okay." "I was beginning to worry." "This is where they kept the T-virus." "How do you know all this?" "Because I was going to steal it." "I was your sister's contact." " You betrayed her." " I don't know." " You caused all this." " I can't remember." " The truth." " I don't remember the truth." "I don't understand." "It's gone." "It's gone." "It's not there." "I can't." "I just can't." "It's over." "I can help you get the virus." "I have access to security codes... surveillance plans, the works." "But there's a price." "Name it." "You have to guarantee me that you'll bring this corporation down." "Today all your dreams come true..." "Spence?" "Spence?" "Thank you!" "Spence?" "We can still make it out of here." "Come with me." "We can have everything we've ever wanted." "Money's out there waiting." "You wouldn't believe how much." "Is that how you thought all my dreams would come true?" "Please." "I wouldn't want to shoot you." "Might need the bullets." "Back off!" "I won't take any part in this." "Okay, but you can't just wash your hands of this." "We work for the same company." "You knew what they did." "I was trying to stop them." "You really believe that... people like him will ever change anything?" "Nothing ever... changes." "Where..." "Where is... the antivirus?" "It's on the train... where you found me." "Couldn't have been standing more than there feet from it." "I so nearly made it out." "I didn't realize that bitch of a computer... had defense systems outside the Hive." "In or out?" "In?" "Or out?" "I don't know what we had." "But it's over." "Back... the fuck off!" "I'm missing you already." "Your boyfriend's a real asshole." "He shot the locking mechanism out." "I can't believe that son of a bitch is going to get away with this." "I don't think so." "I've been a bad, bad girl." "Oh, my God." "What the fuck is that?" "One of the Hive's early experiments." "Produced by injecting the virus directly into living tissue." "The results were unstable." "Now that it has fed on fresh DNA... it will mutate... becoming a stronger, faster hunter." "Great." "If you knew it was loose, why didn't you warn us?" "Because she was saving it." "For us." "Isn't that right?" "I didn't think any of you would make it this far." "Not without infection." "Why didn't you tell us about the antivirus?" "This long after infection, there's no guarantee it would work." "But there's a chance." "Right?" "I don't deal in chance." "Fuck it." "No pressure, guys." "You require the four-digit access code." "I can give you the code." "But first, you must do something for me." "What do you want?" "One of your group is infected." "I require her life for the code." "The antivius is right there on the platfom!" "I'm sorry, but it's a risk I cannot take." "She's right." "It's the only way." "You'll have to kill me." "Otherwise, we all die down here." "The glass is reinforced, but it won't hold forever." "Do it." " Get up." " Just do it." " Please." " Do it!" "You don't have long to decide." " You have no choice." " Kill her now!" " Get off!" " You don't have any choice." " Just do it now!" " I can't!" " Kill her now." "Do it." " Please." " Kill her." "Kill her now!" " Just do it." "Kill her!" "Kap?" "The bitch wouldn't open the door, so I had to fry her." "Move!" "What the fuck was that?" "It's a long story." "Start it up." "I'll get the virus." "I'm missing you already." "we're in business." "Full power!" "We're leaving!" "I don't want to be one of those things... walking aound without a soul." "You won't." "When the time comes... you'll take care of it." "No one else is going to die." "Here." "Rain." "Rain." "Rain." "I'm not dead yet." "I think I'll have that back." "I could kiss you, you bitch." "What the hell's going on back there?" " Get us the fuck out of here." " Any faster, we'll come off the rails." "Open the doors!" "Open the doors!" "Now!" "I failed all of them." "I failed." "Listen to me." "There is nothing else you could've done." "The Corporation's guilty here, not you." "And we finally have the proof." "And that way, Umbrella can't get... away with this." "I mean, we can..." "What is it?" "You're infected, but you'll be okay." "I'm not losing you." " Help!" " Help him!" "What are you doing?" "He's mutating." "I want him in the Nemesis Pogram." "Get off!" "What's happening?" "I want her quarantined." "Close observation... and a full series of blood tests." "Let's see if she's infected." "Take her to the Raccoon City facility." "Then assemble the team." "We're reopening the Hive." "I want to know what went on down there." "Just do it." "Who's in there?" "Let me out!" "Let me out!" "Subtitles By Rajanee"
|
{
"pile_set_name": "OpenSubtitles"
}
|
Hollywood Deadline have just announced that Damon Lindelof, one of the Lost writers, has been brought onto do some work on Spaiht’s prequel script:
“In a development as vexing as a Lost plotline, studio insiders said that while Lindelof indeed met with Scott and the studio for that rewrite job, the exchange of ideas between them sparked a take that could well turn out to be a free-standing science fiction film. The studio will decide when Lindelof turns it in. Scott Free is producing and Lindelof’s CAA reps closed his deal last night.
I give up. Seriously that's it. Just call Joss Whedon and Jean Pierre whatever and make another one of the worst movies ever made. Seriously I'm done....... I loved Alien and Aliens but I have come to the conclusion that movies like that will only come out perhaps every 100 years or so. We've been waiting since 1986! It really is a shame...
LakerFan
I don't actually know if I should believe this or not because the last I heard was that right now Damon Lindelof was working with both Roberto Orci & Alex Kurtzman on the script for the next "Star Trek" movie which I don't think they have even finished yet.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
How do I remove a member from a Trello board?
I'm not finding how to remove team members from my Trello board?
A:
Suppose you want to remove Rich from the "Development Board"
Open the Development Board
Click on Rich's avatar in the Members section
Click "Remove from Board"
|
{
"pile_set_name": "StackExchange"
}
|
---
author:
- Joris Raeymaekers
title: On matter coupled to the higher spin square
---
Introduction
============
The idea that string theory may possess a phase of enhanced higher spin gauge symmetry is a longstanding one [@Vasiliev:1995dn]. String field theory would most likely take its simplest form when formulated around the vacuum of maximal unbroken symmetry, where it would be maximally constrained by an underlying gauge principle. Phases with massive higher spin fields, such as the standard formulation around the Minkowski background, would then arise as Higgsed phases upon expanding around a vacuum which breaks the higher spin symmetry. The work of Vasiliev (see e.g. [@Vasiliev:1999ba], [@Didenko:2014dwa] for reviews) has shown that interacting higher spin gauge theories allow for an anti-de Sitter vacuum, and it is therefore natural to look for the most symmetric phase of string theory in an AdS compactification.
Though conceptually appealing, these ideas didn’t receive a concrete realization until the recent work of Gaberdiel and Gopakumar [@Gaberdiel:2014cha],[@Gaberdiel:2015mra],[@Gaberdiel:2015wpo] (see also the related works [@Gaberdiel:2013vva],[@Gaberdiel:2014yla],[@Gaberdiel:2015uca]). They proposed the tensionless limit of string theory on $AdS_3 \times S^3 \times T^4$ as a candidate for the phase with maximal unbroken symmetry. It has a dual description in terms of a two-dimensional superconformal field theory: the $N$-fold symmetric product orbifold of the $\caln = 4$ SCFT on the torus $T^4$, denoted by $Sym^N ( T^4 )$, in the limit of large $N$. From analyzing the dual theory they were able to isolate the symmetry algebra which plays the role of the gauge algebra in the bulk. This algebra, which contains exponentially more generators than the standard higher spin algebras, is nevertheless fully determined by the action of standard ‘horizontal’ and ’vertical’ higher spin algebras and therefore goes under the name of the higher spin square ($hss$) [@Gaberdiel:2015mra]. We will review its definition in section \[Sechss\] below. Furthermore, the spectrum of the untwisted sector of $Sym^N ( T^4 )$ has a simple content in terms of $hss$ representations.
In this note, we will take a first step towards reformulating tensionless string theory in the bulk as a higher spin gauge theory with $hss$ symmetry. In particular, we will show that the entire spectrum of the untwisted sector arises, on the bulk side, from a single matter field coupled to the $hss$ gauge fields, thereby confirming a conjecture made in [@Gaberdiel:2015wpo]. Along the way, we will single out the group-theoretic data which determine the spectrum of single-particle states described by Vasiliev-like matter equations in $AdS_3$ [@Vasiliev:1992gr] for a general higher spin algebra. We will illustrate this by revisiting the Vasiliev theory based on the higher spin algebra $hs[1/2 ]$ from this point of view.
Let us first collect some of the results of [@Gaberdiel:2015wpo]. It was shown there that the NS-NS sector partition function of the untwisted sector of $Sym^N ( T^4 )$ can, at large $N$, be written a way which is suggestive of a dual bulk interpretation: Z\_U (q, |q, y, |y) && \_U q\^[L\_0]{} |q\^[L\_0]{} y\^[2 J\^3\_0]{} |y\^[2 J\^3\_0]{}\
&=& Z\^[gauge]{}\_[hss]{}(q, |q, y, |y) Z\_[hss]{}\^[matter]{}(q, |q, y, |y) .\[ZU\] Here, $Z_{hss} $ is the mod-squared of the vacuum character of the chiral algebra of the dual CFT Z\^[gauge]{}\_[hss]{}(q, |q, y, |y) = |Z\_[vac]{}(q,y)|\^2.\[Zgauge\] In analogy with the Vasiliev higher spin theories [@Gaberdiel:2010ar], this contribution is expected to come from boundary excitations of gauge fields taking values in the higher spin square Lie algebra $hss$. The second factor in (\[ZU\]) is suggestive of a contribution from matter in the bulk. It takes the ‘multi-particle’ form[^1] Z\_[hss]{}\^[matter]{} (q, |q, y, |y) = \_[n=1]{}\^\[Zmatter\] and appears to describe multi-particle excitations of a theory whose single particle spectrum is given by Z\_[hss]{}\^[1-part]{} (q, |q, y, |y) = |\_[min]{}(q,y)|\^2 \[Z1part\] Here, $\chi_{min}$ is the character of the so-called minimal representation [@Gaberdiel:2014cha] of the higher spin square. More explicitly, it is given by \_[min]{}(q,y) =Z\_ [T\^4]{}(q,y) - 1\[chimin\] where $Z_{T^4}$ is the chiral part of the partition function of the SCFT on $T^4$, i.e. the partition function of 4 real chiral bosons and 4 Mayorana-Weyl fermions: Z\_[T\^4]{}(q,y) = \_[n=1]{}\^.\[ZT4\] Our goal in this note will be to show how (\[Z1part\]) arises from single-particle excitations of matter fields in the bulk.
Free Vasiliev system and single particle states
===============================================
In this section we will review the linearized equations describing matter coupled to massless higher spin fields in 2+1 dimensions. These equations were originally [@Vasiliev:1992gr] written down for the higher spin theories with higher spin algebra $hs[\l]$ (and their supersymmetric extensions), but we will not yet specify the higher spin algebra here, emphasizing instead the algebraic ingredients necessary to write down a consistent set of equations. This will pave the way for analyzing matter fields coupled to the higher spin square in section \[Sechss\].
Massless higher spin fields
---------------------------
Massless higher spin fields in 2+1 dimensions are described by a gauge theory based on two copies[^2] of a higher spin Lie algebra $\mh$, with $\mh$-valued gauge potentials $A, \tilde A$. We will assume $\mh$ to contain an $sl(2,{\mathbb{R}})$ subalgebra, which we will single out as the subsector which describes Einstein gravity in $AdS_3$. In general, the spin content of the theory is determined by the decomposition of the adjoint representation of $\mh$ into representations of this $sl(2,{\mathbb{R}})$ subalgebra. The equations of motion state that $A, \tilde A$ are flat: $$\begin{aligned}
d A - A \wedge A &=0, &
d \tilde A - \tilde A \wedge \tilde A &=0.\label{F0}\end{aligned}$$ Hence the gauge sector doesn’t contain any local propagating degrees of freedom, although a careful treatment of the boundary conditions at infinity [@Henneaux:2010xg],[@Campoleoni:2010zq] generically uncovers the existence of boundary excitations.
The equations of motion are formally invariant under finite higher spin gauge transformations of the form $$\begin{aligned}
A&\to hA h^{-1} + dh h^{-1}, &
\tilde A&\to \tilde h \tilde A \tilde h^{-1} + d\tilde h \tilde h^{-1}\label{Agt}\end{aligned}$$ where $h, \tilde h$ belong to $H$, the set of formal exponentials of elements of $\mh$. We will not address here the question for which elements of $\mh$ the exponential is well-defined, nor whether $H$ can be given the structure of of a Lie group. In the case where $\mh$ is the higher spin algebra $hs[\l ] $, these issues were addressed in [@Monnier:2014tfa].
Linearized matter equations
---------------------------
Next we review the linearized equations describing matter in a higher spin background specified by $A, \tilde A$. In most known examples, the higher spin Lie algebra $\mh$ can be embedded in an associative algebra $\ma$, such that the Lie bracket in $\mh$ arises from the commutator in $\ma$. If this is the case, we can write down linearized equations[^3] for two scalar matter fields $C, \tilde C$ taking values in the associative algebra $\ma$: $$\begin{aligned}
d C - A C + C \tilde A &=0 &
d \tilde C - \tilde A \tilde C + \tilde C A &=0 .\label{Ceqgen}\end{aligned}$$ Here the fields are multiplied using the associative product in $\ma$. Note that the consistency of (\[Ceqgen\]) is guaranteed by (\[F0\]). These equations are usually written in an equivalent ‘star-product’ form, in which the $\ma$-valued fields are replaced by $c$-number functions (or ‘symbols’) by using a specific operator ordering prescription, and the effect of the operator product is captured by a suitably defined star-product. We will however keep working with $\ma$-valued fields in this note. The equations (\[Ceqgen\]) are higher spin gauge invariant with the fields transforming as $$\begin{aligned}
C &\to h C \tilde h^{-1},&
\tilde C &\to \tilde h \tilde C h^{-1}\label{gaugetransf}
$$ When $\mh$ is one of the standard $hs[\l ]$ higher spin algebras and $\ma$ is the underlying ‘lone-star product’ associative algebra [@Pope:1989sr], the equations (\[Ceqgen\]), when expanded around the AdS background, describe the unfolded form of the Klein-Gordon equation for a scalar field of mass squared $\l^2-1 $. We will review this in some detail for the case of $\l = \half$ in section \[Sechshalf\] below.
One might think that it is consistent to truncate the theory to keep only the $C$ or $\tilde C$ matter field. We will see however in the next section that $C$ describes only negative frequency modes, while $\tilde C$ describes positive frequency ones. In order to have a sensible phase space lending itself to quantization, we should therefore keep both $C$ and $\tilde C$ even at the linearized level.
The AdS background
------------------
The advantage of the unfolded form of the equations is that we can easily write down the general solution to (\[Ceqgen\]) in any background [@Vasiliev:1992gr]. Indeed, writing the flat connections $A, \tilde A$ locally in a pure gauge form, $$\begin{aligned}
A &= dg g^{-1},& \tilde A &= d\tilde g \tilde g^{-1}
\end{aligned}$$ we can transform to a gauge where $A = \tilde A=0$. In this gauge the solutions for the matter fields are simply constant elements $C^0, \tilde C^0 \in \ma$. Introducing a basis $\{ e_a \}_a$ for $\ma$ and gauge-transforming back, we can write the general solution to (\[Ceqgen\]) as a linear combination of the solutions $$\begin{aligned}
C_a &= g e_a \tilde g^{-1},&
\tilde C_a &= \tilde g e_a g^{-1}.\label{gensol}\end{aligned}$$
Let us now specialize to the global AdS background, for which $g$ is an exponential of elements in the $sl(2,{\mathbb{R}})$ subalgebra of $\mh$ with commutation relations $[L_m,L_n] = (m-n) L_{m+n}$ for $m,n = 0, \pm1$. Separating out the dependence on the $AdS$ radial coordinate $\r$, the group elements can be written conveniently as [@Perlmutter:2012ds] $$\begin{aligned}
g &= R(\r ) e^{iL_0 x_+},&
\tilde g =& \tilde R(\r ) e^{-iL_0 x_-},\label{ggt}\end{aligned}$$ where $x_\pm = t\pm \f$ and R() = e\^[-L\_0]{}M\^[-1]{}, R() = e\^[L\_0]{}M\^[-1]{}, M= e\^[- [i 4]{}(L\_1 - L\_[-1]{})]{}.The presence of the constant element $M$ is for later convenience: it implements a change of basis which diagonalizes the element $\half (L_1 + L_{-1})$, in the sense that M (L\_1 + L\_[-1]{}) M\^[-1]{} = - i L\_0. Plugging this decomposition into (\[gensol\]), the mode solutions for $C$ and $\tilde C$ around $AdS$ are given by $$\begin{aligned}
C_a &= R e^{iL_0 x_+} e_a e^{iL_0 x_-} \tilde R^{-1},&
\tilde C_a =& \tilde R e^{-iL_0 x_-} e_a e^{-iL_0 x_+} R^{-1}.\label{gensolAdS}\end{aligned}$$
Higher spin representations and single-particle spectrum
--------------------------------------------------------
We would also like to determine how the solutions (\[gensolAdS\]) transform under the global higher spin symmetries of the $AdS$ background. The unfolded formulation makes symmetries manifest in general (see e.g. [@Vasiliev:2012vf]), and we will now argue that the symmetry properties of the solutions (\[gensolAdS\]) follow easily once a certain group-theoretic fact about the algebra $\ma$ is known.
First let us discuss the global symmetries of the $AdS$ background and their action on the matter fields [@Vasiliev:1992gr],[@Perlmutter:2012ds]. As before it is convenient to transform to the gauge $A= \tilde A=0$ where the matter fields are constant. Global symmetries are gauge transformations leaving the background $A= \tilde A=0$ invariant; from (\[Agt\]) these are generated by constant elements $h_0, \tilde h_0 $ and hence the global symmetry consists of two copies of $H$, which we will denote as $H \times \tilde H$. These global symmetries act on constant matter solutions $C^0 , \tilde C^0\in \ma$ by left-and right multiplication according to (\[gaugetransf\]): $$\begin{aligned}
C^0 & \to h_0 C^0 \tilde h_0^{-1}, & \tilde C^0 & \to \tilde h_0 \tilde C^0 h_0^{-1}, & h_0 \in H , \tilde h_0 \in \tilde H.\label{globalA0}
\end{aligned}$$ We can view the algebra $\ma$ as a representation space for $H \times \tilde H$ with, say, $\tilde H$ acting from the left and $ H$ acting from the right. Therefore we expect to be able to decompose $\ma$ into irreducible $H \times \tilde H$ representations as follows = \_i (V\_i, W\_i).\[decomp\] This decomposition determines how the space of matter solutions decomposes into irreducible representations of the global symmetry in the gauge $A = \tilde A=0$.
These observations can then be simply gauge transformed to the ‘AdS gauge’ where A = dg g\^[-1]{}, A = d g g\^[-1]{}\[AdSgauge\] with $g, \tilde g$ given in (\[ggt\]). The elements which implement the global $H \times \tilde H$ symmetry in this gauge are simply obtained from (\[globalA0\]) by conjugation with $g$ and $\tilde g$: $$\begin{aligned}
h &= g h_0 g^{-1},& \tilde h &= \tilde g \tilde h_0 \tilde g^{-1}.
\end{aligned}$$ Therefore the decomposition (\[decomp\]) also determines the quantum numbers carried by solutions in the AdS gauge (\[AdSgauge\]). As a check on our analysis so far, let us work out the infinitesimal gauge parameters implementing the $SL(2,{\mathbb{R}})\times \widetilde{SL(2,{\mathbb{R}})}$ subgroup of the global symmetry: $$\begin{aligned}
\e_{L_0} &= b^{-1} {i\over 2}( L_1 +L_{-1}) b, & \e_{L_{\pm1}} &= b^{-1} e^{\mp i x_+} \left(i L_0 \pm \half (L_1 - L_{-1}) \right) b \nonu
\tilde \e_{\tilde L_0} &= b {i\over 2}( L_1 +L_{-1}) b^{-1} , & \tilde \e_{\tilde L_{\pm1}} &= b e^{\pm i x_-} \left(i L_0 \pm \half (L_1 - L_{-1}) \right) b^{-1}
\end{aligned}$$ where $b = e^{\r L_0}$. These agree, modulo differences in conventions, with the expressions derived in [@Gaberdiel:2011wb] in the AdS gauge (\[AdSgauge\]).
We have argued that the decomposition (\[decomp\]) determines how the solution space to (\[Ceqgen\]) decomposes into representations of the global symmetry. In free field theory, the space of solutions generally decomposes into positive and negative frequency modes, and only one of these subspaces (usually chosen to be the positive frequency subspace) can be given the structure of a Hilbert space representing the single particle states of the theory. For example, for a complex scalar field, the Hilbert space inner product is constructed from the conserved $U(1)$ current, and a higher spin invariant conserved current also exists for the linearized Vasiliev system based on the $hs[\l ]$ algebra [@Prokushkin:1999xq] (see also[@Vasiliev:2002fs]). It would be interesting to generalize this construction to the higher spin square theory, but in what follows we will simply assume the usual correspondence between positive frequency modes and single particle states.
From (\[gensolAdS\]), we see that, if the representations entering in the decomposition (\[decomp\]) are unitary (as will be the case in our examples), so that $L_0$ has positive eigenvalues, the positive frequency modes are contained in the field $\tilde C$, while $C$ describes the negative frequency ones. Therefore only the modes of $\tilde C$ represent single particle states, leading to a partition function of the form Z\^[1-part]{}(q,|q) &=& \_q\^[L\_0]{} |q\^[L\_0]{}\
&=& \_i \_[V\_i]{} (q) \_[W\_i]{} (|q),\[1partspectr\] where $L_0$ and $\tilde L_0$ denote quantum numbers under right- and left action respectively. In the last line we have used (\[decomp\]) to write the result in terms of characters $\chi_{V_i}$ of the representations $V_i$. A similar formula holds if we refine the partition function with chemical potentials.
To summarize, we have argued that the decomposition (\[decomp\]) contains the group-theoretic data which determine the matter spectrum for generic higher spin algebras. In the next two sections we will work out (\[decomp\]), first for the warm-up example of the theory based on the $hs[1/2 ]$ algebra, and subsequently for the case of interest where $\mh$ is the higher spin square $hss$. Before doing so it may be instructive to work out (\[decomp\]) for some finite-dimensional examples. Let $\ma$ the algebra of real $5\times 5$ matrices with the standard matrix multiplication. Let $\mh$ be the subalgebra $sl(2,{\mathbb{R}})$ whose generators are embedded as $L_m
= L_m^{({\bf 2})} \oplus L_m^{({\bf 3})}$, with $L_m^{({\bf n})}$ the generators in the [**n**]{}-dimensional representation. It’s easy to see that $\ma$ decomposes into $SL(2,{\mathbb{R}}) \times \widetilde{SL(2,{\mathbb{R}})}$ representations as = ([**2**]{}, [**2**]{}) ([**2**]{}, [**3**]{}) ([**3**]{}, [**2**]{}) ([**3**]{}, [**3**]{}). If, on the other hand, $\mh$ is $sl(2,{\mathbb{R}})$ embedded as $L_m
= L_m^{({\bf 5})}$, the decomposition is simply = ([**5**]{}, [**5**]{}).
Matter coupled to [*hs\[1/2\]*]{} {#Sechshalf}
=================================
As a warmup to the higher spin square case, let us discuss the decomposition (\[decomp\]) in the case where $\mh$ is the Lie algebra $hs[1/2 ]$ and $\ma$ is the underlying ‘lone-star algebra’ $\ma_{hs[1/2]}$ introduced in [@Pope:1989sr]. This example is instructive since, as will be the case for the higher spin square, $\ma_{hs[1/2]}$ has a realization in terms of undeformed harmonic oscillators. Furthermore, we will be able to give a clearer physical justification of one of the steps involved in this simplified setting.
We start from a single harmonic oscillator =1. \[acomm\] Here, $a$ and $a^\dagger$ can be thought of as related to the Vasiliev operators $y_1,y_2$ as $a = {y_1\over \sqrt{2 i}}, a^\dagger = {y_2\over \sqrt{2 i}}$. The standard basis of $\ma_{hs[1/2]}$ is formed by Weyl-ordered monomials of even degree in the oscillators, V\^s\_m = 2\^[1-s]{} \_W, s1, |m|<s.\[weylbasis\] where the subscript stands for Weyl-ordering. In particular, $V^1_0$ is the identity operator, and the remaining generators $V^s_m$ with $s\geq 2$ generate, through their commutators, the Lie algebra $hs[1/2 ]$. It was shown in [@Ammon:2011ua] that multiplying these basis elements and using the commutation relation (\[acomm\]) to once again Weyl order the result reproduces the lone-star product of $\ma_{hs[1/2]}$ defined in [@Pope:1989sr]. The $s=2$ generators form an $sl(2, {\mathbb{R}}) $ subalgebra, with $L_0 = V^2_0,\ L_{\pm 1} = V^2_{\pm 1}$. One can check that the quadratic Casimir $C_2$ of this $sl(2, {\mathbb{R}}) $ subalgebra takes the value C\_2 = L\_0\^2 - (L\_1 L\_[-1]{} + L\_[-1]{} L\_1 )= -[3 16]{}.\[Casrel\] This observation allows one to alternatively view $\ma_{hs[1/2]}$ as the quotient of the universal enveloping algebra $U( sl(2, {\mathbb{R}}) )$ by the ideal $C_2 + 3/16$.
The basis (\[weylbasis\]) of Weyl-ordered monomials is not very suitable for figuring out the desired decomposition of the form (\[decomp\]). For this purpose, one would like to diagonalize the action of the Cartan generators $V^s_0$ both from the left and the right, while one easily checks that this is not the case in the basis (\[weylbasis\]). To remedy this we will instead expand operators in a Fock basis[^4], in terms of basis elements = [(a\^)\^m ]{} \_F.\[Fockbasis\] In the last equality we have defined, for later convenience, a ‘Fock-ordering’ acting on oscillator monomials by letting the creation and annihilation operators act on $\ket{0} \bra{0} $ from the left and the right respectively. The relations between Weyl-ordered and Fock-ordered monomials is summarized by the following formulae, whose origin is explained in Appendix \[App\]: \_W &=& {
[lcr]{} 2\^[-n]{}n! \_F & & [for]{} mn\
2\^[-m]{}m! \_F& & [for]{} nm
.\[WeyltoFock\]\
\_F &=& {
[lcr]{}(-1)\^n 2\^[m-n+1]{}n! \_W & & [for]{} mn\
(-1)\^m 2\^[n-m+1]{}m! \_W& & [for]{} nm
. ,\[FocktoWeyl\] where $L^k_n$ are the associated Laguerre polynomials. Since the right-hand side of these equations is non-polynomial, one might question the validity of transforming to the Fock basis, and we will provide a physical justification for this step below. From these expressions it follows that even Weyl-ordered monomials are expressed in terms of even Fock-ordered monomials and vice versa. Therefore (\[WeyltoFock\],\[FocktoWeyl\]) allow us to represent the standard basis elements ${V^s_m}$ of $\ma_{hs[1/2]}$ in terms of the subset op Fock basis elements m+n [ even]{},\[abasisfock\] and vice versa. For example one finds, from (\[WeyltoFock\]), 1 &=& V\^1\_0 = \_n\
L\_0 &=& V\^2\_0 = \_n ( n + ) \[L0hshalf\]\
L\_1 &=& V\^2\_1 = \_n \[L1hshalf\]\
L\_[-1]{} &=& V\^2\_[-1]{} = \_n .\[sl2hshalf\]
Using the Fock basis of $\ma_{hs[1/2]}$ we can now now easily derive the decomposition of the form (\[decomp\]). Decomposing the harmonic oscillator Fock space $\calf$ into = \_[even]{} \_[odd]{}, where $\calf_{even}$ ($\calf_{odd} $) are spanned by the basis states with even (odd) excitation number $\ket{2m}$ ($\ket{2m+1}$) respectively, we have, due to (\[abasisfock\]), \_[hs\[1/2\]]{} = ( \_[even]{} \_[even]{}\^\* ) ( \_[odd]{} \_[odd]{}\^\* ). where $\,^*$ denotes the dual vector space. The subspaces $\calf_{even} $ and $\calf_{odd}$ each form irreducible lowest weight representations of $hs[1/2 ]$ whose lowest weight vectors are $\ket{0}$ and $\ket{1}$ respectively. Indeed, from (\[L1hshalf\]) we see that they are annihilated by $L_1$, and that their $L_0$ eigenvalues are ${1 \over 4}$ and ${3\over 4}$ respectively. Using the description of $hs[1/2 ]$ as a quotient of the universal enveloping algebra of $sl(2,{\mathbb{R}}) $ by the relation (\[Casrel\]), one can show that $\ket{0}$ and $\ket{1}$ are also lowest weight vectors under the full $hs[1/2]$ algebra. The corresponding irreducible representations were denoted by $\f_-$ and $\f_+$ respectively in [@Gaberdiel:2011wb]. We also note that writing the $hs[1/2 ]$ elements in the Fock basis as in (\[sl2hshalf\]) and restricting their action to either $\calf_{even}$ or $\calf_{odd}$, we obtain the infinite-dimensional matrix representations of $hs[1/2 ]$ discussed in [@Khesin:1994ey],[@Hijano:2013fja],[@Campoleoni:2013lma].
It follows that, for $hs[1/2 ]$, the decomposition (\[decomp\]) reads, \_[hs\[1/2\]]{} = ( V\_[\_-]{} , V\_[\_-]{}\^\* ) ( V\_[\_+]{} , V\_[\_+]{}\^\* ).\[decomphshalf\] where $\,^*$ denotes the dual representation. Applying (\[1partspectr\]), the spectrum of single particle states described by the linearized Vasiliev equations is Z\^[1-part]{}\_[hs\[1/2\]]{} = |\_[\_-]{} |\^2 + |\_[\_+]{} |\^2. This agrees with the conclusions reached in [@Vasiliev:1992gr] using somewhat different methods.
Let us now discuss in more detail the explicit solutions which furnish the representations in the decomposition (\[decomp\]). These will turn out to be physically sensible, which provides additional justification for the initial step of expanding in the Fock basis (\[Fockbasis\]). From (\[gensolAdS\]), the first term in (\[decomphshalf\]) is furnished by the positive frequency solutions of the form C\_[2m,2n]{}\^[AdS]{} = e\^[-i( (m+ n + ) t + (n-m)) ]{}R R\^[-1]{}\[soleven\] while the second term is realized on the solutions C\_[2m+1,2n+1]{}\^[AdS]{} = e\^[-i( (m+ n + [32]{}) t + (n-m))]{} R R\^[-1]{}.\[solodd\] The physical content of the matter fields $C, \tilde C$ is contained in the component of the unit operator $V^1_0$ when expanded in the basis (\[weylbasis\]), while the other components in this expansion are auxiliary fields [@Vasiliev:1992gr]. The operation of extracting the component of $V^1_0$ is referred to as taking the trace, and we will denote it by $\tr$, though it should not be confused with the trace operation in the Hilbert space of the harmonic oscillator. The equations of motion (\[Ceqgen\]) imply that the physical fields = C, = C satisfy the Klein-Gordon equation with $m^2= - 3/4$ [@Vasiliev:1992gr]. One finds that the physical wavefunctions of the solutions (\[soleven\], \[solodd\]) are, up to an inconsequential normalization factor, given by \_[2m, 2n]{} &=& e\^[-i ( (n+[1 4]{}) x\_+ + (m+[1/4]{})x\_-)]{} [tr]{} ( e\^[-i(L\_1 + L\_[-1]{})]{} ) &\~& e\^[- i ø\_- t -i l ]{} ()\^[-2 h\_+]{} ()\^l \_2F\_1 ( h\_+ + [l - ø\_- 2]{}, h\_+ + [l + ø\_- 2]{}, l+1,\^2 )\_[2m+1, 2n+1]{} &=& e\^[-i ( (n+[3 4]{}) x\_+ + (m+[3/4]{})x\_-)]{} [tr]{} ( e\^[-i(L\_1 + L\_[-1]{})]{} ) &\~& e\^[- i ø\_+ t -i l ]{} ()\^[-2 h\_+]{} ()\^l \_2F\_1 ( h\_+ + [l - ø\_+ 2]{}, h\_+ + [l + ø\_+ 2]{}, l+1,\^2 ) where $h_+ = 3/4, h_-=1/4$, and we have defined l &=& n-m\
ø\_&=& l + 2 h\_+ 2m. The first identity in the above formulas follows using the cyclicity of $\tr$, while in second identity we evaluated the required traces using (\[traces\]). Comparing to [@Balasubramanian:1998sn], we see that $ \F_{2m, 2n} $ and $ \F_{2m+1, 2n+1}$ are precisely the positive frequency modes of the Klein-Gordon field in the ‘alternate’ and ‘standard’ quantizations respectively, with the correct frequency spectrum to guarantee regularity in global $AdS_3$. The solutions \_[0,0]{} = e\^[-it /2]{} ()\^[-1/2]{}, \_[1,1]{} = e\^[-3it /2]{} ()\^[-3/2]{} represent the lowest weight vectors in the decomposition (\[decomphshalf\]), and the action of $hs[1/2 ]$ is realized on the wavefunctions in terms of differential operators. For example, one can show that the generators of the $SL(2,
{\mathbb{R}}) \times \widetilde{SL(2,{\mathbb{R}})}$ subgroup act by Lie derivatives [@Perlmutter:2012ds]. One can perform a similar analysis for the mode solutions of the field $C$ leading the negative frequency solutions of the Klein-Gordon field in global $AdS_3$. In the standard approach to AdS/CFT, one imposes boundary conditions which select only one of the representations in (\[decomphshalf\]).
It would be interesting to extend this analysis to the theories based on the higher spin algebra $hs[\l ]$ which have a realization in terms of deformed oscillators [@Vasiliev:1997dq]. When $\l$ equals $N$, a natural number greater than one, the generators $V^s_m$ with $s>N$ form an ideal which can be quotiented out, after which the higher spin algebra becomes $sl(N,{\mathbb{R}})$ and the associative algebra becomes the algebra of $N\times N$ matrices. In this case the single particle spectrum was analyzed in [@Perlmutter:2012ds].
Matter coupled to the higher spin square {#Sechss}
========================================
Now we turn to the example of interest, where the higher spin Lie algebra $\mh$ is the higher spin square $hss$ and $\ma$ is the underlying associative algebra $\ma_{hss}$, both of which we will presently describe following [@Gaberdiel:2015wpo]. The algebra $\ma_{hss}$ has an oscillator realization in terms of the chiral modes[^5] of the $\caln=4$ sigma model on $T^4$. This free superconformal field theory consists of two complex scalars and two complex fermions with NS boundary conditions, leading to chiral oscillator modes[^6] $a^\a_m , \bar a^\a_m, \psi^\a_m, \bar \psi^\a_m$, with $m \in {\mathbb{N}}_0, r\in {\mathbb{N}}+\half, \a\in \{1,2 \}$, and their Hermitian conjugates. The canonical (anti-) commutation relations are $$\begin{aligned}
\left[ a^\a_m, \left(a^\b_n\right)^\dagger \right]&= \d^{\a\b}\d_{mn}1, &
\left[\bar a^\a_m, \left(\bar a^\b_n\right)^\dagger \right]&= \d^{\a\b}\d_{mn}1 \\
\left\{\psi^\a_r, \left(\psi^\b_s\right)^\dagger \right\} &= \d^{\a\b}\d_{rs}1,&
\left\{\bar \psi^\a_r, \left(\bar \psi^\b_s\right)^\dagger \right\}&= \d^{\a\b}\d_{rs} 1\label{hssmodes}\end{aligned}$$ with all other (anti-) commutators vanishing. The algebra $\ma_{hss}$ is the subalgebra of the oscillator algebra consisting of operators which annihilate both the in- and out Fock vacuum. A basis for $\ma_{hss}$ is formed by the normal-ordered monomials in the oscillators which contain at least one creation and one annihilation operator. The algebra $hss$ is the Lie algebra obtained from $\ma$ by defining the Lie bracket to be the commutator in $\ma$.
The algebra $hss$ contains a subalgebra $su(1,1|2)$, which arises as the vacuum-preserving subalgebra of the (small) $\caln=4$ superconformal algebra which governs the $T^4$ theory [@Ademollo:1976wv]. The $su(1,1|2)$ algebra consists of $sl(2)$ generators $L_0,L_{\pm 1}$, $su(2)$ R-symmetry generators $J^i_0$ and superconformal generators $G^\a_{\pm \half}, \bar G^\a_{\pm \half}$. These are realized in terms of quadratic monomials in the oscillator modes. The expressions for the conformal weight $L_0$ and R-charge generator $J^3_0$ are: L\_0 &=& \_[n=1]{}\^J\^3\_0 &=& -\_[n=1]{}\^( (\^\_[n-]{})\^\^\_[n-]{} - (|\^\_[n-]{})\^|\^\_[n-]{} ), where a sum over the index $\a =1,2$ is implied. Expressions for the other generators can be found in [@Ademollo:1976wv].
As in the previous example we would like to work out the decomposition (\[decomp\]) of $\ma_{hss}$ into irreducible $HSS \times \widetilde{HSS}$ representations, where the two copies act from the right and left respectively. The basis of $\ma_{hss}$ consisting of normal-ordered monomials is not adapted to such a decomposition, since for example $L_0$ and $J^3_0$ don’t act diagonally either from the left or the right. Once again, a suitable basis for this purpose is the Fock basis, where we expand general operators in basis elements of the form , where $\ket{F_1} $ and $\ket{F_2}$ are elements of the Fock space $\calf$ built from acting with the creation modes in (\[hssmodes\]) on the vacuum.
The transformation between the normal ordered monomial and Fock bases can be worked out explicitly. For notational simplicity, let us illustrate this for a single bosonic oscillator mode $a$ and for a fermionic mode $\psi$. For a bosonic oscillator, the relation between normal-ordered and Fock-ordered monomials is summarized by (see Appendix \[App\] for more details): \_F &=& : (a\^)\^m a\^n e\^[- a\^a]{} :(a\^)\^m a\^n &=& \[(a\^)\^m a\^n e\^[ a\^a]{}\]\_F. \[FockNormalbos\] For a fermionic oscillator, similar formulas hold: \[ (\^)\^m \^n\]\_F &=& : (\^)\^m \^n e\^[- \^]{} : (\^)\^m \^n &=& \[(\^)\^m \^n e\^[ \^]{}\]\_F,\[FockNormalferm\] where most of the terms in the expansion of the right hand side actually vanish due to $(\psi^\dagger)^2 = \psi^2=0$. Returning to the full algebra $\ma_{hss}$, the monomial and Fock operator bases can be worked out in principle by repeated application of (\[FockNormalbos\],\[FockNormalferm\]). Note that in the Fock basis, both $L_0$ and $J^3_0$ act diagonally both from the left and right.
We have not yet imposed, on our Fock operator basis, the restriction that that elements of $\ma_{hss}$ should annihilate the in- and out- Fock vacua. Decomposing the Fock space $\calf$ as = ’,\[decomprep\] where $\calf'$ is the direct sum of the one-, two-, and more-particle Hilbert spaces, a basis for $\ma_{hss}$ is formed by elements of the form , ’ .\[basishss\] It follows that, as a vector space, $\ma_{hss}$ is simply \_[hss]{} = ’ \^\* \[decompfock\] Viewed as representations of $hss$, the ${\mathbb{C}}\ket{0}$ term in the decomposition (\[decomprep\]) corresponds to the the trivial representation, while the second term $\calf'$ carries a representation which turns out to be the minimal representation $V_{min}$ discussed in [@Gaberdiel:2014cha],[@Gaberdiel:2015wpo]. Indeed, from the above considerations we easily compute the character \_[’]{}&& \_[’]{} q\^[L\_0]{}y\^[2 J\^3\_0]{}&=& \_ q\^[L\_0]{}y\^[2 J\^3\_0]{} -1&=& Z\_[T\^4]{}-1 where $Z_{T^4}$ is the chiral partition function (\[ZT4\]) of the $T^4$ SCFT. This agrees with the character of the minimal representation (\[chimin\]) of $hss$ [@Gaberdiel:2014cha],[@Gaberdiel:2015wpo].
Combining (\[decompfock\]) with the observation that $\calf ' = V_{min}$ we arrive at the following simple decomposition (\[decomp\]) in the case of the higher spin square: \_[hss]{} = ( V\_[min]{}, V\_[min]{}\^\* ).\[decomphss\] The positive frequency solutions which furnish this representation are, from (\[gensolAdS\]), C\_[F\_1’, F\_2’]{} = e\^[-i( h\_[F\_1’]{} x\_- + h\_[F\_2’]{} x\_+ )]{} R R\^[-1]{} where $h_F$ denotes the $L_0$-eigenvalue of $\ket{F}$. From (\[1partspectr\]) we read off that the partition function of the single particle states of the matter field is Z\^[1-part]{}\_[hss]{} (q,|q, y, |y) = \_[\_[hss]{}]{} q\^[L\_0]{} |q\^[L\_0]{} y\^[2J\^3\_0]{}|y\^[2J\^3\_0]{}= |\_[min]{}(q,y)|\^2. which reproduces (\[Z1part\]). For completeness, let us also indicate how the multi-particle spectrum, keeping track of statistics, leads to the full CFT result (\[Zmatter\]). We define degeneracies $c(h, \tilde h, l, \tilde l)$ from writing the single-particle partition function as Z\^[1-part]{}\_[hss]{} = \_[h,h, l, l]{} c(h, h, l, l) q\^h |q\^[h]{} y\^l |y\^[l]{}. We further note that $c(h, \tilde h, l, \tilde l)$ counts bosonic states when $l+\tilde l$ is even and fermions when $l+\tilde l$ is odd. Therefore the multiparticle partition function can be written as Z\_[hss]{}\^[matter]{} = \_[h, h]{} [\_[l,l; l+l [odd]{}]{} (1+ q\^h |q\^[h]{} y\^l |y\^[l]{})\^[c(h, h, l, l)]{} \_[l,l; l+l [even]{}]{} (1- q\^h |q\^[h]{} y\^l |y\^[l]{})\^[c(h, h, l, l)]{}]{}. After some algebra this can be rewritten in the form (\[Zmatter\]).
We note that, unlike in the $hs[1/2]$ case (\[decomphshalf\]), the decomposition (\[decomphss\]) contains only one term, so that unlike in that example we don’t have a choice of several boundary conditions which are compatible with the $hss$ symmetry. This seems similar to what happens in other examples (see e.g. [@Klebanov:1999tb]) where only one of the two possible boundary conditions on a scalar is compatible with supersymmetry.
Generalization and outlook
==========================
In this note we have confirmed Gaberdiel and Gopakumar’s conjecture that the full contribution (\[Zmatter\]) to the untwisted sector CFT partition function arises from a single matter field in the bulk, which is furthermore coupled to the $hss$ gauge fields in a straightforward generalization of Vasiliev’s linearized theory [@Vasiliev:1992gr]. It would be interesting to understand better how this spectrum decomposes in terms of supermultiplets of the AdS supergroup $SU(1,1|2) \times \widetilde{SU(1,1|2)}$ (see [@Gunaydin:1986fe]) contained in $HSS \times \widetilde{HSS}$. It would also be of interest to understand how, after imposing appropriate boundary conditions on the gauge fields as in [@Henneaux:2010xg],[@Campoleoni:2010zq], the spectrum of boundary excitations reproduces the extended vacuum character (\[Zgauge\]).
The symmetric orbifold CFT also contains twisted sectors, whose decomposition into $HSS \times \widetilde{HSS}$ representations is not fully understood at present. We note that any representation $(R, \tilde R)$ entering in such a decomposition can be described in the bulk by fields $C$ and $\tilde C$ taking values in $R \otimes \tilde R$ and $\tilde R \otimes R$ respectively, with linearized equations d C - A\_R C + C A\_[R]{} &=&0d C - A\_[R]{} C + C A\_R &=&0 where $A_R $ and $\tilde A_{\tilde R}$ are the gauge fields in the representations $R, \tilde R$ respectively.
These considerations show how the full spectrum of the symmetric orbifold can in principle be reproduced from linearized matter fields in the bulk. The main open question is of course if and how these fields can be incorporated into a consistent interacting theory which furthermore reproduces the correlation functions of the symmetric orbifold. The hope is that the $hss$ symmetry will be sufficiently restrictive that to determine the interactions essentially uniquely, as is the case for the Vasiliev theories.
Acknowledgements {#acknowledgements .unnumbered}
================
I would like to thank R. Gopakumar, C. Iazeolla, E. Perlmutter and T. Procházka for helpful comments and discussions. This research was supported by the Grant Agency of the Czech Republic under the grant 14-31689S.
Some ordering identities {#App}
========================
In this section we will work out some relations between different ordering prescriptions for operators constructed out of a single harmonic oscillator needed in the main text. In particular, we need to relate the Fock basis to the basis of Weyl-ordered monomials in section \[Sechshalf\] and to the basis of normal ordered monomials in section \[Sechss\]. It’s useful to define a ‘Fock ordering’ as the operation which turns monomials in the variables $a, a^\dagger$ into operators by letting the creation and annihilation operators act on $\ket{0} \bra{0} $ from the left and the right respectively, e.g. \_F = (a\^)\^m a\^n. Any operator can be expanded in the bases of Fock-, normal- or Weyl-ordered monomials as = \_F= :f\^N\_(a, a\^): = \_W where $f^F_\calo, f^N_\calo, f^W_\calo$ are the Fock-, normal- and Weyl-ordered symbols respectively. These are given by f\^F\_(z, |z) &=& \_[m,n]{} [ ]{} |z\^m z\^n \[Focksymbol\]\
f\^N\_(z, |z) &=& \[normalsymbol\]\
f\^W\_(z, |z) &=& [2 e\^[2 |z|\^2]{}]{} d\^2 w e\^[-2( w|z- |w z)]{} \[Weylsymbol\] where we have made use of the coherent states = e\^[-z |z]{} e\^[z a\^]{} . For a derivation of last two expressions (\[normalsymbol\],\[Weylsymbol\]) see e.g. [@Agarwal:1971wc].
From (\[Focksymbol\],\[normalsymbol\]) we find the following simple relation between the normal- and Fock-ordered symbols: f\^F\_(z, |z) &=& f\^N\_(z, |z) e\^[|z|\^2]{} f\^N\_(z, |z) &=& f\^F\_(z, |z) e\^[-|z|\^2]{}.\[Focknormalsymbol\] Applied to monomial basis elements these lead to the expressions (\[FockNormalbos\]).
Next we wish to derive a relation between Weyl-ordered and Fock-ordered symbols. We start from the expressions relating Weyl- and normal-ordered symbols[^7] (see (5.15) and (5.30) in [@Agarwal:1971wc]) f\^N\_(z, |z) &=& [2]{} d\^w f\^W\_(w, |w) e\^[-2 |w-z|\^2]{} f\^W\_(z, |z) &=& e\^[- \_z \_[|z]{} ]{} f\^N\_(z, |z) Combining these with (\[Focknormalsymbol\]) we obtain a relation between Weyl-ordered and Fock-ordered symbols: f\^F\_(z, |z) &=& [2 e\^[|z|\^2]{} ]{} d\^2 w f\^W\_(w, |w) e\^[-2 |w-z|\^2]{}f\^W\_(z, |z) &=& e\^[- \_z \_[|z]{}]{} ( f\^F\_(z, |z) e\^[- |z|\^2]{}). Application of the first equation leads, after some algebra, to the expansion of Weyl-ordered basis elements in terms of Fock-ordered ones (\[WeyltoFock\]). For the inverse relation, instead of using the second equation it is more convenient to apply (\[Weylsymbol\]), leading to (\[FocktoWeyl\]).
From (\[Weylsymbol\]) we also derive an expression [@Kraus:2012uf] for the trace operation, defined as extracting the coefficient of the unit operator in an expansion in Weyl-ordered monomials, = [2 ]{} d\^2 z . From this we compute the following traces needed in section \[Sechshalf\]: $$\begin{aligned}
&{\rm tr} \left( e^{-i\r (L_1 + L_{-1})} \ket{m}\bra{n} \right) =&\nonu
& \caln_{m,n} (\cosh \r)^{-{3 \over 2}} (\tanh \r)^{{n-m\over 2}} \,_2 F_1
\left({1-m\over 2}, {n \over 2} +1,{n-m \over 2} + 1, \tanh^2 \r\right)&\label{traces}\end{aligned}$$ where $\caln_{m,n}$ is a constant which is irrelevant for our purposes. To derive this result we made use of the BCH-type rearrangement formula e\^[i(L\_1 + L\_[-1]{})]{} = e\^[ i L\_[-1]{}]{} e\^[ i L\_[1]{}]{} ()\^[-2 L\_0]{}.
[10]{} M. A. Vasiliev, “Higher spin gauge theories in four-dimensions, three-dimensions, and two-dimensions,” Int. J. Mod. Phys. D [**5**]{}, 763 (1996) doi:10.1142/S0218271896000473 \[hep-th/9611024\]. M. A. Vasiliev, “Higher spin gauge theories: Star product and AdS space,” In \*Shifman, M.A. (ed.): The many faces of the superworld\* 533-610 \[hep-th/9910096\]. V. E. Didenko and E. D. Skvortsov, “Elements of Vasiliev theory,” arXiv:1401.2975 \[hep-th\]. M. R. Gaberdiel and R. Gopakumar, “Higher Spins & Strings,” JHEP [**1411**]{}, 044 (2014) doi:10.1007/JHEP11(2014)044 \[arXiv:1406.6103 \[hep-th\]\]. M. R. Gaberdiel and R. Gopakumar, “Stringy Symmetries and the Higher Spin Square,” J. Phys. A [**48**]{}, no. 18, 185402 (2015) doi:10.1088/1751-8113/48/18/185402 \[arXiv:1501.07236 \[hep-th\]\].
M. R. Gaberdiel and R. Gopakumar, “String Theory as a Higher Spin Theory,” arXiv:1512.07237 \[hep-th\]. M. R. Gaberdiel and R. Gopakumar, “Large N=4 Holography,” JHEP [**1309**]{}, 036 (2013) doi:10.1007/JHEP09(2013)036 \[arXiv:1305.4181 \[hep-th\]\]. M. R. Gaberdiel and C. Peng, “The symmetry of large $\mathcal N= 4$ holography,” JHEP [**1405**]{}, 152 (2014) doi:10.1007/JHEP05(2014)152 \[arXiv:1403.2396 \[hep-th\]\]. M. R. Gaberdiel, C. Peng and I. G. Zadeh, “Higgsing the stringy higher spin symmetry,” JHEP [**1510**]{}, 101 (2015) doi:10.1007/JHEP10(2015)101 \[arXiv:1506.02045 \[hep-th\]\]. M. A. Vasiliev, “Unfolded representation for relativistic equations in (2+1) anti-De Sitter space,” Class. Quant. Grav. [**11**]{}, 649 (1994). doi:10.1088/0264-9381/11/3/015 A. S. Arvanitakis, “Higher spins from Nambu-Chern-Simons theory,” arXiv:1511.01482 \[hep-th\]. M. R. Gaberdiel, R. Gopakumar and A. Saha, “Quantum $W$-symmetry in $AdS_3$,” JHEP [**1102**]{}, 004 (2011) doi:10.1007/JHEP02(2011)004 \[arXiv:1009.6087 \[hep-th\]\]. M. Henneaux and S. J. Rey, “Nonlinear $W_{infinity}$ as Asymptotic Symmetry of Three-Dimensional Higher Spin Anti-de Sitter Gravity,” JHEP [**1012**]{}, 007 (2010) doi:10.1007/JHEP12(2010)007 \[arXiv:1008.4579 \[hep-th\]\]. A. Campoleoni, S. Fredenhagen, S. Pfenninger and S. Theisen, “Asymptotic symmetries of three-dimensional gravity coupled to higher-spin fields,” JHEP [**1011**]{}, 007 (2010) doi:10.1007/JHEP11(2010)007 \[arXiv:1008.4744 \[hep-th\]\]. S. Monnier, “Finite higher spin transformations from exponentiation,” Commun. Math. Phys. [**336**]{}, no. 1, 1 (2015) doi:10.1007/s00220-014-2220-9 \[arXiv:1402.4486 \[hep-th\]\]. M. Ammon, P. Kraus and E. Perlmutter, “Scalar fields and three-point functions in D=3 higher spin gravity,” JHEP [**1207**]{}, 113 (2012) doi:10.1007/JHEP07(2012)113 \[arXiv:1111.3926 \[hep-th\]\]. C. N. Pope, L. J. Romans and X. Shen, “$W$(infinity) and the Racah-wigner Algebra,” Nucl. Phys. B [**339**]{}, 191 (1990). doi:10.1016/0550-3213(90)90539-P E. Perlmutter, T. Prochazka and J. Raeymaekers, “The semiclassical limit of W$_N$ CFTs and Vasiliev theory,” JHEP [**1305**]{}, 007 (2013) \[arXiv:1210.8452 \[hep-th\]\]. M. A. Vasiliev, “Holography, Unfolding and Higher-Spin Theory,” J. Phys. A [**46**]{}, 214013 (2013) doi:10.1088/1751-8113/46/21/214013 \[arXiv:1203.5554 \[hep-th\]\]. M. R. Gaberdiel and T. Hartman, “Symmetries of Holographic Minimal Models,” JHEP [**1105**]{}, 031 (2011) doi:10.1007/JHEP05(2011)031 \[arXiv:1101.2910 \[hep-th\]\].
S. F. Prokushkin and M. A. Vasiliev, “Cohomology of arbitrary spin currents in AdS(3),” Theor. Math. Phys. [**123**]{}, 415 (2000) \[Teor. Mat. Fiz. [**123**]{}, 3 (2000)\] doi:10.1007/BF02551048 \[hep-th/9907020\]. M. A. Vasiliev, “Higher spin conserved currents in Sp(2M) symmetric space-time,” Russ. Phys. J. [**45**]{}, 670 (2002) \[Izv. Vuz. Fiz. [**2002N7**]{}, 23 (2002)\] doi:10.1023/A:1021249631042 \[hep-th/0204167\]. C. Iazeolla and P. Sundell, “A Fiber Approach to Harmonic Analysis of Unfolded Higher-Spin Field Equations,” JHEP [**0810**]{}, 022 (2008) doi:10.1088/1126-6708/2008/10/022 \[arXiv:0806.1942 \[hep-th\]\]. B. Khesin and F. Malikov, “Universal Drinfeld-Sokolov reduction and matrices of complex size,” Commun. Math. Phys. [**175**]{}, 113 (1996) doi:10.1007/BF02101626 \[hep-th/9405116\]. E. Hijano, P. Kraus and E. Perlmutter, “Matching four-point functions in higher spin AdS$_3$/CFT$_2$,” JHEP [**1305**]{}, 163 (2013) doi:10.1007/JHEP05(2013)163 \[arXiv:1302.6113 \[hep-th\]\].
A. Campoleoni, T. Prochazka and J. Raeymaekers, “A note on conical solutions in 3D Vasiliev theory,” JHEP [**1305**]{}, 052 (2013) doi:10.1007/JHEP05(2013)052 \[arXiv:1303.0880 \[hep-th\]\].
V. Balasubramanian, P. Kraus and A. E. Lawrence, “Bulk versus boundary dynamics in anti-de Sitter space-time,” Phys. Rev. D [**59**]{}, 046003 (1999) doi:10.1103/PhysRevD.59.046003 \[hep-th/9805171\]. M. A. Vasiliev, “Deformed oscillator algebras and higher spin gauge interactions of matter fields in (2+1)-dimensions,” Lect. Notes Phys. [**509**]{}, 274 (1998) doi:10.1007/BFb0105257 \[hep-th/9712246\].
M. Ademollo [*et al.*]{}, “Dual String Models with Nonabelian Color and Flavor Symmetries,” Nucl. Phys. B [**114**]{}, 297 (1976). doi:10.1016/0550-3213(76)90590-3 I. R. Klebanov and E. Witten, “AdS / CFT correspondence and symmetry breaking,” Nucl. Phys. B [**556**]{}, 89 (1999) doi:10.1016/S0550-3213(99)00387-9 \[hep-th/9905104\].
M. Gunaydin, G. Sierra and P. K. Townsend, “The Unitary Supermultiplets of $d=3$ Anti-de Sitter and $d=2$ Conformal Superalgebras,” Nucl. Phys. B [**274**]{}, 429 (1986). doi:10.1016/0550-3213(86)90293-2 G. S. Agarwal and E. Wolf, “Calculus for functions of noncommuting operators and general phase-space methods in quantum mechanics. i. mapping theorems and ordering of functions of noncommuting operators,” Phys. Rev. D [**2**]{}, 2161 (1970). doi:10.1103/PhysRevD.2.2161
P. Kraus and E. Perlmutter, “Probing higher spin black holes,” JHEP [**1302**]{}, 096 (2013) doi:10.1007/JHEP02(2013)096 \[arXiv:1209.4937 \[hep-th\]\].
D. V. Widder, “The convolution transform,” Bull. Amer. Math. Soc. [**60**]{} (1954), no. 5, 444–456.
[^1]: The minus signs in this expression account for statistics, as we will explain in more detail in section \[Sechss\] below.
[^2]: See however [@Arvanitakis:2015sgs] for an example of a higher spin theory based on a Lie algebra which is simple, rather than a product of two isomorphic copies.
[^3]: In the original work [@Vasiliev:1992gr], see also [@Ammon:2011ua], the equations were written more succinctly by introducing an extra Grassmann element $\f$, satisfying $\f^2=1$, and the associated projection operators $P_\pm = {1 \pm \f\over 2}$. Combining the fields as $W= A P_+ + \tilde A P_-, B = C P_+ + \tilde C P_-$, the equations (\[F0\],\[Ceqgen\]) reduce to $$\begin{aligned}
d W - W\wedge W &=0, &\qquad
d B - W B + B \p ( W )&= 0\nonumber \end{aligned}$$ where the operation $\p$ sends $\f \to - \f$.
[^4]: A similar basis change in the case of four-dimensional higher spin theories was advocated in [@Iazeolla:2008ix].
[^5]: As in [@Gaberdiel:2015wpo], we will ignore the zero modes and work in the sector of zero momentum and winding.
[^6]: Our conventions are related to those of [@Ademollo:1976wv] as follows: starting from the oscillators of four real bosons, $b^i_m$, and four real fermions, $\s^i_m$, with $i = 1,\ldots ,4$, satisfying $$\left[ b^i_m, \left(b^j_n\right)^\dagger \right]= \d^{ij}\d_{mn}1, \qquad \left\{\s^i_r, \left(\s^j_s\right)^\dagger \right\} = \d^{ij}\d_{rs}1$$ we have defined $$\begin{aligned}
a^1_m &= {1\over \sqrt{2}} (b^1_m + i b^2_m), \qquad & \bar a^1_m &= {1\over \sqrt{2}} (b^1_m - i b^2_m), \qquad &
a^2_m & = {1\over \sqrt{2}} (b^4_m + i b^3_m), \qquad & \bar a^2_m &= {1\over \sqrt{2}} (b^4_m - i b^3_m)\nonu
\psi^1_r &= {1\over \sqrt{2}} (\s^1_r + i \s^2_r), \qquad & \bar \psi^1_r &= {1\over \sqrt{2}} (\s^1_r - i \s^2_r)\qquad &
\psi^2_r &= {1\over \sqrt{2}} (\s^4_r + i \s^3_r), \qquad & \bar a^2_r &= {1\over \sqrt{2}} (\s^4_r - i \s^3_r)\nonumber\end{aligned}$$
[^7]: These formal expressions are to be treated with caution as convergence issues may arise, see [@Widder] for more details.
|
{
"pile_set_name": "ArXiv"
}
|
Just this Tuesday, Thailand’s cabinet approved the transfer of three senior head officials from the country’s Ministry of Education amid a probe into alleged malfeasance in relation to the construction of the Songkhla Lake Aquaculture Research Centre, an aquarium and marine research centre in the southern province of Songkhla. This is the latest step in a high-profile corruption probe that the ministry is conducting.
The fact is the ministry has been engulfed in corruption scandals throughout the year. Earlier in March, an embezzlement scandal going back to 2008 involving scholarships from the Sema Phatthana Chiwit Fund worth US$3.7 million was exposed. Then in June, a preliminary investigation found irregularities in the school lunch programme allegedly committed by a school director in Surat Thani. Money was misappropriated and students were fed lunches consisting of nothing but noodles and fish sauce on some days.
Jacques Hallak and Muriel Poisson from the United Nations Educational, Scientific and Cultural Organization (UNESCO) once wrote that corruption in education is a system for personal gain which affects the quality of public goods and services, including the quality of education in different parts of the education system.
Meanwhile, Educational Policy and Administration expert David Chapman says that the more serious costs of corruption in education are incurred when children unable to afford bribes are denied access to schooling or examinations, talent is misallocated due to promotion being awarded on the basis of bribery rather than merit, and a generation of children come to believe that personal effort and merit do not count and that success comes through manipulation, favouritism and bribery.
A struggling system
Going by the Programme for International Student Assessment (PISA) scores for the last three surveys (2009, 2012 and 2015), Thailand’s education system has been struggling. In 2009, Thailand’s overall rank was 50th out of 65 countries, in 2012, Thailand was ranked 50th again out of 65 countries, and in 2015, it was ranked 54th out of 70 countries.
The World Economic Forum’s (WEF) Global Competitiveness Index 2017-2018, did not have anything different to say about the country’s education system either. For Higher Education and Training, Thailand was placed 57th out of 137 countries. Brunei was 67th, Cambodia was 124th, Indonesia was 64th, Lao was 105th, Malaysia was 45th, Myanmar was 108th, Philippines was 55th, Singapore was first and Vietnam was 84th.
If Hallak and Poisson were right in their assertion that corruption – especially in the education system - affects the quality of education, recent cases involving corruption in the education system in Thailand may indicate that this is one of the areas where the government should focus on if it intends to improve the quality of education; more so with the looming challenges of Industry 4.0 ahead.
Source: Cisco and Oxford Economics
Realising Thailand 4.0
According to a study by Cisco and Oxford Economics, Thailand could see 12 percent of its workforce (4.9 million people) losing their jobs by 2028. While the study has claimed that more jobs will be created because of the economic growth that comes with improved technology, it unfortunately also notes that ASEAN’s workforce, including that of Thailand’s, isn’t ready to fill in these new roles.
While Singapore fared poorly in the study which looked at the percentage of workers who could possibly lose their jobs to machines, it is already addressing the problem. Several different sectors including institutions of higher learning, the government and the private sector are coming together in order to create a highly-skilled Singapore workforce. Towards this end, innovation in education is also being discussed extensively.
Teerakiat Jareonsettasin, Thailand’s minister of education has consistently been trying to improve the standard of English in the country. He has also expressed his desire to infuse innovation into the curriculum in general. However, the biggest challenge he could be facing is the rampant corruption in the education system.
For one, funding allocated for new programmes might not be reaching the right people as the Sema Phatthana Chiwit Fund and Surat Thani school lunch programme scandals have shown. Another concern is that if corruption is rife in Thailand’s education system, then bribery too would also be possible, resulting in meritocracy taking a backseat.
If the government is truly committed to its Thailand 4.0 ambitions, then it will need to address corruption in the education system. While steps have been taken to clean up corruption in the past there is still much that needs to be done today. In order for Thais to make the leap to Thailand 4.0, then, corruption in education must be eradicated to ensure that meritocracy reigns supreme.
Related articles:
The push for better English
Corruption before and after the NCPO
|
{
"pile_set_name": "OpenWebText2"
}
|
Gopher
A gopher is a small rodent that plagues gardens. Derek Karlavaegen believes the Universe Interpreter may have been set up to scare gophers out of Crispin's vegetable garden, or that it may serve to both scare gophers and keep the stars aligned.[1]
|
{
"pile_set_name": "Pile-CC"
}
|
The disclosure of Japanese Patent Application No. 2001-11842 filed on Jan. 19, 2001 including the specification, drawings and abstract is incorporated herein by reference in its entirety.
1. Field of Invention
The invention relates to a reclining device. More specifically, the invention relates to the fitting of a seat back and a seat cushion.
2. Description of Related Art
A reclining device of a certain type is disclosed, for example, in Japanese Patent Application Laid-Open No. 8-253063. This reclining device is designed such that a cam body presses a plurality of slide pawls each having outer teeth on the front end side against an annular ratchet having inner teeth on the inner periphery side so that the slide pawls are brought into mesh with the ratchet and locked with respect thereto. Further, the operation of pressing the slide pawls against the ratchet is canceled by applying an arbitrary operational force to the cam body so that the slide pawls are retreated from the ratchet and brought out of mesh therewith.
The reclining device of this type is designed to prevent the ratchet from rotating relative to a holder when the slide pawls are locked with respect to the ratchet and to allow the ratchet to rotate relative to the holder when the slide pawls are unlocked from the ratchet. The reclining device of this type is disposed between a rear end portion of a seat cushion and a lower end portion of a seat back, thus constituting a vehicular reclining seat. For example, the reclining device of this type is designed such that the seat back is longitudinally tiltably supported with respect to the seat cushion by mounting the ratchet on the lower end side of the seat back and the holder on the rear end side of the seat cushion.
It is to be noted herein that the reclining device of this type confronts the following problem. If a great circumferential turning force is applied to the seat back constituting the reclining seat, the ratchet is also exposed to a great circumferential turning force, which acts on the slide pawls as radial and tangential components in the circumferential direction. The slide pawls are displaced both radially inwardly and circumferentially. As a result, the slide pawls may be brought out of mesh with the ratchet. Thus, the reclining device of this type requires that the slide pawls securely mesh with the ratchet when the slide pawls are locked with respect to the ratchet.
However, the reclining device according to the related art as disclosed in the aforementioned patent publication is designed to bear each of the slide pawls only at a single point, namely, at the center of a rear end portion thereof. Hence, if a great circumferential turning force is applied to the slide pawls from the ratchet, each of the slide pawls sways circumferentially upon its bearing portion for the cam body and becomes quite unstable although it is still maintained in mesh with the ratchet. Then, the slide pawls may be retreated from the ratchet, disengaged therefrom, and unlocked therefrom.
The invention thus improves the reclining device of the above-mentioned type such that the slide pawls are stably maintained in mesh with the ratchet and cannot be disengaged therefrom easily even if a great circumferential turning force is applied to the slide pawls from the ratchet. To achieve this object, the reclining device of the invention adopts a construction capable of securely maintaining the slide pawls in mesh with the ratchet, taking into account the configuration of the slide pawls and the manner in which the cam body bears the slide pawls.
A reclining device according to one exemplary aspect of the invention comprises a plurality of pawls, an annular ratchet, a cam body, and a holder. Each of the pawls has outer teeth formed on the front end side, first and second leg portions formed at opposed end portions, and a bearing portion formed between the first and second leg portions. The first and second leg portions extend toward the rear end side. The annular ratchet has inner teeth formed on the inner periphery side. The cam body comes into abutment at least on the bearing portion of each of the pawls and possibly on the leg portions and the bearing portion of each of the pawls. The cam body presses the pawls toward the ratchet so that the pawls are brought into mesh with the ratchet and locked with respect thereto and stops pressing the pawls so that the pawls are retreated from the ratchet and unlocked therefrom. The holder holds each of the pawls such that the pawl can move toward and away from the inner teeth of the ratchet, and rotates concentrically with respect to the ratchet. The cam body, which operates by an arbitrary operational force, releases the pressing force applied to the slide pawls and brings them out of mesh with the ratchet. The reclining device is designed to prevent the ratchet from rotating relative to the holder when the slide pawls are in mesh with the ratchet and to allow the ratchet to rotate relative to the holder when the slide pawls are out of mesh with the ratchet.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
The surgeon general says that abstinence education is not enough. Successful sex education must include both abstinence education as well as safe-sex practices. Educating students about using social-networking sites, and more broadly, the Internet requires just the same. While we acknowledge that the safest behavior is to abstain from social-networking communities, we also want those who enter them to do so with the knowledge to do so safely. This is my recreation of the Surgeon General’s report, but made for the online education we are working towards:
Provide access to education about online safety and appropriate use of the Internet that is thorough, wide-ranging, begins early, and continues throughout the lifespan. Such education should: recognize the special place that the online world has in the lives of young people stress the value and benefits of being online anonymously until involved in a community where one feels confident that information is protected and secure * assure awareness of optimal protection from online dangers for those who participate in online communities, while stressing that there are no infallible methods of protection except “abstinence,” and that restricted communities can still leave one’s information exposed
|
{
"pile_set_name": "Pile-CC"
}
|
Rolaids recalls 13 million packages
Johnson & Johnson's McNeil unit is recalling more than 13 million packages of Rolaids after consumers complained of metal and wooden particles.
NEW YORK (CNNMoney.com) -- Johnson & Johnson's McNeil division announced a recall Thursday of more than 13 million packages of various Rolaids medicines following consumer complaints of foreign materials, including metal and wood particles.
McNeil Consumer Healthcare, which makes over-the-counter drugs such as Tylenol, Rolaids, and Benadryl, said it was recalling all lots of Rolaids Extra Strength Softchews, Rolaids Extra Strength plus Gas Softchews, and Rolaids Multi-Symptom plus Anti-Gas Softchews distributed in the United States.
This is the latest in a string of recalls this year by McNeil of other non-prescription drugs including Tylenol, Motrin, and Benadryl.
McNeil spokesman Marc Boston said the Rolaids recalls involve products that were made for McNeil by a third-party manufacturer.
The company said it has suspended production of the recalled medicines while it investigates the matter and subsequently implements corrective actions.
The Johnson & Johnson (JNJ, Fortune 500) unit said its investigation has determined that the materials were potentially introduced into the product during the manufacturing process.
McNeil said that while the risk of serious adverse health consequences is remote, it is advising consumers who have purchased these recalled products to discontinue use.
Consumers who purchased the recalled products should contact McNeil Consumer Healthcare, either at http://www.rolaids.com/ or by calling 1-888-222-6036 about receiving a refund.
The company said consumers who have medical concerns or questions should contact their health care provider.
|
{
"pile_set_name": "OpenWebText2"
}
|
Distribution of molecular size within an unfolded state ensemble using small-angle X-ray scattering and pulse field gradient NMR techniques.
The size distribution of molecules within an unfolded state of the N-terminal SH3 domain of drk (drkN SH3) has been studied by small-angle X-ray scattering (SAXS) and pulsed-field-gradient NMR (PFG-NMR) methods. An empirical model to describe this distribution in the unfolded state ensemble has been proposed based on (i) the ensemble-averaged radius of gyration and hydrodynamic radius derived from the SAXS and PFG-NMR data, respectively, and (ii) a histogram of the size distribution of structures obtained from preliminary analyses of structural parameters recorded on the unfolded state. Results show that this unfolded state, U(exch), which exists in equilibrium with the folded state, F(exch), under non-denaturing conditions, is relatively compact, with the average size of conformers within the unfolded state ensemble only 30-40% larger than the folded state structure. In addition, the model predicts a significant overlap in the size range of structures comprising the U(exch) state with those in a denatured state obtained by addition of 2 M guanidinium chloride.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
A hilarious new video shows what happens when you let the internet control a robot stuck inside a demo room.
The robot in question is a telepresence robot called the Double, which is basically an iPad mounted on a pole with wheels, which can then be remotely controlled by someone outside of the office.
The company that makes the Double, Double Robotics, set up a demo room where anyone online can take one of its robots for a test drive.
One of the internet users, however, soon grew bored of the demo room and began to hatch an escape plan.
The door to the demo room is usually kept closed with a latch, but one day the door was left unlocked, which then allowed the man to slowly but surely use the robot to open the door wide enough for the robot to slip past.
Once free, the robot is free to explore the vacant offices on its own.
Unfortunately, the robot can't quite make it into the great outdoors due to a closed front door, but it manages to explore most of the offices before returning to the demo room and closing the door, leaving Double Robotics to discover its escape when they see the clip online like everyone else.
You can watch the robot's escape and resulting joy ride through the office below, or test out a Double for yourself right here.
We first saw this video on Reddit.
|
{
"pile_set_name": "OpenWebText2"
}
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import logging
logger = logging.getLogger(__name__)
logger.debug("%s loaded", __name__)
def get(*args, **kwargs):
try:
if len(kwargs['name']) == 0: kwargs['name'] = ['']
if len(kwargs['value']) == 0: kwargs['value'] = ['']
webserver = kwargs['DoorPiObject'].webserver
status = {}
for name_requested in kwargs['name']:
if name_requested in 'config_status':
status['config_status'] = webserver.config_status
if name_requested in 'session_ids':
status['session_ids'] = webserver.sessions.session_ids
if name_requested in 'sessions':
status['sessions'] = webserver.sessions.sessions
if name_requested in 'running':
status['running'] = True if webserver and webserver.keep_running else False
if name_requested in 'server_name':
status['server_name'] = webserver.server_name
if name_requested in 'server_port':
status['server_port'] = webserver.server_port
return status
except Exception as exp:
logger.exception(exp)
return {'Error': 'could not create '+str(__name__)+' object - '+str(exp)}
def is_active(doorpi_object):
return True if doorpi_object.webserver else False
|
{
"pile_set_name": "Github"
}
|
Detection and measurement of alternative splicing using splicing-sensitive microarrays.
Splicing and alternative splicing are major processes in the interpretation and expression of genetic information for metazoan organisms. The study of splicing is moving from focused attention on the regulatory mechanisms of a selected set of paradigmatic alternative splicing events to questions of global integration of splicing regulation with genome and cell function. For this reason, parallel methods for detecting and measuring alternative splicing are necessary. We have adapted the splicing-sensitive oligonucleotide microarrays used to estimate splicing efficiency in yeast to the study of alternative splicing in vertebrate cells and tissues. We use gene models incorporating knowledge about splicing to design oligonucleotides specific for discriminating alternatively spliced mRNAs from each other. Here we present the main strategies for design, application, and analysis of spotted oligonucleotide arrays for detection and measurement of alternative splicing. We demonstrate these strategies using a two-intron yeast gene that has been altered to produce different amounts of alternatively spliced RNAs, as well as by profiling alternative splicing in NCI 60 cancer cell lines.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
How to find connected edges from a list of edges in Matlab
I have a list of edges as follows.
75 77
77 78
78 79
60 63
61 65
65 67
57 62
62 64
67 81
81 85
I want to separate the connected edges as follows.
75 60 61 57
77 63 65 62
78 67 64
79 81
85
I wrote the following code in Matlab.
edges = [75 77; 77 78; 78 79; 60 63; 61 65; 65 67; 57 62; 62 64; 67 81; 81 85];
visited = zeros(size(edges,1),1);
cEdges = [];
cEdgesC = 1;
cEdges(1,cEdgesC) = edges(1,1);
cEdges(2,cEdgesC) = edges(1,2);
visited(1,1) = 1;
orgR = 1;
orgC = 2;
while sum(visited) <= size(visited,1)
cEdgesR = nnz(cEdges(:,cEdgesC));
currentVertex = cEdges(cEdgesR,cEdgesC);
fprintf('\n%d\t%d',cEdgesR,currentVertex);
[foundR,foundC] = find(edges==currentVertex);
foundR(foundR==orgR) = [];
foundC(foundC==orgC) = [];
while isempty(foundR)
fmt=repmat('%d ',1,cEdgesR);
fprintf('\nLoop found: ');
fprintf(fmt,(cEdges(:,cEdgesC))');
cEdgesC = cEdgesC+1;
orgR = find(visited==0, 1, 'first');
orgC = 1;
cEdges(1,cEdgesC) = edges(orgR,orgC);
cEdges(2,cEdgesC) = edges(orgR,orgC+1);
visited(orgR,1) = 1;
cEdgesR = nnz(cEdges(:,cEdgesC));
currentVertex = cEdges(2,cEdgesC);
fprintf('\n%d\t%d',cEdgesR,currentVertex);
[foundR,foundC]=find(edges==currentVertex);
foundR(foundR==orgR) = [];
foundC(foundC==orgC) = [];
if isempty(foundR)
// What to do here?
end
end
fprintf('\t%d\t%d',foundR,foundC);
orgR = foundR;
if foundC == 1
cEdges(cEdgesR+1,1) = edges(foundR,foundC+1);
orgC = foundC+1;
else
cEdges(cEdgesR+1,1) = edges(foundR,foundC-1);
orgC = foundC-1;
end
visited(foundR,1) = 1;
end
The code runs in a loop with no stop. I feel problem is at the end of inner while loop. How may I jump back to the beginning of inner while loop if the same condition is met at the end again? Thank you.
Edit:
Example larger matrix of edges.
A:
If you not consider cyclic cases and backward connection than this should be easy problem.
edges = [75 77; 77 78; 78 79; 60 63; 61 65; 65 67; 57 62; 62 64; 67 81; 81 85];
NumEdges=size(edges,1);
visited = false(NumEdges,1);
List=cell(0);
k=0;
for i=1:NumEdges
if ~visited(i)
k=k+1;
List{k}=edges(i,1);
Idx=i;
while ~isempty(Idx)
visited(Idx)=true;
List{k}(end+1)=edges(Idx,2);
Idx=find(edges(:,1)==edges(Idx,2) & ~visited,1);
end
end
end
celldisp(List)
|
{
"pile_set_name": "StackExchange"
}
|
/********************************************************************
* AUTHORS: Vijay Ganesh, Trevor Hansen, Andrew V. Jones
*
* BEGIN DATE: November, 2005
*
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
********************************************************************/
#include "stp/STPManager/STP.h"
#include "stp/Simplifier/constantBitP/ConstantBitPropagation.h"
#include "stp/Simplifier/constantBitP/NodeToFixedBitsMap.h"
#include "stp/ToSat/ToSATAIG.h"
#include "stp/Simplifier/UpwardsCBitP.h"
#ifdef USE_CRYPTOMINISAT
#include "stp/Sat/CryptoMinisat5.h"
#endif
#ifdef USE_RISS
#include "stp/Sat/Riss.h"
#endif
#include "stp/Sat/MinisatCore.h"
#include "stp/Sat/SimplifyingMinisat.h"
#include "stp/Simplifier/AIGSimplifyPropositionalCore.h"
#include "stp/Simplifier/AlwaysTrue.h"
#include "stp/Simplifier/DifficultyScore.h"
#include "stp/Simplifier/FindPureLiterals.h"
#include "stp/Simplifier/RemoveUnconstrained.h"
#include "stp/Simplifier/UnsignedIntervalAnalysis.h"
#include "stp/Simplifier/UseITEContext.h"
#include <memory>
using std::cout;
namespace stp
{
const static string cb_message = "After Constant Bit Propagation. ";
const static string bb_message = "After Bitblast simplification. ";
const static string uc_message = "After Removing Unconstrained. ";
const static string int_message = "After Unsigned Interval Analysis. ";
const static string pl_message = "After Pure Literals. ";
const static string bitvec_message = "After Bit-vector Solving. ";
const static string size_inc_message = "After Speculative Simplifications. ";
const static string pe_message = "After Propagating Equalities. ";
SOLVER_RETURN_TYPE STP::solve_by_sat_solver(SATSolver* newS,
ASTNode original_input)
{
SATSolver& NewSolver = *newS;
if (bm->UserFlags.stats_flag)
NewSolver.setVerbosity(1);
if (bm->UserFlags.timeout_max_conflicts >= 0)
newS->setMaxConflicts(bm->UserFlags.timeout_max_conflicts);
if (bm->UserFlags.timeout_max_time >= 0)
newS->setMaxTime(bm->UserFlags.timeout_max_time);
// reset the timeout expired flag for the new check
bm->soft_timeout_expired = false;
SOLVER_RETURN_TYPE result = TopLevelSTPAux(NewSolver, original_input);
return result;
}
SATSolver* STP::get_new_sat_solver()
{
SATSolver* newS = NULL;
switch (bm->UserFlags.solver_to_use)
{
case UserDefinedFlags::SIMPLIFYING_MINISAT_SOLVER:
newS = new SimplifyingMinisat;
break;
case UserDefinedFlags::CRYPTOMINISAT5_SOLVER:
#ifdef USE_CRYPTOMINISAT
newS = new CryptoMiniSat5(bm->UserFlags.num_solver_threads);
#else
std::cerr << "CryptoMiniSat5 support was not enabled at configure time."
<< std::endl;
exit(-1);
#endif
break;
case UserDefinedFlags::RISS_SOLVER:
#ifdef USE_RISS
newS = new RissCore();
#else
std::cerr << "Riss support was not enabled at configure time."
<< std::endl;
exit(-1);
#endif
break;
case UserDefinedFlags::MINISAT_SOLVER:
newS = new MinisatCore;
break;
default:
std::cerr << "ERROR: Undefined solver to use." << endl;
exit(-1);
break;
};
return newS;
}
// The absolute TopLevel function that invokes STP on the input
// formula
SOLVER_RETURN_TYPE STP::TopLevelSTP(const ASTNode& inputasserts,
const ASTNode& query)
{
// Unfortunatey this is a global variable,which the aux function needs to
// overwrite sometimes.
bool saved_ack = bm->UserFlags.ackermannisation;
ASTNode original_input;
if (query != bm->ASTFalse)
{
original_input =
bm->CreateNode(AND, inputasserts, bm->CreateNode(NOT, query));
}
else
{
original_input = inputasserts;
}
SATSolver* newS = get_new_sat_solver();
SOLVER_RETURN_TYPE result = solve_by_sat_solver(newS, original_input);
delete newS;
bm->UserFlags.ackermannisation = saved_ack;
return result;
}
ASTNode STP::callSizeReducing(ASTNode inputToSat, BVSolver* bvSolver,
PropagateEqualities* pe,
const long initial_difficulty_score,
long& actualBBSize)
{
while (true)
{
ASTNode last = inputToSat;
inputToSat = sizeReducing(last, bvSolver, pe);
if (last == inputToSat)
break;
}
actualBBSize = -1;
// Expensive, so only want to do it once.
if (bm->UserFlags.enable_bitblast_simplification &&
initial_difficulty_score < 250000)
{
BBNodeManagerAIG bitblast_nodemgr;
BitBlaster<BBNodeAIG, BBNodeManagerAIG> bb(
&bitblast_nodemgr, simp, bm->defaultNodeFactory, &(bm->UserFlags));
ASTNodeMap fromTo;
ASTNodeMap equivs;
bb.getConsts(inputToSat, fromTo, equivs);
if (equivs.size() > 0)
{
/* These nodes have equivalent AIG representations, so even though they
* have different
* word level expressions they are identical semantically. So we pick one
* of the ASTnodes
* and replace the others with it.
* TODO: I replace with the lower id node, sometimes though we replace
* with much more
* difficult looking ASTNodes.
*/
ASTNodeMap cache;
inputToSat = SubstitutionMap::replace(
inputToSat, equivs, cache, bm->defaultNodeFactory, false, true);
bm->ASTNodeStats(bb_message.c_str(), inputToSat);
}
if (fromTo.size() > 0)
{
ASTNodeMap cache;
inputToSat = SubstitutionMap::replace(inputToSat, fromTo, cache,
bm->defaultNodeFactory);
bm->ASTNodeStats(bb_message.c_str(), inputToSat);
}
actualBBSize = bitblast_nodemgr.totalNumberOfNodes();
}
return inputToSat;
}
// These transformations should never increase the size of the DAG.
ASTNode STP::sizeReducing(ASTNode inputToSat, BVSolver* bvSolver,
PropagateEqualities* pe)
{
inputToSat = pe->topLevel(inputToSat, arrayTransformer);
if (simp->hasUnappliedSubstitutions())
{
inputToSat = simp->applySubstitutionMap(inputToSat);
simp->haveAppliedSubstitutionMap();
bm->ASTNodeStats(pe_message.c_str(), inputToSat);
}
if (bm->UserFlags.enable_unconstrained)
{
// Remove unconstrained.
RemoveUnconstrained r1(*bm);
inputToSat = r1.topLevel(inputToSat, simp);
bm->ASTNodeStats(uc_message.c_str(), inputToSat);
}
if (bm->UserFlags.enable_use_intervals)
{
UnsignedIntervalAnalysis intervals(*bm);
inputToSat = intervals.topLevel_unsignedIntervals(inputToSat);
bm->ASTNodeStats(int_message.c_str(), inputToSat);
}
if (bm->UserFlags.bitConstantProp_flag)
{
bm->GetRunTimes()->start(RunTimes::ConstantBitPropagation);
UpwardsCBitP cb(bm);
inputToSat = cb.topLevel(inputToSat);
bm->GetRunTimes()->stop(RunTimes::ConstantBitPropagation);
if (simp->hasUnappliedSubstitutions())
{
inputToSat = simp->applySubstitutionMap(inputToSat);
simp->haveAppliedSubstitutionMap();
}
bm->ASTNodeStats(cb_message.c_str(), inputToSat);
}
// Find pure literals.
if (bm->UserFlags.enable_pure_literals)
{
FindPureLiterals fpl;
bool changed = fpl.topLevel(inputToSat, simp, bm);
if (changed)
{
inputToSat = simp->applySubstitutionMap(inputToSat);
simp->haveAppliedSubstitutionMap();
bm->ASTNodeStats(pl_message.c_str(), inputToSat);
}
}
if (bm->UserFlags.enable_always_true)
{
AlwaysTrue always(simp, bm, bm->defaultNodeFactory);
inputToSat = always.topLevel(inputToSat);
bm->ASTNodeStats("After removing always true: ", inputToSat);
}
if (bm->UserFlags.wordlevel_solve_flag && bm->UserFlags.optimize_flag)
{
inputToSat = bvSolver->TopLevelBVSolve(inputToSat, false);
bm->ASTNodeStats(bitvec_message.c_str(), inputToSat);
}
return inputToSat;
}
// Acceps a query, calls the SAT solver and generates Valid/InValid.
// if returned 0 then input is INVALID if returned 1 then input is
// VALID if returned 2 then UNDECIDED
SOLVER_RETURN_TYPE
STP::TopLevelSTPAux(SATSolver& NewSolver, const ASTNode& original_input)
{
bm->ASTNodeStats("input asserts and query: ", original_input);
DifficultyScore difficulty;
if (bm->UserFlags.stats_flag)
cerr << "Difficulty Initially:" << difficulty.score(original_input, bm)
<< endl;
// A heap object so I can easily control its lifetime.
std::unique_ptr<BVSolver> bvSolver(new BVSolver(bm, simp));
std::unique_ptr<PropagateEqualities> pe(
new PropagateEqualities(simp, bm->defaultNodeFactory, bm));
ASTNode inputToSat = original_input;
// If the number of array reads is small. We rewrite them through.
// The bit-vector simplifications are more thorough than the array
// simplifications. For example,
// we don't currently do unconstrained elimination on arrays--- but we do for
// bit-vectors.
// A better way to do this would be to estimate the number of axioms
// introduced.
// TODO: I chose the number of reads we perform this operation at randomly.
bool removed = false;
if ((bm->UserFlags.ackermannisation &&
numberOfReadsLessThan(inputToSat, 50)) ||
numberOfReadsLessThan(inputToSat, 10))
{
// If the number of axioms that would be added it small. Remove them.
bm->UserFlags.ackermannisation = true;
inputToSat = arrayTransformer->TransformFormula_TopLevel(inputToSat);
if (bm->UserFlags.stats_flag)
{
cerr << "Have removed array operations" << endl;
}
removed = true;
}
const bool arrayops = containsArrayOps(inputToSat, bm);
if (removed)
{
assert(!arrayops);
}
if (bm->UserFlags.check_counterexample_flag ||
bm->UserFlags.print_counterexample_flag || (arrayops && !removed))
bm->UserFlags.construct_counterexample_flag = true;
else
bm->UserFlags.construct_counterexample_flag = false;
#ifndef NDEBUG
bm->UserFlags.construct_counterexample_flag = true;
#endif
// Run size reducing just once.
inputToSat = sizeReducing(inputToSat, bvSolver.get(), pe.get());
long initial_difficulty_score = difficulty.score(inputToSat, bm);
long bitblasted_difficulty = -1;
// Fixed point it if it's not too difficult.
// Currently we discards all the state each time sizeReducing is called,
// so it's expensive to call.
if ((!arrayops && initial_difficulty_score < 1000000))
{
inputToSat =
callSizeReducing(inputToSat, bvSolver.get(), pe.get(),
initial_difficulty_score, bitblasted_difficulty);
}
if (!arrayops || bm->UserFlags.array_difficulty_reversion)
{
initial_difficulty_score = difficulty.score(inputToSat, bm);
}
if (bitblasted_difficulty != -1 && bm->UserFlags.stats_flag)
cout << "Initial Bitblasted size:" << bitblasted_difficulty << endl;
if (bm->UserFlags.stats_flag)
cout << "Difficulty After Size reducing:" << initial_difficulty_score
<< endl;
// So we can delete the object and release all the hash-buckets storage.
std::unique_ptr<Revert_to> revert(new Revert_to());
if (!arrayops || bm->UserFlags.array_difficulty_reversion)
{
revert->initialSolverMap.insert(simp->Return_SolverMap()->begin(),
simp->Return_SolverMap()->end());
revert->backup_arrayToIndexToRead.insert(
arrayTransformer->arrayToIndexToRead.begin(),
arrayTransformer->arrayToIndexToRead.end());
revert->toRevertTo = inputToSat;
}
// round of substitution, solving, and simplification. ensures that
// DAG is minimized as much as possibly, and ideally should
// garuntee that all liketerms in BVPLUSes have been combined.
bm->SimplifyWrites_InPlace_Flag = false;
bm->TermsAlreadySeenMap_Clear();
ASTNode tmp_inputToSAT;
do
{
tmp_inputToSAT = inputToSat;
if (bm->soft_timeout_expired)
return SOLVER_TIMEOUT;
if (bm->UserFlags.optimize_flag)
{
inputToSat = pe->topLevel(inputToSat, arrayTransformer);
// Imagine:
// The simplifier simplifies (0 + T) to T
// Then bvsolve introduces (0 + T)
// Then CreateSubstitutionMap decides T maps to a constant, but leaving
// another (0+T).
// When we go to simplify (0 + T) will still be in the simplify cache, so
// will be mapped to T.
// But it shouldn't be T, it should be a constant.
// Applying the substitution map fixes this case.
//
if (simp->hasUnappliedSubstitutions())
{
inputToSat = simp->applySubstitutionMap(inputToSat);
simp->haveAppliedSubstitutionMap();
}
bm->ASTNodeStats(pe_message.c_str(), inputToSat);
inputToSat = simp->SimplifyFormula_TopLevel(inputToSat, false);
bm->ASTNodeStats(size_inc_message.c_str(), inputToSat);
}
if (bm->UserFlags.wordlevel_solve_flag && bm->UserFlags.optimize_flag)
{
inputToSat = bvSolver->TopLevelBVSolve(inputToSat);
bm->ASTNodeStats(bitvec_message.c_str(), inputToSat);
}
} while (tmp_inputToSAT != inputToSat);
if (bm->UserFlags.bitConstantProp_flag)
{
bm->GetRunTimes()->start(RunTimes::ConstantBitPropagation);
simplifier::constantBitP::ConstantBitPropagation cb(
bm, simp, bm->defaultNodeFactory, inputToSat);
inputToSat = cb.topLevelBothWays(inputToSat);
bm->GetRunTimes()->stop(RunTimes::ConstantBitPropagation);
if (cb.isUnsatisfiable())
{
inputToSat = bm->ASTFalse;
}
bm->ASTNodeStats(cb_message.c_str(), inputToSat);
}
if (bm->UserFlags.enable_use_intervals)
{
UnsignedIntervalAnalysis intervals(*bm);
inputToSat = intervals.topLevel_unsignedIntervals(inputToSat);
bm->ASTNodeStats(int_message.c_str(), inputToSat);
}
// Find pure literals.
if (bm->UserFlags.enable_pure_literals)
{
FindPureLiterals fpl;
bool changed = fpl.topLevel(inputToSat, simp, bm);
if (changed)
{
inputToSat = simp->applySubstitutionMap(inputToSat);
simp->haveAppliedSubstitutionMap();
bm->ASTNodeStats(pl_message.c_str(), inputToSat);
}
}
if (bm->soft_timeout_expired)
return SOLVER_TIMEOUT;
// Simplify using Ite context
if (bm->UserFlags.optimize_flag && bm->UserFlags.enable_ite_context)
{
UseITEContext iteC(bm);
inputToSat = iteC.topLevel(inputToSat);
bm->ASTNodeStats("After ITE Context: ", inputToSat);
}
if (bm->UserFlags.enable_aig_core_simplify)
{
AIGSimplifyPropositionalCore aigRR(bm);
inputToSat = aigRR.topLevel(inputToSat);
bm->ASTNodeStats("After AIG Core: ", inputToSat);
}
if (bm->UserFlags.enable_unconstrained)
{
// Remove unconstrained.
RemoveUnconstrained r(*bm);
inputToSat = r.topLevel(inputToSat, simp);
bm->ASTNodeStats(uc_message.c_str(), inputToSat);
}
bm->TermsAlreadySeenMap_Clear();
bm->SimplifyWrites_InPlace_Flag = false;
long final_difficulty_score = difficulty.score(inputToSat, bm);
bool worse = false;
if (final_difficulty_score > .8 * initial_difficulty_score)
worse = true;
// It's of course very wasteful to do this! Later I'll make it reuse the
// work..We bit-blast again, in order to throw it away, so that we can
// measure whether the number of AIG nodes is smaller. The difficulty score
// is sometimes completelywrong, the sage-app7 are the motivating examples.
// The other way to improve it would be to fix the difficulty scorer!
if (!worse && (bitblasted_difficulty != -1))
{
BBNodeManagerAIG bitblast_nodemgr;
BitBlaster<BBNodeAIG, BBNodeManagerAIG> bb(
&bitblast_nodemgr, simp, bm->defaultNodeFactory, &(bm->UserFlags));
bb.BBForm(inputToSat);
int newBB = bitblast_nodemgr.totalNumberOfNodes();
if (bm->UserFlags.stats_flag)
cerr << "Final BB Size:" << newBB << endl;
if (bitblasted_difficulty < newBB)
worse = true;
}
if (bm->UserFlags.stats_flag)
{
cerr << "(3) Initial/Final Difficulty Score:" << initial_difficulty_score << " / " << final_difficulty_score << endl;
}
bool optimize_enabled = bm->UserFlags.optimize_flag;
if (worse && (!arrayops || bm->UserFlags.array_difficulty_reversion) &&
bm->UserFlags.difficulty_reversion)
{
// If the simplified problem is harder, than the
// initial problem we revert back to the initial
// problem.
if (bm->UserFlags.stats_flag)
cerr << "simplification made the problem harder, reverting." << endl;
inputToSat = revert->toRevertTo;
// I do this to clear the substitution/solver map.
// Not sure what would happen if it contained simplifications
// that haven't been applied.
simp->ClearAllTables();
simp->Return_SolverMap()->insert(revert->initialSolverMap.begin(),
revert->initialSolverMap.end());
revert->initialSolverMap.clear();
// Copy back what we knew about arrays at the start..
arrayTransformer->arrayToIndexToRead.clear();
arrayTransformer->arrayToIndexToRead.insert(
revert->backup_arrayToIndexToRead.begin(),
revert->backup_arrayToIndexToRead.end());
// The arrayTransformer calls simplify. We don't want
// it to put back in all the bad simplifications.
bm->UserFlags.optimize_flag = false;
}
revert.reset(NULL);
inputToSat = arrayTransformer->TransformFormula_TopLevel(inputToSat);
bm->ASTNodeStats("after transformation: ", inputToSat);
bm->TermsAlreadySeenMap_Clear();
bm->UserFlags.optimize_flag = optimize_enabled;
SOLVER_RETURN_TYPE res;
if (!bm->UserFlags.ackermannisation)
{
bm->counterexample_checking_during_refinement = true;
}
// We are about to solve. Clear out all the memory associated with caches
// that we won't need again.
simp->ClearCaches();
simp->haveAppliedSubstitutionMap();
bm->ClearAllTables();
// Deleting it clears out all the buckets associated with hashmaps etc. too.
bvSolver.reset(NULL);
pe.reset(NULL);
if (bm->UserFlags.stats_flag)
simp->printCacheStatus();
const bool maybeRefinement = arrayops && !bm->UserFlags.ackermannisation;
simplifier::constantBitP::ConstantBitPropagation* cb = NULL;
std::unique_ptr<simplifier::constantBitP::ConstantBitPropagation> cleaner;
if (bm->UserFlags.bitConstantProp_flag)
{
bm->GetRunTimes()->start(RunTimes::ConstantBitPropagation);
cb = new simplifier::constantBitP::ConstantBitPropagation(
bm, simp, bm->defaultNodeFactory, inputToSat);
cleaner.reset(cb);
bm->GetRunTimes()->stop(RunTimes::ConstantBitPropagation);
bm->ASTNodeStats(cb_message.c_str(), inputToSat);
if (cb->isUnsatisfiable())
inputToSat = bm->ASTFalse;
}
ToSATAIG toSATAIG(bm, cb, arrayTransformer);
ToSATBase* satBase = bm->UserFlags.traditional_cnf ? tosat : &toSATAIG;
if (bm->soft_timeout_expired)
return SOLVER_TIMEOUT;
NewSolver.enableRefinement(maybeRefinement);
if (bm->UserFlags.stats_flag)
bm->print_stats();
// If it doesn't contain array operations, use ABC's CNF generation.
res = Ctr_Example->CallSAT_ResultCheck(NewSolver, inputToSat, original_input,
satBase, maybeRefinement);
if (bm->soft_timeout_expired)
{
if (toSATAIG.cbIsDestructed())
cleaner.release();
return SOLVER_TIMEOUT;
}
if (SOLVER_UNDECIDED != res)
{
// If the aig converter knows that it is never going to be called again,
// it deletes the constant bit stuff before calling the SAT solver.
if (toSATAIG.cbIsDestructed())
cleaner.release();
CountersAndStats("print_func_stats", bm);
return res;
}
// should only go to abstraction refinement if there are array ops.
assert(arrayops);
assert(!bm->UserFlags.ackermannisation); // Refinement must be enabled too.
res = Ctr_Example->SATBased_ArrayReadRefinement(NewSolver, original_input,
satBase);
if (SOLVER_UNDECIDED != res)
{
if (toSATAIG.cbIsDestructed())
cleaner.release();
CountersAndStats("print_func_stats", bm);
return res;
}
FatalError("TopLevelSTPAux: reached the end without proper conclusion:"
"a bug in STP");
// bogus return to make the compiler shut up
return SOLVER_ERROR;
}
} // end of namespace
|
{
"pile_set_name": "Github"
}
|
Q:
How do I change an animation for an object while it is already animating?
So, right now I have a rocket which bounces side to side across the bottom of the iphone 5 screen. I want the rocket however to stop moving side to side but to go upwards once the user touches the screen (so touching the screen makes the rocket take off).
First, in viewDidAppear I told the compiler to run the spawnRocket method after 2 seconds.
In the spawnRocket method I established the rockets image and frame, and then I added it to the view and performed a uiview animation sending the rocket to the right side of the screen. In the finished parameter in the uiview animation method I told the compiler to run the moveRocketLeft method.
In the moveRocketLeft method I did an animation which would send the rocket to the left of the screen, and in the finished parameter I ran the moveRocketRight method.
The moveRocketMethod is basically the spawnRocket method except I don't establish the rockets image and frame and add it to the view.
So after all this, I tried to implemented the -touchesBegan:withEvent: method. I tried simply running a uiview animation which changed the rockets y to off the screen upwards, and the x to whatever the x was currently at when the user touched the screen.
However, I realize that the calling the rockets frame does not return the location that the rocket looks like while animating. It really just returns what the rockets frame will be when its done animating. So, to get the frame I want should I call layer? I remember reading somewhere that layer will return the actual location of a uiimageview during an animation.
But, layer only has the property bounds and not frame, so I'm a little confused.
I also tried calling [self.view.layer removeAllAnimations]; and then running a new animation which would shoot the awkward up, but the removeAllAnimations method never worked (and anyway i don't really like the idea of using that because i heard it lags).
So anyone have any idea how i can implement touchesBegan:withEvent: method so that the rocket can take off correctly? (or if you think I have to change my whole program please feel free to help)
#import "ViewController.h"
#import <QuartzCore/QuartzCore.h>
@interface ViewController ()
@property UIImageView *rocket;
@end
@implementation ViewController
@synthesize rocket=_rocket;
- (void)viewDidLoad
{
[super viewDidLoad];
}
-(void)touchesBegan:(NSSet *)touches withEvent:(UIEvent *)event{
[self.view.layer removeAllAnimations];
// [UIView animateWithDuration:3 delay:0 options:UIViewAnimationOptionCurveEaseIn animations:^(){self.rocket.frame=CGRectMake(self.rocket.frame.origin.x, -40, 25, 40);} completion:^(BOOL finished){}];
// this didn't work :(
}
-(void)viewDidAppear:(BOOL)animated{
[self performSelector:@selector(spawnRocket) withObject:self afterDelay:2];
}
-(void)spawnRocket{
self.rocket=[[UIImageView alloc]initWithImage:[UIImage imageNamed:@"default.png"]]; //places imageview right off screen
self.rocket.frame=CGRectMake(-25, 420, 25, 40);
[self.view addSubview:self.rocket];
[UIView animateWithDuration:1.5 delay:0 options:UIViewAnimationOptionCurveLinear animations:^(){self.rocket.frame=CGRectMake(295, 420, 25, 40);} completion:^(BOOL finished){if (finished)[self moveRocketLeft]; }];
}
-(void) moveRocketLeft{
[UIView animateWithDuration:1.5 delay:0 options:UIViewAnimationOptionCurveLinear animations:^(){self.rocket.frame=CGRectMake(0, 420, 25, 40);} completion:^(BOOL finished){if (finished)[self moveRocketRight];}];
}
-(void)moveRocketRight{
[UIView animateWithDuration:1.5 delay:0 options:UIViewAnimationOptionCurveLinear animations:^(){self.rocket.frame=CGRectMake(295, 420, 25, 40);} completion:^(BOOL finished){if (finished)[self moveRocketLeft];}];
}
- (void)didReceiveMemoryWarning
{
[super didReceiveMemoryWarning];
// Dispose of any resources that can be recreated.
}
@end
A:
This should do the trick
-(void)touchesBegan:(NSSet *)touches withEvent:(UIEvent *)event{
CALayer *rocketPresentationLayer = [self.rocket.layer presentationLayer];
self.rocket.layer.position = rocketPresentationLayer.position;
[UIView animateWithDuration:3 delay:0 options:UIViewAnimationOptionCurveEaseIn|UIViewAnimationOptionBeginFromCurrentState animations:^(){self.rocket.frame=CGRectMake(self.rocket.frame.origin.x, -40, 25, 40);} completion:^(BOOL finished){}];
}
Note 1: I didn't put logic in here to check whether the user tapped the rocket again, when it is taking off vertically. You might want to add a BOOL or something to see if the user successfully hit the rocket or not, and if so, don't perform the vertical animation again.
Note 2: If in future you only want this to occur when the rocket is hit, you can use hitTest checking to call the animation conditionally.
// Get the touch
UITouch *touch = [touches anyObject];
CGPoint touchPoint = [touch locationInView:self.view];
// See if we hit the rocket
CALayer *rocketPresentationLayer = [self.rocket.layer presentationLayer];
CALayer* hitTest = [rocketPresentationLayer hitTest:touchPoint];
// If we did, then stop animation and move upwards
if (hitTest) {
....
}
P.S: Also as a slight mention, @property UIImageView *rocket; should be changed to @property (nonatomic) UIImageView *rocket;. This is primarily for performance reasons, as I don't expect your rocket to be accessed by multiple threads (it shouldn't, it's the UI!).
|
{
"pile_set_name": "StackExchange"
}
|
The present invention relates generally to imaging devices, and more particularly to a light guide for an array of detectors in an imaging device.
In certain types of imaging devices, such as positron emission tomography (PET) scanners, arrays of detector elements serve the function of detecting radiation emanating from the patient. In a PET scanner, for example, arrays of scintillator crystals detect gamma rays which are generated inside the patient. The gamma rays are produced when a positron emitted from a radiopharmaceutical injected into the patient collides with an electron causing an annihilation event. The scintillator crystals receive the gamma rays and generate photons in response to the gamma rays.
One of the challenges in designing a high resolution PET scanner relates to the space requirements of the electronics associated with the detector crystals, in particular the photomultiplier tubes (PMTs) which are situated behind the detector crystals. The function of the photomultiplier tubes is to receive photons produced by the scintillator crystals and to generate an analog signal with a magnitude representative of the number of photons received. The photomultiplier tubes typically cannot be diminished in size beyond a certain point, so that generally each photomultiplier tube is situated behind a number of smaller detector crystals. For example, a detector module in a PET scanner may comprise a 2×2 array of photomultiplier tubes situated behind a 6×6 array of scintillator crystals. In response to a scintillation event, each PMT produces an analog signal which is representative of the number of photons it has received. The relative magnitudes of the four PMT signals are then used to determine where the scintillation event took place and which crystal detected the event.
In determining the location of the scintillation event, it is generally advantageous to have a high degree of separation of the relative signal levels arising from each of the individual scintillation crystals in the detector array. Various arrangements have been proposed for increasing the spatial resolution of the detector crystals by controlling the light distribution within the detector array. For example the light distribution within the array of detector crystals can be controlled by applying various surface finishes having known light scattering and reflective properties to each crystal. These arrangements generally attempt to control the light distribution such that the proportion of light reaching each photomultiplier tube is relatively consistent and well defined for each event occurring at a particular detector crystal. In this way, the analog signals from the photomultiplier tubes may consistently determine which detector crystal produced the scintillation event.
As the demands for higher resolution in PET scanners continue to increase, one approach to achieving higher resolution is to increase the number of crystals in each detector array without increasing the size of the array. For example, a 6×6 array of detector crystals might be replaced with an 8×8 array. However, an increase in the number of crystals may introduce additional complexities and costs to the surface finishes and optical coupling which may be necessary for acceptable spatial resolution of the scintillation events. An increased number of smaller crystals may also introduce additional challenges with respect to light loss in the corner crystals and the tolerances for mechanical alignment of the array with respect to the photomultiplier tubes. The present invention provides an apparatus and method which can overcome these problems.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Q:
Show that $|f(0)| \le \sqrt{12}$ for the following complex analytic function
If $f$ is an analytic function on $D(0\ ;2)$ with $|f(z)| < 4 $ if $\text{Im}(z) \ge 0\ \text{and}\ |z| =1$, and $|f(z)| < 3$ if $\text{Im}(z) <0\ \text{and}\ |z| =1$. How do I show $|f(0)| \le \sqrt{12}\ ?$
Can I use $g(z) = f(z)\cdot f(-z)$ here? I thought of using maximum modulus theorem on $g(z)$ also, but it doesn't seem to work as I need a $a\in D(0\ ;2)$ such that the condition in the theorem is satisfied, I can't see what will be it's ($a'$s) value. Do I need to calculate the derivative of $g(z)$ and do something with it? How do I proceed? Any ideas/hints?
A:
$|g(z)| \leq 12$ whenever $|z|=1$ so MMP implies that $|g(0)| \leq 12$. This means $|f(0)|^{2} \leq 12$ or $|f(0)| \leq \sqrt {12}$.
|
{
"pile_set_name": "StackExchange"
}
|
Most of us are Stoics. We think that happiness is something that individuals find for themselves: the key is to work hard for a good life, and to face adversity with defiance. This ‘rugged individualism’ might fit the American ethos, but it is at odds with a growing body of empirical research that shows that some kinds of societies produce a great deal more satisfaction with life than others. Happiness, in other words, is more social than psychological.
If so, then the obvious step, as Albert Einstein put it, is to ‘ask ourselves how the structure of society and the cultural attitude of man should be changed in order to make human life as satisfying as possible’. Economists, political scientists and other social scientists in the growing field of the political economy of wellbeing, or ‘happiness economics’, are using empirical rather than speculative methods to better understand what makes for satisfying lives. Happiness economics is not to be confused with ‘positive psychology’, which approaches happiness as a matter of individual attitudes. In contrast, scholars of ‘happiness economics’ maintain that, in the aggregate, a satisfying life is rooted in objective conditions, such that the economic, political and social aspects of societies are strong predictors of individual happiness.
The policies most conducive to human wellbeing turn out to be essentially the same ones that Einstein himself originally suggested: those associated with social democracy. In reviewing the research in 2014, Adam Okulicz-Kozaryn, a political scientist at Rutgers University-Camden in New Jersey, found that ‘societies led by leftist or liberal governments (also referred to as welfare states)’ have the highest levels of life satisfaction, controlling for other factors. Looking across countries, the more generous and universalistic the welfare state, the greater the level of human happiness, net of other factors.
The phrase ‘welfare state’ is pejorative to many Americans, but it would be less so if they had a better understanding of what it implies to the rest of the world. In the abstract, a welfare state means a society that has created a system of protecting people against the insecurities of everyday life by socialising risk and reward. This implies not only the staples of social protection – guaranteed access to healthcare, unemployment insurance, and pensions – but benefits unknown in the United States, such as state-mandated sick days (in Germany, six weeks at full pay, and then up to 78 weeks at 70 per cent) and guaranteed vacation days (four weeks at full pay in Germany). More surprising perhaps are ‘family allowances’, or grants paid to all families with children, regardless of income – every German family receives 184 euros (or around $205) per month, per child. Minimum guaranteed earnings are also much higher in countries approaching the welfare state ideal – Denmark’s effective minimum wage is about $20 per hour. It is this sense of shared risk and shared prosperity that prompted the late Swedish Prime Minister Olof Palme to observe that: ‘With all its faults, the welfare state remains the most humane and civilised system ever created.’
It is public policies that are humane and civilised that foster the conditions which allow people to actually enjoy being alive. That conclusion is provocative and profound, suggesting that if human wellbeing is the appropriate metric by which to judge, then the choice of left over right public policies is justified on objective, ‘scientific’ grounds. But what is this ‘science of happiness’ and how has it come to such dramatic conclusions?
The idea of a science of happiness invites skepticism. Some feel that happiness is too slippery or elusive to admit of easy measurement or study using scientific methods. Antipathy to approaching wellbeing via social-scientific means can be down to a Frankenstein-like fear of science, an apprehension that studying happiness might lead to the silencing of non-experts. This fear is worth respecting; no one wants a world in which only ‘experts’ can talk about happiness.
Happiness is not chemistry or algebraic geometry, fields where lay views have little impact. But social science research on happiness is based on asking people if they are happy. Thus, we are not interested in deciding what happiness is – an undeniably difficult problem – but only in knowing if people are happy. All we want to know, in sum, is how much people find their lives to be positive and rewarding – in Einstein’s phrase, ‘satisfying’.
The World Values Survey provides comparable data on life satisfaction and other measures of subjective wellbeing for the universe of industrial democracies from 1981 to 2014. Most of the research in happiness economics relies upon this survey question (or some minor variant): ‘All things considered, how satisfied are you with your life as a whole these days?’ to which respondents are asked to reply on a scale from 1 (dissatisfied) to 10 (satisfied). Individuals decide the vital, and individual, matter of what happiness means, and how happy they are, for themselves. With their answers, social scientists can study happiness the way any empirical phenomenon is studied.
There are pitfalls in using survey methods, but only the same ones that social scientists are used to in any kind of survey. Does the question measure what we think it does, and does it do so consistently and reliably? Do people even know how happy they are – and if they do, are there cultural factors that discourage them from answering honestly? A cottage industry of research has grown up around these questions and similar matters, but the professional jury believes that they do not present serious complications to the researcher.
those factors external to the individual that drive the provision of basic needs will have the greatest impact on wellbeing
So, we have data on happiness. What theories do we have to inform the analysis of those data? Psychologists rely on genetic and personality explanations: happiness is a relatively fixed personality trait, wherein everyone has a set-point, to which they naturally return following brief deviations in reaction to life events. Economists have tended to focus on the importance of ‘consumption’ or income, and are much vested in the idea that happiness is relative. Thus, the Easterlin Paradox, named for the US economist Richard Easterlin, who first described it in 1974: at any given time, people with higher incomes are happier, since they judge themselves to be relatively privileged compared with those on lower incomes. But, over time, rising levels of national income do not raise the average level of happiness, since the consumption norm by which people make comparisons also increases. The implication is that a narrow focus on just raw economic growth is a mistake, given that what people need more of are the social goods that are judged absolutely, not relatively – of which financial security, access to health care, and dignity are prime examples.
This takes us to approaches that stress the provision of just such human needs. The most prominent of these is what the Dutch sociologist Ruut Veenhoven of the Erasmus University in Rotterdam has labelled ‘liveability theory’, which simply suggests that people are happier in those societies that are the most liveable, in the sense of providing the highest level of human needs to the greatest number of people. In this interpretation, people are simply happier when more of their needs as human animals are met. The influential work of the late US psychologist Abraham Maslow provides a model for understanding those needs, from the more basic lower-level needs necessary to obtain the higher-order ones. Food, clothing and shelter – our physiological needs – are at the bottom of the pyramid, followed by financial security, employment, and freedom from fear or crime. These are safety and security needs. Esteem constitutes the next level – these include friendships, romantic love, and immersion in social networks. A sense of being valued by one’s community and an amount of agency, or being able to make decisions of consequence about one’s life, form the higher level needs of self-respect and self-actualisation.
This approach reveals a hierarchy of needs. Physiological needs and security – the bottom of the chain of wellbeing – are most crucial, in that they are necessary for the attainment of other goals. Thus, those factors external to the individual that drive the provision of basic needs will have the greatest impact on wellbeing. By enumerating what these basic needs are, we know what institution is most important in generating and distributing them: the economy. The key to understanding happiness, then, is to be found in understanding how the market economy works.
The market has much to recommend it. It is one of humanity’s greatest achievements, providing both a greater degree of human liberty and a higher standard of living for more people than any other readily achievable form of economic production. As a system, it contributes to human happiness by successfully meeting basic human needs in vital and unique ways. But the internal logic of capitalism contains elements that are destructive to the common good. Externalities, such as pollution, are the most familiar of such problems, but there is a deeper, even foundational characteristic of capitalism that warrants our attention.
It is arguably the single most important concept in the entire logic of capitalism: commodification, more specifically the commodification of labour. A commodified world is one in which the vast majority of the population is dependent for their economic survival on the sale of their labour power as a commodity in the form of wage or salary work. In other words, to survive, people must sell their ability to work in the same kind of market that exists for any other commodity. As the 18th-century political economist Adam Smith noted, the demand for men is like that for any other commodity. Whatever the many positive and commendable aspects of the market economy, the reduction of people to commodities comes with two negative consequences.
people adopt the values of the market prison – competitive individualism, short-term material gain – that detract from a satisfying life
First, when people become commodities they become subject to pitiless market forces beyond their control. They face a world characterised by chronic insecurity, since the market for the sale of their labour is, like the market for any commodity, subject to uncontrollable fluctuation. People become dependent on forces indifferent to them, or to any individual. As the Danish sociologist Gøsta Esping-Andersen put it in The Three Worlds of Welfare Capitalism (1990), ‘the market becomes to the worker a prison’. To survive and try to flourish, people adopt the values and norms of the market prison – competitive individualism, egotism, a focus on short-term material gain. In practice, these values detract from a satisfying life.
Commodification has another, equally destructive aspect. When people are reduced to commodities, they lack the ability to make moral claims on society. Just as we have no moral responsibility to bushels of wheat or consignments of mobile phones, we have no moral responsibility to workers who are conceived of as commodities, labour units instead of people. Not only is a commodity without a right to a job to begin with, it certainly has no right to paid sick days or vacation time, to pensions or healthcare, or to protection against arbitrary dismissal, to say nothing of a guaranteed severance package or similar redundancy benefits.
Rather than being treated with dignity and respect – as valued members of a community whose work contributes to the general good – workers as commodities are merely another factor of production, no more worthy of considerate treatment than the machines they manipulate.
If commodification is so harmful to humans, while the greater market system itself contributes so much to human society, the obvious solution is to maintain the essential features of the market while introducing public policies that serve to ‘decommodify’ workers and their families. Simply put, a society is decommodified to the extent that individuals can maintain something like a middle-class existence if they are unable to successfully sell their labour power as a commodity due to illness, old-age, disability, the need to care for a family member, the desire to improve one’s position through further education, or simply the inability to find (good) jobs when times are hard. The greater the level of decommodification, the easier it is for more people to survive without winning in the labour market.
The creation of a social safety net (the much-maligned ‘welfare state’) is essential to decommodifying people. It assures that those unable to find work will be provided with a minimum income, coupled in its most expansive form with other programmes that limit the extent to which one’s wellbeing is dependent on income – such as ‘family allowances’ (ie child support payments provided by the public), subsidised daycare and housing, and the availability of healthcare as a social right, ie as something (like police protection) that one receives because one is a citizen, not because one can pay for it.
Labour unions also play a vital role in helping decommodify people, by providing a degree of protection to workers against the arbitrary whims of employers; the higher wages and benefits of unionised workers tend to raise the wage floor for all. Finally, labour market regulations can cover all employees, even those not in labour unions. These protections, in some countries, protect all workers, assure them paid vacation and sick days, maintain high levels of workplace safety, and might even (as in codetermination schemes) provide workers with a say in how the business is managed. All this serves to not only reduce insecurity and other forms of stress, but helps contribute to an environment in which workers feel that they are treated with the dignity and respect all persons deserve.
Does decommodification actually have these positive benefits, and, if so, do these positive benefits accrue in excess of the negative costs of reducing market efficiency? That is the empirical question on which political scientists focus. Simply put, does the political programme of the left really best contribute to a world in which people lead positive and rewarding lives? This is not a philosophical or normative question. Nor is it a matter of political taste. It is rather a relatively simple empirical question that can be answered through the examination of the data on life satisfaction.
In The Political Economy of Human Happiness (2013), I analyse the data in more detail, but the sketch of an answer follows, and other scholars have come to similar conclusions. The principal data come from the World Values Surveys; additional similar data are used for a companion comparison of satisfaction across the US.
Using both individual- and aggregate-level data, I find that life satisfaction is higher in those countries that have the highest levels of decommodification. The positive relationship between decommodification and wellbeing obtains when using two different indices of the total level of decommodification (summarising multiple programmes into a single index), as well as with more particular measures of specific policies, such as the share of the economy (the percentage of gross domestic product) devoted to social spending, a measure of the scope and generosity of unemployment compensation per se, and the total amount of ‘government consumption’ (as a percentage of GDP) as a measure of the total share of the economy the government controls. There is also a positive relationship between satisfaction and tax burden, meaning that wellbeing improves as society pays more in taxes, as a necessary compliment to higher levels of spending. Wellbeing also varies in the expected direction when considering an index of the general size and scope of government developed by the ultra-conservative Fraser Institute in Canada: in their terms, life satisfaction increases when there is more ‘economic freedom’.
Similar results obtain when considering the effects of labour organisation and economic regulation. Individuals who belong to labour unions are more satisfied with their lives than non-members, other things being equal. More importantly, everyone in society benefits from higher levels of labour union organisation, whether a member or not. The principal reason for the latter finding is that, as unions become stronger, they support public policies (through their own self-interest as much as any altruism) which benefit all workers, such as the social safety net. They also tend to support pro-worker labour-market regulations, which themselves also have a strong and positive impact on life satisfaction (as demonstrated statistically using different measures of regulation, including, again, one from the anti-regulation Fraser Institute).
life satisfaction is higher in those states that have, measured in partisan terms, recent rule by the Democratic Party
Critically, all of these relationships obtain regardless of one’s income or social status. Everyone benefits from a more generous welfare state, from labour laws that protect workers, and from strong unions, whatever their income, in that these institutions help build a more ‘liveable’ society of shared prosperity (and shared human dignity) from which all benefit.
The cross-national pattern also repeats itself across the US: while the exact indicators vary based on the availability of data, it is clear that life satisfaction is higher in those states that have higher levels of welfare spending, a more regulated economy, and governments that have a longer history of either policy liberalism or, to measure the same concept in partisan terms, recent rule by the Democratic Party. Quality of life (for rich and poor, men and women) also shows the same strong and positive relationship with the size of the labour movement: life is better in those states where more workers belong to unions, controlling for other factors.
The fact is that, however we approach the subject empirically, human happiness increases as the level of decommodification increases. If indeed we are concerned with building a world in which people lead lives that they themselves find to be valuable and rewarding, we would be well‑advised to consider why the term ‘welfare state’ has acquired such disrepute in the US, despite the fact that it has produced more human happiness than other kinds of state.
If there is a strong link between the social-democratic vision of politics and human wellbeing, why does that vision appear to be in retreat? If ‘big government’ makes people happy, why do voters seem to be more inclined to elect governments that are committed to unfettered markets, ‘flexible’ labour laws, and ever-lower social spending?
This question is a real and important one, but its posing should not be understood as tantamount to the end of the welfare state. The generous welfare states of Western Europe have indeed been chipped away at in recent decades, but their basic features remain in place almost everywhere. That is because there is a social consensus for maintaining those fundamental contours. Even in the UK and the US, as conservative commentators have gloomily observed, the core elements of the welfare state have resisted the past efforts of Margaret Thatcher and Ronald Reagan to undo them.
The welfare state has shown great resilience – as in the UK’s National Health Service or Medicare in the US – precisely because of its intimate connection with human wellbeing. The examples earlier in this article about social protection in contemporary Germany – a middling welfare state, compared with the Nordic countries – also illustrates that, even in these times, social democracy is flourishing. Other signs of the vibrancy of this progressive achievement are everywhere to be seen, so I will name just two: the US just managed to extend a social right of access to medical care, courtesy of Obamacare; and Thomas Piketty’s Capital in the Twenty-First Century (2013) – a leftist critique of the currently dominant form of capitalism – has become what The Guardian rightly called a ‘publishing sensation’ comparable to Fifty Shades of Grey. When an economist’s research on long-term patterns of inequality under capitalism is generating the same interest as kinky sex, it is definitely too early to count the left out.
Just as in their private lives, people have to learn what political outcomes will make them happy
Still, if the welfare state leads to more human happiness, why is it under attack, and not expanding? The most obvious answer is that people do not always know what makes them happy. Much work by psychologists and economists alike has confirmed that many of the things we strive for either provide far less happiness than we might expect (promotions, raises) or even make us less happy (having children). It is hard enough to judge, in our personal lives, what will make us happier. The difficulties in deducing the consequences of political programmes on our happiness, especially those whose connection to our own life is hard to judge, are significant.
The strongest support is for those kinds of ‘big government’ programmes we can see working: you like social security when you get a payment, or your parents receive one. It is harder to like food stamps if you and the people you interact with don’t rely on the programme; the tangible benefits to you come obliquely, in the form of more social capital and less violent crime. When political parties succeed in illustrating the value of building a country in which children do not go hungry, and so providing an immediate and welcome benefit to everyone with children – remember those German family allowances – political support for the welfare state is naturally higher. Just as in their private lives, people have to learn what political outcomes will make them happy. That is easier in some places than others.
It is also unfortunately true that what people want does not always, or even usually, get translated into public policies. Students of political economy often think of policy outcomes as being the result of the ‘power resources’ that different classes possess. Among the most important for representing the interests of the working class and the middle class, in both policy and opinion spheres, are labour unions, which have been under pressure almost everywhere, but especially in the US. The recent instituting of so-called ‘right-to-work’ laws (whose explicit purpose is to make union organising impossible) in Indiana, Michigan and Wisconsin must be seen in this context: the goal is to destroy a major institutional voice for the progressive policies that benefit working people, so as to reduce their contribution to public debate and policymaking.
To the extent that labour has declined across countries, so has this voice – and thus so have both happiness and the welfare state. It is thus not necessarily so much that people have turned against progressive ideals as that the strongest organised interest group supporting that approach has been (to various degrees) emasculated. While labour has hung on to a substantial degree in much of Europe, losses in the US have been dramatic. The decline of unions is reflected in the huge body of recent research on policymaking in the US, nicely summarised in April 2014 by this US News and World Report headline: ‘Oligarchy Nation – Political Scientists Find Wealthy Elites Control Politics in America’.
We need not be quite so literal as to believe that business and the wealthy have grossly disproportionate influence over politics: such people are generally disinclined to be supportive of the welfare state, and they also have enormous influence over public opinion through their ownership of the media. But it takes little insight to see how the fate of the social-democratic approach to politics faces an uphill battle, whatever the consequences for human wellbeing.
|
{
"pile_set_name": "OpenWebText2"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.