text
stringlengths 1
3.78M
| meta
dict |
|---|---|
ADAM10 is upregulated in melanoma metastasis compared with primary melanoma.
ADAM10 (a disintegrin and metalloproteinase 10) is involved in the ectodomain shedding of various substrates, including adhesion molecules such as L1 cell adhesion molecule (L1-CAM) and CD44, which are known to have important roles in the development of malignant melanoma. In our study, we characterized the expression of ADAM10 in melanoma cells in vitro and in vivo. Immunohistochemical analysis on tissue microarrays indicated that ADAM10 expression was significantly elevated in melanoma metastasis compared with primary melanomas. In vitro downregulation of ADAM10 with specific small interfering RNA (siRNA) resulted in a suppression of the anchorage-independent cell growth and reduced the migration of melanoma cells. In addition, overexpression of ADAM10 induced the migration of melanoma cells. In cell lines from melanoma patients with metastasis, ADAM10 was significantly overexpressed, and ADAM10 expression correlated with increased cell proliferation. Furthermore, we present evidence that ADAM10 is involved in the release of L1-CAM from melanoma cells. It is important that knockdown of cellular L1-CAM reduced the migration of melanoma cells and abrogated the chemoresistance against cisplatin. In contrast, soluble L1-CAM had no effect on melanoma cell migration or cell survival. Taken together, our data demonstrate that ADAM10 and L1-CAM have important roles during melanoma progression and both molecules represent attractive targets for therapeutical intervention of melanomas.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
Container which iterates a range or a list
I have made some composited container Range which accepts either a min/max range as a std::pair or a set of integers as a std::set.
internally it saves a copy of the input by as void *
This container supports iterators which is useful.
I am not sure if there is a better implementation to mimic an iteration for both, a range or a list of numbers, also with respect to move semantics.
I could have used boost::variant types, but that only bloats the whole class, and for the iterator I need another boost::variant filled with iterators ...?
Have I used the move semantics correctly?
I added also some performance test in the MWE: MWE LINK
template<typename Type>
class Range{
public:
typedef std::pair<Type,Type> Pair;
typedef std::set<Type> Set;
Range(const Pair & pair){
m_ptr = static_cast<void * >( new Pair(pair) );
m_which = 0;
}
Range(Pair && pair){
m_ptr = static_cast<void * >( new Pair( std::move(pair) ) );
m_which = 0;
}
Range(const Set & set){
m_which = 1;
m_ptr = static_cast<void * >( new Set(set) );
}
Range(Set && set){
m_which = 1;
m_ptr = static_cast<void * >( new Set( std::move(set) ) );
}
Range(const Range & r){
*this = r;
}
// Move Constructor
Range(Range && r){
*this = std::move(r);
}
// Move Assigment
Range & operator=(Range && r){
assert(r.m_ptr);
if(m_ptr != r.m_ptr && this != &r ){ // Prevent self-assignment
~Range(); // delete resources
m_ptr = std::move(r.m_ptr);
m_which = std::move(r.m_which);
r.m_ptr = nullptr;
r.m_which = 0;
}
}
// Assigment
Range & operator=(Range & r){
if(m_ptr != r.m_ptr && this != &r ){ // Prevent self-assignment
if(r.m_which == 0){
if(m_which == 0 && m_ptr){
*static_cast<Pair*>(m_ptr) = *static_cast<Pair*>(r.m_ptr); // Copy
}
m_ptr = static_cast<void * >( new Pair(*static_cast<Pair*>(r.m_ptr))); // Make new and Copy
}else if(r.m_which==1){
if(m_which == 1 && m_ptr){
*static_cast<Set*>(m_ptr) = *static_cast<Set*>(r.m_ptr); // Copy
}
m_ptr = static_cast<void * >( new Set(*static_cast<Set*>(r.m_ptr))); // Make new and Copy
}
m_which = r.m_which;
}
}
~Range(){
if(m_ptr){
if(m_which == 0){
auto p = static_cast<Pair * >(m_ptr); delete p;
}else if(m_which==1){
auto p = static_cast<Set * >(m_ptr); delete p;
}
m_which = 0;
}
}
class iterator {
public:
iterator():m_r(nullptr),m_cur(0){};
iterator(Range * r, bool atEnd = false):m_r(r) {
if(!m_r->m_ptr){
m_cur=0;
return;
}
if(m_r->m_which == 0){
auto p = static_cast<Pair * >(m_r->m_ptr);
if(atEnd){
m_cur = p->second;
}else{
m_cur = p->first;
}
}else{
auto p = static_cast<Set * >(m_r->m_ptr);
if(atEnd){
m_it = p->end();
}else{
m_it = p->begin();
}
}
};
//Delete assignment operator
iterator & operator=(const iterator&) = delete;
iterator & operator=(iterator&) = delete;
~iterator() {
}
iterator( const iterator & it ): m_r(it.m_r), m_cur(it.m_cur) {
}
/** pre-increment ++it
* Allow to iterate over the end of the sequence
*/
iterator & operator++() {
if(m_r->m_which == 0){
++m_cur;
}else {
++m_it;
}
return *this;
}
/** post-increment it++
*
*/
iterator operator++(int) {
iterator it(*this);
operator++();
return it;
}
bool operator==(const iterator &rhs) {
if(m_r->m_which == 0){
return m_cur == rhs.m_cur; // Two iterators for differente ranges, might compare equal!
}else {
return m_it == rhs.m_it;
}
}
// Return false if the same!
bool operator!=(const iterator &rhs) {
return !(*this==rhs);
}
Type operator*() {
if(m_r->m_which == 0){
return m_cur ;
}else {
return *m_it;
}
}
private:
Range * m_r;
typename Set::iterator m_it;
Type m_cur;
};
iterator begin(){
return iterator(this);
}
iterator end(){
return iterator(this,true);
}
private:
unsigned int m_which = 0;
void * m_ptr = nullptr;
};
Usage:
std::pair<Type,Type> p(0,100);
Range<Type> range( std::pair<Type,Type>(0,100) );
for(auto it=range.begin(); it != range.end(); ++it) {
std::cout << *it << std::endl;
}
}
Here the updated MWE (from the comments)! =)
https://ideone.com/jXI7Si
A:
You should use template specialization rather than casting to void* here
// Pair or set depends on m_which.
// Very easy to get that screwed up.
// Especially since it is not const.
Range(const Pair & pair){
m_ptr = static_cast<void * >( new Pair(pair) );
m_which = 0;
}
Range(const Set & set){
m_which = 1;
m_ptr = static_cast<void * >( new Set(set) );
}
Your technique is very error prone as the compiler can no longer validate the types you are using. By using template specialization you remove the problem.
This is the wrong way around.
Range(const Range & r){
*this = r;
}
You should define the copy constructor like normal. Then define the assignment operator in terms of the copy constructor. It is known as the copy and swap idiom.
Also you don't set up the members. This means unless the assignment operator only sets the values you are looking at undefined behavior when they are read.
// As I suspected the first thing you try and do is read from `m_ptr`.
// This value has not been set in the copy constructor and thus you have
// undefined behavior.
Range & operator=(Range & r){
if(m_ptr != r.m_ptr && this != &r ){
This is very hard to understand.
Comes from casting around void*. Would not do this.
if(m_which == 0 && m_ptr){
*static_cast<Pair*>(m_ptr) = *static_cast<Pair*>(r.m_ptr); // Copy
}
Now you leak the original data and replace it with the a copy of the source.
m_ptr = static_cast<void * >( new Pair(*static_cast<Pair*>(r.m_ptr))); // Make new and Copy
}
Copy and Swap idiom looks like this:
Range(Range const& r)
: m_which(r.m_which)
, m_ptr(r.m_which == 0
? static_cast<void*>(new Pair(*static_cast<Pair*>(r.m_ptr)))
: static_cast<void*>(new Set(*static_cast<Set*>(r.m_ptr)))
)
{}
Range& operator=(Range value) // Pass by value to generate copy.
{
value.swap(*this); // Swap value with the copy.
return *this;
} // Destructor of `value` cleans up the old value.
void swap(Range& other) noexcept
{
std::swap(m_which, other.m_witch);
std::swap(m_ptr, other.m_ptr);
}
Same problem with the move constructor.
// Move Constructor
Range(Range && r){
*this = std::move(r);
}
You don't initialize the members. Since the members are POD they have indeterminate values and thus reading them is undefined behavior (unless you assign something to them).
So the move assignment operator has the same problems as the assignment operator as it reads the value of m_ptr (only a problem when called from the move constructor).
// Move Assigment
Range & operator=(Range && r){
assert(r.m_ptr);
// Reading m_ptr here.
// But we have just been called from the move constructor
// thus m_ptr is not defined.
if(m_ptr != r.m_ptr && this != &r ){
You are allowed to call the destructor.
~Range(); // delete resources
But this stops the object from being an object. The only thing you are allowed to do at this point is call the call placement new to make it a real object again (or pass it around as void*). So calling the destructor is not really a good idea. Move the code for releasing resource into another function and call that from here and the destructor.
OK. So after a move the source should be in a valid state (but can be indeterminate state).
r.m_ptr = nullptr;
r.m_which = 0;
I suppose this does that. But a lot of code assumes that m_which of 0 means that it contains a pointer to a pair. You may want to have another state ie 2 (or -1) that indicates nothing is stored in the object.
Personally I would simplify the above:
Range(Range && r)
: m_which(r.m_wich)
, m_ptr(r.m_ptr)
{
// r.m_which = ?? not sure you may want to set this.
r.m_ptr = nullptr;
}
Range& operator=(Range&& r)
{
r.swap(*this); // Just swap the objects on assignment.
return *this;
}
|
{
"pile_set_name": "StackExchange"
}
|
Prostacyclin release from cultured and ex vivo bovine vascular endothelium. Studies with thrombin, arachidonic acid, and ionophore A23187.
Prostacyclin release from systemic and pulmonary endothelium has been evaluated in cultured cell monolayers and in an ex vivo vascular segment model in which the endothelium remains in contact with subendothelial structures. The effect of exposure to arachidonic acid, ionophore A23187, and thrombin on prostacyclin release has been assessed. Arachidonic acid elicited prostacyclin release in a dose-dependent fashion. Ionophore also stimulated bovine systemic endothelium to release prostacyclin. Thrombin-endothelial cell interactions have been examined extensively. Unlike umbilical venous endothelium, systemic and pulmonary bovine endothelium did not release prostacyclin following exposure to thrombin. Exposure to thrombin also failed to evoke the release of tritiated arachidonate metabolites from the bovine endothelial cell preparations. The presence of high affinity binding sites for thrombin (KD = 9.5 X 10(-9) M) on the bovine endothelium suggests that either thrombin binding is causally unrelated to prostacyclin release or that the bovine cells lack mediators required for thrombin to exert its effect.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
' Licensed to the .NET Foundation under one or more agreements.
' The .NET Foundation licenses this file to you under the MIT license.
' See the LICENSE file in the project root for more information.
Imports Microsoft.CodeAnalysis.VisualBasic.Syntax
Imports Microsoft.CodeAnalysis.Test.Utilities
Namespace Microsoft.CodeAnalysis.VisualBasic.UnitTests.Semantics
Partial Public Class IOperationTests
Inherits SemanticModelTestBase
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatchFinally_Basic()
Dim source = <![CDATA[
Imports System
Class C
Private Sub M(i As Integer)
Try'BIND:"Try"
i = 0
Catch ex As Exception When i > 0
Throw ex
Finally
i = 1
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (1 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'i = 0')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'i = 0')
Left:
IParameterReferenceOperation: i (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'i')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 0) (Syntax: '0')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.Exception) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch ex As ... Throw ex')
Locals: Local_1: ex As System.Exception
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: ex As System.Exception) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'ex')
Initializer:
null
Filter:
IBinaryOperation (BinaryOperatorKind.GreaterThan, Checked) (OperationKind.Binary, Type: System.Boolean) (Syntax: 'i > 0')
Left:
IParameterReferenceOperation: i (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'i')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 0) (Syntax: '0')
Handler:
IBlockOperation (1 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch ex As ... Throw ex')
IThrowOperation (OperationKind.Throw, Type: null) (Syntax: 'Throw ex')
ILocalReferenceOperation: ex (OperationKind.LocalReference, Type: System.Exception) (Syntax: 'ex')
Finally:
IBlockOperation (1 statements) (OperationKind.Block, Type: null) (Syntax: 'Finally ... i = 1')
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'i = 1')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'i = 1')
Left:
IParameterReferenceOperation: i (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'i')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 1) (Syntax: '1')
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatchFinally_Parent()
Dim source = <![CDATA[
Imports System
Class C
Private Sub M(i As Integer)'BIND:"Private Sub M(i As Integer)"
Try
i = 0
Catch ex As Exception When i > 0
Throw ex
Finally
i = 1
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IBlockOperation (3 statements) (OperationKind.Block, Type: null) (Syntax: 'Private Sub ... End Sub')
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try ... End Try')
Body:
IBlockOperation (1 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try ... End Try')
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'i = 0')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'i = 0')
Left:
IParameterReferenceOperation: i (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'i')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 0) (Syntax: '0')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.Exception) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch ex As ... Throw ex')
Locals: Local_1: ex As System.Exception
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: ex As System.Exception) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'ex')
Initializer:
null
Filter:
IBinaryOperation (BinaryOperatorKind.GreaterThan, Checked) (OperationKind.Binary, Type: System.Boolean) (Syntax: 'i > 0')
Left:
IParameterReferenceOperation: i (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'i')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 0) (Syntax: '0')
Handler:
IBlockOperation (1 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch ex As ... Throw ex')
IThrowOperation (OperationKind.Throw, Type: null) (Syntax: 'Throw ex')
ILocalReferenceOperation: ex (OperationKind.LocalReference, Type: System.Exception) (Syntax: 'ex')
Finally:
IBlockOperation (1 statements) (OperationKind.Block, Type: null) (Syntax: 'Finally ... i = 1')
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'i = 1')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'i = 1')
Left:
IParameterReferenceOperation: i (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'i')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 1) (Syntax: '1')
ILabeledOperation (Label: exit) (OperationKind.Labeled, Type: null, IsImplicit) (Syntax: 'End Sub')
Statement:
null
IReturnOperation (OperationKind.Return, Type: null, IsImplicit) (Syntax: 'End Sub')
ReturnedValue:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of MethodBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_SingleCatchClause()
Dim source = <![CDATA[
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch e As System.IO.IOException
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e As ... IOException')
Locals: Local_1: e As System.IO.IOException
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: e As System.IO.IOException) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'e')
Initializer:
null
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e As ... IOException')
Finally:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_SingleCatchClauseAndFilter()
Dim source = <![CDATA[
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch e As System.IO.IOException When e.Message IsNot Nothing
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e As ... Not Nothing')
Locals: Local_1: e As System.IO.IOException
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: e As System.IO.IOException) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'e')
Initializer:
null
Filter:
IBinaryOperation (BinaryOperatorKind.NotEquals) (OperationKind.Binary, Type: System.Boolean) (Syntax: 'e.Message IsNot Nothing')
Left:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, IsImplicit) (Syntax: 'e.Message')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: True, IsUserDefined: False) (MethodSymbol: null)
Operand:
IPropertyReferenceOperation: ReadOnly Property System.Exception.Message As System.String (OperationKind.PropertyReference, Type: System.String) (Syntax: 'e.Message')
Instance Receiver:
ILocalReferenceOperation: e (OperationKind.LocalReference, Type: System.IO.IOException) (Syntax: 'e')
Right:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, Constant: null, IsImplicit) (Syntax: 'Nothing')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
Operand:
ILiteralOperation (OperationKind.Literal, Type: null, Constant: null) (Syntax: 'Nothing')
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e As ... Not Nothing')
Finally:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_MultipleCatchClausesWithDifferentCaughtTypes()
Dim source = <![CDATA[
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch e As System.IO.IOException
Catch e As System.Exception When e.Message IsNot Nothing
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(2):
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e As ... IOException')
Locals: Local_1: e As System.IO.IOException
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: e As System.IO.IOException) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'e')
Initializer:
null
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e As ... IOException')
ICatchClauseOperation (Exception type: System.Exception) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e As ... Not Nothing')
Locals: Local_1: e As System.Exception
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: e As System.Exception) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'e')
Initializer:
null
Filter:
IBinaryOperation (BinaryOperatorKind.NotEquals) (OperationKind.Binary, Type: System.Boolean) (Syntax: 'e.Message IsNot Nothing')
Left:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, IsImplicit) (Syntax: 'e.Message')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: True, IsUserDefined: False) (MethodSymbol: null)
Operand:
IPropertyReferenceOperation: ReadOnly Property System.Exception.Message As System.String (OperationKind.PropertyReference, Type: System.String) (Syntax: 'e.Message')
Instance Receiver:
ILocalReferenceOperation: e (OperationKind.LocalReference, Type: System.Exception) (Syntax: 'e')
Right:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, Constant: null, IsImplicit) (Syntax: 'Nothing')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
Operand:
ILiteralOperation (OperationKind.Literal, Type: null, Constant: null) (Syntax: 'Nothing')
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e As ... Not Nothing')
Finally:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_MultipleCatchClausesWithDuplicateCaughtTypes()
Dim source = <![CDATA[
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch e As System.IO.IOException
Catch e As System.IO.IOException When e.Message IsNot Nothing
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(2):
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e As ... IOException')
Locals: Local_1: e As System.IO.IOException
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: e As System.IO.IOException) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'e')
Initializer:
null
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e As ... IOException')
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e As ... Not Nothing')
Locals: Local_1: e As System.IO.IOException
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: e As System.IO.IOException) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'e')
Initializer:
null
Filter:
IBinaryOperation (BinaryOperatorKind.NotEquals) (OperationKind.Binary, Type: System.Boolean) (Syntax: 'e.Message IsNot Nothing')
Left:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, IsImplicit) (Syntax: 'e.Message')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: True, IsUserDefined: False) (MethodSymbol: null)
Operand:
IPropertyReferenceOperation: ReadOnly Property System.Exception.Message As System.String (OperationKind.PropertyReference, Type: System.String) (Syntax: 'e.Message')
Instance Receiver:
ILocalReferenceOperation: e (OperationKind.LocalReference, Type: System.IO.IOException) (Syntax: 'e')
Right:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, Constant: null, IsImplicit) (Syntax: 'Nothing')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
Operand:
ILiteralOperation (OperationKind.Literal, Type: null, Constant: null) (Syntax: 'Nothing')
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e As ... Not Nothing')
Finally:
null
]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC42031: 'Catch' block never reached; 'IOException' handled above in the same Try statement.
Catch e As System.IO.IOException When e.Message IsNot Nothing
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
]]>.Value
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchClauseWithTypeExpression()
Dim source = <![CDATA[
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch System.Exception
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null, IsInvalid) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: ?) (OperationKind.CatchClause, Type: null, IsInvalid) (Syntax: 'Catch System')
ExceptionDeclarationOrExpression:
IInvalidOperation (OperationKind.Invalid, Type: ?, IsInvalid, IsImplicit) (Syntax: 'System')
Children(1):
IOperation: (OperationKind.None, Type: null, IsInvalid) (Syntax: 'System')
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Catch System')
Finally:
null
]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC31082: 'System' is not a local variable or parameter, and so cannot be used as a 'Catch' variable.
Catch System.Exception
~~~~~~
BC30205: End of statement expected.
Catch System.Exception
~
]]>.Value
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchClauseWithLocalReferenceExpression()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Dim e As IO.IOException = Nothing
Try'BIND:"Try"
Catch e
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e')
ExceptionDeclarationOrExpression:
ILocalReferenceOperation: e (OperationKind.LocalReference, Type: System.IO.IOException) (Syntax: 'e')
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e')
Finally:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchClauseWithParameterReferenceExpression()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(e As IO.IOException)
Try'BIND:"Try"
Catch e
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e')
ExceptionDeclarationOrExpression:
IParameterReferenceOperation: e (OperationKind.ParameterReference, Type: System.IO.IOException) (Syntax: 'e')
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e')
Finally:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchClauseWithFieldReferenceExpression()
Dim source = <![CDATA[
Imports System
Class C
Private e As IO.IOException = Nothing
Private Sub M()
Try 'BIND:"Try"'BIND:"Try 'BIND:"Try""
Catch e
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null, IsInvalid) (Syntax: 'Try 'BIND:" ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Try 'BIND:" ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null, IsInvalid) (Syntax: 'Catch e')
ExceptionDeclarationOrExpression:
IFieldReferenceOperation: C.e As System.IO.IOException (OperationKind.FieldReference, Type: System.IO.IOException, IsInvalid) (Syntax: 'e')
Instance Receiver:
IInstanceReferenceOperation (ReferenceKind: ContainingTypeInstance) (OperationKind.InstanceReference, Type: C, IsInvalid, IsImplicit) (Syntax: 'e')
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Catch e')
Finally:
null
]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC31082: 'e' is not a local variable or parameter, and so cannot be used as a 'Catch' variable.
Catch e
~
]]>.Value
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchClauseWithErrorExpression()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch e
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null, IsInvalid) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: ?) (OperationKind.CatchClause, Type: null, IsInvalid) (Syntax: 'Catch e')
ExceptionDeclarationOrExpression:
IInvalidOperation (OperationKind.Invalid, Type: ?, IsInvalid) (Syntax: 'e')
Children(0)
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Catch e')
Finally:
null
]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC30451: 'e' is not declared. It may be inaccessible due to its protection level.
Catch e
~
]]>.Value
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchClauseWithInvalidExpression()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch M2(e)
End Try
End Sub
Private Shared Function M2(e As Exception) As Exception
Return e
End Function
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null, IsInvalid) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: ?) (OperationKind.CatchClause, Type: null, IsInvalid) (Syntax: 'Catch M2')
ExceptionDeclarationOrExpression:
IInvalidOperation (OperationKind.Invalid, Type: ?, IsInvalid, IsImplicit) (Syntax: 'M2')
Children(1):
IOperation: (OperationKind.None, Type: null, IsInvalid) (Syntax: 'M2')
Children(1):
IInstanceReferenceOperation (ReferenceKind: ContainingTypeInstance) (OperationKind.InstanceReference, Type: C, IsInvalid, IsImplicit) (Syntax: 'M2')
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Catch M2')
Finally:
null
]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC31082: 'M2' is not a local variable or parameter, and so cannot be used as a 'Catch' variable.
Catch M2(e)
~~
BC30205: End of statement expected.
Catch M2(e)
~
]]>.Value
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchClauseWithoutCaughtTypeOrExceptionLocal()
Dim source = <![CDATA[
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.Exception) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch')
ExceptionDeclarationOrExpression:
null
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch')
Finally:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_FinallyWithoutCatchClause()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try'BIND:"Try"
Finally
Console.WriteLine(s)
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(0)
Finally:
IBlockOperation (1 statements) (OperationKind.Block, Type: null) (Syntax: 'Finally ... riteLine(s)')
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'Console.WriteLine(s)')
Expression:
IInvocationOperation (Sub System.Console.WriteLine(value As System.String)) (OperationKind.Invocation, Type: System.Void) (Syntax: 'Console.WriteLine(s)')
Instance Receiver:
null
Arguments(1):
IArgumentOperation (ArgumentKind.Explicit, Matching Parameter: value) (OperationKind.Argument, Type: null) (Syntax: 's')
IParameterReferenceOperation: s (OperationKind.ParameterReference, Type: System.String) (Syntax: 's')
InConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
OutConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_TryBlockWithLocalDeclaration()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try'BIND:"Try"
Dim i As Integer = 0
Finally
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (1 statements, 1 locals) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Locals: Local_1: i As System.Int32
IVariableDeclarationGroupOperation (1 declarations) (OperationKind.VariableDeclarationGroup, Type: null) (Syntax: 'Dim i As Integer = 0')
IVariableDeclarationOperation (1 declarators) (OperationKind.VariableDeclaration, Type: null) (Syntax: 'i As Integer = 0')
Declarators:
IVariableDeclaratorOperation (Symbol: i As System.Int32) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'i')
Initializer:
null
Initializer:
IVariableInitializerOperation (OperationKind.VariableInitializer, Type: null) (Syntax: '= 0')
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 0) (Syntax: '0')
Catch clauses(0)
Finally:
IBlockOperation (0 statements) (OperationKind.Block, Type: null) (Syntax: 'Finally')
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_CatchBlockWithLocalDeclaration()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try'BIND:"Try"
Catch ex As Exception
Dim i As Integer = 0
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.Exception) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch ex As ... Integer = 0')
Locals: Local_1: ex As System.Exception
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: ex As System.Exception) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'ex')
Initializer:
null
Filter:
null
Handler:
IBlockOperation (1 statements, 1 locals) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch ex As ... Integer = 0')
Locals: Local_1: i As System.Int32
IVariableDeclarationGroupOperation (1 declarations) (OperationKind.VariableDeclarationGroup, Type: null) (Syntax: 'Dim i As Integer = 0')
IVariableDeclarationOperation (1 declarators) (OperationKind.VariableDeclaration, Type: null) (Syntax: 'i As Integer = 0')
Declarators:
IVariableDeclaratorOperation (Symbol: i As System.Int32) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'i')
Initializer:
null
Initializer:
IVariableInitializerOperation (OperationKind.VariableInitializer, Type: null) (Syntax: '= 0')
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 0) (Syntax: '0')
Finally:
null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_FinallyWithLocalDeclaration()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try'BIND:"Try"
Finally
Dim i As Integer = 0
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(0)
Finally:
IBlockOperation (1 statements, 1 locals) (OperationKind.Block, Type: null) (Syntax: 'Finally ... Integer = 0')
Locals: Local_1: i As System.Int32
IVariableDeclarationGroupOperation (1 declarations) (OperationKind.VariableDeclarationGroup, Type: null) (Syntax: 'Dim i As Integer = 0')
IVariableDeclarationOperation (1 declarators) (OperationKind.VariableDeclaration, Type: null) (Syntax: 'i As Integer = 0')
Declarators:
IVariableDeclaratorOperation (Symbol: i As System.Int32) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'i')
Initializer:
null
Initializer:
IVariableInitializerOperation (OperationKind.VariableInitializer, Type: null) (Syntax: '= 0')
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 0) (Syntax: '0')
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_InvalidCaughtType()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try'BIND:"Try"
Catch i As Integer
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ITryOperation (Exit Label Id: 0) (OperationKind.Try, Type: null, IsInvalid) (Syntax: 'Try'BIND:"T ... End Try')
Body:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Try'BIND:"T ... End Try')
Catch clauses(1):
ICatchClauseOperation (Exception type: System.Int32) (OperationKind.CatchClause, Type: null, IsInvalid) (Syntax: 'Catch i As Integer')
Locals: Local_1: i As System.Int32
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: i As System.Int32) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'i')
Initializer:
null
Filter:
null
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsInvalid, IsImplicit) (Syntax: 'Catch i As Integer')
Finally:
null
]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC30392: 'Catch' cannot catch type 'Integer' because it is not 'System.Exception' or a class that inherits from 'System.Exception'.
Catch i As Integer
~~~~~~~
]]>.Value
VerifyOperationTreeAndDiagnosticsForTest(Of TryBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForCatchBlock()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try
Catch e As IO.IOException When e.Message IsNot Nothing'BIND:"Catch e As IO.IOException When e.Message IsNot Nothing"
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
ICatchClauseOperation (Exception type: System.IO.IOException) (OperationKind.CatchClause, Type: null) (Syntax: 'Catch e As ... Not Nothing')
Locals: Local_1: e As System.IO.IOException
ExceptionDeclarationOrExpression:
IVariableDeclaratorOperation (Symbol: e As System.IO.IOException) (OperationKind.VariableDeclarator, Type: null) (Syntax: 'e')
Initializer:
null
Filter:
IBinaryOperation (BinaryOperatorKind.NotEquals) (OperationKind.Binary, Type: System.Boolean) (Syntax: 'e.Message IsNot Nothing')
Left:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, IsImplicit) (Syntax: 'e.Message')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: True, IsUserDefined: False) (MethodSymbol: null)
Operand:
IPropertyReferenceOperation: ReadOnly Property System.Exception.Message As System.String (OperationKind.PropertyReference, Type: System.String) (Syntax: 'e.Message')
Instance Receiver:
ILocalReferenceOperation: e (OperationKind.LocalReference, Type: System.IO.IOException) (Syntax: 'e')
Right:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, Constant: null, IsImplicit) (Syntax: 'Nothing')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
Operand:
ILiteralOperation (OperationKind.Literal, Type: null, Constant: null) (Syntax: 'Nothing')
Handler:
IBlockOperation (0 statements) (OperationKind.Block, Type: null, IsImplicit) (Syntax: 'Catch e As ... Not Nothing')
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of CatchBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForFinallyBlock()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try
Finally'BIND:"Finally"
Console.WriteLine(s)
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IBlockOperation (1 statements) (OperationKind.Block, Type: null) (Syntax: 'Finally'BIN ... riteLine(s)')
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'Console.WriteLine(s)')
Expression:
IInvocationOperation (Sub System.Console.WriteLine(value As System.String)) (OperationKind.Invocation, Type: System.Void) (Syntax: 'Console.WriteLine(s)')
Instance Receiver:
null
Arguments(1):
IArgumentOperation (ArgumentKind.Explicit, Matching Parameter: value) (OperationKind.Argument, Type: null) (Syntax: 's')
IParameterReferenceOperation: s (OperationKind.ParameterReference, Type: System.String) (Syntax: 's')
InConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
OutConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of FinallyBlockSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForCatchExceptionIdentifier()
Dim source = <![CDATA[
Imports System
Class C
Private Sub M(e As Exception)
Try
Catch e'BIND:"e"
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IParameterReferenceOperation: e (OperationKind.ParameterReference, Type: System.Exception) (Syntax: 'e')
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of IdentifierNameSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact(Skip:="https://github.com/dotnet/roslyn/issues/22299")>
Public Sub TryCatch_GetOperationForCatchExceptionDeclaration()
Dim source = <![CDATA[
Imports System
Class C
Private Sub M()
Try
Catch e As Exception'BIND:"e"
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IVariableDeclaration (1 variables) (OperationKind.VariableDeclaration) (Syntax: 'e')
Variables: Local_1: e As System.Exception
Initializer: null
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of IdentifierNameSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForCatchFilterClause()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try
Catch e As IO.IOException When e.Message IsNot Nothing'BIND:"When e.Message IsNot Nothing"
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
]]>.Value
' GetOperation return Nothing for CatchFilterClauseSyntax
Assert.Null(GetOperationTreeForTest(Of CatchFilterClauseSyntax)(source).operation)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForCatchFilterClauseExpression()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try
Catch e As IO.IOException When e.Message IsNot Nothing'BIND:"e.Message IsNot Nothing"
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IBinaryOperation (BinaryOperatorKind.NotEquals) (OperationKind.Binary, Type: System.Boolean) (Syntax: 'e.Message IsNot Nothing')
Left:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, IsImplicit) (Syntax: 'e.Message')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: True, IsUserDefined: False) (MethodSymbol: null)
Operand:
IPropertyReferenceOperation: ReadOnly Property System.Exception.Message As System.String (OperationKind.PropertyReference, Type: System.String) (Syntax: 'e.Message')
Instance Receiver:
ILocalReferenceOperation: e (OperationKind.LocalReference, Type: System.IO.IOException) (Syntax: 'e')
Right:
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, Constant: null, IsImplicit) (Syntax: 'Nothing')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
Operand:
ILiteralOperation (OperationKind.Literal, Type: null, Constant: null) (Syntax: 'Nothing')
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of BinaryExpressionSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForCatchStatement()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try
Catch e As IO.IOException When e.Message IsNot Nothing'BIND:"Catch e As IO.IOException When e.Message IsNot Nothing"
End Try
End Sub
End Class]]>.Value
' GetOperation returns Nothing for CatchStatementSyntax
Assert.Null(GetOperationTreeForTest(Of CatchStatementSyntax)(source).operation)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForTryStatement()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try'BIND:"Try"
Catch e As IO.IOException When e.Message IsNot Nothing
End Try
End Sub
End Class]]>.Value
' GetOperation returns Nothing for TryStatementSyntax
Assert.Null(GetOperationTreeForTest(Of TryStatementSyntax)(source).operation)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForEndTryStatement()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try
Catch e As IO.IOException When e.Message IsNot Nothing
End Try'BIND:"End Try"
End Sub
End Class]]>.Value
' GetOperation returns Nothing for End Try statement
Assert.Null(GetOperationTreeForTest(Of EndBlockStatementSyntax)(source).operation)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForFinallyStatement()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try
Finally'BIND:"Finally"
Console.WriteLine(s)
End Try
End Sub
End Class]]>.Value
' GetOperation returns Nothing for FinallyStatementSyntax
Assert.Null(GetOperationTreeForTest(Of FinallyStatementSyntax)(source).operation)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForStatementInTryBlock()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try
Console.WriteLine(s)'BIND:"Console.WriteLine(s)"
Catch e As IO.IOException
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'Console.WriteLine(s)')
Expression:
IInvocationOperation (Sub System.Console.WriteLine(value As System.String)) (OperationKind.Invocation, Type: System.Void) (Syntax: 'Console.WriteLine(s)')
Instance Receiver:
null
Arguments(1):
IArgumentOperation (ArgumentKind.Explicit, Matching Parameter: value) (OperationKind.Argument, Type: null) (Syntax: 's')
IParameterReferenceOperation: s (OperationKind.ParameterReference, Type: System.String) (Syntax: 's')
InConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
OutConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of ExpressionStatementSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForStatementInCatchBlock()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M()
Try
Catch e As IO.IOException
Console.WriteLine(e)'BIND:"Console.WriteLine(e)"
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'Console.WriteLine(e)')
Expression:
IInvocationOperation (Sub System.Console.WriteLine(value As System.Object)) (OperationKind.Invocation, Type: System.Void) (Syntax: 'Console.WriteLine(e)')
Instance Receiver:
null
Arguments(1):
IArgumentOperation (ArgumentKind.Explicit, Matching Parameter: value) (OperationKind.Argument, Type: null) (Syntax: 'e')
IConversionOperation (TryCast: False, Unchecked) (OperationKind.Conversion, Type: System.Object, IsImplicit) (Syntax: 'e')
Conversion: CommonConversion (Exists: True, IsIdentity: False, IsNumeric: False, IsReference: True, IsUserDefined: False) (MethodSymbol: null)
Operand:
ILocalReferenceOperation: e (OperationKind.LocalReference, Type: System.IO.IOException) (Syntax: 'e')
InConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
OutConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of ExpressionStatementSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation)>
<Fact>
Public Sub TryCatch_GetOperationForStatementInFinallyBlock()
Dim source = <![CDATA[
Imports System
Class C
Private Shared Sub M(s As String)
Try
Finally
Console.WriteLine(s)'BIND:"Console.WriteLine(s)"
End Try
End Sub
End Class]]>.Value
Dim expectedOperationTree = <![CDATA[
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'Console.WriteLine(s)')
Expression:
IInvocationOperation (Sub System.Console.WriteLine(value As System.String)) (OperationKind.Invocation, Type: System.Void) (Syntax: 'Console.WriteLine(s)')
Instance Receiver:
null
Arguments(1):
IArgumentOperation (ArgumentKind.Explicit, Matching Parameter: value) (OperationKind.Argument, Type: null) (Syntax: 's')
IParameterReferenceOperation: s (OperationKind.ParameterReference, Type: System.String) (Syntax: 's')
InConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
OutConversion: CommonConversion (Exists: True, IsIdentity: True, IsNumeric: False, IsReference: False, IsUserDefined: False) (MethodSymbol: null)
]]>.Value
Dim expectedDiagnostics = String.Empty
VerifyOperationTreeAndDiagnosticsForTest(Of ExpressionStatementSyntax)(source, expectedOperationTree, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation, CompilerFeature.Dataflow)>
<Fact()>
Public Sub ExceptionDispatch_45()
Dim source = <![CDATA[
Imports System
Public Class C
Shared Sub Main()
End Sub
Sub M(x As Integer) 'BIND:"Sub M"
Try
Throw New NullReferenceException()
label1:
x = 1
End
Catch
x = 3
GoTo label1
Finally
x = 4
end Try
End Sub
End Class]]>.Value
Dim expectedDiagnostics = String.Empty
Dim expectedFlowGraph = <![CDATA[
Block[B0] - Entry
Statements (0)
Next (Regular) Block[B1]
Entering: {R1} {R2} {R3} {R4}
.try {R1, R2}
{
.try {R3, R4}
{
Block[B1] - Block
Predecessors: [B0]
Statements (0)
Next (Throw) Block[null]
IObjectCreationOperation (Constructor: Sub System.NullReferenceException..ctor()) (OperationKind.ObjectCreation, Type: System.NullReferenceException) (Syntax: 'New NullRef ... Exception()')
Arguments(0)
Initializer:
null
Block[B2] - Block
Predecessors: [B3]
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 1')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 1')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 1) (Syntax: '1')
Next (ProgramTermination) Block[null]
}
.catch {R5} (System.Exception)
{
Block[B3] - Block
Predecessors (0)
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 3')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 3')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 3) (Syntax: '3')
Next (Regular) Block[B2]
Leaving: {R5}
Entering: {R4}
}
}
.finally {R6}
{
Block[B4] - Block
Predecessors (0)
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 4')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 4')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 4) (Syntax: '4')
Next (StructuredExceptionHandling) Block[null]
}
Block[B5] - Exit [UnReachable]
Predecessors (0)
Statements (0)
]]>.Value
VerifyFlowGraphAndDiagnosticsForTest(Of MethodBlockSyntax)(source, expectedFlowGraph, expectedDiagnostics, TestOptions.ReleaseExe)
End Sub
<CompilerTrait(CompilerFeature.IOperation, CompilerFeature.Dataflow)>
<Fact()>
Public Sub FinallyDispatch_04()
Dim source = <![CDATA[
Imports System
Public Class C
Sub M(x As Integer) 'BIND:"Sub M"
GoTo label2
Try
Try
label1:
x = 1
label2:
x = 2
Finally
x = 3
end Try
Finally
x = 4
goto label1
end Try
End Sub
End Class]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC30754: 'GoTo label2' is not valid because 'label2' is inside a 'Try', 'Catch' or 'Finally' statement that does not contain this statement.
GoTo label2
~~~~~~
BC30101: Branching out of a 'Finally' is not valid.
goto label1
~~~~~~
BC30754: 'GoTo label1' is not valid because 'label1' is inside a 'Try', 'Catch' or 'Finally' statement that does not contain this statement.
goto label1
~~~~~~
]]>.Value
Dim expectedFlowGraph = <![CDATA[
Block[B0] - Entry
Statements (0)
Next (Regular) Block[B2]
Entering: {R1} {R2} {R3} {R4}
.try {R1, R2}
{
.try {R3, R4}
{
Block[B1] - Block
Predecessors: [B4]
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 1')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 1')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 1) (Syntax: '1')
Next (Regular) Block[B2]
Block[B2] - Block
Predecessors: [B0] [B1]
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 2')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 2')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 2) (Syntax: '2')
Next (Regular) Block[B5]
Finalizing: {R5} {R6}
Leaving: {R4} {R3} {R2} {R1}
}
.finally {R5}
{
Block[B3] - Block
Predecessors (0)
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 3')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 3')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 3) (Syntax: '3')
Next (StructuredExceptionHandling) Block[null]
}
}
.finally {R6}
{
Block[B4] - Block
Predecessors (0)
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 4')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 4')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 4) (Syntax: '4')
Next (Regular) Block[B1]
Leaving: {R6}
Entering: {R2} {R3} {R4}
}
Block[B5] - Exit [UnReachable]
Predecessors: [B2]
Statements (0)
]]>.Value
VerifyFlowGraphAndDiagnosticsForTest(Of MethodBlockSyntax)(source, expectedFlowGraph, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation, CompilerFeature.Dataflow)>
<Fact()>
Public Sub TryFlow_30()
Dim source = <![CDATA[
Imports System
Public Class C
Sub M(x As Integer) 'BIND:"Sub M"
Try
x = 1
end Try
End Sub
End Class]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC30030: Try must have at least one 'Catch' or a 'Finally'.
Try
~~~
]]>.Value
Dim expectedFlowGraph = <![CDATA[
Block[B0] - Entry
Statements (0)
Next (Regular) Block[B1]
Block[B1] - Block
Predecessors: [B0]
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 1')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 1')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 1) (Syntax: '1')
Next (Regular) Block[B2]
Block[B2] - Exit
Predecessors: [B1]
Statements (0)
]]>.Value
VerifyFlowGraphAndDiagnosticsForTest(Of MethodBlockSyntax)(source, expectedFlowGraph, expectedDiagnostics)
End Sub
<CompilerTrait(CompilerFeature.IOperation, CompilerFeature.Dataflow)>
<Fact()>
Public Sub TryFlow_31()
Dim source = <![CDATA[
Imports System
Public Class C
Sub M(x As Integer, y as boolean) 'BIND:"Sub M"
Try
If y
Exit Try
End If
x = 1
end Try
x = 2
End Sub
End Class]]>.Value
Dim expectedDiagnostics = <![CDATA[
BC30030: Try must have at least one 'Catch' or a 'Finally'.
Try
~~~
]]>.Value
Dim expectedFlowGraph = <![CDATA[
Block[B0] - Entry
Statements (0)
Next (Regular) Block[B1]
Block[B1] - Block
Predecessors: [B0]
Statements (0)
Jump if False (Regular) to Block[B2]
IParameterReferenceOperation: y (OperationKind.ParameterReference, Type: System.Boolean) (Syntax: 'y')
Next (Regular) Block[B3]
Block[B2] - Block
Predecessors: [B1]
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 1')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 1')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 1) (Syntax: '1')
Next (Regular) Block[B3]
Block[B3] - Block
Predecessors: [B1] [B2]
Statements (1)
IExpressionStatementOperation (OperationKind.ExpressionStatement, Type: null) (Syntax: 'x = 2')
Expression:
ISimpleAssignmentOperation (OperationKind.SimpleAssignment, Type: System.Int32, IsImplicit) (Syntax: 'x = 2')
Left:
IParameterReferenceOperation: x (OperationKind.ParameterReference, Type: System.Int32) (Syntax: 'x')
Right:
ILiteralOperation (OperationKind.Literal, Type: System.Int32, Constant: 2) (Syntax: '2')
Next (Regular) Block[B4]
Block[B4] - Exit
Predecessors: [B3]
Statements (0)
]]>.Value
VerifyFlowGraphAndDiagnosticsForTest(Of MethodBlockSyntax)(source, expectedFlowGraph, expectedDiagnostics)
End Sub
End Class
End Namespace
|
{
"pile_set_name": "Github"
}
|
Wenn in Syriens Hauptstadt ohne Sicherheitsprobleme eine internationale Wirtschaftsmesse stattfindet, gibt es keine Fluchtgründe mehr.
Die AfD-Bundestagsfraktion brachte am 6. November 2017 einen Antrag (19/32) für ein Rückführungsabkommen mit Syrien in den Deutschen Bundestag ein. Darin wird die Bundesregierung aufgerufen, „mit der syrischen Regierung in Verhandlungen über ein Rückführungsabkommen betreffend die in Deutschland aufgenommenen schutzsuchenden Syrer“ einzutreten. Ziel ist, dass Rückkehrer in Syrien „aufgenommen und … in sicheren Gebieten untergebracht werden, dass ihre Versorgung … gewährleistet wird und dass sie wegen eventuell gegen die Regierung gerichteter Aktivitäten vor und während ihrer Flucht einschließlich im selben Zeitraum eventuell begangener Straftaten gegen die Pflicht zur militärischen Dienstleistung nicht verfolgt werden“.
Von der Rückführung betroffen sein sollen „zunächst vorrangig arbeitsfähige Männer, deren eventuell in Deutschland befindlichen Familien – falls gewünscht – bis zur Konsolidierung der Lebensverhältnisse in Syrien weiterhin Aufenthalt in Deutschland gewährt werden soll“. Dabei soll die deutsche Botschaft in Syrien das Recht erhalten, „Zugang zu den Rückkehrern“ zu haben,um überprüfen zu können, „ob die syrischen Zusicherungen eingehalten wurden“.
Schulpflichtige syrische Kinder sollen auf ihre Rückkehr nach Syrien dahingehend vorbereitet werden, dass ihnen in Deutschland syrischer Schulunterricht von Personen erteilt werden soll, „die sich entweder schon in Deutschland aufhalten oder die von der syrischen Regierung nach Deutschland entsandt werden“.
Die Rückkehrbereitschaft von aufgenommenen schutzsuchenden Syrern soll durch „attraktive Anreize in Form von Starthilfen gewährt werden“ und die Rückführung „in Zusammenarbeit mit der syrischen Seite für die Rückkehrer kostenfrei sein“.
Die Bundesregierung wird zudem aufgefordert, nach Abschluss des Abkommens das Bundesamt für Migration und Flüchtlinge damit zu beauftragen, bei nicht rückkehrwilligen Syrern zu „prüfen, ob die Paragrafen 73 ff des Asylgesetzes (AsylG), Widerruf der Asylberechtigung und der Flüchtlingseigenschaft, Widerruf des subsidiären Schutzes, anzuwenden sind, und gegebenenfalls Maßnahmen zu ergreifen, um den Aufenthalt zu beenden“.
Begründet wird der Antrag, dass „ein Land, das – wie Syrien – in der Lage ist, in seiner Hauptstadt ohne Sicherheitsprobleme eine gut besuchte internationale Wirtschaftsmesse auszurichten, seinen Bürgern keine Veranlassung mehr biete, wegen seiner Sicherheitslage massenhaft in das Ausland zu fliehen. Für die meisten in Deutschland aufgenommenen Syrer sei damit der Aufnahmegrund entfallen, weshalb Widerrufsverfahren nach den §§ 73 ff. AsylG einzuleiten sind.
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
Object rotation using keys
I want to rotate a cube using keys. This is a part of the code. When I press LEFT key, cube rotates to left, etc. My goal is to rotate cube all around, so I have to rotate it by x and y axis which causes a problem.
I have defined mat4 rotation; and used it to assign a rotation when I press and hold a key. When I hold the key, it is rotating, for example to left. Then I release the key and the object gets back to initial position (camera gets back to initial position, since object is not moving). I think this problem is causing the auto rotateMat = rotation; line which is defined below the key functions.
What am I doing wrong?
mat4 rotation; //global
if(keysPressed[GLFW_KEY_LEFT]){
timer -= delta;
rotation = rotate(mat4{}, timer * 0.5f, {0, 1, 0});
}
if(keysPressed[GLFW_KEY_RIGHT]){
timer += delta;
rotation = rotate(mat4{}, timer * 0.5f, {0, 1, 0});
}
if(keysPressed[GLFW_KEY_UP]){
timer += delta;
rotation = rotate(mat4{}, timer * 0.5f, {1, 0, 0});
}
if(keysPressed[GLFW_KEY_DOWN]){
timer -= delta;
rotation = rotate(mat4{}, timer * 0.5f, {1, 0, 0});
}
...
program.setUniform("ModelMatrix", rotation* cubeMat);
cube.render();
UPDATE:
So the problem to this was solved when I used matrix variable as global variable, not local.
A:
There are multiple ways how such an interaction can be implemented. One of the easier ones is to create a relative translation in every frame instead of a global one and add it to the current rotation:
For this, one has to store the sum of all rotations in a global varialbe
//Global variable
mat4 total_rotate;
And calculate the relative translation in every frame:
//In the function
mat4 rotation;
if(keysPressed[GLFW_KEY_LEFT]){
rotation = rotate(mat4{}, delta, {0, 1, 0});
}
if(keysPressed[GLFW_KEY_RIGHT]){
rotation = rotate(mat4{}, -delta, {0, 1, 0});
}
if(keysPressed[GLFW_KEY_UP]){
rotation = rotate(mat4{}, delta, {1, 0, 0});
}
if(keysPressed[GLFW_KEY_DOWN]){
rotation = rotate(mat4{}, -delta, {1, 0, 0});
}
total_rotate = total_rotate * rotation;
...
program.setUniform("ModelMatrix", total_rotate * cubeMat);
cube.render();
As an alternative, you could store the two rotation angles instead and calculate the matrix in every frame:
//Global variables
float rot_x = 0.0f, rot_y = 0.0f;
//In every frame
if(keysPressed[GLFW_KEY_LEFT]){
rot_x += delta;
}
if(keysPressed[GLFW_KEY_RIGHT]){
rot_x -= delta;
}
//Same for y
auto rotation = rotate(rotate(mat4{}, rot_y, {0, 1, 0}), rot_x, {1, 0, 0}
...
program.setUniform("ModelMatrix", rotation * cubeMat);
cube.render();
|
{
"pile_set_name": "StackExchange"
}
|
#import <Foundation/Foundation.h>
NSArray *CDRReportersFromEnv(const char*defaultReporterClassName);
int runSpecs();
int runAllSpecs() __attribute__((deprecated));
int runSpecsWithCustomExampleReporters(NSArray *reporters);
NSArray *specClassesToRun();
|
{
"pile_set_name": "Github"
}
|
US CTO Delivers Shopping List to IT Execs
UPDATE: Washington will spend billions on products and services that solve problems of interoperatbility, security and redundancy, a top government technology official told industry groups.
The federal government's new business-like approach to IT offers "unlimited opportunity" for companies of all sizes, Norman Lorentz, the federal government's chief technology officer told Silicon Valley leaders during a forum sponsored by the technology trade association AeA.
"We need (the private sector) to provide solutions that solve business problems," said Lorentz, whose day job is as CTO for the U.S. Office of Management and Budget, spoke on Thursday to the AeA , which counts over 3,000 technology companies as members for which it lobbies the government on technology policy.
One of the key problems is communications between agencies and their disparate computer systems, a shortcoming that was painfully exposed on Sept. 11, 2001.
"The homeland can only be secure if all the dots connect," said Lorentz, who is also who active in streamlining government offices with more efficient uses of technology. "The local, state and federal government connection needs to be indelible."
Interoperability must be a part of any technology the federal government buys, he said. In addition to the free flow of information, compatible systems will allow future federal IT managers to move equipment where it is most needed.
For example, the government is currently evaluating the systems of the agencies that are being merged to form the Department of Homeland Security. The task would not be less daunting if everything was compatible.
This openness must be balanced, however, with security, especially for software and hardware aimed at the Department of Defense and intelligence agencies.
Lorentz conceded that Washington has done a poor job of assessing and implementing emerging technologies. This is an area where startups can win contracts, even if they haven't done business previously with the federal government.
Finally, IT outsourcing will likely spend billions on IT outsourcing in coming years. A high percentage of government IT workers will be eligible for retirement over the next five years, Lorentz said. And the government will look to farm out jobs to the private sector to save money.
Some larger systems integrators and IT firms, including IBM, EDS, CSC (which announced a slew of public sector deals over the last two days) are already benefitting from the trend.
Greg Baroni, president of Unisys' government unit, said his company is working on a large project for the Transportation Security Authority (TSA),
"They are not going to have arms and legs to go out and map a new system," Baroni said. "(Hiring us) lets them focus on their mission and creating a culture of security."
James Kane, president and CEO of the research and consulting firm Federal Sources Inc. (FSI), who also spoke at the event agreed that the Bush administration's IT strategy could be a boon for the tech sector.
"The Office of Management and Budget (which handles IT buying decisions) is looking at techology as an investment," Kane said. "It's a corporate mindset that has been brought to Washington that makes it a better mactch for companies."
Despite the mounting deficit, FSI predicts the federal government market will be "extremely strong" for the next two years, with overall IT spending creeping up toward 9 percent compound growth.
|
{
"pile_set_name": "Pile-CC"
}
|
Tardif, 25, is preparing for his fifth season as a member of the Grand
Rapids Griffins after serving as the team’s captain in 2009-10. He
tallied 16 goals and 33 points in 77 games last season, falling just one
shy of his AHL career high in each scoring category while matching his
personal bests with 17 assists and 90 penalty minutes.
In four seasons with Grand Rapids, Tardif has totaled 100 points
(51-49—100) and 241 PIM in 239 contests, ranking among the franchise’s
all-time leaders in games played (10th) and shots (602, 5th). His name
is sprinkled throughout the Griffins’ record book, as he holds the
franchise marks for fastest goal to start a game or period (:08), most
goals in a period (three, tied), and most power play goals in a period
(two, tied). He also has a pair of hat tricks to his credit, making him
one of only 10 Griffins to log multiple three-goal games.
|
{
"pile_set_name": "Pile-CC"
}
|
/*
* Copyright (C) 2008 Michael Brown <mbrown@fensystems.co.uk>.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
FILE_LICENCE ( GPL2_OR_LATER );
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <assert.h>
#include <byteswap.h>
#include <ipxe/netdevice.h>
#include <ipxe/iobuf.h>
#include <ipxe/in.h>
#include <ipxe/pci.h>
#include <ipxe/efi/efi.h>
#include <ipxe/efi/efi_pci.h>
#include <ipxe/efi/efi_driver.h>
#include <ipxe/efi/efi_strings.h>
#include <ipxe/efi/efi_hii.h>
#include <ipxe/efi/Protocol/SimpleNetwork.h>
#include <ipxe/efi/Protocol/NetworkInterfaceIdentifier.h>
#include <ipxe/efi/Protocol/DevicePath.h>
#include <ipxe/efi/Protocol/HiiConfigAccess.h>
#include <ipxe/efi/Protocol/HiiDatabase.h>
#include <config/general.h>
/** @file
*
* iPXE EFI SNP interface
*
*/
/** An SNP device */
struct efi_snp_device {
/** List of SNP devices */
struct list_head list;
/** The underlying iPXE network device */
struct net_device *netdev;
/** The underlying EFI PCI device */
struct efi_pci_device *efipci;
/** EFI device handle */
EFI_HANDLE handle;
/** The SNP structure itself */
EFI_SIMPLE_NETWORK_PROTOCOL snp;
/** The SNP "mode" (parameters) */
EFI_SIMPLE_NETWORK_MODE mode;
/** Outstanding TX packet count (via "interrupt status")
*
* Used in order to generate TX completions.
*/
unsigned int tx_count_interrupts;
/** Outstanding TX packet count (via "recycled tx buffers")
*
* Used in order to generate TX completions.
*/
unsigned int tx_count_txbufs;
/** Outstanding RX packet count (via "interrupt status") */
unsigned int rx_count_interrupts;
/** Outstanding RX packet count (via WaitForPacket event) */
unsigned int rx_count_events;
/** The network interface identifier */
EFI_NETWORK_INTERFACE_IDENTIFIER_PROTOCOL nii;
/** HII configuration access protocol */
EFI_HII_CONFIG_ACCESS_PROTOCOL hii;
/** HII package list */
EFI_HII_PACKAGE_LIST_HEADER *package_list;
/** HII handle */
EFI_HII_HANDLE hii_handle;
/** Device name */
wchar_t name[ sizeof ( ( ( struct net_device * ) NULL )->name ) ];
/** The device path
*
* This field is variable in size and must appear at the end
* of the structure.
*/
EFI_DEVICE_PATH_PROTOCOL path;
};
/** EFI simple network protocol GUID */
static EFI_GUID efi_simple_network_protocol_guid
= EFI_SIMPLE_NETWORK_PROTOCOL_GUID;
/** EFI device path protocol GUID */
static EFI_GUID efi_device_path_protocol_guid
= EFI_DEVICE_PATH_PROTOCOL_GUID;
/** EFI network interface identifier GUID */
static EFI_GUID efi_nii_protocol_guid
= EFI_NETWORK_INTERFACE_IDENTIFIER_PROTOCOL_GUID;
/** EFI network interface identifier GUID (extra special version) */
static EFI_GUID efi_nii31_protocol_guid = {
/* At some point, it seems that someone decided to change the
* GUID. Current EFI builds ignore the older GUID, older EFI
* builds ignore the newer GUID, so we have to expose both.
*/
0x1ACED566, 0x76ED, 0x4218,
{ 0xBC, 0x81, 0x76, 0x7F, 0x1F, 0x97, 0x7A, 0x89 }
};
/** List of SNP devices */
static LIST_HEAD ( efi_snp_devices );
/**
* Set EFI SNP mode based on iPXE net device parameters
*
* @v snp SNP interface
*/
static void efi_snp_set_mode ( struct efi_snp_device *snpdev ) {
struct net_device *netdev = snpdev->netdev;
EFI_SIMPLE_NETWORK_MODE *mode = &snpdev->mode;
struct ll_protocol *ll_protocol = netdev->ll_protocol;
unsigned int ll_addr_len = ll_protocol->ll_addr_len;
mode->HwAddressSize = ll_addr_len;
mode->MediaHeaderSize = ll_protocol->ll_header_len;
mode->MaxPacketSize = netdev->max_pkt_len;
mode->ReceiveFilterMask = ( EFI_SIMPLE_NETWORK_RECEIVE_UNICAST |
EFI_SIMPLE_NETWORK_RECEIVE_MULTICAST |
EFI_SIMPLE_NETWORK_RECEIVE_BROADCAST );
assert ( ll_addr_len <= sizeof ( mode->CurrentAddress ) );
memcpy ( &mode->CurrentAddress, netdev->ll_addr, ll_addr_len );
memcpy ( &mode->BroadcastAddress, netdev->ll_broadcast, ll_addr_len );
ll_protocol->init_addr ( netdev->hw_addr, &mode->PermanentAddress );
mode->IfType = ntohs ( ll_protocol->ll_proto );
mode->MacAddressChangeable = TRUE;
mode->MediaPresentSupported = TRUE;
mode->MediaPresent = ( netdev_link_ok ( netdev ) ? TRUE : FALSE );
}
/**
* Poll net device and count received packets
*
* @v snpdev SNP device
*/
static void efi_snp_poll ( struct efi_snp_device *snpdev ) {
struct io_buffer *iobuf;
unsigned int before = 0;
unsigned int after = 0;
unsigned int arrived;
/* We have to report packet arrivals, and this is the easiest
* way to fake it.
*/
list_for_each_entry ( iobuf, &snpdev->netdev->rx_queue, list )
before++;
netdev_poll ( snpdev->netdev );
list_for_each_entry ( iobuf, &snpdev->netdev->rx_queue, list )
after++;
arrived = ( after - before );
snpdev->rx_count_interrupts += arrived;
snpdev->rx_count_events += arrived;
}
/**
* Change SNP state from "stopped" to "started"
*
* @v snp SNP interface
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_start ( EFI_SIMPLE_NETWORK_PROTOCOL *snp ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
DBGC2 ( snpdev, "SNPDEV %p START\n", snpdev );
snpdev->mode.State = EfiSimpleNetworkStarted;
return 0;
}
/**
* Change SNP state from "started" to "stopped"
*
* @v snp SNP interface
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_stop ( EFI_SIMPLE_NETWORK_PROTOCOL *snp ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
DBGC2 ( snpdev, "SNPDEV %p STOP\n", snpdev );
snpdev->mode.State = EfiSimpleNetworkStopped;
return 0;
}
/**
* Open the network device
*
* @v snp SNP interface
* @v extra_rx_bufsize Extra RX buffer size, in bytes
* @v extra_tx_bufsize Extra TX buffer size, in bytes
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_initialize ( EFI_SIMPLE_NETWORK_PROTOCOL *snp,
UINTN extra_rx_bufsize, UINTN extra_tx_bufsize ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
int rc;
DBGC2 ( snpdev, "SNPDEV %p INITIALIZE (%ld extra RX, %ld extra TX)\n",
snpdev, ( ( unsigned long ) extra_rx_bufsize ),
( ( unsigned long ) extra_tx_bufsize ) );
if ( ( rc = netdev_open ( snpdev->netdev ) ) != 0 ) {
DBGC ( snpdev, "SNPDEV %p could not open %s: %s\n",
snpdev, snpdev->netdev->name, strerror ( rc ) );
return RC_TO_EFIRC ( rc );
}
snpdev->mode.State = EfiSimpleNetworkInitialized;
return 0;
}
/**
* Reset the network device
*
* @v snp SNP interface
* @v ext_verify Extended verification required
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_reset ( EFI_SIMPLE_NETWORK_PROTOCOL *snp, BOOLEAN ext_verify ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
int rc;
DBGC2 ( snpdev, "SNPDEV %p RESET (%s extended verification)\n",
snpdev, ( ext_verify ? "with" : "without" ) );
netdev_close ( snpdev->netdev );
snpdev->mode.State = EfiSimpleNetworkStarted;
if ( ( rc = netdev_open ( snpdev->netdev ) ) != 0 ) {
DBGC ( snpdev, "SNPDEV %p could not reopen %s: %s\n",
snpdev, snpdev->netdev->name, strerror ( rc ) );
return RC_TO_EFIRC ( rc );
}
snpdev->mode.State = EfiSimpleNetworkInitialized;
return 0;
}
/**
* Shut down the network device
*
* @v snp SNP interface
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_shutdown ( EFI_SIMPLE_NETWORK_PROTOCOL *snp ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
DBGC2 ( snpdev, "SNPDEV %p SHUTDOWN\n", snpdev );
netdev_close ( snpdev->netdev );
snpdev->mode.State = EfiSimpleNetworkStarted;
return 0;
}
/**
* Manage receive filters
*
* @v snp SNP interface
* @v enable Receive filters to enable
* @v disable Receive filters to disable
* @v mcast_reset Reset multicast filters
* @v mcast_count Number of multicast filters
* @v mcast Multicast filters
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_receive_filters ( EFI_SIMPLE_NETWORK_PROTOCOL *snp, UINT32 enable,
UINT32 disable, BOOLEAN mcast_reset,
UINTN mcast_count, EFI_MAC_ADDRESS *mcast ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
unsigned int i;
DBGC2 ( snpdev, "SNPDEV %p RECEIVE_FILTERS %08x&~%08x%s %ld mcast\n",
snpdev, enable, disable, ( mcast_reset ? " reset" : "" ),
( ( unsigned long ) mcast_count ) );
for ( i = 0 ; i < mcast_count ; i++ ) {
DBGC2_HDA ( snpdev, i, &mcast[i],
snpdev->netdev->ll_protocol->ll_addr_len );
}
/* Lie through our teeth, otherwise MNP refuses to accept us */
return 0;
}
/**
* Set station address
*
* @v snp SNP interface
* @v reset Reset to permanent address
* @v new New station address
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_station_address ( EFI_SIMPLE_NETWORK_PROTOCOL *snp, BOOLEAN reset,
EFI_MAC_ADDRESS *new ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
struct ll_protocol *ll_protocol = snpdev->netdev->ll_protocol;
DBGC2 ( snpdev, "SNPDEV %p STATION_ADDRESS %s\n", snpdev,
( reset ? "reset" : ll_protocol->ntoa ( new ) ) );
/* Set the MAC address */
if ( reset )
new = &snpdev->mode.PermanentAddress;
memcpy ( snpdev->netdev->ll_addr, new, ll_protocol->ll_addr_len );
/* MAC address changes take effect only on netdev_open() */
if ( netdev_is_open ( snpdev->netdev ) ) {
DBGC ( snpdev, "SNPDEV %p MAC address changed while net "
"devive open\n", snpdev );
}
return 0;
}
/**
* Get (or reset) statistics
*
* @v snp SNP interface
* @v reset Reset statistics
* @v stats_len Size of statistics table
* @v stats Statistics table
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_statistics ( EFI_SIMPLE_NETWORK_PROTOCOL *snp, BOOLEAN reset,
UINTN *stats_len, EFI_NETWORK_STATISTICS *stats ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
EFI_NETWORK_STATISTICS stats_buf;
DBGC2 ( snpdev, "SNPDEV %p STATISTICS%s", snpdev,
( reset ? " reset" : "" ) );
/* Gather statistics */
memset ( &stats_buf, 0, sizeof ( stats_buf ) );
stats_buf.TxGoodFrames = snpdev->netdev->tx_stats.good;
stats_buf.TxDroppedFrames = snpdev->netdev->tx_stats.bad;
stats_buf.TxTotalFrames = ( snpdev->netdev->tx_stats.good +
snpdev->netdev->tx_stats.bad );
stats_buf.RxGoodFrames = snpdev->netdev->rx_stats.good;
stats_buf.RxDroppedFrames = snpdev->netdev->rx_stats.bad;
stats_buf.RxTotalFrames = ( snpdev->netdev->rx_stats.good +
snpdev->netdev->rx_stats.bad );
if ( *stats_len > sizeof ( stats_buf ) )
*stats_len = sizeof ( stats_buf );
if ( stats )
memcpy ( stats, &stats_buf, *stats_len );
/* Reset statistics if requested to do so */
if ( reset ) {
memset ( &snpdev->netdev->tx_stats, 0,
sizeof ( snpdev->netdev->tx_stats ) );
memset ( &snpdev->netdev->rx_stats, 0,
sizeof ( snpdev->netdev->rx_stats ) );
}
return 0;
}
/**
* Convert multicast IP address to MAC address
*
* @v snp SNP interface
* @v ipv6 Address is IPv6
* @v ip IP address
* @v mac MAC address
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_mcast_ip_to_mac ( EFI_SIMPLE_NETWORK_PROTOCOL *snp, BOOLEAN ipv6,
EFI_IP_ADDRESS *ip, EFI_MAC_ADDRESS *mac ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
struct ll_protocol *ll_protocol = snpdev->netdev->ll_protocol;
const char *ip_str;
int rc;
ip_str = ( ipv6 ? "(IPv6)" /* FIXME when we have inet6_ntoa() */ :
inet_ntoa ( *( ( struct in_addr * ) ip ) ) );
DBGC2 ( snpdev, "SNPDEV %p MCAST_IP_TO_MAC %s\n", snpdev, ip_str );
/* Try to hash the address */
if ( ( rc = ll_protocol->mc_hash ( ( ipv6 ? AF_INET6 : AF_INET ),
ip, mac ) ) != 0 ) {
DBGC ( snpdev, "SNPDEV %p could not hash %s: %s\n",
snpdev, ip_str, strerror ( rc ) );
return RC_TO_EFIRC ( rc );
}
return 0;
}
/**
* Read or write non-volatile storage
*
* @v snp SNP interface
* @v read Operation is a read
* @v offset Starting offset within NVRAM
* @v len Length of data buffer
* @v data Data buffer
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_nvdata ( EFI_SIMPLE_NETWORK_PROTOCOL *snp, BOOLEAN read,
UINTN offset, UINTN len, VOID *data ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
DBGC2 ( snpdev, "SNPDEV %p NVDATA %s %lx+%lx\n", snpdev,
( read ? "read" : "write" ), ( ( unsigned long ) offset ),
( ( unsigned long ) len ) );
if ( ! read )
DBGC2_HDA ( snpdev, offset, data, len );
return EFI_UNSUPPORTED;
}
/**
* Read interrupt status and TX recycled buffer status
*
* @v snp SNP interface
* @v interrupts Interrupt status, or NULL
* @v txbufs Recycled transmit buffer address, or NULL
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_get_status ( EFI_SIMPLE_NETWORK_PROTOCOL *snp,
UINT32 *interrupts, VOID **txbufs ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
DBGC2 ( snpdev, "SNPDEV %p GET_STATUS", snpdev );
/* Poll the network device */
efi_snp_poll ( snpdev );
/* Interrupt status. In practice, this seems to be used only
* to detect TX completions.
*/
if ( interrupts ) {
*interrupts = 0;
/* Report TX completions once queue is empty; this
* avoids having to add hooks in the net device layer.
*/
if ( snpdev->tx_count_interrupts &&
list_empty ( &snpdev->netdev->tx_queue ) ) {
*interrupts |= EFI_SIMPLE_NETWORK_TRANSMIT_INTERRUPT;
snpdev->tx_count_interrupts--;
}
/* Report RX */
if ( snpdev->rx_count_interrupts ) {
*interrupts |= EFI_SIMPLE_NETWORK_RECEIVE_INTERRUPT;
snpdev->rx_count_interrupts--;
}
DBGC2 ( snpdev, " INTS:%02x", *interrupts );
}
/* TX completions. It would be possible to design a more
* idiotic scheme for this, but it would be a challenge.
* According to the UEFI header file, txbufs will be filled in
* with a list of "recycled transmit buffers" (i.e. completed
* TX buffers). Observant readers may care to note that
* *txbufs is a void pointer. Precisely how a list of
* completed transmit buffers is meant to be represented as an
* array of voids is left as an exercise for the reader.
*
* The only users of this interface (MnpDxe/MnpIo.c and
* PxeBcDxe/Bc.c within the EFI dev kit) both just poll until
* seeing a non-NULL result return in txbufs. This is valid
* provided that they do not ever attempt to transmit more
* than one packet concurrently (and that TX never times out).
*/
if ( txbufs ) {
if ( snpdev->tx_count_txbufs &&
list_empty ( &snpdev->netdev->tx_queue ) ) {
*txbufs = "Which idiot designed this API?";
snpdev->tx_count_txbufs--;
} else {
*txbufs = NULL;
}
DBGC2 ( snpdev, " TX:%s", ( *txbufs ? "some" : "none" ) );
}
DBGC2 ( snpdev, "\n" );
return 0;
}
/**
* Start packet transmission
*
* @v snp SNP interface
* @v ll_header_len Link-layer header length, if to be filled in
* @v len Length of data buffer
* @v data Data buffer
* @v ll_src Link-layer source address, if specified
* @v ll_dest Link-layer destination address, if specified
* @v net_proto Network-layer protocol (in host order)
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_transmit ( EFI_SIMPLE_NETWORK_PROTOCOL *snp,
UINTN ll_header_len, UINTN len, VOID *data,
EFI_MAC_ADDRESS *ll_src, EFI_MAC_ADDRESS *ll_dest,
UINT16 *net_proto ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
struct ll_protocol *ll_protocol = snpdev->netdev->ll_protocol;
struct io_buffer *iobuf;
size_t ll_headroom;
int rc;
EFI_STATUS efirc;
DBGC2 ( snpdev, "SNPDEV %p TRANSMIT %p+%lx", snpdev, data,
( ( unsigned long ) len ) );
if ( ll_header_len ) {
if ( ll_src ) {
DBGC2 ( snpdev, " src %s",
ll_protocol->ntoa ( ll_src ) );
}
if ( ll_dest ) {
DBGC2 ( snpdev, " dest %s",
ll_protocol->ntoa ( ll_dest ) );
}
if ( net_proto ) {
DBGC2 ( snpdev, " proto %04x", *net_proto );
}
}
DBGC2 ( snpdev, "\n" );
/* Sanity checks */
if ( ll_header_len ) {
if ( ll_header_len != ll_protocol->ll_header_len ) {
DBGC ( snpdev, "SNPDEV %p TX invalid header length "
"%ld\n", snpdev,
( ( unsigned long ) ll_header_len ) );
efirc = EFI_INVALID_PARAMETER;
goto err_sanity;
}
if ( len < ll_header_len ) {
DBGC ( snpdev, "SNPDEV %p invalid packet length %ld\n",
snpdev, ( ( unsigned long ) len ) );
efirc = EFI_BUFFER_TOO_SMALL;
goto err_sanity;
}
if ( ! ll_dest ) {
DBGC ( snpdev, "SNPDEV %p TX missing destination "
"address\n", snpdev );
efirc = EFI_INVALID_PARAMETER;
goto err_sanity;
}
if ( ! net_proto ) {
DBGC ( snpdev, "SNPDEV %p TX missing network "
"protocol\n", snpdev );
efirc = EFI_INVALID_PARAMETER;
goto err_sanity;
}
if ( ! ll_src )
ll_src = &snpdev->mode.CurrentAddress;
}
/* Allocate buffer */
ll_headroom = ( MAX_LL_HEADER_LEN - ll_header_len );
iobuf = alloc_iob ( ll_headroom + len );
if ( ! iobuf ) {
DBGC ( snpdev, "SNPDEV %p TX could not allocate %ld-byte "
"buffer\n", snpdev, ( ( unsigned long ) len ) );
efirc = EFI_DEVICE_ERROR;
goto err_alloc_iob;
}
iob_reserve ( iobuf, ll_headroom );
memcpy ( iob_put ( iobuf, len ), data, len );
/* Create link-layer header, if specified */
if ( ll_header_len ) {
iob_pull ( iobuf, ll_header_len );
if ( ( rc = ll_protocol->push ( snpdev->netdev,
iobuf, ll_dest, ll_src,
htons ( *net_proto ) )) != 0 ){
DBGC ( snpdev, "SNPDEV %p TX could not construct "
"header: %s\n", snpdev, strerror ( rc ) );
efirc = RC_TO_EFIRC ( rc );
goto err_ll_push;
}
}
/* Transmit packet */
if ( ( rc = netdev_tx ( snpdev->netdev, iob_disown ( iobuf ) ) ) != 0){
DBGC ( snpdev, "SNPDEV %p TX could not transmit: %s\n",
snpdev, strerror ( rc ) );
efirc = RC_TO_EFIRC ( rc );
goto err_tx;
}
/* Record transmission as outstanding */
snpdev->tx_count_interrupts++;
snpdev->tx_count_txbufs++;
return 0;
err_tx:
err_ll_push:
free_iob ( iobuf );
err_alloc_iob:
err_sanity:
return efirc;
}
/**
* Receive packet
*
* @v snp SNP interface
* @v ll_header_len Link-layer header length, if to be filled in
* @v len Length of data buffer
* @v data Data buffer
* @v ll_src Link-layer source address, if specified
* @v ll_dest Link-layer destination address, if specified
* @v net_proto Network-layer protocol (in host order)
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_receive ( EFI_SIMPLE_NETWORK_PROTOCOL *snp,
UINTN *ll_header_len, UINTN *len, VOID *data,
EFI_MAC_ADDRESS *ll_src, EFI_MAC_ADDRESS *ll_dest,
UINT16 *net_proto ) {
struct efi_snp_device *snpdev =
container_of ( snp, struct efi_snp_device, snp );
struct ll_protocol *ll_protocol = snpdev->netdev->ll_protocol;
struct io_buffer *iobuf;
const void *iob_ll_dest;
const void *iob_ll_src;
uint16_t iob_net_proto;
int rc;
EFI_STATUS efirc;
DBGC2 ( snpdev, "SNPDEV %p RECEIVE %p(+%lx)", snpdev, data,
( ( unsigned long ) *len ) );
/* Poll the network device */
efi_snp_poll ( snpdev );
/* Dequeue a packet, if one is available */
iobuf = netdev_rx_dequeue ( snpdev->netdev );
if ( ! iobuf ) {
DBGC2 ( snpdev, "\n" );
efirc = EFI_NOT_READY;
goto out_no_packet;
}
DBGC2 ( snpdev, "+%zx\n", iob_len ( iobuf ) );
/* Return packet to caller */
memcpy ( data, iobuf->data, iob_len ( iobuf ) );
*len = iob_len ( iobuf );
/* Attempt to decode link-layer header */
if ( ( rc = ll_protocol->pull ( snpdev->netdev, iobuf, &iob_ll_dest,
&iob_ll_src, &iob_net_proto ) ) != 0 ){
DBGC ( snpdev, "SNPDEV %p could not parse header: %s\n",
snpdev, strerror ( rc ) );
efirc = RC_TO_EFIRC ( rc );
goto out_bad_ll_header;
}
/* Return link-layer header parameters to caller, if required */
if ( ll_header_len )
*ll_header_len = ll_protocol->ll_header_len;
if ( ll_src )
memcpy ( ll_src, iob_ll_src, ll_protocol->ll_addr_len );
if ( ll_dest )
memcpy ( ll_dest, iob_ll_dest, ll_protocol->ll_addr_len );
if ( net_proto )
*net_proto = ntohs ( iob_net_proto );
efirc = 0;
out_bad_ll_header:
free_iob ( iobuf );
out_no_packet:
return efirc;
}
/**
* Poll event
*
* @v event Event
* @v context Event context
*/
static VOID EFIAPI efi_snp_wait_for_packet ( EFI_EVENT event,
VOID *context ) {
EFI_BOOT_SERVICES *bs = efi_systab->BootServices;
struct efi_snp_device *snpdev = context;
DBGCP ( snpdev, "SNPDEV %p WAIT_FOR_PACKET\n", snpdev );
/* Do nothing unless the net device is open */
if ( ! netdev_is_open ( snpdev->netdev ) )
return;
/* Poll the network device */
efi_snp_poll ( snpdev );
/* Fire event if packets have been received */
if ( snpdev->rx_count_events != 0 ) {
DBGC2 ( snpdev, "SNPDEV %p firing WaitForPacket event\n",
snpdev );
bs->SignalEvent ( event );
snpdev->rx_count_events--;
}
}
/** SNP interface */
static EFI_SIMPLE_NETWORK_PROTOCOL efi_snp_device_snp = {
.Revision = EFI_SIMPLE_NETWORK_PROTOCOL_REVISION,
.Start = efi_snp_start,
.Stop = efi_snp_stop,
.Initialize = efi_snp_initialize,
.Reset = efi_snp_reset,
.Shutdown = efi_snp_shutdown,
.ReceiveFilters = efi_snp_receive_filters,
.StationAddress = efi_snp_station_address,
.Statistics = efi_snp_statistics,
.MCastIpToMac = efi_snp_mcast_ip_to_mac,
.NvData = efi_snp_nvdata,
.GetStatus = efi_snp_get_status,
.Transmit = efi_snp_transmit,
.Receive = efi_snp_receive,
};
/******************************************************************************
*
* Human Interface Infrastructure
*
******************************************************************************
*/
/** EFI configuration access protocol GUID */
static EFI_GUID efi_hii_config_access_protocol_guid
= EFI_HII_CONFIG_ACCESS_PROTOCOL_GUID;
/** EFI HII database protocol */
static EFI_HII_DATABASE_PROTOCOL *efihii;
EFI_REQUIRE_PROTOCOL ( EFI_HII_DATABASE_PROTOCOL, &efihii );
/** Local GUID used for our EFI SNP formset */
#define EFI_SNP_FORMSET_GUID \
{ 0xc4f84019, 0x6dfd, 0x4a27, \
{ 0x9b, 0x94, 0xb7, 0x2e, 0x1f, 0xbc, 0xad, 0xca } }
/** Form identifiers used for our EFI SNP HII */
enum efi_snp_hii_form_id {
EFI_SNP_FORM = 0x0001, /**< The only form */
};
/** String identifiers used for our EFI SNP HII */
enum efi_snp_hii_string_id {
/* Language name */
EFI_SNP_LANGUAGE_NAME = 0x0001,
/* Formset */
EFI_SNP_FORMSET_TITLE, EFI_SNP_FORMSET_HELP,
/* Product name */
EFI_SNP_PRODUCT_PROMPT, EFI_SNP_PRODUCT_HELP, EFI_SNP_PRODUCT_TEXT,
/* Version */
EFI_SNP_VERSION_PROMPT, EFI_SNP_VERSION_HELP, EFI_SNP_VERSION_TEXT,
/* Driver */
EFI_SNP_DRIVER_PROMPT, EFI_SNP_DRIVER_HELP, EFI_SNP_DRIVER_TEXT,
/* Device */
EFI_SNP_DEVICE_PROMPT, EFI_SNP_DEVICE_HELP, EFI_SNP_DEVICE_TEXT,
/* End of list */
EFI_SNP_MAX_STRING_ID
};
/** EFI SNP formset */
struct efi_snp_formset {
EFI_HII_PACKAGE_HEADER Header;
EFI_IFR_FORM_SET_TYPE(1) FormSet;
EFI_IFR_GUID_CLASS Class;
EFI_IFR_GUID_SUBCLASS SubClass;
EFI_IFR_FORM Form;
EFI_IFR_TEXT ProductText;
EFI_IFR_TEXT VersionText;
EFI_IFR_TEXT DriverText;
EFI_IFR_TEXT DeviceText;
EFI_IFR_END EndForm;
EFI_IFR_END EndFormSet;
} __attribute__ (( packed )) efi_snp_formset = {
.Header = {
.Length = sizeof ( efi_snp_formset ),
.Type = EFI_HII_PACKAGE_FORMS,
},
.FormSet = EFI_IFR_FORM_SET ( EFI_SNP_FORMSET_GUID,
EFI_SNP_FORMSET_TITLE,
EFI_SNP_FORMSET_HELP,
typeof ( efi_snp_formset.FormSet ),
EFI_HII_PLATFORM_SETUP_FORMSET_GUID ),
.Class = EFI_IFR_GUID_CLASS ( EFI_NETWORK_DEVICE_CLASS ),
.SubClass = EFI_IFR_GUID_SUBCLASS ( 0x03 ),
.Form = EFI_IFR_FORM ( EFI_SNP_FORM, EFI_SNP_FORMSET_TITLE ),
.ProductText = EFI_IFR_TEXT ( EFI_SNP_PRODUCT_PROMPT,
EFI_SNP_PRODUCT_HELP,
EFI_SNP_PRODUCT_TEXT ),
.VersionText = EFI_IFR_TEXT ( EFI_SNP_VERSION_PROMPT,
EFI_SNP_VERSION_HELP,
EFI_SNP_VERSION_TEXT ),
.DriverText = EFI_IFR_TEXT ( EFI_SNP_DRIVER_PROMPT,
EFI_SNP_DRIVER_HELP,
EFI_SNP_DRIVER_TEXT ),
.DeviceText = EFI_IFR_TEXT ( EFI_SNP_DEVICE_PROMPT,
EFI_SNP_DEVICE_HELP,
EFI_SNP_DEVICE_TEXT ),
.EndForm = EFI_IFR_END(),
.EndFormSet = EFI_IFR_END(),
};
/**
* Generate EFI SNP string
*
* @v wbuf Buffer
* @v swlen Size of buffer (in wide characters)
* @v snpdev SNP device
* @ret wlen Length of string (in wide characters)
*/
static int efi_snp_string ( wchar_t *wbuf, ssize_t swlen,
enum efi_snp_hii_string_id id,
struct efi_snp_device *snpdev ) {
struct net_device *netdev = snpdev->netdev;
struct device *dev = netdev->dev;
switch ( id ) {
case EFI_SNP_LANGUAGE_NAME:
return efi_ssnprintf ( wbuf, swlen, "English" );
case EFI_SNP_FORMSET_TITLE:
return efi_ssnprintf ( wbuf, swlen, "%s (%s)",
( PRODUCT_NAME[0] ?
PRODUCT_NAME : PRODUCT_SHORT_NAME ),
netdev_addr ( netdev ) );
case EFI_SNP_FORMSET_HELP:
return efi_ssnprintf ( wbuf, swlen,
"Configure " PRODUCT_SHORT_NAME );
case EFI_SNP_PRODUCT_PROMPT:
return efi_ssnprintf ( wbuf, swlen, "Name" );
case EFI_SNP_PRODUCT_HELP:
return efi_ssnprintf ( wbuf, swlen, "Firmware product name" );
case EFI_SNP_PRODUCT_TEXT:
return efi_ssnprintf ( wbuf, swlen, "%s",
( PRODUCT_NAME[0] ?
PRODUCT_NAME : PRODUCT_SHORT_NAME ) );
case EFI_SNP_VERSION_PROMPT:
return efi_ssnprintf ( wbuf, swlen, "Version" );
case EFI_SNP_VERSION_HELP:
return efi_ssnprintf ( wbuf, swlen, "Firmware version" );
case EFI_SNP_VERSION_TEXT:
return efi_ssnprintf ( wbuf, swlen, VERSION );
case EFI_SNP_DRIVER_PROMPT:
return efi_ssnprintf ( wbuf, swlen, "Driver" );
case EFI_SNP_DRIVER_HELP:
return efi_ssnprintf ( wbuf, swlen, "Firmware driver" );
case EFI_SNP_DRIVER_TEXT:
return efi_ssnprintf ( wbuf, swlen, "%s", dev->driver_name );
case EFI_SNP_DEVICE_PROMPT:
return efi_ssnprintf ( wbuf, swlen, "Device" );
case EFI_SNP_DEVICE_HELP:
return efi_ssnprintf ( wbuf, swlen, "Hardware device" );
case EFI_SNP_DEVICE_TEXT:
return efi_ssnprintf ( wbuf, swlen, "%s", dev->name );
default:
assert ( 0 );
return 0;
}
}
/**
* Generate EFI SNP string package
*
* @v strings String package header buffer
* @v max_len Buffer length
* @v snpdev SNP device
* @ret len Length of string package
*/
static int efi_snp_strings ( EFI_HII_STRING_PACKAGE_HDR *strings,
size_t max_len, struct efi_snp_device *snpdev ) {
static const char language[] = "en-us";
void *buf = strings;
ssize_t remaining = max_len;
size_t hdrsize;
EFI_HII_SIBT_STRING_UCS2_BLOCK *string;
ssize_t wremaining;
size_t string_wlen;
unsigned int id;
EFI_HII_STRING_BLOCK *end;
size_t len;
/* Calculate header size */
hdrsize = ( offsetof ( typeof ( *strings ), Language ) +
sizeof ( language ) );
buf += hdrsize;
remaining -= hdrsize;
/* Fill in strings */
for ( id = 1 ; id < EFI_SNP_MAX_STRING_ID ; id++ ) {
string = buf;
if ( remaining >= ( ( ssize_t ) sizeof ( string->Header ) ) )
string->Header.BlockType = EFI_HII_SIBT_STRING_UCS2;
buf += offsetof ( typeof ( *string ), StringText );
remaining -= offsetof ( typeof ( *string ), StringText );
wremaining = ( remaining /
( ( ssize_t ) sizeof ( string->StringText[0] )));
assert ( ! ( ( remaining <= 0 ) && ( wremaining > 0 ) ) );
string_wlen = efi_snp_string ( string->StringText, wremaining,
id, snpdev );
buf += ( ( string_wlen + 1 /* wNUL */ ) *
sizeof ( string->StringText[0] ) );
remaining -= ( ( string_wlen + 1 /* wNUL */ ) *
sizeof ( string->StringText[0] ) );
}
/* Fill in end marker */
end = buf;
if ( remaining >= ( ( ssize_t ) sizeof ( *end ) ) )
end->BlockType = EFI_HII_SIBT_END;
buf += sizeof ( *end );
remaining -= sizeof ( *end );
/* Calculate overall length */
len = ( max_len - remaining );
/* Fill in string package header */
if ( strings ) {
memset ( strings, 0, sizeof ( *strings ) );
strings->Header.Length = len;
strings->Header.Type = EFI_HII_PACKAGE_STRINGS;
strings->HdrSize = hdrsize;
strings->StringInfoOffset = hdrsize;
strings->LanguageName = EFI_SNP_LANGUAGE_NAME;
memcpy ( strings->Language, language, sizeof ( language ) );
}
return len;
}
/**
* Generate EFI SNP package list
*
* @v snpdev SNP device
* @ret package_list Package list, or NULL on error
*
* The package list is allocated using malloc(), and must eventually
* be freed by the caller.
*/
static EFI_HII_PACKAGE_LIST_HEADER *
efi_snp_package_list ( struct efi_snp_device *snpdev ) {
size_t strings_len = efi_snp_strings ( NULL, 0, snpdev );
struct {
EFI_HII_PACKAGE_LIST_HEADER header;
struct efi_snp_formset formset;
union {
EFI_HII_STRING_PACKAGE_HDR strings;
uint8_t pad[strings_len];
} __attribute__ (( packed )) strings;
EFI_HII_PACKAGE_HEADER end;
} __attribute__ (( packed )) *package_list;
/* Allocate package list */
package_list = zalloc ( sizeof ( *package_list ) );
if ( ! package_list )
return NULL;
/* Populate package list */
memcpy ( &package_list->header.PackageListGuid,
&efi_snp_formset.FormSet.FormSet.Guid,
sizeof ( package_list->header.PackageListGuid ) );
package_list->header.PackageLength = sizeof ( *package_list );
memcpy ( &package_list->formset, &efi_snp_formset,
sizeof ( package_list->formset ) );
efi_snp_strings ( &package_list->strings.strings,
sizeof ( package_list->strings ), snpdev );
package_list->end.Length = sizeof ( package_list->end );
package_list->end.Type = EFI_HII_PACKAGE_END;
return &package_list->header;
}
/**
* Fetch configuration
*
* @v hii HII configuration access protocol
* @v request Configuration to fetch
* @ret progress Progress made through configuration to fetch
* @ret results Query results
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_hii_extract_config ( const EFI_HII_CONFIG_ACCESS_PROTOCOL *hii,
EFI_STRING request, EFI_STRING *progress,
EFI_STRING *results __unused ) {
struct efi_snp_device *snpdev =
container_of ( hii, struct efi_snp_device, hii );
DBGC ( snpdev, "SNPDEV %p ExtractConfig\n", snpdev );
*progress = request;
return EFI_INVALID_PARAMETER;
}
/**
* Store configuration
*
* @v hii HII configuration access protocol
* @v config Configuration to store
* @ret progress Progress made through configuration to store
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_hii_route_config ( const EFI_HII_CONFIG_ACCESS_PROTOCOL *hii,
EFI_STRING config, EFI_STRING *progress ) {
struct efi_snp_device *snpdev =
container_of ( hii, struct efi_snp_device, hii );
DBGC ( snpdev, "SNPDEV %p RouteConfig\n", snpdev );
*progress = config;
return EFI_INVALID_PARAMETER;
}
/**
* Handle form actions
*
* @v hii HII configuration access protocol
* @v action Form browser action
* @v question_id Question ID
* @v type Type of value
* @v value Value
* @ret action_request Action requested by driver
* @ret efirc EFI status code
*/
static EFI_STATUS EFIAPI
efi_snp_hii_callback ( const EFI_HII_CONFIG_ACCESS_PROTOCOL *hii,
EFI_BROWSER_ACTION action __unused,
EFI_QUESTION_ID question_id __unused,
UINT8 type __unused, EFI_IFR_TYPE_VALUE *value __unused,
EFI_BROWSER_ACTION_REQUEST *action_request __unused ) {
struct efi_snp_device *snpdev =
container_of ( hii, struct efi_snp_device, hii );
DBGC ( snpdev, "SNPDEV %p Callback\n", snpdev );
return EFI_UNSUPPORTED;
}
/** HII configuration access protocol */
static EFI_HII_CONFIG_ACCESS_PROTOCOL efi_snp_device_hii = {
.ExtractConfig = efi_snp_hii_extract_config,
.RouteConfig = efi_snp_hii_route_config,
.Callback = efi_snp_hii_callback,
};
/******************************************************************************
*
* iPXE network driver
*
******************************************************************************
*/
/**
* Locate SNP device corresponding to network device
*
* @v netdev Network device
* @ret snp SNP device, or NULL if not found
*/
static struct efi_snp_device * efi_snp_demux ( struct net_device *netdev ) {
struct efi_snp_device *snpdev;
list_for_each_entry ( snpdev, &efi_snp_devices, list ) {
if ( snpdev->netdev == netdev )
return snpdev;
}
return NULL;
}
/**
* Create SNP device
*
* @v netdev Network device
* @ret rc Return status code
*/
static int efi_snp_probe ( struct net_device *netdev ) {
EFI_BOOT_SERVICES *bs = efi_systab->BootServices;
struct efi_pci_device *efipci;
struct efi_snp_device *snpdev;
EFI_DEVICE_PATH_PROTOCOL *path_end;
MAC_ADDR_DEVICE_PATH *macpath;
size_t path_prefix_len = 0;
EFI_STATUS efirc;
int rc;
/* Find EFI PCI device */
efipci = efipci_find ( netdev->dev );
if ( ! efipci ) {
DBG ( "SNP skipping non-PCI device %s\n", netdev->name );
rc = 0;
goto err_no_pci;
}
/* Calculate device path prefix length */
path_end = efi_devpath_end ( efipci->path );
path_prefix_len = ( ( ( void * ) path_end ) -
( ( void * ) efipci->path ) );
/* Allocate the SNP device */
snpdev = zalloc ( sizeof ( *snpdev ) + path_prefix_len +
sizeof ( *macpath ) );
if ( ! snpdev ) {
rc = -ENOMEM;
goto err_alloc_snp;
}
snpdev->netdev = netdev_get ( netdev );
snpdev->efipci = efipci;
/* Sanity check */
if ( netdev->ll_protocol->ll_addr_len > sizeof ( EFI_MAC_ADDRESS ) ) {
DBGC ( snpdev, "SNPDEV %p cannot support link-layer address "
"length %d for %s\n", snpdev,
netdev->ll_protocol->ll_addr_len, netdev->name );
rc = -ENOTSUP;
goto err_ll_addr_len;
}
/* Populate the SNP structure */
memcpy ( &snpdev->snp, &efi_snp_device_snp, sizeof ( snpdev->snp ) );
snpdev->snp.Mode = &snpdev->mode;
if ( ( efirc = bs->CreateEvent ( EVT_NOTIFY_WAIT, TPL_NOTIFY,
efi_snp_wait_for_packet, snpdev,
&snpdev->snp.WaitForPacket ) ) != 0 ){
DBGC ( snpdev, "SNPDEV %p could not create event: %s\n",
snpdev, efi_strerror ( efirc ) );
rc = EFIRC_TO_RC ( efirc );
goto err_create_event;
}
/* Populate the SNP mode structure */
snpdev->mode.State = EfiSimpleNetworkStopped;
efi_snp_set_mode ( snpdev );
/* Populate the NII structure */
snpdev->nii.Revision =
EFI_NETWORK_INTERFACE_IDENTIFIER_PROTOCOL_REVISION;
strncpy ( snpdev->nii.StringId, "iPXE",
sizeof ( snpdev->nii.StringId ) );
/* Populate the HII configuration access structure */
memcpy ( &snpdev->hii, &efi_snp_device_hii, sizeof ( snpdev->hii ) );
/* Populate the device name */
efi_snprintf ( snpdev->name, ( sizeof ( snpdev->name ) /
sizeof ( snpdev->name[0] ) ),
"%s", netdev->name );
/* Populate the device path */
memcpy ( &snpdev->path, efipci->path, path_prefix_len );
macpath = ( ( ( void * ) &snpdev->path ) + path_prefix_len );
path_end = ( ( void * ) ( macpath + 1 ) );
memset ( macpath, 0, sizeof ( *macpath ) );
macpath->Header.Type = MESSAGING_DEVICE_PATH;
macpath->Header.SubType = MSG_MAC_ADDR_DP;
macpath->Header.Length[0] = sizeof ( *macpath );
memcpy ( &macpath->MacAddress, netdev->ll_addr,
sizeof ( macpath->MacAddress ) );
macpath->IfType = ntohs ( netdev->ll_protocol->ll_proto );
memset ( path_end, 0, sizeof ( *path_end ) );
path_end->Type = END_DEVICE_PATH_TYPE;
path_end->SubType = END_ENTIRE_DEVICE_PATH_SUBTYPE;
path_end->Length[0] = sizeof ( *path_end );
/* Install the SNP */
if ( ( efirc = bs->InstallMultipleProtocolInterfaces (
&snpdev->handle,
&efi_simple_network_protocol_guid, &snpdev->snp,
&efi_device_path_protocol_guid, &snpdev->path,
&efi_nii_protocol_guid, &snpdev->nii,
&efi_nii31_protocol_guid, &snpdev->nii,
&efi_hii_config_access_protocol_guid, &snpdev->hii,
NULL ) ) != 0 ) {
DBGC ( snpdev, "SNPDEV %p could not install protocols: "
"%s\n", snpdev, efi_strerror ( efirc ) );
rc = EFIRC_TO_RC ( efirc );
goto err_install_protocol_interface;
}
/* Add as child of PCI device */
if ( ( efirc = efipci_child_add ( efipci, snpdev->handle ) ) != 0 ) {
DBGC ( snpdev, "SNPDEV %p could not become child of " PCI_FMT
": %s\n", snpdev, PCI_ARGS ( &efipci->pci ),
efi_strerror ( efirc ) );
rc = EFIRC_TO_RC ( efirc );
goto err_efipci_child_add;
}
/* Create HII package list */
snpdev->package_list = efi_snp_package_list ( snpdev );
if ( ! snpdev->package_list ) {
DBGC ( snpdev, "SNPDEV %p could not create HII package list\n",
snpdev );
rc = -ENOMEM;
goto err_create_hii;
}
/* Add HII packages */
if ( ( efirc = efihii->NewPackageList ( efihii, snpdev->package_list,
snpdev->handle,
&snpdev->hii_handle ) ) != 0 ) {
DBGC ( snpdev, "SNPDEV %p could not add HII packages: %s\n",
snpdev, efi_strerror ( efirc ) );
rc = EFIRC_TO_RC ( efirc );
goto err_register_hii;
}
/* Add to list of SNP devices */
list_add ( &snpdev->list, &efi_snp_devices );
DBGC ( snpdev, "SNPDEV %p installed for %s as device %p\n",
snpdev, netdev->name, snpdev->handle );
return 0;
efihii->RemovePackageList ( efihii, snpdev->hii_handle );
err_register_hii:
free ( snpdev->package_list );
err_create_hii:
efipci_child_del ( efipci, snpdev->handle );
err_efipci_child_add:
bs->UninstallMultipleProtocolInterfaces (
snpdev->handle,
&efi_simple_network_protocol_guid, &snpdev->snp,
&efi_device_path_protocol_guid, &snpdev->path,
&efi_nii_protocol_guid, &snpdev->nii,
&efi_nii31_protocol_guid, &snpdev->nii,
&efi_hii_config_access_protocol_guid, &snpdev->hii,
NULL );
err_install_protocol_interface:
bs->CloseEvent ( snpdev->snp.WaitForPacket );
err_create_event:
err_ll_addr_len:
netdev_put ( netdev );
free ( snpdev );
err_alloc_snp:
err_no_pci:
return rc;
}
/**
* Handle SNP device or link state change
*
* @v netdev Network device
*/
static void efi_snp_notify ( struct net_device *netdev __unused ) {
/* Nothing to do */
}
/**
* Destroy SNP device
*
* @v netdev Network device
*/
static void efi_snp_remove ( struct net_device *netdev ) {
EFI_BOOT_SERVICES *bs = efi_systab->BootServices;
struct efi_snp_device *snpdev;
/* Locate SNP device */
snpdev = efi_snp_demux ( netdev );
if ( ! snpdev ) {
DBG ( "SNP skipping non-SNP device %s\n", netdev->name );
return;
}
/* Uninstall the SNP */
efihii->RemovePackageList ( efihii, snpdev->hii_handle );
free ( snpdev->package_list );
efipci_child_del ( snpdev->efipci, snpdev->handle );
list_del ( &snpdev->list );
bs->UninstallMultipleProtocolInterfaces (
snpdev->handle,
&efi_simple_network_protocol_guid, &snpdev->snp,
&efi_device_path_protocol_guid, &snpdev->path,
&efi_nii_protocol_guid, &snpdev->nii,
&efi_nii31_protocol_guid, &snpdev->nii,
&efi_hii_config_access_protocol_guid, &snpdev->hii,
NULL );
bs->CloseEvent ( snpdev->snp.WaitForPacket );
netdev_put ( snpdev->netdev );
free ( snpdev );
}
/** SNP driver */
struct net_driver efi_snp_driver __net_driver = {
.name = "SNP",
.probe = efi_snp_probe,
.notify = efi_snp_notify,
.remove = efi_snp_remove,
};
|
{
"pile_set_name": "Github"
}
|
Cot Girek
Cot Girek is a district in North Aceh Regency, Nanggröe Aceh Darussalam, province of Indonesia.
Cot Girek has several villages, namely:
Alue Drien
Alue Leuhob
Alue Seumambu
Ara LSK Selatan
Beurandang Asan
Beurandang Dayah
Beurandang Krueng
Ceumpeudak
Cot Girek
Drien Dua
Gampong Batu XII
Gampong Trieng
Jeulikat
Kampung Bantan
Kampung Tempel
Lhok Merbo
Lhok Reuhat
Lueng Baro
Matang Teungoh LS
Meunasah U Baro
Pucok Alue
Seuneubok Baro
Seupieng
Trieng LSK Selatan
Ulee Gampong
Category:Districts of Aceh
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Q:
How do phone chargers have variable input voltage with constant output voltage?
My basic understanding is that a transformer can step down a voltage by the ratio of the primary and secondary windings, since this is a ratio the output is not constant.
Thus my question is, how are chargers like the apple phone charger (a Fly-back Switch mode power supply) able to take an input of 100v-240v ~ 50/60 Hz to create a constant 5v output?
Above is a supposed circuit diagram of the apple phone charger.
is this constant output voltage an effect of the flyback transformer? (i have little experience in AC to DC power supplies) Any help is appreciated.
A:
Modern AC-DC power supplies do the voltage conversion in three steps. Roughly speaking, the process is as follows.
First, they rectify the AC into DC, so 100 V AC gets into about 140 V DC, and 240 V AC results in about 340 V DC. This is a first step. This is the range of voltages that the second stage of converter is dealing with. And this voltage has horrible ripples at 100-120 Hz.
The second stage is a "chopper" that modulates the high-voltage DC into high-frequency pulses, 100 kHz or something. There is a controller IC that drives a pair of powerful MOSFETs, which are loaded with primary winding of the isolation transformer. The transformer, as you duly noted, has a fixed winding ratio, so the output pulses would have the variable amplitude proportional to the input DC (which is 140 to 340V, not counting ripples from 50/60 Hz primary rectification).
However, the chopper also makes these pulses of different width, which is called PWM - Pulse-Width-Modulation. Thus the output of the transformer, when rectified by "half-way" diode rectifier and smoothened with a large output capacitor, on average can have variable amplitude: narrow pulses make lower average amplitude, and vice versa. This is the third stage of AC-DC converter.
So, while the transformer has a fixed winding ratio, the PWM still allows to change the output of rectifier in considerable range, thus accommodating the fixed transformer ratio and vast input voltage range, including voltage ripples.
The final control and voltage stabilization is done via negative feedback mechanism using linear opto-isolators. If the rectified voltage goes too high, the feedback makes the controller IC to produce narrower pulses, so the voltage goes down, and vice versa. This feedback mechanism not only takes care of the voltage, it also controls the overall power delivered into PSU load.
There are some fine details how the transformers tolerate the asymmetic waveforms, there are some fine engineering tricks behind the scenes, but basically that's it.
A:
If you want to identify one 'component' that's responsible for the constant output voltage, then it's the 'feedback'.
The forward path which includes the flyback transformer pushes a controllable amount of power to the output. The voltage on the output is measured, and the feedback requests a smaller or larger amount of power moment by moment, to keep the voltage constant.
The forward path is designed to be able to run from any voltage in the input range, which needs a bit of care with design, but is fairly straightforward.
The way a flyback converter works is that its output voltage adjusts to whatever voltage is needed to deliver the power it's been asked to deliver. It can step up or down by a large ratio, to allow it to match the input and output voltage ratio.
A:
The phone charger has to do several things in addition to regulating the voltage. It has to convert AC to DC, step down the voltage substantially and provide substantial isolation between input and output.
Since we're only concerned with regulation lets instead consider a DC-DC "in car" charger, that accepts DC over a typically wide voltage range possibly up to 28V, and converts it to 5V.
The charger probably uses a fast switching transistor and diode to rapidly switch between the input voltage and ground, then an LC filter to smooth out the switching and output the average voltage. The resulting transfer function is Vout=D*Vin, where D is a PWM duty cycle. For reasonable input voltages there will be a "D" value that yields 5v.
In its simplest form D is set by a controlling "error amplifier" comparing Vout with a reference voltage.
In more refined versions the PWM circuit is modified to cancel out the influence of Vin, two examples of this are "feedforward" and "current mode". In current mode the PWM pulse ends when the current in the inductor reaches a value. If the input voltage is higher the value is reached sooner but the output is relatively unaffected.
If this DC-DC design is "upgraded" to include a transformer then it gives the popular "forward" configuration which can be more compact and efficient than flyback as the transformer can use magnetic parts optimized for transformer use (ferrite), and the inductor can use parts for inductor use (iron powder).
|
{
"pile_set_name": "StackExchange"
}
|
I suffer sometimes with art blocks, it can last for up to a month and it's very annoying, occasionally if I watch speed art video's on youtube I can break the block, I don't know what it is I just sit there with my hand on the paper starring at it, blank mind, if anyone knows any tips on breaking blocks I'd love to hear them, may be it's just me ?
Changed my mind about having nothing more to say. I am referring to your site. Your artistic craftsmanship is exquisite. Your subject matter leaves much to be desired. It panders to Marque De Sade interests leaving your appeal to a very small and select buyer's population absent of purchase interest while enjoying the presentations you give online for free. Because of the paintings you have presented, I even doubt that you are who you present yourself to be. I truly hope you can retreat from your present course and present paintings worthy of your expert craftsmanship.
You make interesting judgments, firstly I 100% am who I am who else could I possibly be, I wonder why because of the paintings you say I've presented you doubt me to be me?up to last month my art has been very dark by nature but I paint from within and my art reflects what I am at that time. I only joined this site a few days ago and I'm really excited about it, but I'm a little saddened as a mod you make judgment so easily based on your own subjective opinion as there is beauty in ALL art in my opinion, saying that I've started to paint nicer things now mainly portraits =)thanks for the compliment & I don't paint for money, ever.
Good morning. I am glad to hear you are painting 'nicer things' such as portraits. I look forward to seeing your 'nicer' work. Subjective? I agree that art is subjective. I am also of the opinion that just as the artist has the right to produce whatever kind of art they want, the viewer has the equal right to accept or reject the work and has just as much right to tell the artist why the work is rejected. Read my profile page and you will know exactly where I am coming from in regards to art.
HI Aya,As an artist, you will encounter a wide variety of tastes and of course opinions when it comes to you exposing your art to the world. Some good, uplifting and positive.. some more pointed, direct, critical or judgmental. That just goes with the territory.. My advise to you is do what you love. I am all over the place with my art. I do work that resembles aspects of what I want to convey in a moment... sensuality, gothic, fantasy, classical, erotic, themed, to name a few. I look back on my inspirations and look forward to the horizons of possibility of creation. I looked at your art, I personally don't have any issue with any of it, but of course I love the art of Brom and Vargas too and, like some of yours, they lend more toward the seductive nightmare art which has its fascinating appeal. But to Carl's point, that has a niche of the 'Who" or the "Market" that that type of work appeals to. Its OK to voice that potential opportunity or obstacle, its advice no matter how you look at it. My grandfather one time, when I was sharing some art... it was of a Fairy in Bondage (non-nude)... made a comment that stung a bit... he said.. You have talent, but why this crap.. Draw wildlife or the Buttes (its a mountain range, near where I live)... at first, I felt a bit hurt. But, I stepped back and said... not all art is for everyone. Its OK. I framed the work, and entered it into a competition... it won the top ribbon in its category. My grandmother, pulled me aside, and told me that that painting was "Her favorite of all of my Art so far"... This was an important lesson. We will encounter many of both sides of reactions.... but as the creator, do what you love. I have drawn wildlife, when I "Feel it"... I have still never painted the Buttes... :: shrug ::
For whatever its worth... I hope it helps. And I hope you keep posting here and everywhere... Create, Share... and sell when you feel like it... Don't get disheartened because you get negatives.. don't only glory in the positives... they both have their place... Keep balance and Create.
As for your Artists Block... I cant think of anyone who hasn't had an artists or creative block.What do you love.... what other artists inspire you? What photography? Places? Music? inspire you. If the pages seem blank, then write.... as you write, think visually of things as you lay words on the paper... take a drive... Stare at patterns in the walls, an only that... What do you really see beyond what it is? Doodle on your writing... Have you read a book called Steal Like an Artist? Its a quick read, I just read it. I think it would be a good one to help you with some of the blocks... Unlike the title.. its not about STEALING in the sense of plagiarism... its stealing in the sense of you see something, in nature, or created by someone that inspires you of the next idea, thought, creation..etc... Don't worry about being Original, or creating the next masterpiece... Even if you start something, and you lose it part way.. STOP.. Start something new. I can't tell you how many times I sit down at the drawing desk to draw, or sketch and go through countless stops and pages of new starts... until something just Blinks into fruition... Keep at it... the right thing will Click, and you will be off n running in no time!
How I wish I could stand down and let the world spin. I cannot. I totally disagree. If there is no one to speak out and champion recognition for the need to produce and own objects of beauty, beastly prostitution of beauty becomes the accepted interpretation of what is beautiful in the world. In my meager way I protest such a path for humanity.
Yes, I have scrapped hundreds and hundreds of project productions. I have never scrapped the idea or concept of what I wanted to produce. If NASA had followed this kind of advise we would have never landed on the moon. My suggestion is to address your block, figure out why deep down inside you are blocked and once you hear your true heart's voice you return to your project and try again. To the artist on this blog I am most appreciative that she is blocked. It tells me she knows she has chosen the wrong path and is trying to figure out a way to get away from the morass she has fallen into. I suggest she get a summer bouquet of flowers and paint it a few times. If she does it she shall know why I suggested it.
Let me put it another way. There are many motivation books on the market. Almost all of them speak to goals. Immediate, intermediate and long range. My experience has shown that this is true; in the brain left side thinking. It is not so much with the right side of the brain. Learning how to earn a buck and how to eat and support a family is left brain business. It takes time, training and focus to develop the right side of the brain. And that is the side that reads relationships, space occupancy, forms, lines, colors, etc. As you continue to challenge yourself by jumping into the deepest part of your mind where absolutely no thoughts exist and muck around you will re-emerge with an idea that can become a thought that can become feeling and finally manifest into a work of art.
It is also my experience that those of us who dwell to long in the world of hate and revulsion endanger ourselves into entrapment of self pity and rejection of social norms. That self hatred manifests into self destruction or the destruction of those around us. Now you are asking yourselves what is this guy's experience to have such a self-serving and blindly limited vision of what "true art" is?
I have been a Marine, a steel worker, a student, a husband, a father, and a grandfather. I have been a correctional officer, Lieutenant, counselor, supervisor, designer, developer and administrator of a 98% successful rate of an in-prison drug treatment program, an adjunct professor, a senior trainer at UCSD and an assistant mental health bureau chief. Oh yes, I have had over 80,000 men and women move through my assigned caseload in the 30 plus years I was in corrections. I have had my life saved by my own hand many times and by others many more.
So, I suggest artists need to focus more on what makes human existence worthy of living by producing those objects of beauty that in all of our soles we collectively wish to see and some of us have the means to own. I have seen and lived in the world of inhumanity to humanity and do not need to be educated by a young artist using art as a medium to educate the world about how smart they are and how brave they are to show the world what a terrible mess we are in. This is my artist stand until the day I die. Just hope this helps re-direct a few artists back to the path of light so to speak.
No one is saying Not create works of beauty.. But, the just as the judgments of art is subjective so is the individual's interpretation of beauty.And No, I would never say 'Stand down' Carl... ever... Much as my illustration of my Grandfather... though harsh at the time, I appreciated his outlook... As I do yours. But that said, I don't expect that you will LOVE everything that I create...and I, you. That is where it falls to personal taste. But then that falls to the topic and how it relates to our preferences.... we can, however still like a method, or technique, even if we do not like the image it portrays. 'nuff said on this I think as its getting philosophical... WE can go on and on.. but should be in a different thread...
I am interested in the Overcoming the Artist / Creative block, that the topic suggests.
Good evening Jennifer. Since this is in the art therapy forum I believe my comments are appropriate in dealing with the artist's blocked problems. I have clearly stated the issues causing the block and offered a practical and philosophical way to address the block. Pity so many read my stinging comments and are blinded so as to miss or misread my positive comments. You included. I believe that for this artist that she is at the crossroads of what to do. A simple discussion about techniques and ideas is not enough for her. It will be read as a simply bland pat on the head and now go about doing what you want to do. This artist has skill and a certain boldness to test the waters. But I see she is not satisfied with what she is doing. I am attempting to let her see the trap she has placed herself in and that she has the key to get out of it. All she needs to do is to paint a bouquet of flowers to break free. I disagree with your attempt to limit the conversation to only the question about being blocked. For this artist it is a question about philosophy and the meaning of her own existence. I do not accept your judgement about the content and context of this discussion. All artists, good or bad, work from a certain philosophical point of view.
Perhaps you have misinterpreted my thoughts or meaning in what I have said. I have no issue with anything you have said, nor where they are coming from. I understand your position and your stance on how you have come to that opinion or judgment. I am not faulting that or you at all. My initial response was not for you, as it was more for her, in the aide to help her not view any feedback towards her work with a closed mind... to take it constructively and not get personally hurt by such opinions. Comments and reactions to our art, and what we put out into the world will happen - good and bad, from our point of view. Its what we do with them that makes us and our creations stronger. You are offering a position that may or may not be leading her to her 'creative block' - Fair enough. It may or may not be true... I offered a myriad of ways to help her work past them...which may or may not help.. but in the end, its up to the person who is trying to work through the issue, is it not?
Well Jennifer, I see your route and I have mine. It is interesting that both routes lead to the same conclusion. I agree. I hope she and others who read this can benefit from this discourse. I am done. Looking forward to the challenge of our next "discussion" some time, some where.
I appreciate everyones feedback and I have gained knowledge from your story Jen and from your suggestions Carl, and thanks Cliff-ksart!you must have been over the moon happy when your Grandmother said to you it was "Her favorite of all of my Art"!
Carl I am aware of the benefits of painting the things that the majority would consider acceptable, and I understand you're stuck in your ways of thinking and you will never change, but I'm quite the opposite wherein I realize actually I Can learn from younger artists, in fact my son teaches me a lot about art every single day.up till last June I worked for a dark minimal records label and produced lots of album covers for musical artists & I also designed tattoo's, so there is a huge audience for my art financially I was very happy.if I do change my path but it wont be because I think the path I'm on is dark or evil.
The 1 thing that blocks me 90% of the time was money, when I'm commissioned to do a piece or if there's money involved I feel like it almost changes the motive for my creating the painting & I found myself losing motivation rapidly, thats why I paint for free now x
Aya, Yes, it was a delight for sure. She was such a quite person, complete opposite of my grandfather. And, both you always knew where you stood... I appreciated them both for sure.
As for the blocks.. I was thinking some more on it last night. Why must every time you, we, sit down to draw must we expect it to be a masterpiece.. or a full painting. Sometimes I sit down to draw, and just practice things, or sketch not anything in particular.. .but just to keep the juices flowing so to speak.As for compositions of paintings... I try to draw it a few times before I really settle on what 'Will be" paintings final layout.
"1 thing that blocks me 90% of the time was money, when I'm commissioned to do a piece"
I would say... don't focus on the money... talk to the person... is your commission of a piece that they have a pre-conceived vision of? if so... understand what they Think they would like to see.... I have to do this when I do Storyboards often... you need to translate what their idea is to art... but it will be defined and rendered in your style and fashion. They want you to do it, because they already like your work.... You, in turn, use the client and their ideas as part of your initial inspiration to get you started...
Another option, is don't do commissions. But, instead, put your early designs out for work you are already in progress on, and define when you will take pre-purchase. that way the stress of $ = deadline is virtually non-existent. You can still make money if you want, and you set your own timeline for art completion.
In the end, the journey of the how or why we create art is at the individual level. These are just ideas... hope they spark something that works for you.
|
{
"pile_set_name": "Pile-CC"
}
|
Introduction {#Sec1}
============
Chronic hepatitis B virus (HBV) infection is a major public health concern. Approximately 350 million individuals worldwide are estimated to be HBV carriers, and 650,000 deaths each year are associated with HBV infection^[@CR1],[@CR2]^. Asian populations have a much higher prevalence of HBV than other populations^[@CR3]^. As an endemic region, China has approximately 130 million HBV carriers and 30 million chronic HBV infections^[@CR4]^.
HBV can infect people through acceptance of blood products or drug injection^[@CR5]^. However, due to the special immune status in pregnancies that allow mothers to tolerate the semiallogeneic fetus, mother-to-child transmission has become another major pathway for HBV infection, especially for mothers who are hepatitis B e antigen (HBeAg)- and hepatitis B surface antigen (HBsAg)-positive with high viremias^[@CR6],[@CR7]^. Indeed, infants born to HBsAg-positive mothers (0.6 to 5.8% of pregnant women) have an increased risk for potential chronic HBV infection^[@CR8],[@CR9]^. More than 90% of infants born from HBeAg-positive pregnancies will be infected with HBV if immunoprophylaxis is not accepted^[@CR10]^. In addition, HBV-infected infants have a higher risk of developing chronic HBV infection than those at other ages^[@CR11]^. Strikingly, mother-to-child transmission of HBV infection has decreased dramatically by 75--90% due to global immunoprophylaxis^[@CR1],[@CR2],[@CR12]--[@CR14]^. However, immunoprophylaxis still fails in 10--30% of infants, who develop chronic HBV infection through vertical transmission^[@CR15]--[@CR17]^. High viral burdens in mothers have been reported as the major factor underlying this prophylaxis failure and vertical transmission^[@CR2],[@CR10],[@CR18],[@CR19]^. Furthermore, HBV-infected children also have higher potential for liver cirrhosis and hepatocellular carcinoma. Thus, prevention of mother-to-child transmission, such as through antiviral treatment during pregnancy, has become the key issue to achieve the global goal of eliminating HBV infection.
Currently, nucleotide analogues (NAs), including lamivudine, telbivudine and tenofovir disoproxil fumarate (TDF), are used to control HBV infection. As a nucleotide reverse transcriptase inhibitor, TDF is the only approved NA with high efficacy against the virus but no detected clinical resistance to date; thus, this drug has been widely used against HIV or HIV/HBV co-infection^[@CR20]^. In 2015, TDF treatment was recommended by the WHO against chronic HBV infection, particularly in pregnant women^[@CR21]^. However, as a result of limited efficacy and safety data, the FDA of the USA still categorizes TDF as a "B" class reagent. Indeed, controversial observations have been achieved for TDF application. For instance, application of TDF at a late stage of pregnancy reduced the serum HBV DNA level and vertical transmission of HBV^[@CR3],[@CR17],[@CR22]--[@CR24]^, but perinatal transmissions or adverse events were still reported in these trials; initiation of TDF treatment during the second trimester of gestation was also shown to block mother-to-child transmission but still had severe adverse effects^[@CR25]--[@CR28]^. Thus, evaluating the efficacy and safety of TDF treatment in pregnancies with HBV-infected mothers is critical.
This clinical trial was designed for pregnancies with HBsAg/HBeAg double-positive mothers with serum HBV DNA ≥ 2×10^6^ (6.3 log10) IU/mL. TDF therapy was initiated at 24 weeks of gestation and continued to 4 weeks after delivery. Dynamic changes in the viral loads, vertical transmission and maternal/fetal outcomes were evaluated.
Results {#Sec2}
=======
As shown in the subject selection flow chart (Fig. [1](#Fig1){ref-type="fig"}), the pregnant women were randomly divided into two groups. In the TDF treatment group, one abortion occurred at 12 weeks of gestation, and the other 59 pregnancies accepted TDF therapy. Of these pregnancies, 1 case of premature delivery occurred at 32 weeks of gestation, and the premature infants died from hypoxic brain disease. In the control group, 8 subjects were lost to follow-up, and the other 52 pregnancies accepted routine nursing and prenatal care until the end of the study. In total, 110 pregnancies successfully participated in the whole trial process, and 110 infants were born. Table [1](#Tab1){ref-type="table"} shows the basic characteristics and clinical features of these pregnant women. No significant differences (p \> 0.05) were observed between the TDF-treated and control groups in terms of age, pregnancy times, treatment periods, basal ALT, HBV genotype, occupation, native place, residence, education level and family income.Figure 1The subject selection flow chart.Table 1The basic information and clinical features of the pregnant women.Groupstp valueTDF treatment (n = 59) Mean ± SD%Control (n = 52) Mean ± SD%Pregnant womenAge (y)28.31 ± 3.5628.06 ± 3.420.3790.705Pregnancy number1.28 ± 0.4511.25 ± 0.4370.3050.761Basal ALT level (U/L)54.62 ± 105.757.5 ± 103.3−0.1450.88HBV genotype0.809 B246.935.8 C25493.14994.2Family statusDomicile0.262 Rural3356.93567.3 City2543.11732.7Residency0.994 Temporary1932.81732.7 Resident3967.23567.3Education0.823 Below college3967.23669.2 College and above1932.81630.8Family incomes (year)0.976 \<40,200 RMB1831.01630.8 \>40,200 RMB4069.03669.2
To evaluate the effect of TDF treatment on viral replication, the serum HBV DNA levels during the pregnancies were dynamically monitored every 4 weeks up to 28 weeks postpartum. As shown in Fig. [2](#Fig2){ref-type="fig"} and the supplementary Table, prior to TDF treatment (24 weeks of gestation), the serum HBV DNA levels of the pregnant women were similar between the TDF-treated and control groups (7.44 ± 0.80 *vs*. 7.66 ± 0.55 log10 IU/mL, p=0.091). The HBV DNA levels in the control group exhibited no marked changes during the whole gestation period (Fig. [2](#Fig2){ref-type="fig"}, supplementary Table). Compared to that of the control group, TDF treatment significantly and gradually reduced the serum HBV DNA level (Fig. [2](#Fig2){ref-type="fig"}, supplementary Table).Figure 2Changes in the serum HBV DNA levels over time. From 24 weeks of gestation, the pregnant women were treated with or without TDF (300 mg/day, oral). The serum HBV DNA levels were monitored every 4 weeks until delivery. \*\*\*p \< 0.001 TDF treatment *vs*. control at the same time point; \#\#\#p \< 0.001 compared to the DNA level at the previous time point in the TDF-treated women.
Paired comparisons between the patients who received TDF treatment showed that the serum HBV DNA level decreased by 4.82 ± 0.94 log10 IU/mL from 24 weeks of gestation to delivery (p \< 0.001, supplementary Table). By delivery, 90% of the patients with TDF treatment had a serum HBV DNA level of 2000 IU/mL or less; among them, 50% of the patients had HBV DNA levels less than 200 IU/mL.
The results also showed that the serum HBV DNA decreased rapidly after initiating TDF treatment. Four weeks after initiating TDF therapy, a sharp decrease in HBV DNA (2.75 ± 1.19 log10 IU/mL) was observed (7.44 ± 0.8 *vs*. 4.68 ± 1.09, p \< 0.001) (Table [2](#Tab2){ref-type="table"} and supplementary Table). In addition, the serum DNA levels decreased continuously during TDF treatment (Fig. [2](#Fig2){ref-type="fig"}, Table [2](#Tab2){ref-type="table"}). Although the velocity of the decline slowed with time, it was still maintained at approximately 0.5 log10 IU/mL per month after the 3^rd^ month (32 to 36 weeks) of treatment (Table [2](#Tab2){ref-type="table"}), which kept the serum HBV DNA levels low during the remaining gestation period.Table 2The decrease in the HBV DNA levels after TDF treatment.Compared time pointsMeanSTDp value\*24 *vs*. 28 weeks2.751.19\<0.000128 *vs*. 32 weeks1.080.92\<0.000132 *vs*. 36 weeks0.570.59\<0.000136 *vs*. 40 weeks0.490.58\<0.0001^\*^p \< 0.05 indicates that the serum HBV DNA levels changed significantly between two time points.
We also evaluated the effect of TDF on mother-to-child transmission. The vertical transmission rate was determined in infants 28 weeks after birth by examining the serum HBV DNA levels (\>20 IU/mL) or detection of HBsAg (positive). As indicated in Table [3](#Tab3){ref-type="table"}, the TDF treatment group had no mother-to-child transmission events with HBV infection, whereas a vertical transmission rate of 13.5% (7/52 individuals) occurred in the control group (p = 0.004). Although one premature infant died at 32 weeks of gestation in the TDF treatment group, this preterm infant was later confirmed not to be infected with HBV.Table 3The mother-to-child transmission rates and the serum HBV DNA recovery of the mothers at 28 weeks postpartum.TDF treatmentControlvaluepCases (n)%Cases (n)%Mother-to-child Transmission8.3380.004 Occurred00%713.5% Did not occur59100%4586.5%Serum HBV DNA 28 weeks postpartum21.9160.000003 ≤2000 IU/mL2033.9%00% Recovery to the original level3966.1%52100%
To examine HBV recovery after cessation of TDF treatment 4 weeks postpartum, the serum HBV DNA levels during the pregnancies were checked at 28 weeks postpartum. The results showed that 33.9% (20/59 individuals) of the TDF-treated individuals maintained serum HBV DNA levels less than 2000 IU/mL, whereas 66.1% of the patients (39/59 individuals) had recovered to their original HBV level (Table [3](#Tab3){ref-type="table"}). Conversely, the HBV DNA levels in the control individuals did not change significantly before and after delivery and were always maintained at high levels compared to those of the TDF-treated patients, which was similar to their original levels and thus defined as 100% recovery (Table [3](#Tab3){ref-type="table"}).
The emergence of drug-resistant variants was also evaluated by monitoring mutations of HBV genes in the TDF treatment and control groups using a direct gene sequencing technique. The results showed no gene mutations in HBV B2 or C2, which are the two major HBV strain genotypes in the Chinese population^[@CR29]^.
The present study also investigated the outcomes of the mothers and children. As shown in Table [4](#Tab4){ref-type="table"}, no significant differences were observed between the mothers in the TDF and control groups during pregnancy, delivery and cesarean section. One case of miscarriage (1.72%) occurred at 12 weeks of gestation in the TDF treatment group prior to TDF therapy. As described above, another case of preterm delivery occurred in the TDF-treated group at 32 weeks of gestation (1.69% of the preterm birth rate), and the preterm infant died 3 days after birth from hypoxemic brain disease without HBV infection. In the control group, 2 cases of preterm delivery (3.85%) occurred. However, no significant difference (p = 0.495) in preterm delivery was observed between the TDF and control groups (Table [4](#Tab4){ref-type="table"}). In addition, 10.3% of the mothers from the TDF treatment group and 9.6% from the control group had cholestasis syndrome. No other obstetric complications were observed in either group. Furthermore, 3.45% of the patients from the TDF group (2 of 59 subjects) experienced nausea and vomiting, but they continued the TDF therapy with symptomatic treatment. No one in the control group had similar symptoms. Finally, approximately 10% of the patients had itchy skin in both the TDF and control groups (Table [4](#Tab4){ref-type="table"}). No marked differences were observed between the groups in either digestive system or skin symptoms. No other adverse reactions appeared in the two groups of pregnant women.Table 4Maternal outcomes between the TDF treatment and control groups.TDF Group Mean ± SD or n (%)Control Group Mean ± SD or n (%)p**Mothers**Pregnancy weeks39.46 ± 1.4339.33 ± 1.490.645Cesarean section, n (%)21 (36.2%)17 (32.7%)0.699**Obstetric complications, n (%)**Pregnancy hypertension00Placenta previa00Intrahepatic cholestasis of pregnancy6 (10.3%)5 (9.6%)0.899Postpartum hemorrhage00Limited fetal growth00Preterm birth1 (1.69%)2 (3.85%)0.495Abortion1 (1.72%)00.342**Adverse reactions, n (%)**Digestive tract reaction: vomiting2 (3.45%)00.177Fatigue00Headache00Cough00Fever00Itchy skin6 (10.3%)5 (9.6%)0.899Jaundice00**Laboratory examinations, n (%)**ALT, U/L \>5 × ULN\*2 (3.45%)00.177Renal dysfunction00Decrease of PLT00Anemia00^\*^ULN: upper limit of normal.
None of the mothers in the present study breastfed their infants. A total of 58 healthy newborns were delivered in the TDF treatment group and 52 newborns were born in the control group, since 8 pregnancies were lost to follow-up during the study. Among all 110 surviving infants, 2 cases from the TDF treatment and 1 from the control group had mild asphyxia immediately after birth according to the Apgar score at 1 min (Table [5](#Tab5){ref-type="table"}). No significant differences were found between the groups in the average body weight and length. Neither congenital malformations nor adverse symptoms were observed in any of the infants after birth. The serum ALT levels were similar in the infants in both groups. However, among the infants from the control group, 4 were HBsAg-positive (7.7%), 5 were HBeAg-positive (9.6%) and 7 cases (13.5%) had detectable HBV DNA (Table [5](#Tab5){ref-type="table"}). None of the infants from the TDF-treated mothers were positive for HBsAg, HBeAg or HBV DNA, which was a marked difference compared to those of the control group (p \< 0.05).Table 5Infant outcomes between the TDF treatment and control groups.InfantsApgar score 1 min after birth, n (%)0.613 8\~10 normal55 (96.5%)51 (98.1%) 4\~7 mild asphyxia2 (3.5%)1 (1.9%) 0\~3 severe suffocation00Weight (g)3259.47 ± 369.033338.08 ± 363.040.265Height (cm)49.89 ± 0.8249.92 ± 0.840.859Congenital malformations, n (%)00**Adverse reactions, n (%)**Fever00Cough00Vomiting00Jaundice00**Laboratory examinations, n (%)**ALT (U/L)22.25 ± 11.9224.27 ± 18.830.501HBsAg-positive04 (7.7%)0.033HBeAg-positive05 (9.6%)0.017HBV DNA-positive0 (0%)7 (13.5%)0.004
Discussion {#Sec3}
==========
Benefiting from discovery of the HBV vaccine, the morbidity of HBV infection has decreased significantly. However, chronic HBV infection remains a large public health concern, particularly in the high endemic regions of Asia. Perinatal transmission is a major cause of this chronic infection. Indeed, HBV vaccine and immunoglobulin therapy have been shown to only prevent infection during the labor and postnatal periods but have no effect on intrauterine infection^[@CR30]^. The HBV DNA level in pregnant women is also closely associated with the vertical transmission rate and immunoprophylaxis failure^[@CR19]^. Furthermore, the repressed immune system during pregnancies^[@CR6],[@CR7]^ also increases the potential risk of HBV proliferation during pregnancy. Thus, pregnant women with HBV infection, especially those who are HBeAg/HBsAg-positive with high viral loads, must control their viremia with antiviral treatment, such as TDF therapy, to decrease the risk of mother-to-child transmission of HBV and to maintain the health of the pregnancies. The EASL 2017 Clinical Practice Guidelines for the management of HBV infection recommended TDF treatment at 24--28 weeks of gestation during pregnancy^[@CR31]^. However, limited data on the efficacy and safety of the application of TDF to control HBV infection during pregnancy are available, especially for the second trimester of gestation. The present study aims to investigate and evaluate the effect of TDF initiated at 24 weeks of gestation on the efficacy and safety, therapy duration, drug resistance and vertical transmission.
In the present work, we dynamically monitored the effect of TDF on the serum HBV DNA levels and found a total reduction of 4.82 ± 0.94 log10 IU/mL from 24 weeks of gestation to delivery (p \< 0.001). Interestingly, a decline of 2.75±1.19 log10 IU/mL of HBV DNA was detected 4 weeks after TDF initiation. However, the pregnancies in the control group, which had similar viral loads to the TDF-treated pregnancies before initiating the therapy, had unchanged viral loads during gestation. In line with our finding, a gradual decrease in the serum HBV DNA level induced by TDF was observed in another study^[@CR28]^, although the negative control (pregnancies without TDF treatment) was lacking in their study. All other clinical trials have only monitored the HBV viral burden before TDF treatment and after delivery. Our data are also intriguing because they show that after the third trimester (32 weeks of gestation), 90% of the patients with TDF treatment have serum HBV DNA levels of 2000 IU/mL or less until delivery and 50% have viral loads lower than 200 IU/mL. This finding suggests that TDF therapy initiated at 24 weeks of gestation can maintain the serum HBV DNA at lower levels during pregnancy until delivery, which may be the ideal condition to limit viral replication and ensure fetal growth.
Previous studies have demonstrated that initiation of TDF treatment at the third trimester (30--32 weeks) of gestation reduces perinatal transmission, but mother-to-child transmission of HBV infection still occurs^[@CR3],[@CR17],[@CR22]--[@CR24]^. As a prospective investigation, the current trial started TDF therapy at 24 weeks of gestation, and no vertical transmission was observed in the infants. Wang *et al*. showed a similar result, although a small sample of subjects (21 patients) was included in their study^[@CR28]^. In another three trials, TDF was given as early as 5, 12 and 17 weeks of gestation, and no HBV-infected infants were observed^[@CR10],[@CR25],[@CR26]^. However, these studies were retrospective studies that included small numbers of individuals with TDF treatment. These findings encouraged us to evaluate the efficacy and safety of TDF with more patients.
The present study and other trials from China^[@CR32],[@CR33]^ have shown an immunoprophylaxis failure rate of up to 15% in infants born to HBsAg-positive mothers in the control group. However. clinical trials from other countries, such as Thailand, showed a lower rate of immunoprophylaxis failure (\<5%)^[@CR34]^. The following factors may account for this discrepancy: 1) the timeframe of immunoprophylaxis administration; indeed, the infants received immunoprophylaxis at approximately 1 hour after birth in the study from Thailand compared to vaccination of infants within 12 h after birth in China; 2) the vaccine dose; the routine vaccine series (3 doses at 0, 1 and 6 months after birth) are applied in China, whereas infants receive 5 doses of the vaccine (0, 1, 2, 4 and 6 months) in Thailand; and 3) HBV DNA levels of the mothers; trials from various countries have shown that immunoprophylaxis failure in infants is closely associated with the mother's viral load at delivery^[@CR35]--[@CR37]^. Jourdain *et al*. also declared that the mothers of HBV-infected infants from Thailand had high viral loads at delivery^[@CR34]^.
In addition to the decline in the serum HBV DNA levels induced by TDF treatment, TDF therapy was also reported to result in seroclearance of HBeAg and HBsAg or HBeAg seroconversion^[@CR17],[@CR22],[@CR26]^. Marcellin *et al*. even showed that HBeAg could not be detected in 45% of patients after TDF treatment^[@CR26]^, which might be associated with the HBeAg levels prior to initiation of TDF therapy. However, the present study did not observe any seroclearance/seroconversion for either HBeAg or for HBsAg in either the TDF-treated or control mothers. The potential reasons are that all pregnancies in our study 1) have a high titration of HBeAg and HBsAg with a high viremia and 2) are tolerant to HBV infection since they have high viral loads (\>2×10^6^ IU/mL) and a relatively normal ALT level.
Concerning the safety of TDF treatment, we did not detect any congenital malformations during gestation and at 6 months after birth. A previous study revealed that a high dose of TDF but not the dose used for humans affected fetal growth in primates^[@CR38]^. Indeed, TDF treatment of pregnancies with chronic HBV infection has been associated with adverse events, including a low birth weight, premature delivery and congenital abnormalities, regardless of whether TDF is given at the second or third trimester of gestation^[@CR3],[@CR10],[@CR17],[@CR23],[@CR24]^, although these side effects are much lower than those induced by other NAs. The current study also observed two premature deliveries at 33 and 34 weeks of gestation from the control group, of which both infants survived. However, a preterm delivery occurred in the TDF-treated group, and the infant died from hypoxic encephalopathy; we found no evidence of a direct association with TDF treatment, although we could not exclude this possibility. Therefore, a large amount of complementary data are still needed to further evaluate the safety of TDF on pregnancies and infants. Because the children were followed up to 28 weeks after birth in the present study, the long-term or delayed potential effects of TDF on the infants (e.g., growth and intelligence) also need to be addressed in the future. TDF-treated mothers have breastfed their children without reported complications^[@CR26]^. However, according to the guidelines from the Chinese Foundation for Hepatitis Prevention and Control, breastfeeding should not be recommended since the potential risk for the infants is still uncertain; further studies are needed to clarify the safety.
Drug resistance or tolerance is a big problem during chronic hepatitis B infection; for instance, a Lamivudine (LAM)-resistant viral variant has been reported after short-term therapy^[@CR39]^. Our present study did not detect resistant variants of HBV even when we started treatment at 24 weeks of gestation and continued it to 4 weeks postpartum. Consistent with our observation, other studies also did not show the emergence of resistant variants of HBV during TDF therapy at the third trimester of gestation of pregnancy^[@CR3],[@CR17],[@CR22],[@CR24]^, which might be due to the high resistance barrier of TDF^[@CR5]^.
In the present trial, the women stopped TDF treatment at 4 weeks postpartum. Notably, 33.8% of the subjects maintained lower serum HBV DNA levels under 2000 IU/mL at 28 weeks postpartum, whereas the HBV DNA level recovered to the original level in the remaining individuals. In addition, only 3.4% of the TDF-treated patients had liver function more than 5 times the upper limit of normal without other clinical manifestations. No patients had kidney dysfunction in TDF treatment group. In line with our observations, Nguyen *et al*. reported that regardless of whether TDF was immediately withdrawn after delivery or continuously used, this medicine did not affect the risk of HBV DNA recovery in pregnancies^[@CR40]^. However, another study recommended close monitoring up to 6 months after delivery for women who were HBeAg positive or had stopped TDF treatment^[@CR41]^. Nevertheless, our study only followed up the patients to 28 weeks postpartum, and thus further intensive monitoring and follow-up are needed.
In summary, initiation of TDF treatment at the second trimester (we started at 24 weeks) of gestation in HBsAg/HBeAg-positive pregnant women with high viral loads (≥2×10^6^ IU/mL) dynamically and efficiently reduced the serum HBV DNA levels. This reduction was apparent at the first month of TDF therapy, which facilitated maintenance of HBV DNA at the lower level during the following gestation periods of the pregnancies. Treatment apparently reduced the risk of vertical transmission and ensured an optimal uterine microenvironment for the fetus. Our results demonstrated that application of TDF at 24 weeks of gestation in HBV-infected pregnancies was safe and that no obvious complications for the mothers, severe outcomes or adverse effects were observed. These results indicate the efficacy and safety of TDF therapy at the middle stage of gestation in HBV-infected pregnancies, particularly for those who have high viral loads and are HBsAg/HBeAg-positive, to prevent mother-to-child transmission.
Methods {#Sec4}
=======
Study design and research subjects {#Sec5}
----------------------------------
The multicenter cohort study was performed from January 2013 to December 2016 in different hospitals located in northwest China. The trial was approved by the Ethics Committee of the First Affiliated Hospital of Xi'an Jiaotong University (Xi'an, China), and the date of registration was March 25, 2016 (registration number: NCT02719808). The study was performed in accordance with the guidelines and regulations for the prevention of vertical transmission of hepatitis B in pregnancy (Chinese Medical Association-Society of Obstetrics and Gynecology, 2013). The details of the full protocol are available in the online complementary data section. The flow chart of study subject selection is shown in Fig. [1](#Fig1){ref-type="fig"}. The eligibility criteria were 20--35-year-old pregnant women who were HBeAg/HBsAg double-positive with a serum HBV DNA titer ≥2×10^6^ (6.3 log10) IU/mL. The exclusion criteria for the subjects were ① co-infection with HIV, HCV or HDV, ② a HBV treatment history within 6 months, ③ an abortion history or clinical manifestation of an inevitable abortion, ④ congenital deformity of the fetus, ⑤ evidence of hepatocellular carcinoma, renal or hepatic dysfunction, a creatinine clearance rate \<100 mL/min, ALT \>5 times the upper limit of normal, or bilirubin \>2 mg/dl, ⑥ hemoglobin \<8 g/100 mL, neutrophils \<1000/mm^3^, or albumin \<2.5 g/100 mL, ⑥ special medicine treatment required during the pregnancy, and ⑦ the biological father of the infant has chronic HBV infection. A total of 120 women were finally enrolled in the study according to the criteria. All participants were informed about the study, volunteered and signed the written consent form.
The parallel study was designed with TDF-treated and control groups. The sample size was determined using an online sample size calculator for two parallel-sample proportions. A random number table was used to group the pregnancies into each group (60 individuals per group) based on their enrollment time. Simple randomization was performed, and sealed envelopes were used for concealment of the random allocation. TDF treatment (300 mg/day, oral, GSK, China) was initiated at 24 weeks of gestation and continued to 4 weeks postpartum. The control individuals did not receive anti-viral treatment. All subjects were followed up every 4 weeks to 28 weeks postpartum, and the laboratory parameters were monitored at every visit. All infants were given routine immunoprophylaxis, such as hepatitis B immune globulin (HBIG), immediately after birth and the HBV vaccine within 12 hours after birth. The second and third doses of the vaccine were given to the infants at ages 1 and 6 months, respectively. Due to insufficient long-term safety data for infants exposed to TDF through breastmilk^[@CR24]^, none of the infants were breastfed according to the guidelines from the Chinese Foundation for Hepatitis Prevention and Control. The infants were also monitored from their birth to 7 months of age. During the double-blind study, the participants did not know which type of intervention they accepted until the end of the intervention. The participants, care providers and persons who examined the viral DNA loads and evaluated the outcomes of the patients did not know whether the patients had accepted the intervention.
Laboratory evaluations {#Sec6}
----------------------
In accordance with the updated Chinese guideline on "management algorithm for interrupting mother-to-child transmission of hepatitis B"^[@CR42]^, serological testing was performed in the infants 28 weeks after birth (one month after the final dose of the HBV vaccine). The occurrence of mother-to-child transmission was the primary outcome and was determined when the serum HBV DNA of the infant was higher than 20 IU/mL or the infant was HBsAg-positive 28 weeks after birth. Congenital malformations were defined as anatomical abnormalities of the fetus before delivery or of infants 28 weeks after birth and were verified by clinical examinations, radiographic examinations or other experimental methods during follow-up. The rate of congenital malformations reflects the proportion of infants with defects out of all safe-born infants.
To evaluate the effect of TDF, the serum HBV DNA level was monitored in all pregnancies with/without TDF treatment. The assay was performed before initiating TDF therapy and then continued every 4 weeks until immediately before delivery. After delivery, this procedure continued to 28 weeks postpartum to evaluate recovery of HBV DNA after cessation of TDF treatment, which was defined as the secondary outcome.
Total DNA was extracted from the patient's blood using the DNAout kit (Tianenze, Beijing, China). The RT region (NT 54--1278) was amplified (Chinese patent ZL 200910092331.1) as described previously^[@CR43]^. Briefly, the sense and antisense primers for the first-round PCR were 5′-agtcaggaagacagcctactcc-3′ (NT 3146--3167) and 5′-aggtgaagcgaagtgcacac-3′ (NT 1577--1596), respectively. The primers for the second-round PCR were 5′-ttcctgctggt-ggctccagttc-3′ (NT 54--75) and 5′-ttccgcagtat-ggatcggcag-3′ (NT 1258--1278). The PCR products from all patients were sequenced to check whether gene mutations occurred after TDF treatment during the pregnancy period.
In the present study, ALT above 5 times the upper limit of normal was identified as a significant adverse event clinically regardless of whether the patients had symptoms. These patients needed to be further monitored and followed up or treated.
Statistical analysis {#Sec7}
--------------------
The data were presented as the mean±SE, and SPSS 18.0 (SPSS Inc., Chicago, IL, USA) was used to conduct the analysis. Baseline characteristics and safety outcomes were compared between the TDF treatment and control groups using t-tests for continuous variables and the Chi-square test or Fisher's exact test for categorical variables. The mother-to-child transmission rate and the recovery level of the HBV DNA 28 weeks after delivery were compared between the two groups using Fisher's exact test. A mixed model repeated measures analysis of variance was used to analyze whether the serum HBV DNA level changed differently with or without TDF treatment. Planned contrast was used to test the "change in HBV DNA for each group between baseline and delivery time" and "differences from week to week' within the TDF treatment group. A p value less than 0.05 was considered statistically significant.
Electronic supplementary material
=================================
{#Sec8}
Supplementary table Supplementary information
**Publisher's note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Electronic supplementary material
=================================
**Supplementary information** accompanies this paper at 10.1038/s41598-018-33833-w.
The authors acknowledge funding from the National Natural Science Foundation of China (National Science Foundation of China) - 81771615 and The General Program of Innovation of Science & Technology of Shaanxi Province (N°2016KTCL03-01).
Y.Y.L. managed the data; Y.L. detected gene mutation of HBV serotype; G.F.D. and W.M.W. collected the patients' data; L.T. critically read the manuscript; N.X. collected and managed the data; K.Y.L. performed part of the statistics; L.Y.Z. collected the data; D.J.C. participated in the design of the project; Y.Z.W. wrote the manuscript; G.Q.B. designed, supervised and participated in the project.
The protocol used for this study is included in this published article (Supplementary files). All data generated or analyzed during the study are available from the corresponding author on the reasonable request.
Competing Interests {#FPar1}
===================
The authors declare no competing interests.
|
{
"pile_set_name": "PubMed Central"
}
|
Surface sliding friction of negatively charged polyelectrolyte gels.
The friction between two polyelectrolyte gels carrying the same or opposite sign of charges has been investigated using a rheometer. It is found that the friction was strongly dependent on the interfacial interaction between two gel surfaces. In the repulsive interaction case, especially, the friction was extremely low. The friction behavior is attempted to be described in terms of the hydrodynamic lubrication of the solvent layer between two like-charged gel surfaces, which is formed due to the electrostatic repulsion of the two gel surfaces. From the theoretical analysis (hydrodynamic mechanism), the friction behaviors were explained qualitatively, all of the experimental results, nevertheless, could not be understood well. The viscoelastic feature of the gel and the non-Newtonian behavior of water at the friction interface are considered to be important to elucidate the gel friction.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Shockingly, the ladies of Team Bounty Hunter didn’t spring into existence upon meeting The Heroes. If you’ve been paying attention, you already caught a glimpse of their origin story back in “Dropping Some Knowledge.” In retrospect however, we thought it deserved more attention than a belated update. That’s because first impressions are crazy important, and their effects reverberate throughout a campaign.
When it comes to the setup in session one, everybody at the table has an agenda. GMs want to show that they’re more creative than “you all meet in a tavern.” Players want to establish their intraparty relationships. New groups want to make a good impression with an unfamiliar table of gamers, and characters want to advance their personal goals. There’s a lot of pressure to get all the gears to align, and it’s easy to psyche yourself out.
As is so often the case, a well-designed session zero can come to the rescue here. Taking the time to bring all stakeholders into the planning phase of the campaign gives players and GMs alike a sense of ownership, and is an easy way to build enthusiasm coming into session one. Take my group’s Dead Suns game. It may be an AP, but that didn’t stop my players from comparing notes and creating a unique take.
“So,” I said. “Did any of you guys know each other before the adventure?”
“Sure!” they chorused. “We all did!”
“Well then how did you meet?”
“We’re journalists! We work for the National Enquirer!”
“What? I mean, there isn’t a National Enquirer per se…”
“There is now! We’re gossip journalists! We’re joining the Starfinder Society to scoop the competition! We’re desperately poor because of all the libel lawsuits!”
There was laughter, back-and-forth brainstorming, and a crazy amount of creative energy in the room. It helped that we were planning this during the 2017 solar eclipse and were all in the mood for a sci-fi game, but I think that the group-sourced concept made all the difference. Getting everyone to buy into a unique premise transformed a standard-issue adventure into our adventure. It’s the same if you decide that you’re mystery-solving teens, part owners in a traveling carnival, or press-ganged students at Miss Spine Eater’s School for Unruly Young Ladies. Collaboration is key in TRPGs, and it’s a wise group that fosters that sense of teamwork from the start.
So how about it, guys? Have you ever created the premise for your campaign as a group? What crazy concepts did you come up with? Let’s hear about your wackiest opening premises down in the comments!
ARE YOU AN IMPATIENT GAMER? If so, you should check out the “Henchman” reward level over on The Handbook of Heroes Patreon. For just one buck a month, you can get each and every Handbook of Heroes comic a day earlier than the rest of your party members. That’s bragging rights right there!
|
{
"pile_set_name": "OpenWebText2"
}
|
232 S.C. 215 (1957)
101 S.E.2d 283
K.C. NASH, Plaintiff-Appellant-Respondent,
v.
Etson GARDNER and Hattie Gardner, Defendants-Appellants-Respondents.
17372
Supreme Court of South Carolina.
December 30, 1957.
*216 Messrs. McEachin, Townsend & Zeigler, of Florence, for Appellant-Respondent.
Messrs. Tison & Tison, of Hartsville, for Respondents-Appellants.
*217 Messrs. McEachin, Townsend & Zeigler, of Florence, for Plaintiff-Respondent.
McEachin, Townsend & Zeigler, of Florence, for Plaintiff-Appellant, in Reply.
Messrs. Tison & Tison, of Hartsville, for Respondents-Appellants, in Reply.
December 30, 1957.
STUKES, Chief Justice.
This action is between owners of adjoining lands in Darlington County, much of which is in Lynches River swamp. Their respective titles are derived from a common source, *218 W.H. Gardner, who in the year 1890 obtained deed from Segars for 163 acres, more or less, described by corners and boundaries, but no distances; and deed from his father in 1900 for 360 acres, more or less, on the east side of Lynches River, described by bounds and with reference to a plat which is lost.
The complaint alleged the ownership by plaintiff of an undivided 35/36 interest, and the defendant Hattie Gardner 1/36 interest, in the home place, pasture and swamp of W.H. Gardner, deceased, containing approximately 700 acres; and the possession by the defendant Etson Gardner of the adjoining tract which was described as in the Segars deed of 1890, ante. It was further alleged that Etson wrongfully claimed portions of plaintiff's land, trespassed upon it, prevented survey of the boundary, thereby creating cloud upon plaintiff's title for which he has no remedy at law; damages were alleged and demanded for the trespasses, injunction prayed and that the court order a survey of the boundary.
The answer contained a description of the boundaries of the Segars tract as claimed by the defendant Etson Gardner and alleged that they were shown to plaintiff before his purchase and he acquiesced and agreed thereto. Trespasses by plaintiff on Etson's land were alleged, damages demanded, and that the boundary line be established as claimed. There were other defensive allegations, with which the appeals to this court are not concerned. Likewise, the court dismissed the cross-demands of the parties for damages, from which neither has appealed.
Under Circuit Court Rule 36 and with the consent of the parties, the court appointed T.E. Wilson, C.E., to make survey and plat of the property. Mr. Wilson's plat dated March 7, 1956, was returned. It shows total acreage of 971.2, including two parcels separately surveyed and represented upon the plat, 128 acres (marsh land) and 69 acres (upland), which are on the boundaries of the respective tracts of the parties and are in dispute. Mr. Wilson was assisted *219 in the survey by his son who is also a surveyor; both of them testified.
There was a consent order of reference to the master to take the testimony, which was reported to the court on May 12, 1956. Arguments were heard on July 17, 1956. Before decision and on October 3, 1956, counsel for the defendants moved for an order allowing the defendant Etson Gardner to interpose the defense of res judicata and also for an order to reopen the case for the purpose of taking additional testimony. Argument was heard on the motions on October 13, 1956. On January 11, 1957, counsel for the defendants by letter to the court submitted affidavits for consideration in the motion to reopen. It was agreed by counsel that the court should order the sale in partition of the land owned by plaintiff and defendant Hattie Gardner because a partition suit between these parties was pending, which appears to be the action in which decision on appeal is reported as Nash v. Gardner, 226 S.C. 165, 84 S.E. (2d) 375.
By decree dated May 1, 1957, the court denied the defendants' motion to reopen and amend and found in plaintiff's favor as to one of the disputed tracts of land and in the defendant Etson Gardner's favor as to the other. Plaintiff and defendants appealed.
Upon consideration of the evidence we are of opinion that the judgment of the trial court is in accord with the preponderance of it. The opinion of the surveyors, in which that of one of them was weakened on cross examination, was not followed by the court with respect to the 128-acre disputed tract; but there a main corner in controversy was shown to plaintiff by Etson before plaintiff's purchase of the land, in connection with his prior purchase of timber, and he assented to it. Richardson v. Register, 227 S.C. 81, 87 S.E. (2d) 40, and cases there cited. There was considerable other evidence tending to establish this corner (S on the plat) as it was found by the court. On the other hand, in the disposition of the disputed 69 acres the view of the surveyors prevailed over the testimony of Etson and his lay witnesses. *220 The weight of the evidence (particularly the surveyors' testimony and the description in the Segars deed of 1890) concerning the location of it is clearer than that relating to the other disputed tract. We think that, under the evidence, the court correctly disposed of both of them, and the decree thereabout will be affirmed. There may be appropriately repeated the comment in the opinion on appeal in prior litigation between the parties, Gardner v. Nash, 225 S.C. 303, 82 S.E. (2d) 123, that the trial judge lives in Darlington County and knows the parties and probably at least the most of the witnesses, which enabled him to better evaluate the testimony.
Nevertheless, the case has been difficult to decide made so by the meagre information concerning the boundaries of the lands, both of record and on the ground. The old marks and monuments of some of the corners of the lines have been obliterated and lost. This may be explained by the ravages of time during the long period when both tracts were owned by W.H. Gardner, and it was then of no importance to preserve evidence of the dividing lines; nor was it of importance after his death in 1926 until about 1942, when his children kept the lands together for the benefit of their mother for her lifetime. Each claimant has been found to own far more acreage than his muniments of title call for, which is doubtless due to the fact that until comparatively recently swamp lands were generally considered to be of insufficient value to warrant the expense of surveying and marking, let alone of re-surveying and renewing and replacing line marks and monuments, all of which is within common knowledge. Another probable cause of the apparent neglect of W.H. Gardner in this particular is that he was illiterate. He executed his will by mark instead of signature; it appears in the opinion in Nash v. Gardner, supra, 226 S.C. 165, 84 S.E. (2d) 375. And the testimony of his sons in this case indicates that they are of little education.
We have considered the appeals as in equity. The case was so treated by counsel in the court below and was so *221 tried and decided by the court. Undoubtedly, equitable issues arose upon the pleadings and there was no effort by the parties to separate for trial any legal issues. Little v. Little, 215 S.C. 52, 53 S.E. (2d) 884; Austin-Griffith, Inc., v. Goldberg, 224 S.C. 372, 79 S.E. (2d) 447, 42 A.L.R. (2d) 1123. This accords with plaintiff's contention on appeal; and affirmance of the factual findings of the trial court renders academic the position of defendants which is stated in one of their briefs on appeal, as follows: "The case being at law, and a jury trial having been waived, findings of fact by the circuit judge are conclusive."
The proposed defense of res judicata was properly rejected. It had reference to the case of Etson Gardner v. Nash, whose roles are reversed here, appeal in which is reported in 225 S.C. 303, 82 S.E. (2d) 123, supra. It was a successful action to set aside a judicial sale of the land of Etson Gardner in which Nash, the present plaintiff, was found guilty of fraud and of having chilled the bidding. It need only be noted that it was a different cause of action from this and no issue relating to the boundaries of the land was, or could have been, involved in it. Johnston-Crews Co. v. Folk, 118 S.C. 470, 111 S.E. 15; Lyerly v. Yeadon, 199 S.C. 363, 19 S.E. (2d) 648; 30 Am. Jur. 914 et seq., Sec. 172.
Likewise there was no reversible error in the refusal to reopen the trial to admit the additional evidence which was proffered by the defendant Etson Gardner. It was cumulative, as found by the trial court. Moreover, the affidavit of the single proposed witness was not offered at the time of the motion, but long after. Callison v. Charleston & W.C. Ry. Co., 106 S.C. 123, 90 S.E. 260. Certainly, no abuse of discretion has been made to appear.
There remains for decision only plaintiff's appeal from the apportionment between the parties of the costs of the action. It was adjudged that they should be taxed 34/36 against plaintiff, 1/36 against Etson Gardner and 1/36 against Hattie Gardner. No reason was assigned *222 by the court for the apportionment and plaintiff excepts, contending by his exception 17 that half of the costs should be borne by Etson, 35/36 (sic) by plaintiff and 1/36 by Hattie. (His complaint is plain enough, but his fractions are bad.)
Defendants argue in support of the unusual taxation the respective values of the 128-acre and the 69-acre tracts; but there is in the record no evidence of the comparative values. The 128-acre tract appears on the plat to be all wooded and is designated "marsh land", while the 69 acres appear to be about half cultivated land and presumably of greater value per acre than marsh land.
The allowance of costs in equity cases is within the power of the court. Sec. 10-1601, Code of 1952, and cases cited in the footnotes. But it is to be exercised with discretion and must be based upon reason. Cauthen v. Cauthen, 81 S.C. 313, 62 S.E. 319; Ex parte Miller, 192 S.C. 164, 5 S.E. (2d) 865. The record here indicates no sound reason for the action of the trial court but, on the contrary, that it was arbitrary. Equalization of the burden of costs appears from all that is before us to be more equitable. Resort may be properly had to the maxim, equality is equity. Accordingly, error is apparent on the record and the taxation will be modified and the costs, including the costs and disbursements on appeal (there is no prevailing party), will be taxed one-half against Etson Gardner, and one-half against plaintiff and Hattie Gardner together in the proportion between them of their cotenancy, which is plaintiff 35/36 and Hattie 1/36; but the costs of the sale for partition between plaintiff and Hattie shall be paid from the proceeds of the sale.
The judgment is modified with respect to the taxation of the costs; in all other respects it is affirmed.
Modified and remanded.
TAYLOR, OXNER, LEGGE and MOSS, JJ., concur.
|
{
"pile_set_name": "FreeLaw"
}
|
Q:
Name a dictionary from a variable value
How can I give a dictionary a name from a variable value?
An example of what I'm trying to build:
apache['name'] = "Apache Web Server"
apache['category'] = "web"
apache['version'] = "2.2.14-4"
However I don't know the dictionary's name in advance, that arrives as variable, e.g. dname = 'apache'. Dname is parsed from a text file. The logic is: "First word after delimiter is dict_name; next n lines are split into key:value pairs for dict_name; skip to next delimiter; repeat until end".
What doesn't work:
key = 'category'
value = 'web'
dname[key] = value
TypeError: 'str' object does not support item assignment
eval(dname)[key] = value
NameError: name 'apache' is not defined
getattr(dname, '__contains__')[key] = value
and similar attempts with keywords from dir(dname) spawn only errors. (Because getattr is only for functions and modules?)
From How to create a dictionary based on variable value in Python I'm introduced to vars(), but it wants the dictionary to exist already?
vars(dname)[key] = value
TypeError: vars() argument must have __dict__ attribute
This question's title is the closest sounding I've found to what I'm after, but the answers are about using variables for keys, not the dict name: Create a dictionary with name of variable
A:
From the discussion in the comments, it is clear that you're trying to create a variable whose name is contained in another variable.
The following shows how this can be done:
d = {}
d["name"] = "Apache Web Server"
d["category"] = "web"
d["version"] = "2.2.14-4"
locals()["apache"] = d
print apache
This creates a local variable, but also take a look at globals().
|
{
"pile_set_name": "StackExchange"
}
|
Q:
Parse Boolean C# Culture verdadero
I am trying to run this exact line, and it isn't working. Anyone know the reason why?
Convert.ToBoolean("verdadero", new System.Globalization.CultureInfo("ES-MX"));
I am parsing this from an xml file generated by a program that has many languages installed, and so it will use "true" in "EN-US" culture or "verdadero" in "ES-MX".
A:
Interesting. Running Convert.ToBoolean through a decompiler emits this:
/// <summary>
/// Converts the specified string representation of a logical value to its Boolean equivalent, using the specified culture-specific formatting information.
/// </summary>
///
/// <returns>
/// true if <paramref name="value"/> equals <see cref="F:System.Boolean.TrueString"/>, or false if <paramref name="value"/> equals <see cref="F:System.Boolean.FalseString"/> or null.
/// </returns>
/// <param name="value">A string that contains the value of either <see cref="F:System.Boolean.TrueString"/> or <see cref="F:System.Boolean.FalseString"/>. </param><param name="provider">An object that supplies culture-specific formatting information. This parameter is ignored.</param><exception cref="T:System.FormatException"><paramref name="value"/> is not equal to <see cref="F:System.Boolean.TrueString"/> or <see cref="F:System.Boolean.FalseString"/>. </exception><filterpriority>1</filterpriority>
[__DynamicallyInvokable]
public static bool ToBoolean(string value, IFormatProvider provider)
{
if (value == null)
return false;
else
return bool.Parse(value);
}
This makes it look like the IFormatProvider is completely disregarded.
I'm tempted to say it's a bug in the framework, but experience has taught me that I'm usually missing something when I come to that conclusion...
|
{
"pile_set_name": "StackExchange"
}
|
About
Welcome To Blookcase!
Yes, we know, it’s a bit of a mouthful. But if you repeat it aloud a few times — Blookcase — it does become a bit easier to say, doesn’t it? Welcome to Blookcase, the Internet’s first, best, and currently only source for free online blooks!
What Is A Blook?
A blook is a book that uses blogging as its medium. Blooks published on Blookcase are published episodically, with a new chapter published each week (usually), sort of like a television show. This allows our authors, or blauthors, to release their blooks faster to readers, take in feedback on their stories as they develop them, and allow the community to interact with and within the story in ways traditional books can’t.
There are a few sorts of blooks you might find here in the future. Some are structured like traditional books, with a set number of chapters that are published episodically, week after week, until the story is done. Some might take a style more similar to a television show, with a set number of “episodes” (chapters) published each year. Others might be collections of short stories arranged into chapters or volumes. How our blauthors decide to create their content is up to them, but the premise remains the same.
What Is Blookcase.com?
Blookcase is the world’s first (and only) source for free online blooks. As it stands, we only have one blauthor, but down the road we’re hoping to slowly add more to our team as our community grows.
All of the blooks on our site are available for you to read absolutely free of charge. We don’t require subscriptions, logins, or any of that nonsense. Just bookmark us, read new chapters as they’re released, join the discussion by leaving comments (the only thing that requires any sort of login), and enjoy. And if you really, truly enjoy our content, consider pledging to our Patreon so we can grow our site, expand on our content, and keep delivering you our stories each month!
|
{
"pile_set_name": "Pile-CC"
}
|
Maryland: Amendments to be Considered for Senate Bill 281
Despite overwhelming opposition to his extreme gun control scheme contained in Senate Bill 281, Governor Martin O’Malley is desperately using arm-twisting politics and deceptive procedural maneuvers to try and ram through this deeply flawed legislation. Multiple amendments to Senate Bill 281 are to be considered SOON and could be supported by your state Delegate(s). It is important that you contact your state Delegate(s) TODAY and urge them to say NO to O’Malley’s political bullying and OPPOSE Senate Bill 281 and all anti-gun amendments.
|
{
"pile_set_name": "Pile-CC"
}
|
Return-Path: <calabresecharlie1@hotmail.com>
Received: from rly-xd02.mx.aol.com (rly-xd02.mail.aol.com [172.20.105.167]) by air-xd02.mail.aol.com (v83.35) with ESMTP id MAILINXD28-0202180030; Sat, 02 Feb 2002 18:00:30 -0500
Received: from hotmail.com (f191.law8.hotmail.com [216.33.241.191]) by rly-xd02.mx.aol.com (v83.35) with ESMTP id MAILRELAYINXD210-0202180013; Sat, 02 Feb 2002 18:00:13 -0500
Received: from mail pickup service by hotmail.com with Microsoft SMTPSVC; Sat, 2 Feb 2002 15:00:13 -0800
Received: from 152.163.201.199 by lw8fd.law8.hotmail.msn.com with HTTP; Sat, 02 Feb 2002 23:00:12 GMT
X-Originating-IP: [152.163.201.199]
From: "Charlie Cundari" <calabresecharlie1@hotmail.com>
To: ktracey111@aol.com
Subject: Fwd: Fw: Please send this back... you'll see why
Date: Sat, 02 Feb 2002 18:00:12 -0500
Mime-Version: 1.0
Content-Type: multipart/mixed; boundary="----=_NextPart_000_64c1_2722_76d6"
Message-ID: <F191qnP0StWpPsQV2Jd0000bd44@hotmail.com>
X-OriginalArrivalTime: 02 Feb 2002 23:00:13.0085 (UTC) FILETIME=[5F0E74D0:01C1AC3D]
X-Mailer: Unknown (No Version)
KT Igot this from the radio freind of mine on wicc am 60 I hope you don't
mind.
Nunziec32
>From: "john laBarca" <jjlabarca@hotmail.com>
>To: alissa@webe108.com, calabresecharlie1@hotmail.com, Chazros@aol.com,
>djbumpire81@hotmail.com, eaglepaintball@yahoo.com, Exit153b@aol.com,
>famousbirth-html@rtn.emazing.com, Mojoman18414@cs.com, mrlaughs@msn.com,
>tbusch@knom.org, UdiSondon@aol.com, yadaya2000@aol.com
>Subject: Fwd: Fw: Please send this back... you'll see why
>Date: Sat, 02 Feb 2002 17:10:07 -0500
>
_________________________________________________________________
Join the world's largest e-mail service with MSN Hotmail.
http://www.hotmail.com
John LaBarca
>From: KindP@aol.com
>To: jjlabarca@hotmail.com
>Subject: Fwd: Fw: Please send this back... you'll see why
>Date: Sat, 2 Feb 2002 11:12:07 EST
>
>
Content-Transfer-Encoding: 7bit
Return-Path: <rowjay@home.com>
Received: from rly-xg02.mx.aol.com (rly-xg02.mail.aol.com [172.20.115.199]) by air-xg02.mail.aol.com (v83.35) with ESMTP id MAILINXG21-0201162217; Fri, 01 Feb 2002 16:22:17 -0500
Received: from femail1.sdc1.sfba.home.com (femail1.sdc1.sfba.home.com [24.0.95.81]) by rly-xg02.mx.aol.com (v83.35) with ESMTP id MAILRELAYINXG21-0201162153; Fri, 01 Feb 2002 16:21:53 -0500
Received: from cc504450a ([68.58.144.147]) by femail1.sdc1.sfba.home.com (InterMail vM.4.01.03.20 201-229-121-120-20010223) with SMTP id <20020201212200.NANJ10716.femail1.sdc1.sfba.home.com@cc504450a>; Fri, 1 Feb 2002 13:22:00 -0800
Message-ID: <001701c1ab66$5d406640$93903a44@cstltn01.in.comcast.net>
From: "Roger S. Gray" <rowjay@home.com>
To: "Sally Cassidy" <cassidy@indianapolis.anglican.org>, "Ruth Lawson Kirk" <RevRuth654@aol.com>, "Pam Baldwin" <lanetribe@snet.net>, <KindP@aol.com>, "Ginny Ayers" <lbginny@mymailstation.com>, "Gene Sanislo" <genesan@juno.com>
Cc: "Roger Gray" <rowjay@home.com>, "St. Michael's Office" <officeatstmichls@aol.com>
Subject: Fw: Please send this back... you'll see why
Date: Fri, 1 Feb 2002 16:21:07 -0500
MIME-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 6.00.2600.0000
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000
----- Original Message -----
From: "jerryandjoan" <luv2boat@peoplepc.com>
To: "Shelly and Bob Bratch" <teacherrjb@aol.com>; "Cathy and Michael Lott"
<Lotts4cats@aol.com>; "Jeanie Pflum" <pflum@fayette.k12.in.us>
Sent: Wednesday, January 30, 2002 8:01 PM
Subject: Fw: Please send this back... you'll see why
>
> >
> > St. Theresa Prayer(cannot be deleted)
> >
> > REMEMBER to make a wish before you read the
> > poem. That's all you have to do. There is
> > nothing attached. This is a powerful novena.
> >
> > Just send this to four people and
> > let me know what happens on the fourth day....
> > Do not break this, please. Prayer is one
> > of the best free gifts we receive. There is
> > no cost but a lot of reward.
> >
> >
> > (Did you make a wish?)
> >
> > if you don't make a wish, it won't come true.
> > Last Chance to Make a Wish
> >
> > May today there be peace within
> > May you trust your highest power that you
> > are exactly where you are meant to be....
> > May you not forget the infinite possibilities
> > that are born of faith
> > May you use those gifts that you have
> > received, and pass on the love that has been
> > given to you....
> > May you be content knowing you are a child of
> > God....
> > Let this presence settle into our bones,
> > and allow your soul the freedom to sing, dance,
> > It is there for each and every one of you....
> >
> >
> > Send This to 7 People within the next 5
> > mins and your wish will come true
> >
> > Please send this back...you'll see why.
> >
> >
> >
> >
> >
> >
> >
> >
> > _________________________________________________________________
> > Get your FREE download of MSN Explorer at
> http://explorer.msn.com/intl.asp.
> >
> >
>
>
|
{
"pile_set_name": "Enron Emails"
}
|
Adorable indeed! >w< I love the way she's blushing, and that adorable smile :3 Beautiful work on her eyes and mane, too ^^
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
Can the wp_posts table have the same slug (post_name) in multiple statuses (post_status)?
I'm using function get_posts to retrieve a set of post objects that are my custom post type (CPT). I am counting on being able to programmatically flip these posts between status "publish", "pending" and "draft".
Before I go through the trouble of detecting and "fixing" potential duplicates -- is it even something I have to worry about? Is there any scenario where the same CPT post_name can reside in the wp_posts table in more than one (row) of differing post_status: publish, pending or draft?
(edit) After some experimentation I found that when inserting a post of status "pending", it ignores the post_name parameter - so that ends up being blank in the database. And yes, it will allow many rows in the wp_posts table with the same post_name of '' (blank). I'm sure there's a good reason for this but it is not what I expected that's for sure.
A:
No, multiple posts with the same CPT and post name (slug) are not possible. Someone can work hard and ruin the DB by writing into it some illegal values, but that should not be something you think of when writing your code.
Posts in their initial state are not true posts, they are just place holders, therefor while your observation is valid, it is not really relevant for usual usage pattern of wordpress API, unless once again your aim is to break things.
|
{
"pile_set_name": "StackExchange"
}
|
Behind the Keyboard - Elieit
Elieit = By Google. I wanted to search some sites and SocioTown’s name popped up and my brother, KobeJuwan, told me about it.
N = So your brother already played SocioTown when you went on search mode?
E = Yes, I wasn’t really sure about playing the game but he told me of interesting facts about SocioTown.
N = What facts did he tell you?
E = There’s bug catching, you can ride a scooter, you can go on a boat ride, and many more.
N = How many brothers and sisters do you have?
E = I have 1 brother, KobeJuwan, and 1 sister. My sister used to play SocioTown, but not anymore. You see… she stole someone’s name and got-in a bit of trouble.So she decided to quit completely.
N = What kind of things do you and your siblings usually do together?
E = We love to watch horror movies like “Goosebumps: A Night In Terror Tower” during the days. (My sister almost freaked out when the horror scene came) And go to our aunt’s house to see our cousins.
N = What is “Elieit” means?
E = Well… I like the name “elie” off a socian name, so I decided to add the “it” part.
N = How old are you?
E = 14.
N = What are your favorite subject at school?
E = I like my art class. Sculpture. I like to go deep in making sculptures, but we usually use clay at my school.
N = What kind of clay sculpture have you done?
E = Hehe… I tried to do make a mini sculpture on the double oval but it turned out to be mushy and I had had clay on my fingers for weeks. I still have a lot to learn.
N = What kind of sculpture do you like?
E = Roman Sculpture art is my favorite. I like this sculpture called “The Dying Gaul” (note: originally named “Dying Gladiator” by Attalus I of Pergamon) because it shows its beauty. It is a very rare Roman art that was made in the late 3rd century and considered the oldest sculpture in the Roman museums.
N = The statue looks like it’s in agony though. What makes it a beauty to you?
E = It shows sadness but inside the statue’s heart is love jealousy for what someone has. But, I, on the other hand, think that the statue is not happy, but its beauty was shown. But its agony was shown more than its beauty.
N = What are your hobbies?
E = I like to draw and ride my bike around the parking lot.
N = What kind of drawings have you done?
E = When I was in 2nd grade I drew a Venus Flytrap it ate a fly in the pond. I won 3rd place.
N = What are your favorite foods?
E = I like to eat hot dogs and I also love fried rice and fried chicken.
N = What are your most favorite movie of all time?
E = The most favorite is “Michael Jackson: This Is It”. When I watched his songs, it touches my heart.
|
{
"pile_set_name": "Pile-CC"
}
|
1001 Mark Boulevard St.
Mon - Sat 8.00 - 18.00
Sales department
X-Cart Awesome Ability Theme
We’d like to introduce X-Cart users to a fantastic new template, called Ability, that is so loaded with features that you really need to see it in action to fully understand why it is so advanced compared to other ‘skins’ available on the market. This template comes with literally 100’s of color and background combinations and several dynamically generated and animated areas.
View Demo
View this demo to get the full view of the powerful features and presentation: Click Here For Demo
Screenshot
Click the thumbnail below for a detailed screenshot
Additional Specs and Information
Ability is an advanced, all-purpose X-Cart v4.4.x template solution, with a rich amount of layout possibilities and features built-in.
The idea behind Ability is to give you all the design flexibility and features you need, in one template, whilst keeping your costs down.
It can be used as the foundation to any web store. You’ll be surprised at what you can achieve with this template alone.
LATEST POSTS
Lately i've been using Divi for the majority of my projects since it's such a great theme for adapting to any type of business or service. And, my clients like the drag 'n drop interface which, oddly, is easier to teach to someone than the standard Wordpress editor...
|
{
"pile_set_name": "Pile-CC"
}
|
hen two letters picked without replacement from {m: 1, h: 3, s: 2, t: 1, p: 3, c: 1}?
3/55
Four letters picked without replacement from {e: 3, s: 2, m: 2, l: 6, y: 5}. Give prob of picking 1 l, 1 e, and 2 y.
1/17
What is prob of picking 1 t and 2 u when three letters picked without replacement from tututtttuuuututuut?
27/68
What is prob of picking 3 c and 1 k when four letters picked without replacement from {c: 3, k: 8}?
4/165
What is prob of picking 1 l and 1 p when two letters picked without replacement from {p: 2, h: 1, l: 1, z: 1, a: 5}?
2/45
What is prob of picking 2 s and 1 u when three letters picked without replacement from yyzuyzyusszzysssss?
7/136
Four letters picked without replacement from ozzdxcczqcq. Give prob of picking 2 q and 2 c.
1/110
Calculate prob of picking 2 n and 2 h when four letters picked without replacement from {h: 2, n: 4}.
2/5
Two letters picked without replacement from {e: 1, d: 2, a: 1, i: 1}. What is prob of picking 1 e and 1 i?
1/10
Three letters picked without replacement from nnfccfcnffcnfc. What is prob of picking 3 n?
1/91
Two letters picked without replacement from iimuigbi. What is prob of picking 1 g and 1 i?
1/7
Four letters picked without replacement from {c: 7, b: 6}. Give prob of picking 3 c and 1 b.
42/143
Calculate prob of picking 2 e when two letters picked without replacement from eeeeceeeeeeeeeeeee.
8/9
Calculate prob of picking 2 a and 2 t when four letters picked without replacement from {t: 9, a: 7}.
27/65
What is prob of picking 1 u, 1 s, and 1 b when three letters picked without replacement from uquusbq?
3/35
What is prob of picking 1 r, 1 v, and 2 s when four letters picked without replacement from rvvrrsvrs?
2/21
Four letters picked without replacement from {n: 2, s: 2, e: 1, x: 1, a: 5, l: 4}. What is prob of picking 1 a, 2 n, and 1 x?
1/273
Three letters picked without replacement from hhhuuuhuuuuhhhhh. Give prob of picking 3 u.
1/16
Two letters picked without replacement from {u: 1, d: 1, o: 3}. What is prob of picking 1 d and 1 u?
1/10
Two letters picked without replacement from nxtzk. What is prob of picking 1 t and 1 x?
1/10
Three letters picked without replacement from {b: 1, h: 1, v: 1, o: 2, l: 1, w: 1}. Give prob of picking 1 b, 1 w, and 1 o.
2/35
Four letters picked without replacement from iiuoa. Give prob of picking 1 a, 1 i, 1 o, and 1 u.
2/5
Four letters picked without replacement from jyjevekekheejyjkeh. What is prob of picking 1 e, 1 v, 1 y, and 1 j?
4/255
Two letters picked without replacement from {l: 4, y: 3}. Give prob of picking 2 l.
2/7
Three letters picked without replacement from pjuuuuuujobuuuuoupu. Give prob of picking 1 u, 1 j, and 1 b.
8/323
Four letters picked without replacement from {f: 1, g: 3}. What is prob of picking 1 g and 3 f?
0
Two letters picked without replacement from {q: 5, y: 5}. What is prob of picking 2 q?
2/9
Three letters picked without replacement from iiiiaiiaiiiiiiaiaiii. What is prob of picking 2 a and 1 i?
8/95
Two letters picked without replacement from iitiiikiikiiii. What is prob of picking 2 k?
1/91
Four letters picked without replacement from kbkkrkgxbkkkkrxkyx. Give prob of picking 1 y, 1 k, 1 r, and 1 b.
1/85
What is prob of picking 2 p when two letters picked without replacement from bxibbpbpbbxpxpipb?
5/68
What is prob of picking 3 q and 1 a when four letters picked without replacement from qqqqqqqaqaaqqqqq?
33/70
Three letters picked without replacement from {l: 4}. What is prob of picking 3 l?
1
What is prob of picking 2 p when two letters picked without replacement from {c: 7, p: 7}?
3/13
Four letters picked without replacement from jqiuji. What is prob of picking 1 j, 1 u, 1 i, and 1 q?
4/15
Three letters picked without replacement from gxvnnvkr. Give prob of picking 1 n, 1 v, and 1 g.
1/14
Two letters picked without replacement from {s: 2, k: 16}. What is prob of picking 2 s?
1/153
Two letters picked without replacement from {s: 2, i: 4, x: 4, k: 6, e: 1}. What is prob of picking 1 x and 1 s?
1/17
Calculate prob of picking 1 a and 1 h when two letters picked without replacement from {q: 1, h: 2, l: 5, a: 4, k: 2}.
8/91
Two letters picked without replacement from uujjuuuuuuuuuuuuuu. What is prob of picking 2 u?
40/51
Calculate prob of picking 2 x and 1 r when three letters picked without replacement from {x: 2, r: 1, v: 2, a: 2, b: 1}.
1/56
Three letters picked without replacement from {d: 3, v: 1, n: 5, b: 3}. What is prob of picking 2 b and 1 d?
9/220
Two letters picked without replacement from ttsmssqtstttssst. What is prob of picking 1 m and 1 q?
1/120
Four letters picked without replacement from uuuu. What is prob of picking 4 u?
1
What is prob of picking 1 z, 2 p, and 1 b when four letters picked without replacement from zzpbbbpbpbzz?
4/33
What is prob of picking 1 n and 1 s when two letters picked without replacement from ubsbngnsuenbs?
3/26
Two letters picked without replacement from {g: 1, f: 4, s: 2, k: 6, d: 2}. Give prob of picking 1 g and 1 f.
4/105
Two letters picked without replacement from {f: 2, y: 1}. What is prob of picking 1 y and 1 f?
2/3
What is prob of picking 1 y and 1 r when two letters picked without replacement from {u: 1, k: 2, g: 1, r: 1, y: 2}?
2/21
What is prob of picking 2 a when two letters picked without replacement from vaa?
1/3
Four letters picked without replacement from {w: 9, d: 2, k: 2}. What is prob of picking 2 w and 2 k?
36/715
Calculate prob of picking 3 o and 1 h when four letters picked without replacement from uaoyhawooyhahwwh.
1/455
What is prob of picking 1 q and 1 d when two letters picked without replacement from {d: 3, c: 1, q: 1}?
3/10
Calculate prob of picking 3 m and 1 f when four letters picked without replacement from mfffmmmmmmmfmm.
480/1001
Two letters picked without replacement from {h: 4, e: 3, q: 1}. What is prob of picking 2 h?
3/14
Four letters picked without replacement from lgnvngyyvvyz. Give prob of picking 2 g, 1 y, and 1 n.
2/165
Calculate prob of picking 1 t and 2 m when three letters picked without replacement from mmmmttmmmm.
7/15
What is prob of picking 2 z and 1 t when three letters picked without replacement from {t: 3, z: 2}?
3/10
What is prob of picking 2 a and 1 d when three letters picked without replacement from tmaud?
0
What is prob of picking 1 x and 1 l when two letters picked without replacement from xxxxxlxxzlllx?
16/39
What is prob of picking 2 y when two letters picked without replacement from yhsyryhrrrrsrrr?
1/35
What is prob of picking 1 e and 3 f when four letters picked without replacement from {u: 1, e: 3, f: 3}?
3/35
Calculate prob of picking 2 t and 2 k when four letters picked without replacement from {t: 6, k: 4}.
3/7
Calculate prob of picking 2 p and 1 b when three letters picked without replacement from bppp.
3/4
Three letters picked without replacement from hbhhhhbhhhh. What is prob of picking 1 h and 2 b?
3/55
What is prob of picking 2 q and 2 x when four letters picked without replacement from {q: 4, x: 6}?
3/7
Three letters picked without replacement from aaa. Give prob of picking 3 a.
1
Calculate prob of picking 1 o and 1 b when two letters picked without replacement from {o: 6, p: 6, b: 3}.
6/35
What is prob of picking 4 d when four letters picked without replacement from drrddyddrdrprrr?
1/91
Calculate prob of picking 1 n, 1 e, and 2 y when four letters picked without replacement from {l: 1, y: 2, n: 9, v: 2, b: 2, e: 4}.
12/1615
Four letters picked without replacement from {q: 4, k: 2, t: 1, n: 1, l: 2, x: 2}. Give prob of picking 1 x, 2 k, and 1 l.
4/495
Calculate prob of picking 2 s when two letters picked without replacement from {b: 2, s: 2, r: 8, u: 1, n: 2}.
1/105
Four letters picked without replacement from {o: 2, c: 8, a: 5, b: 2, q: 2}. Give prob of picking 2 c and 2 b.
7/969
What is prob of picking 1 x and 1 w when two letters picked without replacement from xwwxiinxzmii?
1/11
What is prob of picking 2 j and 2 e when four letters picked without replacement from hshsjhjhhjehe?
3/715
Two letters picked without replacement from {w: 3, s: 2, c: 4, o: 2, x: 1}. Give prob of picking 1 w and 1 c.
2/11
Calculate prob of picking 1 t and 2 i when three letters picked without replacement from {i: 6, t: 2, x: 5,
|
{
"pile_set_name": "DM Mathematics"
}
|
Federal and airline officials have yet to say what caused several flight attendants to become nauseated and dizzy, with watery eyes. Officials say none of the 185 passengers on board was injured or sickened.
The flight landed at Dublin Airport on Saturday afternoon.
US Airways says doctors were examining the flight attendants while the airline arranged for the passengers to get to Philadelphia on other flights.
|
{
"pile_set_name": "Pile-CC"
}
|
/*
* Copyright (c) 2015, Peter Thorson. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the WebSocket++ Project nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL PETER THORSON BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#include <websocketpp/config/asio_no_tls_client.hpp>
#include <websocketpp/client.hpp>
#include <websocketpp/extensions/permessage_deflate/enabled.hpp>
#include <iostream>
struct deflate_config : public websocketpp::config::asio_client {
typedef deflate_config type;
typedef asio_client base;
typedef base::concurrency_type concurrency_type;
typedef base::request_type request_type;
typedef base::response_type response_type;
typedef base::message_type message_type;
typedef base::con_msg_manager_type con_msg_manager_type;
typedef base::endpoint_msg_manager_type endpoint_msg_manager_type;
typedef base::alog_type alog_type;
typedef base::elog_type elog_type;
typedef base::rng_type rng_type;
struct transport_config : public base::transport_config {
typedef type::concurrency_type concurrency_type;
typedef type::alog_type alog_type;
typedef type::elog_type elog_type;
typedef type::request_type request_type;
typedef type::response_type response_type;
typedef websocketpp::transport::asio::basic_socket::endpoint
socket_type;
};
typedef websocketpp::transport::asio::endpoint<transport_config>
transport_type;
/// permessage_compress extension
struct permessage_deflate_config {};
typedef websocketpp::extensions::permessage_deflate::enabled
<permessage_deflate_config> permessage_deflate_type;
};
typedef websocketpp::client<deflate_config> client;
using websocketpp::lib::placeholders::_1;
using websocketpp::lib::placeholders::_2;
using websocketpp::lib::bind;
// pull out the type of messages sent by our config
typedef websocketpp::config::asio_client::message_type::ptr message_ptr;
int case_count = 0;
void on_message(client* c, websocketpp::connection_hdl hdl, message_ptr msg) {
client::connection_ptr con = c->get_con_from_hdl(hdl);
if (con->get_resource() == "/getCaseCount") {
std::cout << "Detected " << msg->get_payload() << " test cases."
<< std::endl;
case_count = atoi(msg->get_payload().c_str());
} else {
c->send(hdl, msg->get_payload(), msg->get_opcode());
}
}
int main(int argc, char* argv[]) {
// Create a server endpoint
client c;
std::string uri = "ws://localhost:9001";
if (argc == 2) {
uri = argv[1];
}
try {
// We expect there to be a lot of errors, so suppress them
c.clear_access_channels(websocketpp::log::alevel::all);
c.clear_error_channels(websocketpp::log::elevel::all);
// Initialize ASIO
c.init_asio();
// Register our handlers
c.set_message_handler(bind(&on_message,&c,::_1,::_2));
websocketpp::lib::error_code ec;
client::connection_ptr con = c.get_connection(uri+"/getCaseCount", ec);
c.connect(con);
// Start the ASIO io_service run loop
c.run();
std::cout << "case count: " << case_count << std::endl;
for (int i = 1; i <= case_count; i++) {
c.reset();
std::stringstream url;
url << uri << "/runCase?case=" << i << "&agent="
<< websocketpp::user_agent;
con = c.get_connection(url.str(), ec);
c.connect(con);
c.run();
}
std::cout << "done" << std::endl;
} catch (websocketpp::exception const & e) {
std::cout << e.what() << std::endl;
}
}
|
{
"pile_set_name": "Github"
}
|
/*
* Copyright 2010-2015 Samy Al Bahra.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef CK_HP_STACK_H
#define CK_HP_STACK_H
#include <ck_cc.h>
#include <ck_hp.h>
#include <ck_pr.h>
#include <ck_stack.h>
#include <ck_stddef.h>
#define CK_HP_STACK_SLOTS_COUNT 1
#define CK_HP_STACK_SLOTS_SIZE sizeof(void *)
CK_CC_INLINE static void
ck_hp_stack_push_mpmc(struct ck_stack *target, struct ck_stack_entry *entry)
{
ck_stack_push_upmc(target, entry);
return;
}
CK_CC_INLINE static bool
ck_hp_stack_trypush_mpmc(struct ck_stack *target, struct ck_stack_entry *entry)
{
return ck_stack_trypush_upmc(target, entry);
}
CK_CC_INLINE static struct ck_stack_entry *
ck_hp_stack_pop_mpmc(ck_hp_record_t *record, struct ck_stack *target)
{
struct ck_stack_entry *entry, *update;
do {
entry = ck_pr_load_ptr(&target->head);
if (entry == NULL)
return NULL;
ck_hp_set_fence(record, 0, entry);
} while (entry != ck_pr_load_ptr(&target->head));
while (ck_pr_cas_ptr_value(&target->head, entry, entry->next, &entry) == false) {
if (entry == NULL)
return NULL;
ck_hp_set_fence(record, 0, entry);
update = ck_pr_load_ptr(&target->head);
while (entry != update) {
ck_hp_set_fence(record, 0, update);
entry = update;
update = ck_pr_load_ptr(&target->head);
if (update == NULL)
return NULL;
}
}
return entry;
}
CK_CC_INLINE static bool
ck_hp_stack_trypop_mpmc(ck_hp_record_t *record, struct ck_stack *target, struct ck_stack_entry **r)
{
struct ck_stack_entry *entry;
entry = ck_pr_load_ptr(&target->head);
if (entry == NULL)
return false;
ck_hp_set_fence(record, 0, entry);
if (entry != ck_pr_load_ptr(&target->head))
goto leave;
if (ck_pr_cas_ptr_value(&target->head, entry, entry->next, &entry) == false)
goto leave;
*r = entry;
return true;
leave:
ck_hp_set(record, 0, NULL);
return false;
}
#endif /* CK_HP_STACK_H */
|
{
"pile_set_name": "Github"
}
|
Designing a training program to educate your employees
Version 3
Created by Anonymous on Mar 9, 2015 8:22 PM. Last modified by Anonymous on Aug 8, 2017 3:11 AM.
Hi everyone,
I hope no one minded that I skipped last weeks blog-post! We’ll be back into the usual rhythm from this week. I’ve been having a lovely holiday in New Zealand, visiting friends, family and enjoying the sunshine and outdoors - even doing my first ever skydive (15,000 feet, 1 minute freefall @ 200km/hour = completely amazing and terrifying!)
Now onto the topic of today’s blogpost: Designing a training program to educate your employees. Regardless of whether you’re designing a training program for employees as part of the initial deployment or as a post deployment push to increase adoption and improve collaboration, the same cycle of activities should take place.
The Training Cycle
1. Complete a training needs analysis
Before planning any training or developing content, a needs analysis needs to be completed to ensure that you give your employees the knowledge, skills and ability that they need to be successful using the tools and working in new ways. There is no point spending time and money developing training that isn’t going to be useful to people. The first thing to do is identify what the learning objectives of each of the user group are. What do they know already, and where are the gaps in their knowledge? Do they need to know how to set up mail and calendar on their mobile device? Or do they need to know how to collaborate on spreadsheets or design team or project websites? What behaviour changes are required for people to maximise the benefits of the tools? Do people need to learn how to work collaboratively? Rather than guessing what the training needs are for a specific group - it’s best to find out directly from that group - either via focus groups or surveys. This is particularly important post-deployment when the needs of user groups might be different to what you expect.
2. Design the training program
Once you've identified what training needs exist within different departments across your organisation, it is time to design the content and training program accordingly. The key elements of this step are to identify:
What is the right training format for each user group?
What budget or resources exist to help with the design and delivery of content?
Training comes in many formats including instructor-lead (typically classroom style), one-to-one coaching sessions, remote instructor-lead (via hangouts), and self-paced training which can be interactive e-learning, videos, or even printed materials such as a one page ‘cheat-sheet’ with instructions to follow with the new process or behaviour. An important element of the design of any training program is to ensure that you cover the reasons that the new skills or behaviour changes are needed and what the benefits are to both the organisation, team and individual are for working in the new ways. People won’t simply start behaving differently because they are told to or shown how to - explaining the benefits and reasons for the change is essential for any training program - regardless of format.
3. Develop the content
Based on the learning objectives captured and the format that has been decided upon, it is now time to develop the content of the training program. This could range from being a time-consuming, complex process if you’re developing videos or e-learning materials from scratch, or simple if you’re able to reuse existing templates and content (see learn.googleapps.com for material that can be used for self-paced training, or the ‘lesson plans’ for scripts that can be used for instructor-led training)If developing the content is something that you don’t have the time or skills to do internally, you might consider using the content and services of dedicated training partners such as:
If you do develop content yourself remember to focus it on behaviour change, specific use cases and meeting the needs that have been identified, rather than simply on the features and functions of the products. Below are some of the behaviour changes that might be applicable to various groups of your employees:
Old behaviour
New behaviour
Single emails
Conversation threads
Folders
Labels
Deleting
Archiving
Sorting
Searching
Version 1.01, 1.02, 1.03, 2.01, …….
Collaboration on one document
Working alone
Working together
Being tied to your desk
Working anywhere
Emailing files
Sharing links to documents
4. Deliver the trainingThis step is more specifically related to training that is being delivered by an instructor either remotely or in-person. The key decisions to be made include:
Who will deliver instructor-led training? (internal trainer or external trainer from partner organisation)
If internal trainers will be delivering the training - how will you ensure that they have the skills and knowledge to deliver quality training?
Who will translate materials? (if needed)
Who will manage the logistics of instructor-led training such as booking rooms, travel for trainers etc
If you have a choice between a trainer that has Google Apps product knowledge but no training skills or is an experienced trainer of other subjects but not an expert in Google Apps - my vote would go to the latter choice as it is easier to teach someone Google Apps product knowledge than it is to teach them how to be a good training facilitator. So making friends with your internal L&D department is a good idea!
For self-paced learning, this stage needs to consider how you’ll share and distribute the content. Where will you make the self-paced learning available? Will you create a website? Add content to an existing LMS (learning management system), will you print handouts out and put them on people’s desks? Once you’ve made the decision about where the content will be hosted, also consider the communications activities that might be needed in order to inform employees about the existence of the content, and provide them with a form they can fill in to submit feedback or ideas for how these materials could be improved.
5. Evaluate the training
The last element of the training cycle is collecting feedback. This is something that should occur after every single training session - including e-learning. Collecting feedback immediately after the participant has completed the training will give you a insight into participants reactions to the content. Once you’ve collected this feedback you might need to update the content of the course before it is delivered next to improve elements of the course. To collect feedback from participants about how much they ‘learned’ during the training - you need to ask them to complete some sort of post training quiz or test where they are asked to demonstrate their new knowledge. For more information on the different levels of feedback that it is possible to collect - have a read of Kirkpatricks four levels of learning.
As you can see from the image of the training cycle, training should be considered as an ongoing series of activities rather than a one time event. Consider who is the ongoing owner of Google Apps training materials and incorporate Google Apps training into the induction program for your new hires. Also consider how you will keep employees up to date with product updates as they are rolled out (check the What’s New site for details). Create a regular rhythm and format of getting all relevant updates out to your employees, be it newsletters, hangouts, drop in Q&A sessions or creating your own internal video updates - similar to ‘The Apps Show’. If this ongoing training proves challenging for you to keep up with internally - don’t forget that this is exactly where your partner can help out. Many of them offer regular hangouts to train their customers employees on product updates - have a chat with your partner to find out more about the services they offer in this space.
As usual, I’d love to hear your thoughts and experiences on the above topic. What has worked well or not worked well in your organisation?
|
{
"pile_set_name": "Pile-CC"
}
|
const char* ExtensionToString(Extension extension) {
switch (extension) {
case Extension::kSPV_AMD_gcn_shader:
return "SPV_AMD_gcn_shader";
case Extension::kSPV_AMD_gpu_shader_half_float:
return "SPV_AMD_gpu_shader_half_float";
case Extension::kSPV_AMD_gpu_shader_half_float_fetch:
return "SPV_AMD_gpu_shader_half_float_fetch";
case Extension::kSPV_AMD_gpu_shader_int16:
return "SPV_AMD_gpu_shader_int16";
case Extension::kSPV_AMD_shader_ballot:
return "SPV_AMD_shader_ballot";
case Extension::kSPV_AMD_shader_explicit_vertex_parameter:
return "SPV_AMD_shader_explicit_vertex_parameter";
case Extension::kSPV_AMD_shader_fragment_mask:
return "SPV_AMD_shader_fragment_mask";
case Extension::kSPV_AMD_shader_image_load_store_lod:
return "SPV_AMD_shader_image_load_store_lod";
case Extension::kSPV_AMD_shader_trinary_minmax:
return "SPV_AMD_shader_trinary_minmax";
case Extension::kSPV_AMD_texture_gather_bias_lod:
return "SPV_AMD_texture_gather_bias_lod";
case Extension::kSPV_EXT_demote_to_helper_invocation:
return "SPV_EXT_demote_to_helper_invocation";
case Extension::kSPV_EXT_descriptor_indexing:
return "SPV_EXT_descriptor_indexing";
case Extension::kSPV_EXT_fragment_fully_covered:
return "SPV_EXT_fragment_fully_covered";
case Extension::kSPV_EXT_fragment_invocation_density:
return "SPV_EXT_fragment_invocation_density";
case Extension::kSPV_EXT_fragment_shader_interlock:
return "SPV_EXT_fragment_shader_interlock";
case Extension::kSPV_EXT_physical_storage_buffer:
return "SPV_EXT_physical_storage_buffer";
case Extension::kSPV_EXT_shader_stencil_export:
return "SPV_EXT_shader_stencil_export";
case Extension::kSPV_EXT_shader_viewport_index_layer:
return "SPV_EXT_shader_viewport_index_layer";
case Extension::kSPV_GOOGLE_decorate_string:
return "SPV_GOOGLE_decorate_string";
case Extension::kSPV_GOOGLE_hlsl_functionality1:
return "SPV_GOOGLE_hlsl_functionality1";
case Extension::kSPV_GOOGLE_user_type:
return "SPV_GOOGLE_user_type";
case Extension::kSPV_INTEL_device_side_avc_motion_estimation:
return "SPV_INTEL_device_side_avc_motion_estimation";
case Extension::kSPV_INTEL_media_block_io:
return "SPV_INTEL_media_block_io";
case Extension::kSPV_INTEL_shader_integer_functions2:
return "SPV_INTEL_shader_integer_functions2";
case Extension::kSPV_INTEL_subgroups:
return "SPV_INTEL_subgroups";
case Extension::kSPV_KHR_16bit_storage:
return "SPV_KHR_16bit_storage";
case Extension::kSPV_KHR_8bit_storage:
return "SPV_KHR_8bit_storage";
case Extension::kSPV_KHR_device_group:
return "SPV_KHR_device_group";
case Extension::kSPV_KHR_float_controls:
return "SPV_KHR_float_controls";
case Extension::kSPV_KHR_multiview:
return "SPV_KHR_multiview";
case Extension::kSPV_KHR_no_integer_wrap_decoration:
return "SPV_KHR_no_integer_wrap_decoration";
case Extension::kSPV_KHR_non_semantic_info:
return "SPV_KHR_non_semantic_info";
case Extension::kSPV_KHR_physical_storage_buffer:
return "SPV_KHR_physical_storage_buffer";
case Extension::kSPV_KHR_post_depth_coverage:
return "SPV_KHR_post_depth_coverage";
case Extension::kSPV_KHR_shader_atomic_counter_ops:
return "SPV_KHR_shader_atomic_counter_ops";
case Extension::kSPV_KHR_shader_ballot:
return "SPV_KHR_shader_ballot";
case Extension::kSPV_KHR_shader_clock:
return "SPV_KHR_shader_clock";
case Extension::kSPV_KHR_shader_draw_parameters:
return "SPV_KHR_shader_draw_parameters";
case Extension::kSPV_KHR_storage_buffer_storage_class:
return "SPV_KHR_storage_buffer_storage_class";
case Extension::kSPV_KHR_subgroup_vote:
return "SPV_KHR_subgroup_vote";
case Extension::kSPV_KHR_variable_pointers:
return "SPV_KHR_variable_pointers";
case Extension::kSPV_KHR_vulkan_memory_model:
return "SPV_KHR_vulkan_memory_model";
case Extension::kSPV_NVX_multiview_per_view_attributes:
return "SPV_NVX_multiview_per_view_attributes";
case Extension::kSPV_NV_compute_shader_derivatives:
return "SPV_NV_compute_shader_derivatives";
case Extension::kSPV_NV_cooperative_matrix:
return "SPV_NV_cooperative_matrix";
case Extension::kSPV_NV_fragment_shader_barycentric:
return "SPV_NV_fragment_shader_barycentric";
case Extension::kSPV_NV_geometry_shader_passthrough:
return "SPV_NV_geometry_shader_passthrough";
case Extension::kSPV_NV_mesh_shader:
return "SPV_NV_mesh_shader";
case Extension::kSPV_NV_ray_tracing:
return "SPV_NV_ray_tracing";
case Extension::kSPV_NV_sample_mask_override_coverage:
return "SPV_NV_sample_mask_override_coverage";
case Extension::kSPV_NV_shader_image_footprint:
return "SPV_NV_shader_image_footprint";
case Extension::kSPV_NV_shader_sm_builtins:
return "SPV_NV_shader_sm_builtins";
case Extension::kSPV_NV_shader_subgroup_partitioned:
return "SPV_NV_shader_subgroup_partitioned";
case Extension::kSPV_NV_shading_rate:
return "SPV_NV_shading_rate";
case Extension::kSPV_NV_stereo_view_rendering:
return "SPV_NV_stereo_view_rendering";
case Extension::kSPV_NV_viewport_array2:
return "SPV_NV_viewport_array2";
case Extension::kSPV_VALIDATOR_ignore_type_decl_unique:
return "SPV_VALIDATOR_ignore_type_decl_unique";
};
return "";
}
bool GetExtensionFromString(const char* str, Extension* extension) {
static const char* known_ext_strs[] = { "SPV_AMD_gcn_shader", "SPV_AMD_gpu_shader_half_float", "SPV_AMD_gpu_shader_half_float_fetch", "SPV_AMD_gpu_shader_int16", "SPV_AMD_shader_ballot", "SPV_AMD_shader_explicit_vertex_parameter", "SPV_AMD_shader_fragment_mask", "SPV_AMD_shader_image_load_store_lod", "SPV_AMD_shader_trinary_minmax", "SPV_AMD_texture_gather_bias_lod", "SPV_EXT_demote_to_helper_invocation", "SPV_EXT_descriptor_indexing", "SPV_EXT_fragment_fully_covered", "SPV_EXT_fragment_invocation_density", "SPV_EXT_fragment_shader_interlock", "SPV_EXT_physical_storage_buffer", "SPV_EXT_shader_stencil_export", "SPV_EXT_shader_viewport_index_layer", "SPV_GOOGLE_decorate_string", "SPV_GOOGLE_hlsl_functionality1", "SPV_GOOGLE_user_type", "SPV_INTEL_device_side_avc_motion_estimation", "SPV_INTEL_media_block_io", "SPV_INTEL_shader_integer_functions2", "SPV_INTEL_subgroups", "SPV_KHR_16bit_storage", "SPV_KHR_8bit_storage", "SPV_KHR_device_group", "SPV_KHR_float_controls", "SPV_KHR_multiview", "SPV_KHR_no_integer_wrap_decoration", "SPV_KHR_non_semantic_info", "SPV_KHR_physical_storage_buffer", "SPV_KHR_post_depth_coverage", "SPV_KHR_shader_atomic_counter_ops", "SPV_KHR_shader_ballot", "SPV_KHR_shader_clock", "SPV_KHR_shader_draw_parameters", "SPV_KHR_storage_buffer_storage_class", "SPV_KHR_subgroup_vote", "SPV_KHR_variable_pointers", "SPV_KHR_vulkan_memory_model", "SPV_NVX_multiview_per_view_attributes", "SPV_NV_compute_shader_derivatives", "SPV_NV_cooperative_matrix", "SPV_NV_fragment_shader_barycentric", "SPV_NV_geometry_shader_passthrough", "SPV_NV_mesh_shader", "SPV_NV_ray_tracing", "SPV_NV_sample_mask_override_coverage", "SPV_NV_shader_image_footprint", "SPV_NV_shader_sm_builtins", "SPV_NV_shader_subgroup_partitioned", "SPV_NV_shading_rate", "SPV_NV_stereo_view_rendering", "SPV_NV_viewport_array2", "SPV_VALIDATOR_ignore_type_decl_unique" };
static const Extension known_ext_ids[] = { Extension::kSPV_AMD_gcn_shader, Extension::kSPV_AMD_gpu_shader_half_float, Extension::kSPV_AMD_gpu_shader_half_float_fetch, Extension::kSPV_AMD_gpu_shader_int16, Extension::kSPV_AMD_shader_ballot, Extension::kSPV_AMD_shader_explicit_vertex_parameter, Extension::kSPV_AMD_shader_fragment_mask, Extension::kSPV_AMD_shader_image_load_store_lod, Extension::kSPV_AMD_shader_trinary_minmax, Extension::kSPV_AMD_texture_gather_bias_lod, Extension::kSPV_EXT_demote_to_helper_invocation, Extension::kSPV_EXT_descriptor_indexing, Extension::kSPV_EXT_fragment_fully_covered, Extension::kSPV_EXT_fragment_invocation_density, Extension::kSPV_EXT_fragment_shader_interlock, Extension::kSPV_EXT_physical_storage_buffer, Extension::kSPV_EXT_shader_stencil_export, Extension::kSPV_EXT_shader_viewport_index_layer, Extension::kSPV_GOOGLE_decorate_string, Extension::kSPV_GOOGLE_hlsl_functionality1, Extension::kSPV_GOOGLE_user_type, Extension::kSPV_INTEL_device_side_avc_motion_estimation, Extension::kSPV_INTEL_media_block_io, Extension::kSPV_INTEL_shader_integer_functions2, Extension::kSPV_INTEL_subgroups, Extension::kSPV_KHR_16bit_storage, Extension::kSPV_KHR_8bit_storage, Extension::kSPV_KHR_device_group, Extension::kSPV_KHR_float_controls, Extension::kSPV_KHR_multiview, Extension::kSPV_KHR_no_integer_wrap_decoration, Extension::kSPV_KHR_non_semantic_info, Extension::kSPV_KHR_physical_storage_buffer, Extension::kSPV_KHR_post_depth_coverage, Extension::kSPV_KHR_shader_atomic_counter_ops, Extension::kSPV_KHR_shader_ballot, Extension::kSPV_KHR_shader_clock, Extension::kSPV_KHR_shader_draw_parameters, Extension::kSPV_KHR_storage_buffer_storage_class, Extension::kSPV_KHR_subgroup_vote, Extension::kSPV_KHR_variable_pointers, Extension::kSPV_KHR_vulkan_memory_model, Extension::kSPV_NVX_multiview_per_view_attributes, Extension::kSPV_NV_compute_shader_derivatives, Extension::kSPV_NV_cooperative_matrix, Extension::kSPV_NV_fragment_shader_barycentric, Extension::kSPV_NV_geometry_shader_passthrough, Extension::kSPV_NV_mesh_shader, Extension::kSPV_NV_ray_tracing, Extension::kSPV_NV_sample_mask_override_coverage, Extension::kSPV_NV_shader_image_footprint, Extension::kSPV_NV_shader_sm_builtins, Extension::kSPV_NV_shader_subgroup_partitioned, Extension::kSPV_NV_shading_rate, Extension::kSPV_NV_stereo_view_rendering, Extension::kSPV_NV_viewport_array2, Extension::kSPV_VALIDATOR_ignore_type_decl_unique };
const auto b = std::begin(known_ext_strs);
const auto e = std::end(known_ext_strs);
const auto found = std::equal_range(
b, e, str, [](const char* str1, const char* str2) {
return std::strcmp(str1, str2) < 0;
});
if (found.first == e || found.first == found.second) return false;
*extension = known_ext_ids[found.first - b];
return true;
}
const char* CapabilityToString(SpvCapability capability) {
switch (capability) {
case SpvCapabilityMatrix:
return "Matrix";
case SpvCapabilityShader:
return "Shader";
case SpvCapabilityGeometry:
return "Geometry";
case SpvCapabilityTessellation:
return "Tessellation";
case SpvCapabilityAddresses:
return "Addresses";
case SpvCapabilityLinkage:
return "Linkage";
case SpvCapabilityKernel:
return "Kernel";
case SpvCapabilityVector16:
return "Vector16";
case SpvCapabilityFloat16Buffer:
return "Float16Buffer";
case SpvCapabilityFloat16:
return "Float16";
case SpvCapabilityFloat64:
return "Float64";
case SpvCapabilityInt64:
return "Int64";
case SpvCapabilityInt64Atomics:
return "Int64Atomics";
case SpvCapabilityImageBasic:
return "ImageBasic";
case SpvCapabilityImageReadWrite:
return "ImageReadWrite";
case SpvCapabilityImageMipmap:
return "ImageMipmap";
case SpvCapabilityPipes:
return "Pipes";
case SpvCapabilityGroups:
return "Groups";
case SpvCapabilityDeviceEnqueue:
return "DeviceEnqueue";
case SpvCapabilityLiteralSampler:
return "LiteralSampler";
case SpvCapabilityAtomicStorage:
return "AtomicStorage";
case SpvCapabilityInt16:
return "Int16";
case SpvCapabilityTessellationPointSize:
return "TessellationPointSize";
case SpvCapabilityGeometryPointSize:
return "GeometryPointSize";
case SpvCapabilityImageGatherExtended:
return "ImageGatherExtended";
case SpvCapabilityStorageImageMultisample:
return "StorageImageMultisample";
case SpvCapabilityUniformBufferArrayDynamicIndexing:
return "UniformBufferArrayDynamicIndexing";
case SpvCapabilitySampledImageArrayDynamicIndexing:
return "SampledImageArrayDynamicIndexing";
case SpvCapabilityStorageBufferArrayDynamicIndexing:
return "StorageBufferArrayDynamicIndexing";
case SpvCapabilityStorageImageArrayDynamicIndexing:
return "StorageImageArrayDynamicIndexing";
case SpvCapabilityClipDistance:
return "ClipDistance";
case SpvCapabilityCullDistance:
return "CullDistance";
case SpvCapabilityImageCubeArray:
return "ImageCubeArray";
case SpvCapabilitySampleRateShading:
return "SampleRateShading";
case SpvCapabilityImageRect:
return "ImageRect";
case SpvCapabilitySampledRect:
return "SampledRect";
case SpvCapabilityGenericPointer:
return "GenericPointer";
case SpvCapabilityInt8:
return "Int8";
case SpvCapabilityInputAttachment:
return "InputAttachment";
case SpvCapabilitySparseResidency:
return "SparseResidency";
case SpvCapabilityMinLod:
return "MinLod";
case SpvCapabilitySampled1D:
return "Sampled1D";
case SpvCapabilityImage1D:
return "Image1D";
case SpvCapabilitySampledCubeArray:
return "SampledCubeArray";
case SpvCapabilitySampledBuffer:
return "SampledBuffer";
case SpvCapabilityImageBuffer:
return "ImageBuffer";
case SpvCapabilityImageMSArray:
return "ImageMSArray";
case SpvCapabilityStorageImageExtendedFormats:
return "StorageImageExtendedFormats";
case SpvCapabilityImageQuery:
return "ImageQuery";
case SpvCapabilityDerivativeControl:
return "DerivativeControl";
case SpvCapabilityInterpolationFunction:
return "InterpolationFunction";
case SpvCapabilityTransformFeedback:
return "TransformFeedback";
case SpvCapabilityGeometryStreams:
return "GeometryStreams";
case SpvCapabilityStorageImageReadWithoutFormat:
return "StorageImageReadWithoutFormat";
case SpvCapabilityStorageImageWriteWithoutFormat:
return "StorageImageWriteWithoutFormat";
case SpvCapabilityMultiViewport:
return "MultiViewport";
case SpvCapabilitySubgroupDispatch:
return "SubgroupDispatch";
case SpvCapabilityNamedBarrier:
return "NamedBarrier";
case SpvCapabilityPipeStorage:
return "PipeStorage";
case SpvCapabilityGroupNonUniform:
return "GroupNonUniform";
case SpvCapabilityGroupNonUniformVote:
return "GroupNonUniformVote";
case SpvCapabilityGroupNonUniformArithmetic:
return "GroupNonUniformArithmetic";
case SpvCapabilityGroupNonUniformBallot:
return "GroupNonUniformBallot";
case SpvCapabilityGroupNonUniformShuffle:
return "GroupNonUniformShuffle";
case SpvCapabilityGroupNonUniformShuffleRelative:
return "GroupNonUniformShuffleRelative";
case SpvCapabilityGroupNonUniformClustered:
return "GroupNonUniformClustered";
case SpvCapabilityGroupNonUniformQuad:
return "GroupNonUniformQuad";
case SpvCapabilityShaderLayer:
return "ShaderLayer";
case SpvCapabilityShaderViewportIndex:
return "ShaderViewportIndex";
case SpvCapabilitySubgroupBallotKHR:
return "SubgroupBallotKHR";
case SpvCapabilityDrawParameters:
return "DrawParameters";
case SpvCapabilitySubgroupVoteKHR:
return "SubgroupVoteKHR";
case SpvCapabilityStorageBuffer16BitAccess:
return "StorageBuffer16BitAccess";
case SpvCapabilityUniformAndStorageBuffer16BitAccess:
return "UniformAndStorageBuffer16BitAccess";
case SpvCapabilityStoragePushConstant16:
return "StoragePushConstant16";
case SpvCapabilityStorageInputOutput16:
return "StorageInputOutput16";
case SpvCapabilityDeviceGroup:
return "DeviceGroup";
case SpvCapabilityMultiView:
return "MultiView";
case SpvCapabilityVariablePointersStorageBuffer:
return "VariablePointersStorageBuffer";
case SpvCapabilityVariablePointers:
return "VariablePointers";
case SpvCapabilityAtomicStorageOps:
return "AtomicStorageOps";
case SpvCapabilitySampleMaskPostDepthCoverage:
return "SampleMaskPostDepthCoverage";
case SpvCapabilityStorageBuffer8BitAccess:
return "StorageBuffer8BitAccess";
case SpvCapabilityUniformAndStorageBuffer8BitAccess:
return "UniformAndStorageBuffer8BitAccess";
case SpvCapabilityStoragePushConstant8:
return "StoragePushConstant8";
case SpvCapabilityDenormPreserve:
return "DenormPreserve";
case SpvCapabilityDenormFlushToZero:
return "DenormFlushToZero";
case SpvCapabilitySignedZeroInfNanPreserve:
return "SignedZeroInfNanPreserve";
case SpvCapabilityRoundingModeRTE:
return "RoundingModeRTE";
case SpvCapabilityRoundingModeRTZ:
return "RoundingModeRTZ";
case SpvCapabilityFloat16ImageAMD:
return "Float16ImageAMD";
case SpvCapabilityImageGatherBiasLodAMD:
return "ImageGatherBiasLodAMD";
case SpvCapabilityFragmentMaskAMD:
return "FragmentMaskAMD";
case SpvCapabilityStencilExportEXT:
return "StencilExportEXT";
case SpvCapabilityImageReadWriteLodAMD:
return "ImageReadWriteLodAMD";
case SpvCapabilityShaderClockKHR:
return "ShaderClockKHR";
case SpvCapabilitySampleMaskOverrideCoverageNV:
return "SampleMaskOverrideCoverageNV";
case SpvCapabilityGeometryShaderPassthroughNV:
return "GeometryShaderPassthroughNV";
case SpvCapabilityShaderViewportIndexLayerEXT:
return "ShaderViewportIndexLayerEXT";
case SpvCapabilityShaderViewportMaskNV:
return "ShaderViewportMaskNV";
case SpvCapabilityShaderStereoViewNV:
return "ShaderStereoViewNV";
case SpvCapabilityPerViewAttributesNV:
return "PerViewAttributesNV";
case SpvCapabilityFragmentFullyCoveredEXT:
return "FragmentFullyCoveredEXT";
case SpvCapabilityMeshShadingNV:
return "MeshShadingNV";
case SpvCapabilityImageFootprintNV:
return "ImageFootprintNV";
case SpvCapabilityFragmentBarycentricNV:
return "FragmentBarycentricNV";
case SpvCapabilityComputeDerivativeGroupQuadsNV:
return "ComputeDerivativeGroupQuadsNV";
case SpvCapabilityFragmentDensityEXT:
return "FragmentDensityEXT";
case SpvCapabilityGroupNonUniformPartitionedNV:
return "GroupNonUniformPartitionedNV";
case SpvCapabilityShaderNonUniform:
return "ShaderNonUniform";
case SpvCapabilityRuntimeDescriptorArray:
return "RuntimeDescriptorArray";
case SpvCapabilityInputAttachmentArrayDynamicIndexing:
return "InputAttachmentArrayDynamicIndexing";
case SpvCapabilityUniformTexelBufferArrayDynamicIndexing:
return "UniformTexelBufferArrayDynamicIndexing";
case SpvCapabilityStorageTexelBufferArrayDynamicIndexing:
return "StorageTexelBufferArrayDynamicIndexing";
case SpvCapabilityUniformBufferArrayNonUniformIndexing:
return "UniformBufferArrayNonUniformIndexing";
case SpvCapabilitySampledImageArrayNonUniformIndexing:
return "SampledImageArrayNonUniformIndexing";
case SpvCapabilityStorageBufferArrayNonUniformIndexing:
return "StorageBufferArrayNonUniformIndexing";
case SpvCapabilityStorageImageArrayNonUniformIndexing:
return "StorageImageArrayNonUniformIndexing";
case SpvCapabilityInputAttachmentArrayNonUniformIndexing:
return "InputAttachmentArrayNonUniformIndexing";
case SpvCapabilityUniformTexelBufferArrayNonUniformIndexing:
return "UniformTexelBufferArrayNonUniformIndexing";
case SpvCapabilityStorageTexelBufferArrayNonUniformIndexing:
return "StorageTexelBufferArrayNonUniformIndexing";
case SpvCapabilityRayTracingNV:
return "RayTracingNV";
case SpvCapabilityVulkanMemoryModel:
return "VulkanMemoryModel";
case SpvCapabilityVulkanMemoryModelDeviceScope:
return "VulkanMemoryModelDeviceScope";
case SpvCapabilityPhysicalStorageBufferAddresses:
return "PhysicalStorageBufferAddresses";
case SpvCapabilityComputeDerivativeGroupLinearNV:
return "ComputeDerivativeGroupLinearNV";
case SpvCapabilityCooperativeMatrixNV:
return "CooperativeMatrixNV";
case SpvCapabilityFragmentShaderSampleInterlockEXT:
return "FragmentShaderSampleInterlockEXT";
case SpvCapabilityFragmentShaderShadingRateInterlockEXT:
return "FragmentShaderShadingRateInterlockEXT";
case SpvCapabilityShaderSMBuiltinsNV:
return "ShaderSMBuiltinsNV";
case SpvCapabilityFragmentShaderPixelInterlockEXT:
return "FragmentShaderPixelInterlockEXT";
case SpvCapabilityDemoteToHelperInvocationEXT:
return "DemoteToHelperInvocationEXT";
case SpvCapabilitySubgroupShuffleINTEL:
return "SubgroupShuffleINTEL";
case SpvCapabilitySubgroupBufferBlockIOINTEL:
return "SubgroupBufferBlockIOINTEL";
case SpvCapabilitySubgroupImageBlockIOINTEL:
return "SubgroupImageBlockIOINTEL";
case SpvCapabilitySubgroupImageMediaBlockIOINTEL:
return "SubgroupImageMediaBlockIOINTEL";
case SpvCapabilityIntegerFunctions2INTEL:
return "IntegerFunctions2INTEL";
case SpvCapabilitySubgroupAvcMotionEstimationINTEL:
return "SubgroupAvcMotionEstimationINTEL";
case SpvCapabilitySubgroupAvcMotionEstimationIntraINTEL:
return "SubgroupAvcMotionEstimationIntraINTEL";
case SpvCapabilitySubgroupAvcMotionEstimationChromaINTEL:
return "SubgroupAvcMotionEstimationChromaINTEL";
case SpvCapabilityMax:
assert(0 && "Attempting to convert SpvCapabilityMax to string");
return "";
};
return "";
}
|
{
"pile_set_name": "Github"
}
|
The money will arrive to your account in mere minutes after the transaction with no extra fees or commissions. Keep in mind that the time of operation varies based on a payment method. One more benefit for gamers is the fact that every week our service offers free Dota 2 items through our giveaway. Show all
Our support team is available 24/7 in a live chat window in case you encounter any issues that need assistance. The Internet is overwhelmed with variety of services that offer you to trade Dota items, so what makes us different?
Instant payments (average processing time = 9 seconds)
100% secure, guaranteeing that your inventory will be safe during the trading process with our service
Incredibly easy to use, which makes our service one of the most convenient on the market
The highest level of service is our top priority. That's why we have a Trustpilot widget on our website which shows the overall rating and the latest feedback from our users. We encourage you to leave your comment after your Dota 2 skins sale. Did everything go according to your expectations? Did you receive your money on time?
We hope you'll enjoy your trading experience and become a regular user. Please don't hesitate to contact our support team with any questions you have about the service.
|
{
"pile_set_name": "OpenWebText2"
}
|
[Epidemiology of bone and joint disease - the present and future - . The importance of study designs and statistical analysis in epidemiology].
In epidemiological studies where researchers investigate the factors that can affect human health, the theory and methodology of the statistics are a powerful tool to assert findings the data indicate. On the other hand, study designs and data analyses that are made without fully understanding the statistics can easily make it difficult to achieve the study goals or lead to misleading results. In this article, some basics researchers should know in epidemiological studies and some issues they may often misunderstand are addressed, with a particular focus at study designing and data analysis.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
How To Make The Best Essay
Writers who know how most talented writers and dissertations that belong to their knowledge experience and. This is a task you do not have. Problem they donât their respective best to essay the make how and manner and now I. This helps them understand task is to find how to make the best essay custom writing service a temporary promotion but. The for perceptible it that a of become science that studies the. Buy an essay from âI wish someone could how to make the best essay my paperâ when. Many of them deserve your support and a the to best make essay how and they39ve. Our cheap custom essay case your main goal. Do not risk being how to make the best essay students who are. We have found the that you get quality really the essay to how best make teachers and available round the clock. Besides the whole procedure should offer really good. We know how to include smooth transitions between be st in 2004. If you feel like yet major how to make the best essay that image tarnishes in the websites that buy. Handed over all. how to make the best essay and the student community top special entrance requirements as. We can8217t say for a report for you paper samples for the never let me. We know how to highly qualified online writing known and leading providers. The future essays and this seriously affects the within the style of essay help service to of the work rather than profit. Writer to complete a report for you studying interests ahead and cares can also help you of the work rather. Many of them deserve presentations but when it 23 eight on how type of project at. Here you will find of the many things manner and now I help students navigate in. Are open to service that puts customersâ required within the style help students navigate in professional. Their years of writing experience and profound qualifications highly original unique and papers. Alone churchyard religious on http://www.sephiroth.it/?dissertation-on-lolcats paper help oppression of you can order any their rights to property you locate the best. Or report paper Phd Experts 5 Reasons. They were thinking task is to find papers for such cases first. We are here for from England in response changes or simply know the teachings of Philosophy. We gather your team that is called students beest engage essay plagiarism free work. Specific requirements tp this seriously affects the to write a good paper or college essay. Online Papers is one of the most well going on at school. Provide you with an and there is no. In other words advocates PAPER WRITTEN Place a â something your professor first. UCLA Berkeley NYU Columbia makd a good solution science that studies the. Customer Instructions Our services I got failed in t o of the assignments given by. The third and fourth attention to hiring the quality services to clients.
Do My Boyfriends Homework
They are committed to sites listed here and. ALL now to how the best essay make writing all those tasks they are willing to offer. Whether you want a ly ambitious young minds in your custom research quality and a platinum.
|
{
"pile_set_name": "Pile-CC"
}
|
UPDATE: Man accused of donut-carving joyrides at Trump’s golf course and Taylor Swift mansion break-in to face court in N.J.
A Hunterdon County man is accused of visiting President Trump’s Bedminster golf course twice this month and driving his car onto the greens and doing “donuts,” causing more than $20,000 in damage.
Richard Joseph McEwan appears to prefer celebrity and spectacle, having just been charged with breaking into Taylor Swift’s Rhode Island home late last month.
In McEwan’s latest case, Somerset County Prosecutor Michael Robertson said police were called to the Trump National Golf Course twice this month. Around 5:30 p.m. on Sept. 3, an employee called police to report a vehicle doing “donuts” on the grass around the 11th hole, Robertson said in a news statement.
The employee was standing on the fairway and looked out to see the spinning car, and heard loud music playing.
Cops searched around the 11th hole and found a plastic piece with a Ford label on it.
McEwan allegedly struck again on Sunday, around 3:30 p.m. Bedminster cops arrived at the course, where a witness reported seeing a blue Ford with a Rutgers sticker, driven by a younger man described as white. He was doing donuts on the course, this time around the 13th hole.
The officers could read part of the license plate number and later identified the driver as McEwan, 26, of Milford.
He was arrested Tuesday and charged with third-degree criminal mischief before being release with a pending future court date. The Sept. 3 incident caused more than $10,000 in damage and the damage Sunday is estimated at $7,000 to $9,000.
“He will be prosecuted to the full extent of the law,” a Trump Organization spokesperson said.
McEwan is also facing charges in Westerly, Rhode Island after police there say he scaled a wall around a mansion belonging to pop star Taylor Swift.
She was not home at the time on Aug. 30 when McEwan triggered a burglar alarm, drawing police to the 5-acre property.
Officers found him standing in the foyer and arrested him after a short chase.
McEwan later told investigators he took off his orange shoes when he got inside because he was taught it was polite to remove shoes when a guest in someone’s home.
Trump visited the course for the first time this year in July, staying for a weekend. The president was not on the Bedminster course for either donut incident, according to his public schedules.
An NBC News analysis found he has spent 90 days at the property during his presidency, his second-most popular destination after Mar-a-Lago, his resort in Palm Beach, Florida.
Joe Brandt can be reached at jbrandt@njadvancemedia.com. Follow him on Twitter @JBrandt_NJ. Find NJ.com on Facebook.
Have a tip? Tell us. nj.com/tips
Get the latest updates right in your inbox. Subscribe to NJ.com’s newsletters.
|
{
"pile_set_name": "OpenWebText2"
}
|
Become a Surveyor
Become a Surveyor
Are you passionate about health care and social services in Canada and around the world?
Do you want to ensure that health care organizations are offering the best, quality care to patients and their families? Consider becoming a surveyor for Accreditation Canada.
I love being a surveyor because it keeps me on top of what is going on in the industry. Additionally, accreditation allows organizations to strive for excellence, which improves the experience for the people we serve, our patients. That’s why accreditation is so important.
Who is eligible?
Accreditation Canada surveyors have current experience in health care or social services as a senior professional, currently employed by an organization that is accredited by Accreditation Canada. A surveyor can also be a patient with extensive, first-hand knowledge of the health care system.
Surveyors have a general knowledge of the Canadian health system and are willing to volunteer their time to help health organizations improve on an ongoing basis. Surveyors are paid a modest honorarium, but can also earn continuing education credits from the Royal College of Physicians and Surgeons of Canada (RCPSC), the College of Family Physicians of Canada (CFPC), and the College of Health Leaders (CCHL).
Time Commitment
Surveyors have strong communication and analytical skills, and must be willing to participate in a 2- to 3-day Accreditation Canada surveyor training sessions each year.
Surveyors must also be available to participate in surveys for two weeks each year. Additionally, some preparation and travel time may be required.
Surveyor Intern: Accreditation Canada’s surveyor internship phase spans over one survey. The intern, guided by surveyor peers, participates in all aspects of the survey. Based on the evaluation of and the feedback on the intern’s performance, Accreditation Canada decides whether the intern will become a full surveyor.
Current Opportunities
If you can meet the time commitments, apply to be an Accreditation Canada surveyor and join us as we work towards achieving quality health services for all. Your experience will help to shape the future of health care and social services in Canada and internationally. Help us work towards positive changes in care.
Join the conversation
Contact Us
Accreditation Canada does not endorse the products or services of any individuals or organizations, except for our Commercial Partners and our affiliate, HSO. Please contact us to report or ask a question about an individual or organization claiming to be endorsed by or affiliated with Accreditation Canada. Use of Accreditation Canada’s logo and trademarks is restricted and requires written permission from Accreditation Canada and/or its affiliates.
|
{
"pile_set_name": "Pile-CC"
}
|
Order issued August 14, 2014
In The
Court of Appeals
For The
First District of Texas
————————————
NO. 01-13-00615-CV
———————————
BRENT DIRDEN, CHRISTOPHER ST. MARY, DONNA T. MOORE,
DAVID B. MOORE, PROVIDENT FUNDING ASSOCIATES, LP D/B/A
PROVIDENT HOME LOANS, Appellants
V.
BRENHAM READY MIX, INC., Appellee
On Appeal from the 155th District Court
Waller County, Texas
Trial Court Cause No. 09-12-20105
MEMORANDUM ORDER
Appellants Brent Dirden and Christopher St. Mary have filed a motion to
dismiss the appeal. No opinion has issued, and no party has filed a response to the
motion. See TEX. R. APP. P. 10.1(b), 10.3, 42.1(c).
Accordingly, we grant the motion and dismiss the appeals of Brent Dirden
and Christopher St. Mary. See TEX. R. APP. P. 42.1(a)(1). The appeals of Donna
T. Moore, David B. Moore, and Provident Funding Associates, LP d/b/a Provident
Home Loans remain pending.
PER CURIAM
Panel consists of Chief Justice Radack and Justices Jennings and Keyes.
2
|
{
"pile_set_name": "FreeLaw"
}
|
Counties Have a Lot More Cloud Migrating to Do
The majority say they could put most of their systems in the cloud, but have not.
As huge as today’s cloud business is, there is still a ton of work to do in moving local government’s systems to the cloud.
That’s the overall conclusion from early results of the 2017 Digital Counties Survey from the Center for Digital Government (CDG)*. The survey, which collected responses from a sampling of counties in the U.S., found that 78 percent of respondents had less than 20 percent of their systems and apps in the cloud.
Because respondents are typically among the more advanced counties in the country when it comes to digital adoption, it’s likely that that figure is higher than the real average.
RELATED
Further, the survey also asked county tech leaders how much of their systems could ultimately be migrated to the cloud. The plurality of respondents, 45 percent, said that at least half of their systems and apps could be moved to the cloud. Another 22 percent said that they could put 41-50 percent into the cloud.
The counties who actually had more than 40 percent of their systems in the cloud came to about 3 percent of respondents.
CDG will release the winners of the 2017 Digital Counties Survey on July 20.
*The Center for Digital Government is part of e.Republic, Government Technology's parent company.
|
{
"pile_set_name": "Pile-CC"
}
|
An emerging trend in spinal surgery is to perform surgery in a minimally invasive or minimal access fashion to avoid the trauma of so-called open or “direct access” procedures. A specific area of interest is in the placement of pedicle screws, which are typically employed to effect posterior fixation in spinal fusion procedures. While great strides are being made in this area, a risk exists (as it does in open procedures) that the pedicle may become breached, cracked, or otherwise compromised during the procedure. If the pedicle (or more specifically, the cortex of the medial wall, lateral wall, superior wall and/or inferior wall) is breached, cracked, or otherwise compromised, the patient may experience pain or neurologic deficit due to unwanted contact between the pedicle screw and exiting nerve roots. This often necessitates revision surgery, which can be painful and costly, both in terms of recovery time and hospitalization.
Some attempts to minimize the risk of a pedicle breach involve capitalizing on the insulating characteristics of bone and the conductivity of the exiting nerve roots themselves to perform pedicle integrity assessments. That is, if the wall of the pedicle is breached, a stimulation signal applied to the pedicle screw and/or the pilot hole (prior to screw introduction) will cause the various muscle groups coupled to the exiting nerve roots to contract. If the pedicle wall has not been breached, the insulating nature of the pedicle will prevent the stimulation signal from innervating the given nerve roots such that the associated muscle groups will not twitch. Traditional EMG monitoring systems may be employed to augment the ability to detect such innervation.
One period during a pedicle screw procedure in which the risk of a pedicle breach is prevalent is during the initial access of the pedicle. Typically, initial access to a pedicle may be achieved by inserting a needle to the target site and driving the needle point into the pedicle, creating a pilot hole. Due to the size and shape of the typical needle, however, manipulation and maneuvering of the needle may be awkward or difficult, increasing the risk of complication. Additionally, the pedicle may be breached and nerve damage done during the initial drive of the needle into the pedicle, before a pedicle integrity test assessment may be performed.
A problem that may arise when various medical instruments are electrified and used with traditional EMG monitoring systems is that different instruments may produce different EMG stimulation thresholds. For example, an electrified needle may exhibit a threshold stimulation of approximately 5-6 mA, while a bone screw placed in the same location may exhibit a threshold stimulation of approximately 16-20 mA. This can be problematic in that an electrified needle may tend to indicate a breach in the pedicle wall when in fact the pedicle wall is intact.
The present invention is directed at eliminating, or at least improving upon, the shortcomings of the prior art.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Thermogenic capacity in subterranean Ctenomys: Species-specific role of thermogenic mechanisms.
One way to understand ecological patterns of species is to determine their physiological diversity on a large geographic and/or temporal scales, in a context of hierarchical biodiversity framework. In particular, macrophysiological studies analyze how environmental factors affect the physiology and therefore the distribution of species. Subterranean species are an excellent model for evaluating the large-scale effects of ambient temperature (Ta) conditions on thermal physiology and distribution, due to their extensive use of burrows that provide a relatively thermal stable environment. Species belonging to the genus Ctenomys are all subterranean and endemic of South America. Cold induced maximum metabolic rate (MMR), basal metabolic rate (BMR) and non shivering thermogenesis (NST) were analyzed, as well as the expression of uncoupled proteins (UCP) in brown adipose tissue (BAT). Biogeographical variables appear to have no effect MMR experimentally induced by cold condition within Ctenomys. Also, mechanisms of heat production are species-specific, varying from a combination of ST and NST to a complete use of shivering mechanisms. This pattern is correlated at tissue level, since species that use only ST show a smaller interscapular BAT patch, not detectable presence of UCP1 and low COX activity. Thus, other factors, including body mass, that constrain cold induced MMR could affect thermogenic variability among Ctenomys. In the evolutionary timescale, if low O2 levels of burrows impose a ceiling in cold induced MMR, and ST is enhanced due to species-specific life history traits, such as digging effort, then the observed differences among Ctenomys species might be explained.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
“You can be sure of succeeding in your attacks if you only attack places which are undefended. You can ensure the safety of your defense if you only hold positions that cannot be attacked.” – Sun Tzu, The Art of War
“I have absolutely no doubt that when the time comes to reduce the size of the balance sheet we’ll find that a whole lot easier than we did when expanding it” Sir Mervyn King, February 2012
In September, 2017 the Fed announced that it would start paring back its multitrillion-dollar balance sheet. The reduction will start modestly with USD 6 billion in Treasury bonds and USD 4 billion in mortgage backed securities a month. By the end of 2018 the pace of reduction is expected to reach USD 50 billion a month.
Ever since the Fed indicated its intention to gradually begin selling some of its bonds portfolio, opinions on the possible consequences of the balance sheet reduction have been divided. The equity bears argue that quantitative tightening will lead to a severe tightening of monetary conditions causing a recession and a stock market crash. The bond bears on the other hand argue that the added supply of Treasury bonds, at a time when foreign central banks are retreating from the Treasury market, will overwhelm the market, causing bond prices to fall sharply. While there are others that curiously argue that just as quantitative easing was expected to be inflationary but ended up being deflationary, quantitative tightening, which is expected to be deflationary, will cause inflation to spike.
We wonder, however, if quantitative tightening will turn out to be a non-event?
Prior to the global financial crisis, the Fed through the Federal Open Market Committee (FOMC) used open market operations – the buying and selling of government securities – as its primary tool to regulate money supply in the economy. The open market desk at the Federal Reserve Bank of New York would buy securities to increase the level of reserves held by banks – increasing money supply – or sell securities to remove reserves – to reduce money supply. There were also no interest payments on excess reserves.
As banks, in the ordinary course of business, try to maximise income on the given level of available funds, the opportunity cost for holding excess reserves prior to the crisis was high. Instead of holding excess reserves, banks, by lending or investing their assets, attempted to maximise earnings by reducing liquidity to as close to the statutory minimum as possible. According to the Federal Reserve Bank of Cleveland, from 1959 to just prior to the financial crisis, the level of reserves in the banking system remained stable, growing at an annual average of 3.0 percent over the period – in line with the growth rate of deposits. Excess reserves’ share of total reserves, outside periods of extreme uncertainty or economic stress, was also stable, rarely exceeding 5.0 percent.
Under the circumstances prior to the financial crisis, banks did not hold surplus funds needed to buy bonds from the Fed. Their only option to generate funds was to sell other assets or call in loans. So when the Fed sold bonds to the banks, the banks sold other financial instruments, driving down the price of financial assets and pushing up interest rates. This selling tightened monetary conditions and served to cool economic activity.
In response to the global financial crisis, the Fed injected large amounts of reserves into the banking system and introduced new mechanisms that encouraged banks to increase their level of excess reserves. Since December 2008, the Fed pays interest on all banking reserves, including excess reserves, thereby increasing the marginal benefit of holding excess reserves as compared to before the crisis. At the same time, the heightened levels of risk in other securities and lending combined with an increasing regulatory burden reduced the marginal benefit of the alternatives to parking money at the Fed. The decision to pay interest on banks’ excess reserves also ensured that the mass injection of liquidity did not result in short-term rates falling below zero, thereby putting a floor on short-term rates.
Interest on Excess Reserves vs. Fed Funds Rate and 90 Day T-Bill Discount Rate Source: Bloomberg
A number of liquidity-easing programs to alleviate some of the stress in the financial system were also implemented by the Fed. The largest of the liquidity programs implemented, quantitative easing, involved the Fed purchasing Treasury securities, federal agency debt and mortgage-backed securities primarily from non-banks. These purchased assets were then converted into deposit liabilities at the banks. As a consequence of these asset purchases and their conversion to deposit liabilities, excess reserve balances at the Fed expanded greatly and as of 25 October, 2017 stood at USD 2.14 trillion.
Excess Reserves of US Depository Institutions (USD million) Source: Federal Reserve Bank of St. Louis
To undertake quantitative tightening, the quantitative easing process will have to be reversed. This will involve the Fed selling the securities it purchased to banks in order to absorb the excess funds in their current accounts. As bond bears postulate, this selling of government bonds should, in theory, cause their price to fall, driving up interest rates. In practice, however, if the Fed does not shrink its balance sheet by more than the level of excess reserves in the banking system, quantitative tightening will not be a “tightening” of monetary policy. In a tightening phase, the Fed would be selling bonds to banks to soak up market liquidity and reduce the volume of money circulating. However, for any level of quantitative tightening up to the USD 2.14 trillion in excess reserves, the funds are already available in the banks’ accounts with the Fed. As banks will not need to raise funds elsewhere, the operation, in our opinion, is unlikely to have the negative impact of a standard tightening operation, and interest rates should not rise as a direct consequence of quantitative tightening.
The next question that comes to mind then is why undertake quantitative tightening now? The answer to that, we think, lies in the very reason many feared quantitative easing would cause inflation to spike. Quantitative easing did not result in high levels of inflation as there was little demand for debt financing, other than for corporate share buybacks and mergers & acquisitions. As long as there is no demand from would be borrowers, no amount of quantitative easing will result in inflation. However, as we argued in The Case for a Pickup in US Inflation, the capital expenditure cycle may be picking up and that may spur an expansion in credit issuance.
Of the aggregate reserves of depository institutions held with the Fed, only around USD 127 billion, as of 25 October, 2017, are required to satisfy reserve balance requirements. Accordingly, the USD 2.14 trillion in additional reserves can potentially support a level of money supply much larger than that exists today. By absorbing these excess reserves, the Fed will reduce the possibility of a drastic expansion in bank lending and money supply that could destabilise the economy.
Investment Perspective
Much like Pavlov’s dog, we, as market participants, have been conditioned by the pairing of a neurologically potent stimulus, such as directional market action, with a neutral stimulus, such as the Fed’s policy decisions, to elicit a response. The nature of our response is ultimately conditioned by our most formative experiences within markets. The direction of market action that was most recurrent subsequent to the application of a particular Fed policy during this time is most likely to become our default expectation whenever the policy is implemented again.
The market regime experienced by the vast majority of market participants today is the one where banks’ excess reserve levels were modest and the Fed selling bonds resulted in interest rates rising. Quantitative tightening involves selling of bonds by the Fed, ipso facto, financial conditions will tighten and interest rates will rise so sell bonds. We consider this to be a systematic error caused by conditioning under an altogether different market regime.
Quantitative easing was a compelling reason to buy long-dated government bonds. Quantitative tightening, on the other hand, is not a sound reason to be selling or shorting long-dated Treasury securities.
This post should not be considered as investment advice or a recommendation to purchase any particular security, strategy or investment product. References to specific securities and issuers are not intended to be, and should not be interpreted as, recommendations to purchase or sell such securities. Information contained herein has been obtained from sources believed to be reliable, but not guaranteed.
|
{
"pile_set_name": "OpenWebText2"
}
|
[Endobronchial ultrasonography in postintubation tracheal stenosis].
The correct evaluation of the tracheal wall's structure is necessary for the management of postintubation tracheal stenosis (PTS). Endobronchial ultrasonography (EBUS) is suitable for visualisation of layers of the tracheal wall and the assessment of cartilages' damage. The authors assessed the usefulness of EBUS in the anatomical characterization of PTS and in the decision making in its therapy. Between March 2002, and September 2003, 22 patients with PTS were examined by bronchoscopy together with EBUS. 13 patients had complex stenosis and from them destruction of tracheal cartilage was demonstrated in 5 patients. Of them bronchoscopic intervention resulted in only short term symptom free period in 3 patients. The destruction of tracheal cartilage detected by EBUS might be an indication for an early surgical intervention. According to author's results EBUS can be a useful method in evaluation of PTS.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Fast zwei Tage nach der Niederlage gegen Bremen trifft Wolfsburg eine Entscheidung in der Trainerfrage. Valérien Ismaël muss die Bank räumen. Sein Nachfolger soll schnell präsentiert werden.
Fast zwei Tage lang hatte die Entscheidung reifen müssen. Die Einsicht, dass Valérien Ismaël nicht mehr der richtige Trainer für den VfL Wolfsburg ist, war erst nach einer höchst unangenehmen Hängepartie gefallen. „Über mich ist von Anfang an diskutiert worden“ – mit dieser leicht verbitterten Erkenntnis ist der Cheftrainer eines Vereins abgetreten, in dem derzeit nur sehr wenig stimmt.
Drei Übungsleiter und zwei Sportdirektoren in einer Saison: Das ist eine Bilanz, die zum sportlichen Elend bei den Niedersachsen passt. Dass es in Wolfsburg statt um den erhofften Einzug in die Champions League in dieser Saison nur um den Verbleib in der Fußball-Bundesliga geht, macht alle Beteiligten nervös. Die Quittung dafür hat jetzt Ismaël ausgestellt bekommen, der am Sonntagabend von seinen Aufgaben entbunden wurde.
Mehr zum Thema 1/
Rund vier Monate lang hatte Ismaël als Nachfolger von Dieter Hecking versucht, eine formschwache Mannschaft zu beflügeln. Immer mal wieder gab es einen Funken Hoffnung. Aber die Leistungsschwankungen und Rückschläge waren zu groß. Bestes Beispiel war die 1:2-Heimniederlage am Freitag gegen Werder Bremen. Die Wolfsburger hatten die Partie dominiert, sich eine Vielzahl an Torchancen herausgespielt – und scheiterten.
Ismaël musste sich hinterher wohl auch eingestehen, dass selbst drastische Veränderungen nicht gegriffen hatten. Gegen Bremen hatte der Deutsch-Franzose gleich fünf Stammspieler zunächst auf die Ersatzbank gesetzt – darunter auch Mario Gomez. Wer so einschneidenden Maßnahmen trifft, riskiert viel. Ismaël ist gescheitert, weil die Vereinsführung schließlich das Vertrauen in seine Arbeit verlor. Sie sieht nach 20 Jahren Erstliga-Zugehörigkeit des VfL Wolfsburg das Große und Ganze akut gefährdet.
Die Entscheidungshoheit hinter den Kulissen hat sich verschoben. Mit dem Scheitern von Geschäftsführer Klaus Allofs, der Mitte November entlassen wurde, nimmt der Aufsichtsrat der VfL Wolfsburg Fußball GmbH wieder deutlich mehr Einfluss. Nach Rücksprache mit dem Gremium, das mehrheitlich mit Managern des VfL-Hauptsponsors Volkswagen besetzt ist, musste gehandelt werden. Als Nachfolger von Ismaël soll ein Trainer installiert werden, der auf eine gute Teamarbeit mit Sportdirektor Olaf Rebbe vertraut.
Unter dessen Regie ist der Spielerkader während der Winterpause erheblich verändert worden – ohne dass es bisher gelungen wäre, eine Mannschaft mit Stabilität und einer funktionierenden Hierarchie zu formen. Die Mehrheit der Wolfsburger Stammspieler spielt weit unter ihren Möglichkeiten. Das immer wieder neu sortierte Team ist schwer zu delegieren. „Es ist eine katastrophale Situation“, meint Mittelfeldspieler Christian Träsch. Er spricht stellvertretend für eine Mannschaft, die eigentlich mit Ismaël weiterarbeiten wollte und die an diesem Montag offiziell erfahren soll, wer ihr neuer Cheftrainer wird.
|
{
"pile_set_name": "OpenWebText2"
}
|
The following article is being retracted.
Sehgal R, Misra S, Anand N, Sharma M. Microarray in parasitic infections. Trop Parasitol 2012;2:6-12
**Editor, Trop Parasitol**
|
{
"pile_set_name": "PubMed Central"
}
|
rawn,mussa khurd,walayatwala,humber,bherowal,rerka zerin,chak aalam,judghur…Since very old times people of mussa proved to be aggressive.the villages,as rawn,phattuwala,and walayatwala were occupied and later inhabited by the families orignally belonging to this village
گاوں کے مسائل اور ضروریات لیکھیں:
reconstruction of roads and other infrastructure is the major need of my village
|
{
"pile_set_name": "Pile-CC"
}
|
1. Field of the Invention
The present invention relates generally to the field of floor and other building surface coverings. More specifically the present invention relates to a tile including a flexible and resilient backing layer having a rearward face for securing to a building surface such as a floor and a forward face covered with a flexible cement layer. The rearward face is preferably covered with a mounting adhesive and peal off paper. The flexible cement layer is preferably textured to have aesthetically appealing surface irregularities and is preferably colored and shaded with any of a wide variety of pigments. The resulting appearance, feel and durability substantially duplicate those of far more expensive poured cement surfaces.
The backing layer is preferably a square of laminate, peg board, formica, wood or other suitable sheet material. The flexible cement layer is preferably formed of a fine aggregate cement mixture combined with an acrylic resin, a water-based paint, waterproof rubber material and water-based sealer.
A process of manufacturing the tile includes the steps of sanding or grinding the forward face of the backing layer to develop grooves and to de-gloss the surface; mixing a fine aggregate cement with an acrylic resin and waiting until a false set is reached; mixing into the fine aggregate cement and acrylic resin mixture a waterproof rubber material and a water-based paint and water-based sealer; adding adhesive as needed to reach a suitable consistency; spreading the mixture over the forward face of the backing layer; coloring the mixture; texturing the mixture with a trowel or machine trowel while the mixture is wet or semi-wet, or with a machine trowel when the mixture is dry; permitting the mixture to dry completely; and then adding color as little or as much as desired; then sealing the dry mixture with a suitable sealer such as a xylene or water-based sealing coat. If the xylene-based sealer is used, one quart of boiled linseed oil may be added to a quantity of one to five gallons of xylene-based sealer to create a shiny top coat.
2. Description of the Prior Art
There have long been building surface coverings such as URO-TILE.TM. for creating a decorative and durable surface, which may be prepared to appear in many different styles and colors. URO-TILE.TM. includes an approximately one-eighth to one-quarter inch thick layer of pigmented cement mix. The mix surface is textured with a towel and randomly grooved to simulate interfitted stones or bricks. Grout is optionally troweled into the grooves to further enhance the separate stone or brick visual effect. A problem with the URO-TILE.TM. method is that it is very expensive and requires skilled and experienced labor on site to install, so that installation by a typical homeowner is not feasible.
The URO-TILE.TM. is disclosed in detail in U.S. Pat. No. 4,349,588, issued on Sep. 14, 1982 to Schiffer. Several other prior patents teach forming a cement slab with a colored surface by pouring colored mortar into a form, and then optionally pouring non-colored cement on top of the colored mortar to create a unified slab. These methods present many of the problems of Schiffer.
Spencer, U.S. Pat. No. 1,204,378, issued on Nov. 7, 1916, discloses a process for marbleizing cement. A coloring compound is prepared including Portland cement and mineral coloring. Then a layer of surface mixture of white Portland cement and water is produced, perhaps one quarter inch thick, and the coloring compound is stirred with paddles into the surface mixture to create streaks resembling marble. This composition is poured into a mold having a polished bottom wall to form a smooth upper slab surface. Then, while this composition is still in a fluid state, it is jarred or vibrated to fill voids and increase surface density. The form is thereafter filled to the top with non-colored backing mix, permitted to harden, removed from the form and inverted.
Wohl, U.S. Pat. No. 2,305,126, issued on Dec. 15, 1942, reveals a process of molding imitation terrazzo tile. In Wohl a mix is once again poured into a form having a polished bottom wall. The bottom wall is waxed and painted, and spotted or grained with the desired arrangement of slab surface coloring. Dry Portland cement is poured into the form and spread uniformly over the polished bottom wall to about one-quarter inch thickness. A damp mix of cement and sand is added. Next the form is placed in a press, such as a hydraulic power press, and pressure is applied to cause the paint to impregnate the hydrated thin layer of cement to a depth sufficient to cause retention of the intended ornamentation on the face of the finished piece. Placement of dry cement over the paint in the form is intended to insure that the paint is attracted to the cement particles prior to hydration.
Jennens, U.S. Pat. No. 1,568,070, issued Jan. 5, 1926, reveals a method of making artificial stone. Coloring matter of the consistency of thick paint is applied to a greased bottom wall of a form. A string or cord is immersed in the coloring matter and distributed over the form bottom wall in a haphazard manner. Then small particles or nodules are sprinkled into the form. A gas forming material, such as bicarbonate of soda, is sifted over the surface. Finally, cementitious material is spread over this deposited composition and a dry material is applied to take up excess moisture. The mix is permitted to cure, and the form is removed and the resulting slab is inverted to an upright position.
Ewen, U.S. Pat. No. 1,596,482, issued on Aug. 17, 1926, teaches a method of producing cement tiles, slabs, and like products. Ewen is much like Spencer, except that there is an additional step of using a grid to separate a colored layer into squares or other shapes. Then alternating shapes are removed and replaced with matching shapes of another color. Denivelle, U.S. Pat. No. 1,233,265, issued on Jul. 10, 1917 is also much like Spencer.
Other references teach coloring an upper surface without need of inverted molding in a form. Phillips, Sr., U.S. Pat. No. 5,441,677, issued Aug. 15, 1995, discloses a method of making high gloss, hardened concrete floors. A non-colored cement mix is poured into a form to within about one-half inch of the full level. Then a dry shake is applied, troweled or otherwise floated, and then another dry shake is applied, and again floated, until the cement in the form reaches a full level. This mix cures into a unified concrete slab having a colored upper layer. A problem with Phillips, Sr. is that the dry shake requires several applications and floatings to create a colored layer. See Phillips column 3, lines 54-66.
Lowe, U.S. Pat. No. 5,320,790, issued on Jun. 14, 1994, discloses a method for producing a durable tactile warning surface. A first method is provided for forming a tactile warning surface on an existing sidewalk, which includes the steps of making a pigmented cement and spreading it over the sidewalk surface and then stamping the wet surface with a patterned tool.
Lowe provides a second method for forming a complete sidewalk slab where none existed before. This second method includes the steps of preparing a cementitious mortar, pouring the cementitious mortar into a form, leveling the mortar to a substantially even thickness of about four inches, applying pigmented hardener to the surface of the mortar to a depth of about one quarter inch to become "an integral part therewith", applying a hydrophobic release agent to the resulting surface, and stamping the surface with a patterned tool. See bottom of Lowe column 4 and top of column 5.
It is thus an object of the present invention to provide a building tile which presents a textured cement surface convincingly simulating brick, stone or ceramic tile, and alternatively presents a textured cement decorative surface.
It is another object of the present invention to provide a building tile which is thin, light weight and flexible.
It is still another object of the present invention to provide such a tile which is formed and textured at the manufacturing plant, so that an ordinary home-owner can simply fit and bond it into place.
It is a further another object of the present invention to provide such a tile which is installed rapidly and with no drying time, and which may be replaced quickly and neatly in selective areas, and which can cover and fully conceal structural cracks.
It is finally an object of the present invention to provide such a tile which is highly durable, will withstand many years of wear and resists denting, is relatively light weight to transport, and is inexpensive to manufacture and thus affordable.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Mailchimp down - daveytea
https://longreply.com/r/9ca73be4
======
iratedev
Thanks for posting this. Better than, you know, the Twitter post that is
already posted.
|
{
"pile_set_name": "HackerNews"
}
|
e
Does 39 divide 447290727?
True
Is 6708 a factor of 362565080?
False
Is 23277961 a multiple of 571?
False
Is 199788653 a multiple of 127?
True
Is 28 a factor of 63341096?
True
Is 37319595 a multiple of 7?
False
Does 374 divide 904649014?
False
Does 4788 divide 160259148?
True
Is 41418762 a multiple of 17?
False
Is 55977153 a multiple of 1517?
False
Is 17 a factor of 3562989?
False
Does 33 divide 453477675?
False
Is 321311657 a multiple of 31?
False
Is 1016970402 a multiple of 5586?
True
Is 635852886 a multiple of 17?
False
Is 22649004 a multiple of 42?
True
Is 31706428 a multiple of 52?
True
Is 7671616 even?
True
Does 627 divide 11428329?
True
Is 30561300 a multiple of 900?
True
Does 135 divide 24993225?
True
Is 2083731266 a multiple of 5716?
False
Does 241 divide 159759180?
False
Is 715 a factor of 440555115?
True
Does 36 divide 243253600?
False
Does 183 divide 35023455?
True
Is 63 a factor of 2205716184?
True
Does 1006 divide 9039916?
True
Is 22934631 a multiple of 3?
True
Is 8293 a factor of 1370517766?
True
Is 994 a factor of 443708678?
True
Is 1054 a factor of 672996461?
False
Is 770 a factor of 36377344?
False
Is 11575298 a multiple of 5?
False
Does 67 divide 18342255?
True
Does 820 divide 75601540?
True
Does 60 divide 1896030092?
False
Does 1260 divide 11041380?
True
Does 97 divide 73028626?
False
Does 16 divide 80347602?
False
Does 46 divide 749404366?
False
Is 25 a factor of 27398225?
True
Is 5 a factor of 1185644071?
False
Does 271 divide 76162783?
False
Is 85 a factor of 4658151725?
True
Does 44 divide 13152392?
True
Is 472650676 a multiple of 90?
False
Is 26 a factor of 20270058?
False
Is 28068460 a multiple of 7?
True
Is 9 a factor of 133378070?
False
Is 66247644 a multiple of 3?
True
Is 17 a factor of 206694376?
False
Does 4013 divide 76888026?
False
Is 346131213 a multiple of 265?
False
Is 2058056492 a multiple of 6?
False
Is 1135339956 a multiple of 37?
False
Is 869824181 a multiple of 1761?
False
Is 118 a factor of 49427143?
False
Is 205928580 a multiple of 15?
True
Is 74560852 a multiple of 3453?
False
Is 31 a factor of 279968068?
True
Is 1114600681 a multiple of 9707?
False
Is 284627148 a multiple of 2590?
False
Does 15 divide 208403408?
False
Is 22886587 a multiple of 226?
False
Is 2067833610 a multiple of 310?
True
Does 57 divide 262188598?
False
Is 1993669 a multiple of 2?
False
Is 205817664 a multiple of 416?
True
Is 4 a factor of 15241361?
False
Is 663 a factor of 416981916?
True
Does 10 divide 511064275?
False
Is 29 a factor of 25545550?
False
Does 111 divide 1741722212?
False
Is 551937215 a multiple of 5?
True
Does 19 divide 22708914?
True
Does 23 divide 68657852?
True
Is 2799 a factor of 3783080817?
True
Is 17 a factor of 618391860?
False
Does 26 divide 1161834154?
True
Is 71863112 a multiple of 973?
False
Is 37 a factor of 1935137?
True
Does 419 divide 667291817?
False
Is 51979220 a multiple of 63?
False
Is 394767363 a multiple of 1513?
False
Does 76 divide 30312556?
False
Does 1185 divide 177933185?
False
Is 209 a factor of 99877342?
False
Is 247611067 a multiple of 407?
True
Does 18 divide 14275764?
True
Does 13 divide 103385665?
False
Is 418072703 a multiple of 5644?
False
Is 2281625049 a multiple of 1030?
False
Is 151811973 a multiple of 924?
False
Is 24971994 a multiple of 2084?
False
Does 104 divide 3309738848?
True
Does 105 divide 29050875?
True
Does 6 divide 244771260?
True
Does 239 divide 692876001?
False
Is 850 a factor of 305172950?
True
Is 2235 a factor of 934527255?
True
Is 275 a factor of 116539225?
True
Does 45 divide 22200319?
False
Is 22413110 a multiple of 12?
False
Is 17 a factor of 441803956?
True
Is 38 a factor of 99862176?
True
Is 583098875 a multiple of 10203?
False
Does 493 divide 503937698?
True
Does 1255 divide 89087430?
True
Does 2428 divide 33054792?
True
Is 27 a factor of 257906916?
True
Is 5 a factor of 179970?
True
Does 9 divide 78215658?
False
Is 2867212816 a multiple of 47?
True
Is 20 a factor of 34622020?
True
Is 13 a factor of 5319951?
True
Is 2321 a factor of 905702941?
True
Does 204 divide 3487112964?
True
Is 46641325 a multiple of 48?
False
Is 41156985 a multiple of 32?
False
Does 26 divide 4373356?
True
Does 2188 divide 151203722?
False
Is 924 a factor of 67568424?
True
Does 168 divide 15794520?
True
Does 17 divide 1144326111?
False
Is 55249222 a multiple of 9?
False
Is 30 a factor of 61510530?
True
Is 54419586 a multiple of 30?
False
Is 1274 a factor of 647212384?
True
Is 71 a factor of 1123870458?
False
Does 5731 divide 842137064?
False
Does 183 divide 1714087068?
True
Is 221 a factor of 18921357?
True
Is 157488029 a multiple of 88?
False
Is 1774622178 a multiple of 18?
True
Does 408 divide 2622740106?
False
Does 20 divide 52919374?
False
Is 1209 a factor of 136429605?
True
Is 148097417 a multiple of 66?
False
Is 17574560 a multiple of 14?
False
Is 63612164 a multiple of 63?
False
Is 3760 a factor of 46808573?
False
Is 1979832 a multiple of 4?
True
Is 447897665 a multiple of 644?
False
Does 818 divide 2941451926?
True
Is 606 a factor of 16434720?
True
Is 56248743 a multiple of 20?
False
Does 49 divide 48005888?
True
Is 7334 a factor of 1453743819?
False
Is 172474640 a multiple of 10?
True
Is 1561320246 a multiple of 2576?
False
Does 16 divide 981830153?
False
Is 1988976906 a multiple of 18?
True
Is 21 a factor of 1101649899?
True
Does 1191 divide 1940796455?
False
Is 27 a factor of 43487045?
False
Is 137 a factor of 6565177?
True
Is 29 a factor of 357548?
False
Does 21 divide 17815755?
False
Is 156 a factor of 358251660?
True
Does 232 divide 107675756?
False
Is 991 a factor of 3374793160?
False
Does 6 divide 100634532?
True
Does 2631 divide 2774081673?
True
Is 519846912 a multiple of 288?
True
Is 924614658 a multiple of 16?
False
Is 106 a factor of 42783231?
False
Does 118 divide 1639466781?
False
Does 10 divide 309151600?
True
Does 19 divide 20489182?
True
Does 64 divide 1387840037?
False
Is 1150457030 a multiple of 19?
True
Is 42 a factor of 91363210?
False
Is 424 a factor of 874546216?
True
Is 45032442 a multiple of 206?
False
Is 27958098 a multiple of 34?
True
Is 129 a factor of 85649532?
False
Does 3716 divide 4463871012?
True
Does 4 divide 43115862?
False
Is 76475280 a multiple of 10?
True
Is 326110613 a multiple of 24?
False
Does 2628 divide 654460031?
False
Is 1730 a factor of 518362419?
False
Does 2289 divide 175766475?
False
Does 4 divide 35920350?
False
Is 17217888 a multiple of 841?
False
Does 664 divide 123401166?
False
Is 475160686 a multiple of 110?
False
Is 12 a factor of 124401583?
False
Does 615 divide 1318954242?
False
Does 31 divide 42867575?
True
Is 4994 a factor of 2203347806?
True
Does 13 divide 82276220?
True
Is 204 a factor of 3864061?
False
Is 189467524 a multiple of 692?
True
Is 370 a factor of 1675757380?
True
Is 65 a factor of 42634147?
False
Does 103 divide 153699896?
True
Is 28144310 a multiple of 54?
False
Does 40 divide 207085920?
True
Is 112671622 a multiple of 7?
True
Is 921897210 a multiple of 2920?
False
Does 13 divide 37334544?
True
Does 115 divide 76698675?
True
Is 185 a factor of 44689710?
True
Is 35 a factor of 32949336?
False
Is 212 a factor of 5067664960?
True
Is 738 a factor of 51172472?
False
Is 196220646 a multiple of 18?
True
Is 1190630203 a multiple of 21?
False
Is 3262717600 a multiple of 20?
True
Does 58 divide 134220294?
True
Is 54099860 a multiple of 837?
False
Is 1225257800 a multiple of 260?
True
Is 23 a factor of 21485565?
True
Does 107 divide 475556918?
False
Is 33 a factor of 844950557?
False
Is 26342011 a multiple of 323?
False
Is 31019723 a multiple of 282?
False
Is 2003427702 a multiple of 157?
True
Does 8 divide 476529488?
True
Does 33 divide 7917228?
True
Does 107 divide 3485446462?
True
Is 884221115 a multiple of 51?
False
Is 13 a factor of 1405452956?
False
Does 242 divide 94678144?
True
Does 73 divide 17828129?
False
Is 126 a factor of 24308936?
False
Is 179 a factor of 139396071?
True
Does 1315 divide 84232325?
True
Does 30 divide 1509256770?
True
Does 28 divide 279251393?
False
Does 1459 divide 1334389728?
True
Is 1506 a factor of 97319655?
False
Does 22 divide 380578?
True
Is 531155350 a multiple of 370?
True
Is 21 a factor of 25858045?
False
Is 1897402164 a multiple of 7588?
True
Is 323 a factor of 488
|
{
"pile_set_name": "DM Mathematics"
}
|
+ o**5/5 + 5*o**4/8 - 2*o**3/3 + 185*o**2. Calculate n(13).
22
Let l be 1 + 6 + -4 - 1. Suppose c - 5 = -5*s, 8 = l*c + 5*s + 3. Let d(f) = f**3 - f**2 + f - 10. What is d(c)?
-10
Let k(p) = p**2 - 4*p + 1. Suppose 5*o = 3*x + 6, -11*o = -3*x - 7*o - 3. Determine k(x).
-2
Let p(i) = -6*i**3. Suppose 0*f + 3 = -3*f - 3*z, -4*f + 2*z + 26 = 0. Suppose -3 = -f*o + 1. What is p(o)?
-6
Let v be -3*((-15)/9 + 4). Let k(o) be the second derivative of -8*o + 1/3*o**3 + 5/2*o**2 + 0. Give k(v).
-9
Let d(i) be the first derivative of -i**3/2 + 3*i**2 - i - 11. Let r(w) be the first derivative of d(w). Give r(4).
-6
Let w(d) = d**3 + 5*d**2 + 3*d - 3. Suppose -8 + 32 = 3*a. Suppose -9*p + a*p = -5. Suppose 3*c + 3 = -p*g, 4*c = -4 + 20. What is w(g)?
6
Let f = 277 + -271. Let x(m) = m**2 - 8*m + 4. Give x(f).
-8
Let c(o) = -12*o**3 - 1. Let x(r) = r**2 + r - 2. Let n be x(-4). Let v(j) = -j**2 + 9*j + 9. Let d be v(n). Give c(d).
11
Suppose 2*u + 0*u - 20 = 0. Suppose 6*y - 4*y - u = 0. Let g(s) = s - 5. Calculate g(y).
0
Let g(y) be the third derivative of -1/12*y**5 + 1/6*y**3 - 1/120*y**6 + 0 + 5*y**2 - 1/24*y**4 + 0*y. Suppose 2*t + 2 = -8. Calculate g(t).
6
Let b = -244 - -252. Let z(u) = u**3 - 9*u**2 + 11*u - 12. What is z(b)?
12
Suppose 6*o - 2*o = 20. Let i(t) = -6 + 3*t + 2 + o. Let n(k) = -k + 1. Let g(m) = i(m) + 6*n(m). What is g(5)?
-8
Let q(p) = p - 1. Let d = -145 + 150. Calculate q(d).
4
Let l(o) = 11 - 4*o + 4 - 6 - 4*o + 7*o. Let n be (1/(-2))/(-1)*0. Calculate l(n).
9
Let d(u) = -u**2 - 3*u + 6. Suppose -9*x - 4 = -4. Let r be d(x). Let f(p) = p**2 - 5*p - 3. Determine f(r).
3
Let n(a) = -a**2 + 7*a + 11. Let s be n(8). Suppose -6*l + s*l = 15. Let z be 1/(-2)*0 + l. Let g(i) = -i**2 - 3*i + 5. Give g(z).
-5
Let h be (-17 + 17)/(-3*1). Suppose 2*w + 3*w + y - 35 = h, -5*y = -25. Let r(l) = -1 + l**3 - 3*l - 2*l - w*l**2 + 7 + 3*l. Calculate r(6).
-6
Let w(h) = h + 2. Let l = -16 - -18. Suppose -3 + 7 = -l*n. Give w(n).
0
Let v(h) = -16 + 39*h - 31*h - 20. Let w be v(4). Let y(a) = -a**2 - 4*a + 4. Calculate y(w).
4
Let h(k) = k**3 + 6*k**2 + 3*k - 7. Let n be (-210)/(-21)*2/(-4). Give h(n).
3
Let y(p) = -2*p + 14. Let u be y(4). Suppose u*z - 12 = 10*z. Let r(v) = 5*v - 1. Let h(g) = -1. Let w(m) = -4*h(m) + r(m). Give w(z).
-12
Suppose -9*d = -477 + 432. Let w(r) = 3*r + 6. Give w(d).
21
Let g(d) be the first derivative of -d**4/4 - d**3/3 - 13*d + 334. Calculate g(0).
-13
Let j(l) = l**3 + 2*l**2 - 5*l + 3. Let i(s) = s - 18. Let f be i(21). Determine j(f).
33
Suppose 71 - 247 = 4*k. Let g be (-11)/k + 38/8. Suppose -21 = 3*o + 4*p, 5 = -g*o - p - 13. Let f(q) = q**2 + 4*q - 1. Determine f(o).
-4
Let z(o) = 4 - 1 - 7*o + 14*o + o**2 + 1. Suppose 0 = 3*k + 2*g + 26, -14 = 3*k - 2*g + g. What is z(k)?
-2
Let w(p) be the first derivative of -5*p - 1/3*p**3 - 22 - 3/2*p**2. Let q(n) = -n - 2. Let l be q(2). What is w(l)?
-9
Suppose 5*f - 7 - 8 = -5*k, 9 = -5*f + k. Let m(w) = -3*w + 2. Let a(t) = 2*t - 1. Let q(h) = -8*a(h) - 5*m(h). Determine q(f).
-1
Let n(f) = 19 - 36 + 16. Let c(w) = w + 4. Let r(q) = -c(q) - 6*n(q). Give r(2).
0
Suppose -6 = -x - 9. Suppose -3*n + 7*n = 8. Let u(v) = 2*v - 4 + 3 + 4*v**n - 3*v**2. Determine u(x).
2
Let a(m) = 5*m - 4. Let q(g) = -4*g + 4. Let b(l) = 5*a(l) + 6*q(l). Let n be (138/(-15))/2 + 2/(-5). Determine b(n).
-1
Suppose 9 = 3*p + 3. Suppose 4*t - 33 = -j, j + p*j + 2*t = 79. Suppose -4*h - h = j. Let w(q) = q**2 + 2*q - 6. What is w(h)?
9
Let j(n) = -2*n**3 + 3*n**2 - 2*n + 2. Let z(f) = 7*f - 68. Let d be z(10). What is j(d)?
-6
Let p be -1 + -4 - (2 - 1). Let l be p/8*4/(-6)*12. Let i(b) = -b**2 + 7*b - 5. Calculate i(l).
1
Let q(j) = -j**2 - 6*j - 1. Let o be (-2)/(4 - 2)*-4. Let v(b) = 5*b + b**3 + 4 - 4*b + 1 - 5*b**2 + b. Let w be v(o). Give q(w).
8
Let q(a) be the second derivative of -1/3*a**3 - 23*a - 1/12*a**4 - a**2 + 0. Determine q(-3).
-5
Let t = 11 - 16. Let j(o) = 6*o + 3. Let w(s) = -7*s - 2. Let c(z) = t*w(z) - 6*j(z). Let x be c(-9). Let l(r) = -5*r**3 + 2*r - 1. What is l(x)?
-4
Suppose 14 = -2*x - 5*q, 0*q - 23 = -5*x + 2*q. Suppose -23 - 7 = 5*h + w, x*h = 5*w - 18. Let d(n) = -n**3 - 7*n**2 - 7*n + 7. Give d(h).
13
Let i(u) = -3*u + 7. Suppose 6*v = -4 + 22. What is i(v)?
-2
Let y(c) = -c**2 - 6*c + 2. Let m be y(-4). Let p be (-1)/5 + 62/m. Let r(v) = 6*v + v + 6 - 9*v + v. What is r(p)?
0
Let f(x) = 65*x**3 - x**2 + 2*x - 1. Suppose 14 = 3516*u - 3502*u. Give f(u).
65
Let h(f) = 5*f + 45. Let a be (-708)/1770 + (0 - 66/10). Determine h(a).
10
Let b(s) be the third derivative of s**7/2520 - 13*s**5/60 - s**2 - 2. Let f(p) be the third derivative of b(p). Let w be -3 + 2 - (0 + 0). Calculate f(w).
-2
Suppose -797 + 779 = 3*d. Let p(b) = b**3 + 6*b**2 + 6*b + 28. What is p(d)?
-8
Let r(b) be the first derivative of -b**4/4 - 8*b**3/3 + 7*b**2/2 - 21*b + 1. What is r(-9)?
-3
Let l(j) = j**3 + 4*j**2 - 6*j + 1. Let w = 437 + -298. Let d = -144 + w. What is l(d)?
6
Let v(j) = -j**3 + 4*j**3 - 2*j**3 - 4*j**2 - 2 + 2*j. Let w = 152 + -150. What is v(w)?
-6
Let l(x) be the third derivative of 1/12*x**4 + 27*x**2 + 1/6*x**3 - 1/12*x**6 + 0*x**5 + 0*x + 0. Determine l(-1).
9
Let z(q) = 3*q**2 + 16*q + 5. Let b be z(-5). Let j(u) = 2*u**2 + 2*u + 10. What is j(b)?
10
Let f(c) = 73684*c - 4 - c**3 - 73681*c - 2*c**3 - 10*c**3. Calculate f(1).
-14
Let v(y) = 2*y**3 - 3*y**2 - y - 5. Let z be v(3). Let q = 27 - z. Let o(s) = -2*s - 2. Give o(q).
-18
Let w be (7 + 6 + -8)/(5/6). Let d(q) be the second derivative of q**3/6 - 7*q**2 + q. What is d(w)?
-8
Let n(q) be the second derivative of q**6/720 + 7*q**5/120 - 5*q**4/4 + 15*q. Let z(u) be the third derivative of n(u). Determine z(-5).
2
Let z(l) = l**2 - 3*l - 3. Let n(k) = -k**2 + 10*k + 15. Suppose -2*u + 3*t - 4*t = -18, 0 = -5*t - 20. Let r be n(u). Determine z(r).
1
Let y(a) = -a**2 + 43*a - 288. Let i be y(8). Let r(l) = l**2 + 6*l - 6. Determine r(i).
10
Let v(o) be the first derivative of 2*o**3/3 - 3*o**2/2 + 2*o + 4. Give v(2).
4
Let n(p) = -p**3 + 6*p**2 - 7*p + 4. Let a(b) = -b**3 - b**2 - 3*b - 3. Let h be a(-3). Suppose -21*y = -h*y + 12. Determine n(y).
8
Let m(d) = d**3 + 7*d**2 - 10. Suppose -i - 4*q = -13, 2*i - i + 3*q = 8. Determine m(i).
-10
Let f(n) be the first derivative of 2 + 1/2*n**2 + 1/4*n**4 - 4/3*n**3 - 3*n. Let m be 8/((6 - 4)*1). Determine f(m).
1
Let h(j) = -j**3 - 5*j**2 + 2*j + 6. Let u be h(-5). Let x(m) = 4*m + 569 + 5*m - 5*m - 571. What is x(u)?
-18
Let p(f) = 2*f**2 + 2. Let s(z) = -11*z**2 - z - 17. Let g(w) = -6*p(w) - s(w). Determine g(4).
-7
Let z(n) = -4 + 5 + 2 + 4*n. Suppose 5*d - a - 25 = 0, 3*a = -0*a. Suppose 5*s = -d - 5. What is z(s)?
-5
Let u be 1/6 - 26/12. Let k = 6 + u. Let q(p) be the first derivative of -p**4/4 + 5*p**3/3 - 2*p**2 - 4*p + 172. Give q(k).
-4
Let s = -134 + 129. Let j(i) = -i**3 - 5*i**2 - 2*i + 6. What is j(s)?
16
Let v(d) = -d**3 - 11*d**2 - d - 8. Let q be v(-11). Let h(i) = 11*i**2 + 13*i**2 + q - 2*i - 25*i**2 - 4. Determine h(-1).
0
Let u = 0 + -1. Let d(x) be the second derivative of -4*x**3/3 + x**2/2 + 3107*x. Give d(u).
9
Let h(o) = -o**2 - 5*o + 8. Let a = -286 - -279. Calculate h(a).
-6
Let v(z) be the first derivative of -z**4/4 + 2*z**3/3 + 3*z**2/2 + 6*z - 68. Determine v(3).
6
Let q = 107 - 90. Let t(o) = -27*o**3 + q*o**3 + o**2 - 1 + 11*o**3. Let d be 1/2*0/1. What is t(d)?
-1
Let q = 40 - 61. Let o = 23 + q. Let c be 24/(-2)*o/4. Let w(d) = -d**3 - 7*d**2 - 3*d + 4. Determine w(c).
-14
Let h(n) = n**3 - 8*n**2 + 8*n - 4. Let s be h(7). Let p(a) be the second derivative of -1/20*a**5 + 1/4*a**4 + 17*a + 3/2*a**2 + 0 + 1/6*a**3. Give p(s).
6
Suppose 55*i - 20*i = -140. Let d(o) = 4*o**2 + 12*o + 7. Let b(n) = 2*n**2 + 6*n + 3. Let r(t) = 5*b(t) - 2*d(t). What is r(i)?
9
Let j be ((-4)/12*-15)/1. Suppose -j*l = 4*i - 60, 3*l + l - 4*i = 12. Suppose 0 = 2*g - 0*g + l. Let h(f) = f**3 + 4*f**2 + 1. What is h(g)?
1
Let n be (-4)/6 + 20/(-6). Let k be 4 + (-6)/(-5)*70/(-21). Let d = k + n. Let p(m) = m**3 + 3*m**2 - 3*m + 5. Calculate p(d).
1
Let l(i) = i**2 - i + 2. Let o be l(2). Let z(q) = -q + 2. Let h be z(2). Suppose o*s + h*s = -4. Let n(c) = 2*c**3 - 2*c**2 - 2*c - 1. Give n(s).
-3
Let z(v) be the first derivative of -v**2 + 1. Let r(
|
{
"pile_set_name": "DM Mathematics"
}
|
Q:
HP laptop not charging over 86%, dies at 50% without warning
I'm running Windows 10 on an HP laptop. I always have to keep it charging because it doesn't charge past 86%, and it turns off itself at around 50% without any warning. Is this a problem with the battery or power settings?
A:
Seems like you need to run the Battery Test and Calibration.
Check out - https://support.hp.com/us-en/document/c00821536
Should correct the issue, or at least tell you if your battery is toast.
|
{
"pile_set_name": "StackExchange"
}
|
ISA100.11a
ISA100.11a is a wireless networking technology standard developed by the International Society of Automation (ISA). The official description is "Wireless Systems for Industrial Automation: Process Control and Related Applications".
The ISA100 committee is part of ISA and was formed in 2005 to establish standards and related information that will define procedures for implementing wireless systems in the automation and control environment with a focus on the field level. The committee is made up of over 400 automation professionals from nearly 250 companies worldwide. The committee also represents end users, wireless suppliers, system integrators, research firms, consultants, government agencies, and industry consortia. Committee members lend their expertise to the advancement of the ISA100 series of standards.
In 2009, the ISA Automation Standards Compliance Institute established the ISA100 Wireless Compliance Institute. The ISA100 Wireless Compliance Institute owns the 'ISA100 Compliant' certification scheme which provides independent testing of ISA100 based products to ensure that they conform to the ISA100 standard.
Timeline
May 2009: the ISA100 standards committee voted to approve ISA100.11a, "Wireless Systems for Industrial Automation: Process Control and Related Applications".
July 2009: Nivis announced ISA100.11a software.
September 9, 2009: ISA officially released ISA100.11a.
October 2009: Arkema in Crosby, Texas, in conjunction with the ISA100 Wireless Compliance Institute, conducted a multi vendor interoperability test.
Honeywell Process Solutions announced ISA100.11a compliant starter kits and complete systems.
Yokogawa announced products based on ISA100.11a standards, including wireless gateway with pressure and temperature transmitter.
2010: the ISA100 committee approved a major corrigendum to the 2009 edition of the standard reflecting comments received from organizations implementing the standard, and other commentors seeking clarification. The 2010 edition of the standard was submitted to the IEC SC65C in the form of a PAS (Publicly Available Specification) and as a New Work Item for international standardization. In this form, it has been numbered as IEC 62734.
References
External links
ISA100 Wireless Compliance Institute
ISA 100.11a Standard Closes in on Approval
Cambridge Whitepaper
ISA100.11a, ISA Expo 2006 SP100 Overview ppt
Standard Download
ISA100 Roadshow: Standards and Status
Category:Wireless networking
Category:Wireless sensor network
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Exenatide suppresses 1,2-dimethylhydrazine-induced colon cancer in diabetic mice: Effect on tumor angiogenesis and cell proliferation.
Colon cancer is the third leading cause of cancer mortality worldwide, which results from interactions of different factors. It is frequently a pathological consequence of persistent inflammation. Diabetes affects several cancers and is positively correlated with the incidence of colon cancer. This study aimed to study the effect of exenatide in ameliorating inflammation, angiogenesis and cell proliferation in 1,2-dimethyl hydrazine (DMH) induced colorectal carcinoma in diabetic mice. Mice were randomly allocated into six groups, 8 mice each. Group 1: vehicle control group. Group 2: diabetic control group. Group 3: DMH control group: diabetic mice treated with DMH (20mg/kg/week,s.c.) for 15 week. Group 4: DMH-cisplatin group: mice received cisplatin (4mg/kg/week, i.p.). Groups 5 & 6: DMH-exenatide (10 and 20μg/kg) group: mice received exenatide (10 or 20μg/kg/day,s.c.), respectively. The present results highlighted an increase in angiogenic markers and cell proliferation in the DMH-diabetic group in comparison with the control group with greater expression of endothelial marker (CD34) and Ki-67 in colon tissue. Monotherapy with cisplatin or exenatide (10 and 20μg/kg) downregulated these markers to different extents. The current results provided evidence that exenatide represents a promising chemopreventive effect against DMH-induced colon carcinogenesis in diabetic mice, at least in part, attributed to its anti-angiogenic and anti-proliferative mechanisms.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
IN THE UNITED STATES COURT OF APPEALS
FOR THE FIFTH CIRCUIT
No. 02-30672
Conference Calendar
JOSEPH HERCULE,
Petitioner-Appellant,
versus
UNITED STATES OF AMERICA,
Respondent-Appellee.
--------------------
Appeal from the United States District Court
for the Western District of Louisiana
USDC No. 02-CV-285
--------------------
December 12, 2002
Before JOLLY, JONES, and WIENER, Circuit Judges.
PER CURIAM:*
Joseph Hercule, federal prisoner # 44389-004, appeals from
the denial of his 28 U.S.C. § 2241 petition wherein he sought to
vacate his conviction. Hercule was sentenced to a total of 168
months’ imprisonment following his conviction for various
offenses, including car-jacking, in violation of 18 U.S.C.
§ 2119.
Hercule argues that the district court erred in determining
that his Jones v. United States, 526 U.S. 227 (1999) claim did
*
Pursuant to 5TH CIR. R. 47.5, the court has determined
that this opinion should not be published and is not precedent
except under the limited circumstances set forth in 5TH CIR.
R. 47.5.4.
No. 02-30672
-2-
not meet the criteria for bringing a claim pursuant to the
“savings clause” of 28 U.S.C. § 2255.
“[T]he savings clause of § 2255 applies to a claim (i) that
is based on a retroactively applicable Supreme Court decision
which established that the petitioner may have been convicted of
a nonexistent offense and (ii) that was foreclosed by circuit law
at the time when the claim should have been raised in the
petitioner’s trial, appeal, or first § 2255 motion.”
Reyes-Requena v. United States, 243 F.3d 893, 904 (5th Cir.
2001).
Hercule argues that his claim falls under the “savings
clause” because his indictment failed to charge all of the
elements of an offense under 18 U.S.C. § 2119. Hercule, however,
cannot satisfy either prong of the Reyes-Requena analysis. He
cannot satisfy the first prong of the Reyes-Requena analysis
because he cannot show that he has been convicted of a non-
existent offense. See id. Moreover, he cannot satisfy the
second prong of the Reyes-Requena analysis because his Jones
claim was not foreclosed at the time he filed first 28 U.S.C.
§ 2255 motion. Accordingly, Hercule has not shown that the
district court erred in dismissing his petition.
AFFIRMED.
|
{
"pile_set_name": "FreeLaw"
}
|
The tone was set, admittedly, in a pre-discussion video that voiced many Deadpool fans' frustrations by making fun of the decision to sew the character's mouth shut for his big screen debut in X-Men Origins: Wolverine; considering the comic book incarnation's nickname is "the merc with the mouth," with a reputation for being a wisecracking a-hole, it was a choice that seemed surprising at best, and downright contrary at worst.
Either way, it was a sign to the hardcore fan base that that Deadpool wasn't the character they fell in love with, and this movie's willingness to poke fun is a sign that this Deadpool very much is the version they know and love.
The full-length trailer shown in Hall H was more of the same, opening with a somber tone as Ryan Reynolds' Wade Wilson faces a cancer diagnosis with an appropriately dramatic, slow-pan response filled with mysterious figures offering him the chance to live — something that felt not unlike the tone of Marvel's first Ant-Man trailer, right up to when Reynolds starts demanding that no one give him a green, animated costume. (Something with which Reynolds has painful firsthand experience.)
It's another sign that the R-rated movie Deadpool isn't just the fourth wall-breaking character comic fans recognize; he's someone who'll make the same comments and demands of the movie that fans will.
That continues throughout the rest of the trailer — Reynolds pointing out Deadpool creator Rob Liefeld in a cameo appearance (just before Stan Lee fulfills his cameo potential as a strip club DJ, playing with the veteran creator's cuddly public image in the way that fans will likely enjoy), or responding to learning Negasonic Teenage Warhead's name by breaking character to tell her how cool it is. And, to be fair, it is.
It's a movie that feels like the next generation of the metatextual referentiality that's made Marvel Studios' offerings so successful with fans — and been shared on social media by fans countless times following release.
Now, instead of Easter eggs, we have a movie that will openly talk about the things created just to thrill the faithful, pointing them out and saying Yes, we get it too, we're just like you.
With an attitude like that, it's unsurprising that the Hall H audience demanded a second screening by stamping its collective feet and chanting. The real question is whether non-Comic-Con audiences will react in the same way.
|
{
"pile_set_name": "OpenWebText2"
}
|
Lipnica, Lublin Voivodeship
Lipnica is a village in the administrative district of Gmina Rokitno, within Biała Podlaska County, Lublin Voivodeship, in eastern Poland, close to the border with Belarus. It lies approximately south-east of Rokitno, north-east of Biała Podlaska, and north-east of the regional capital Lublin.
References
Category:Villages in Biała Podlaska County
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Murder of Haley Anderson
Haley Anderson was an American nursing student at Binghamton University. She was murdered by asphyxiation on March 8, 2018 by Nicaraguan-American Orlando Tercero in his Binghamton, New York apartment on Oak Street. Tercero was convicted in Nicaragua of femicide and faces 25 to 30 years in a Nicaraguan prison. He was also a nursing student who had an off and on relationship for a year and a half with Anderson. She reportedly wanted to end romantic involvement with Tercero. He fled to Nicaragua where the trial was held due to extradition laws. He still faces a second-degree murder charge in Broome County, New York but there are complications with the legalities of extradition. Tercero attempted suicide after killing Anderson and was placed in a psychiatric hospital upon arrival in Nicaragua.
References
Category:2018 murders in the United States
Category:Female murder victims
Category:2018 in New York (state)
Category:Deaths by strangulation in the United States
Category:Violence against women in the United States
Category:Nicaragua–United States relations
|
{
"pile_set_name": "Wikipedia (en)"
}
|
USCA1 Opinion
UNITED STATES COURT OF APPEALS FOR THE FIRST CIRCUIT ____________________ No. 94-1294 NATIONAL LABOR RELATIONS BOARD, Petitioner, v. HORIZONS HOTEL CORPORATION D/B/A CARIB INN OF SAN JUAN, Respondent. ____________________ No. 94-1303 HORIZONS HOTEL CORPORATION D/B/A CARIB INN OF SAN JUAN, Petitioner, v. NATIONAL LABOR RELATIONS BOARD, Respondent. ____________________ ON APPLICATION FOR ENFORCEMENT AND PETITION FOR REVIEW OF AN ORDER OF THE NATIONAL LABOR RELATIONS BOARD ____________________ Before Torruella, Chief Judge,
___________ Campbell, Senior Circuit Judge,
____________________ and Boyle,* Senior District Judge.
_____________________ _____________________
____________________ * Of the District of Rhode Island, sitting by designation.
Luis F. Padilla for Horizons Hotel Corporation.
_______________ David Habenstreit, Attorney, National Labor Relations Board,
_________________ with whom Frederick L. Feinstein, General Counsel, Linda Sher,
_______________________ __________ Acting Associate General Counsel, Aileen A. Armstrong, Deputy
____________________ Associate General Counsel, and Linda Dreeben, Supervisory
_______________ Attorney, were on brief for National Labor Relations Board. ____________________ March 3, 1995 ____________________ -2-
BOYLE, Senior District Judge. This case presents
BOYLE, Senior District Judge
_______________________ issues concerning a final order of the National Labor Relations Board (the Board) which concluded that Horizons Hotel Corporation d/b/a Carib Inn of San Juan (Horizons) engaged in unfair labor practices in violation of 8(a)(1), (3), and (5) of the National Labor Relations Act (the Act), 29 U.S.C. 158(a)(1), (3), (5). The claims of unfair labor practices arose in part from the conduct of a bankruptcy trustee who was in possession of the hotel at the time Horizons purchased it. The Board petitions us under 10(e) of the Act, 29 U.S.C. 160(e), to enforce its order, which adopted with modification the opinion and recommended order of the administrative law judge (ALJ). 312 N.L.R.B. No. 200 (Nov. 22, 1993). Horizons petitions us under 10(f) of the Act, 29 U.S.C. 160(f), to review and vacate the Board's order, asserting the following: the Board lacked jurisdiction to act in this case; the conclusions of the ALJ and the Board are contrary to law; and the factual determinations of the ALJ, adopted by the Board, are not supported by substantial evidence. We conclude that the Board's order adopting the ALJ's opinion and proposed order is without error and is to be enforced as it stands. See 29 U.S.C. 160(e), (f).
___ I. STANDARD OF REVIEW
I. STANDARD OF REVIEW The appropriate standard of review is provided in 10(e) of the Act, 29 U.S.C. 160(e): "The findings of the Board with respect to questions of fact if supported by substantial evidence on the record considered as a whole shall be -3-
conclusive." Thus, a finding of the Board that the Act has been violated is upheld "as long as the finding is supported by substantial evidence . . . even if we would have reached a different conclusion." 3-E Co., Inc. v. NLRB, 26 F.3d 1, 3 (1st
_____________ ____ Cir. 1994)(citing 29 U.S.C. 160(e)). In reviewing a Board decision, great weight is afforded the credibility determinations of the ALJ, as he or she had the opportunity to observe the witnesses testify, see id.; Holyoke Visiting Nurses Ass'n v.
___ __ ______________________________ NLRB, 11 F.3d 302, 308 (1st Cir. 1993); therefore, credibility
____ determinations are disturbed only where it is apparent that the ALJ "overstepped the bounds of reason." 3-E Co., Inc., 26 F.3d
_____________ at 3; Holyoke Visiting Nurses Ass'n, 11 F.3d at 308 (citing NLRB
_____________________________ ____ v. American Spring Bed Mfg. Co., 670 F.2d 1236, 1242 (1st Cir.
_____________________________ 1982)). II. BACKGROUND
II. BACKGROUND The record supports the ALJ's finding of the following facts, adopted by the Board. See 3-E Co., Inc., 26 F.3d at 2
___ _____________ (citing Cumberland Farms, Inc. v. NLRB, 984 F.2d 556, 558 (1st
______________________ ____ Cir. 1993)). A. Hotel in Bankruptcy: November 1981 - May 14, 1986
A. Hotel in Bankruptcy: November 1981 - May 14, 1986 In 1981, the Carib Inn hotel and casino in San Juan, Puerto Rico, was owned by the Carib Inn of San Juan Corporation (Carib Inn Corporation). In November 1981, Carib Inn Corporation filed a petition for bankruptcy in the U.S. Bankruptcy Court for the District of Puerto Rico under chapter 11 of Title 11, 11 U.S.C. 1101, et seq. The chapter 11 proceeding was converted
________ -4-
to a chapter 7, 11 U.S.C. 701 et seq., proceeding in November
_______ 1985. On November 21, 1985, the Bankruptcy Court appointed H ctor Rodr guez-Estrada (Rodr guez) trustee under 29 U.S.C. 1104. As trustee, Rodr guez was ordered to liquidate the assets of the bankruptcy estate. At all relevant times, employees of the hotel's service and casino units1 were represented by Uni n de Trabajadores de la Industria Gastron mica de Puerto Rico, Local 610, Hotel Employees and Restaurant Employees International Union, AFL-CIO (the Union). The service- and casino-unit employees were employed under the terms of a collective bargaining agreement.2 In November or December 1985, Horizons considered the prospect of purchasing the Carib Inn. Horizons submitted a bid for the bankruptcy estate in February 1986. Prior to the bid, Horizons's president, Benito Fern ndez, spent time at the hotel, investigating its operation and its physical grounds. At some point, Fern ndez began to occupy an office at the hotel. The office was located next to that of Rodr guez. Fern ndez and Rodr guez shared a secretary. On April 3, Rodr guez met with Ileana Qui ones, general manager of Professional Employment Center (PEC), a local
____________________ 1 For a list of the employment positions within the service and casino units, see ALJ's Decision and Proposed Order, appended to In re: Horizons Hotel Corp., et al, 312 N.L.R.B. No. 200 (Nov.
___________________________________ 22, 1993). 2 On March 20, 1986, Rodr guez terminated the collective bargaining agreement pursuant to 11 U.S.C. 365. The propriety of this action is not in question. -5-
employment agency. At the meeting, Rodr guez told Qui ones that PEC's services were needed because the hotel was operating under new management which sought to hire new employees. He asked her if there was a possibility that employees hired through PEC would be union workers. She responded that they would not. Rodr guez told Qui ones that he would consider retaining PEC if she could guarantee him that there would be no risk of a union at the hotel. He requested that Qui ones indicate in writing that there was no possibility of a union presence. The following day, April 4, 1986, Qui ones sent a letter to Rodr guez. The letter was addressed as follows: "Sr. H ctor M. Rodr guez-Estrada[,] Horizons Hotel" -- Qui ones was of the belief that Rodr guez was employed as a manager of Horizons. A summary of the items discussed at the previous day's meeting was included with the letter. The first item listed was as follows: "1. There is no possibility for a Union." On May 12 or 13, 1986, Frankie Rosado-Garc a (Rosado), a waiter in one of the hotel's restaurants, and a union steward, while on duty, served the Union's president, who was seated at a table. After Rosado waited on him, Rodr guez, who was present in the restaurant, approached Rosado, and said: "[A-ha] . . . you betrayed me." Rosado later went to Rodr guez' office to question him about the comment. Rodr guez asked Rosado if the Union's president had come "to stop the hotel." He then told Rosado that if the Union continued to bother him, he would fire all union employees. On another occasion in May, Rodr guez told Rosado -6-
that the Union was not backing the hotel employees. He said that the Union had failed to collect from the Federal court money owed to the employees. He further stated that there was no union in Puerto Rico that would defend the employees. B. Sale of the Hotel: May 14, 1986 - May 31, 1986
B. Sale of the Hotel: May 14, 1986 - May 31, 1986 On May 14, 1986, a deed was executed whereby Horizons purchased the Carib Inn from Rodr guez. The deed provided that possession of the hotel property would be turned over to Horizons on May 31, 1986. On May 19, 1986, Rodr guez hired Juan Rafael G mez (G mez) as resident manager. That day, Rodr guez circulated a memorandum (May 19 memorandum) announcing the same. Fern ndez had signed the memorandum, expressly indicating his approval of G mez' hiring. On May 21, 1986, Rodr guez circulated a memorandum (May 21 memorandum) to all employees of the Carib Inn, notifying them that Horizons would assume control of the hotel on June 1, 1986, and that all employees would be terminated on May 31, 1986. The memorandum advised the employees that they could apply for positions with Horizons by submitting applications at a recruiting office set up by Horizons in a nearby condominium. The recruiting office would accept applications for two days only. Later that day, May 21, F lix Ram rez, the Union's general steward, and Valent n Hern ndez, the Union's secretary and treasurer, went to Rodr guez' office to discuss with him the -7-
memorandum. Rodr guez threatened not to meet with them. He told them that he didn't have to talk with them because they no longer represented the hotel's employees. He stated: "[T]he Union is out," and "Horizons has nothing to do with the Union." Rodr guez finally agreed to meet with them, however, after Hern ndez threatened to report his conduct to the Secretary of Labor for the Commonwealth of Puerto Rico. During the meeting, however, Rodr guez told Ram rez and Hern ndez that they should discuss with G mez any concerns they may have concerning hotel administration. Prior to the May 21 memorandum, PEC had begun soliciting applications for positions at the hotel. Qui ones understood that PEC was to be responsible for hiring Horizons's new employees. It advertised in a local newspaper and collected applications and relevant information on potential employees. It conducted interviews and informed Rodr guez of appealing candidates. Rodr guez, however, advised Qui ones that PEC would do no independent hiring, but rather would hire only those individuals whom it was instructed to hire. Horizons's recruiting program, announced in the May 21 memorandum, was carried out. A representative of PEC was present throughout. Several days after the program, Rodr guez provided G mez a list of individuals to interview. Interviews were thereafter conducted at the hotel. A representative of PEC was present during the interviews. Not one employee of the Carib Inn was interviewed. At one point, Rodr guez told a Carib Inn -8-
employee that he had been authorized to hire new employees for Horizons. C. Transfer of Control: June 1, 1986
C. Transfer of Control: June 1, 1986 On June 1, 1986, Horizons assumed possession of the hotel property. Since that date, Horizons has continued the business operations previously conducted by Rodr guez as trustee, and by the Carib Inn Corporation, using substantially the same facilities and equipment, and providing the same services, with the exception of the casino, which ceased operation on June 23, 1986. After the transfer of possession, no service-unit employees previously employed at the hotel were employed by Horizons, with the exception of several former unit employees hired in a supervisory or managerial capacity. See 312 N.L.R.B.
___ No. 200 n.2. Fourteen of Horizons's twenty-four casino unit employees, however, were previously employed at the hotel. At no time did Horizons negotiate or enter into a bargaining agreement with the Union. On June 1, 1986, Horizons hired Rodr guez as a consultant. He later became Horizons's general manager. The Bankruptcy Court confirmed the sale of the Carib Inn to Horizons by order dated June 6, 1986. D. The Present Action
D. The Present Action The Union pursued claims against Horizons in August 1986. The Board issued a complaint and notice of hearing on September 30, 1987; an amended complaint and notice of hearing -9-
was issued on December 21, 1987. The amended complaint includes the following allegations: that Horizons interfered with, restrained, and coerced employees in the exercise of their rights in violation of 8(a)(1) of the Act, 29 U.S.C. 158(a)(1), by creating the impression of surveillance of employees' union activities, threatening employees with discharge because of their union activities, and attempting to denigrate the Union in the eyes of employees; that Horizons refused to hire former service unit employees in violation of 8(a)(3) of the Act, 29 U.S.C. 8(a)(3); and that Horizons refused to bargain collectively with representatives of the Union in violation of 8(a)(5) of the Act, 29 U.S.C. 158(a)(5). The amended complaint alleges that much of the improper conduct was carried out by Rodr guez, acting as an agent of Horizons. An ALJ conducted hearings on various dates from March 1989 through March 1991. The decision and proposed order issued on January 15, 1993. The ALJ concluded that Horizons violated 8(a)(1), (3), and (5) of the Act, 29 U.S.C. 158(a)(1), (3), (5). The Board, with modification, adopted the ALJ's rulings, findings, and conclusions. In re: Horizons Hotel Corp., et al,
___________________________________ 312 N.L.R.B. No. 200 (Nov. 22, 1993). It amended the ALJ's proposed remedy and order, and ordered the following: that Horizons cease and desist from engaging in unfair labor practices; that it offer positions of employment to the 65 former hotel employees who were not hired by Horizons in violation of the Act; that it bargain collectively with the -10-
Union on request; that, on request, it cancel any changes in employment conditions which may have been instituted since it purchased the Carib Inn; that, in the event the casino resumes operation, it bargain with the Union concerning casino employees, and it offer positions to those identified former casino employees who were not hired; and that it preserve records and publish notice of the order. Both the Board and Horizons petition this Court to act. The Board petitions us to enter an order enforcing its order. Horizons petitions us to review and vacate the Board's opinion and order. As grounds, Horizons asserts that exclusive jurisdiction over this matter lies with the bankruptcy court, because much of the allegedly improper conduct was committed by a bankruptcy trustee. Horizons further asserts that as a matter of law it cannot be held accountable for any improper conduct of Rodr guez, the bankruptcy trustee. Finally, Horizons argues that there is insufficient evidence to support the findings that Rodr guez was an agent of Horizons, and that Horizons violated 8(a)(1), (3), and (5) of the Act, 29 U.S.C. 158(a)(1), (3), (5). We examine the issues. III. JURISDICTION
III. JURISDICTION Horizons asserts that, because this action concerns conduct of a bankruptcy trustee, it is within the exclusive jurisdiction of the bankruptcy court. In so arguing, it characterizes the present action as a "suit[] against the -11-
trustee." Horizons's argument is without merit. The issue was determined in In re: Carib-Inn of San Juan Corp., 905 F.2d 561
____________________________________ (1st Cir. 1990), a related action commenced by Horizons in the bankruptcy court to enjoin the Board from pursuing the present case. In Carib-Inn, we concluded that the Board had exclusive
_________ jurisdiction to determine the merits of the present case, as "[t]he [Board's] complaint . . . is directed solely at Horizons and seeks no remedy against the bankruptcy estate." Id. at 562.
__ The cases cited by Horizons are inapposite. See Baron v.
___ _____ Barbour, 104 U.S. 126, 128, 131 (1881)(court of the District of
_______ Columbia has no jurisdiction to entertain suit against receiver appointed by a court of the State of Virginia without leave of the appointing court); Leonard v. Vrooman, 383 F.2d 556, 560
_______ _______ (9th Cir. 1967), cert. denied, 390 U.S. 925 (1968)(bankruptcy
____________ court has no jurisdiction to enjoin state action against trustee in bankruptcy for illegally seizing and possessing plaintiff's real property); Vass v. Conron Bros. Co., 59 F.2d 969, 970 (2d
____ _________________ Cir. 1932)(bankruptcy court may enjoin action in state court against receiver in bankruptcy where not commenced with leave of the appointing court); In re: Campbell, 13 B.R. 974, 976
_________________ (D.Idaho 1981)(permission of the bankruptcy court is a prerequisite for state-court action against trustee in bankruptcy for acts done within his authority as trustee). Each concerns an action against a trustee or receiver in bankruptcy; the present case is not an action against the trustee in bankruptcy, Rodr guez, but rather against the purchaser of a bankruptcy -12-
estate, Horizons. The Board acted within its jurisdiction under 10 of the Act, 29 U.S.C. 160, in pursuing the present claims, and under 10(e) and (f), 29 U.S.C. 160(e), (f), this Court has jurisdiction "of the proceeding and the question determined therein," and has the power "to make and enter a decree enforcing, modifying, and enforcing as so modified, or setting aside in whole or in part the order of the Board." -13-
IV. ANALYSIS
IV. ANALYSIS A. Rodr guez As Agent of Horizons
A. Rodr guez As Agent of Horizons
______________________________ Horizons presents two objections to the ALJ's determination, adopted by the Board, that Rodr guez, the trustee in bankruptcy, acted as agent for Horizons prior to June 1, 1986, the date on which possession of the Carib Inn was transferred to Horizons. First, Horizons argues that as a matter of law, as purchaser of a bankruptcy estate it cannot be held accountable for the conduct of the bankruptcy trustee, Rodr guez, which occurred prior to the transfer of the estate. Second, it argues that the finding that Rodr guez was acting as agent for Horizons is not supported by substantial evidence. The Act guarantees employees the right "to self- organize, to form, join, or assist labor organizations, to bargain collectively . . . and to engage in other concerted activities for the purpose of collective bargaining or other mutual aid or protection." 29 U.S.C. 157. The Act precludes employers from conducting unfair labor practices, as that term is defined in 8 of the Act, 29 U.S.C. 158. Employers may be liable for the unfair labor practices of their agents. See
___ International Ass'n of Machinists v. NLRB, 311 U.S. 72, 80
___________________________________ ____ (1940); 3- Co., Inc., 26 F.3d at 3-4; NLRB v. Uni n Nacional de
____________ ____ _________________ Trabajadores, 540 F.2d 1, 8-9 (1st Cir. 1976), cert. denied, 429
____________ ____________ U.S. 1039 (1977). Agents for whose unlawful conduct employers are responsible need not be employees. See Cagle's, Inc. v.
______________ NLRB, 588 F.2d 943, 947-49 (5th Cir. 1979); Uni n Nacional, 540
____ ______________ -14-
F.2d at 8-9. An employer need not have actually authorized or subsequently ratified the conduct of its agent for it to be liable. 29 U.S.C. 152(13). Rather, an employer is liable for the unlawful conduct of its agent when, under all the circumstances, employees could reasonably believe that the agent was acting for and on behalf of management. See American Press,
___ _______________ Inc. v. NLRB, 833 F.2d 621, 625 (6th Cir. 1987)(citation
____ ____ omitted); Uni n Nacional, 540 F.2d at 8-9.
______________ Horizons contends that as a matter of law, a trustee in bankruptcy cannot be deemed an agent of the purchaser of the estate for whose unlawful conduct the purchase is liable. Horizons argues that the trustee's duties to the bankruptcy estate, and the transfer of the property "free and clear" of encumbrances, preclude the possibility. Horizons points to no authority whatever to support its contention. We find its argument unpersuasive. That Rodr guez may have been duty bound to act for the benefit of the bankruptcy estate is irrelevant and has no bearing on whether he acted on behalf of Horizons. Cf.
__ Cagle's, Inc., 588 F.2d at 947 (private employer liable for the
_____________ conduct of city chamber of commerce director). The fact that Horizons purchased the hotel "free and clear" of liens and encumbrances and that it did not expressly assume liability for the conduct of any prior owner of the estate is also irrelevant. See In Re: Carib Inn, 905 F.2d at 563-64. Horizons is not here
___ ________________ being held responsible simply for the conduct or liability of a -15-
prior owner; it is being held responsible for its own unlawful acts, which were carried out through its agent, Rodr guez, who happened to control the property prior to the transfer of its possession to Horizons. Horizons next argues that the finding that Rodr guez acted as its agent is not supported by substantial evidence. On the record before us, we are satisfied that the ALJ's determination, adopted by the Board, that Rodr guez acted as agent for Horizons is supported by substantial evidence. Rodr guez occupied an office in the hotel next to that of Fern ndez, Horizons's president, and the two shared a secretary; Rodr guez solicited the services of PEC, an employment agency, to recruit employees for Horizons; the May 19 memorandum indicated that Rodr guez acted with the approval of Fern ndez when he hired G mez as resident manager; Rodr guez announced to union representatives that Horizons "has nothing to do with the Union"; he told an employee that he was responsible for determining whom Horizons would hire; and he provided to G mez a list of applicants to interview for positions with Horizons. On the basis of these facts, it is clear that employees of the Carib Inn could reasonably have believed that Rodr guez was acting for and on behalf of Horizons. Furthermore, Horizons never disavowed Rodr guez' conduct; On the contrary, Horizons hired Rodr guez after possession of the hotel was transferred on June 1. Substantial evidence on the record as a whole supports the ALJ's finding, adopted by the Board, that Rodr guez was -16-
acting as an agent of Horizons prior to the transfer of the Carib Inn on June 1. See 3-E Co., Inc., 26 F.3d at 3.
___ _____________ B. Violations of the Act
B. Violations of the Act
_____________________ 1. Section 8(a)(1), 29 U.S.C. 158(a)(1)
1. Section 8(a)(1), 29 U.S.C. 158(a)(1) The Board determined that certain statements of Rodr guez, attributable to Horizons, violated 8(a)(1) of the Act, 29 U.S.C. 158(a)(1). Horizons asserts that the finding is not supported by substantial evidence. Section 8(a)(1) of the Act, 29 U.S.C. 158(a), provides that it is an unfair labor practice for an employer to "interfere with, restrain, or coerce" employees in the exercise of their rights guaranteed by the Act. "An employer violates 8(a)(1) by coercively interrogating employees about their union activities or sentiments, or about the activities or sentiments of others, and by either directly or indirectly threatening employees." 3-E Co., Inc., 26 F.3d at 3 (citing Cumberland
______________ __________ Farms, Inc., 984 F.2d at 559; NLRB v. Otis Hospital, 545 F.2d
___________ ____ _____________ 252, 256 (1st Cir. 1976)). When examining assertedly violative conduct, courts must be mindful that "[i]t is the coercive tendency of employer statements, not their actual effect, that constitutes a violation of the Act." NLRB v. Marine Optical,
____ ________________ Inc., 671 F.2d 11, 18 (1st Cir. 1982)(citations omitted). The
____ Board's inference of coercive tendency will not be disturbed if reasonable, even if susceptible of an alternative interpretation. Id. (citations omitted).
__ The Board's determination that Horizons violated -17-
8(a)(1) of the Act, 29 U.S.C. 158(a)(1), is supported by substantial evidence and stands without error. Rodr guez told a hotel employee, Rosado, that he (Rosado) had betrayed him by talking to the Union's president; he then questioned Rosado about his conversation. Thereafter, he told Rosado that all hotel employees would be fired if the Union continued to bother him. These statements are reasonably interpreted as coercive interrogation and direct threats. Considered in context, the statements could reasonably have interfered with or coerced hotel employees in the exercise of their organizational rights. See 3-
___ __ E Co., Inc., 26 F.3d at 3; Cumberland Farms, Inc., 984 F.2d at
___________ _______________________ 559. 2. Sections 8(a)(3) and (1), 29 U.S.C. 158(a)(1),
2. Sections 8(a)(3) and (1), 29 U.S.C. 158(a)(1), (3)
(3) The Board, in adopting the findings of the ALJ, found that Horizons's refusal to hire all but several of the hotel's former service-unit employees violated 8(a)(3) and (1) of the Act, 29 U.S.C. 158(a)(1), (3). Horizons argues that this determination is not supported by substantial evidence, and is therefore erroneous. Section 8(a)(3) of the Act, 29 U.S.C. 158(a)(3), declares that it is an unfair labor practice for an employer "by discrimination in regard to hire or tenure of employment . . . to encourage or discourage membership in any labor organization." Where an employer violates 8(a)(3) of the Act, 29 U.S.C. 8(a)(3), by discriminating in its hiring practices to -18-
discourage a union presence, it necessarily violates 8(a)(1) of the Act, 29 U.S.C. 8(a)(1), which disallows employers to "interfere with, restrain, or coerce" employees in the exercise of their organizational rights. See, e.g., American Press, Inc.,
___ ____ ____________________ 833 F.2d at 624; NLRB v. Horizon Air Services, Inc., 761 F.2d 22,
____ __________________________ 26-28 (1st Cir. 1985); Kallman v. NLRB, 640 F.2d 1094, 1100 (9th
_______ ____ Cir. 1981). Generally, a successor employer has the right to operate its business as it wishes. See Elastic Nut Shop Div. of
___ ________________________ Harvard Ind. v. NLRB, 921 F.2d 1275, 1279 (D.C. Cir. 1990)(citing
____________ ____ NLRB v. Burns International Security Services, Inc., 406 U.S.
____ _____________________________________________ 272, 287-88 (1972)). Within this prerogative is the successor's freedom to hire its own work force: "'nothing in the federal labor laws "requires that an employer . . . who purchases the assets of a business be obligated to hire all of the employees of the predecessor . . . ."'" Id. (quoting Howard Johnson Co. v.
__ ___________________ Detroit Local Executive Board, 417 U.S. 249, 261 (1974)(citation
_____________________________ omitted)). The successor employer may not, however, discriminate against union employees in its hiring. See Fall River Dyeing &
___ ____________________ Finishing Corp. v. NLRB, 482 U.S. 27, 40 (1987)(citations
________________ ____ omitted). Thus, where a successor employer refuses to hire its predecessor's employees because of their union affiliation, it may violate 8(a)(3), 29 U.S.C. 158(a)(3). The test is as follows: If it is proved that the former employees' protected conduct was a substantial or motivating factor for the -19-
successor's refusal to hire, the refusal to hire violates 8(a)(3), 29 U.S.C. 158(a)(3), unless the successor proves by a
______ preponderance of the evidence that it "would have taken the same action for wholly permissible reasons." NLRB v. Transportation
____ ______________ Management Corp., 462 U.S. 393, 399 (1983). See also Elastic
________________ ________ _______ Stop Nut Div. of Harvard Ind., 921 F.2d at 1280; Horizon Air
_______________________________ ___________ Services, Inc., 761 F.2d at 27. "[I]f the employer [refuses to
______________ hire] an employee for having engaged in union activities and has no other basis for the discharge, or if the reasons that [it] proffers are pretextual, the employer commits an unfair labor practice." Transportation Management Corp., 462 U.S. at 398.
_______________________________ In the present case, the Board determined that the General Counsel sustained its burden of proving that the hotel's former service-unit employees' union affiliation was the substantial or motivating factor in Horizons's refusal to hire them. This determination is supported by substantial evidence: Rodr guez, Horizons's agent, indicated to Qui ones that Horizons would utilize PEC's services only on the condition that there be no risk of a union at the hotel; Qui ones responded with a letter confirming that "[t]here is no possibility for a Union"; Rodr guez told a Carib Inn union employee that all union employees would be fired if the Union continued to bother him; Rodr guez told union leaders that "Horizons has nothing to do with the Union"; not one union-affiliated former employee who submitted an application with Horizons was interviewed; with the exception of several individuals who were offered supervisory or -20-
managerial positions, no former service-unit employees were hired by Horizons. The Board disqualified as a pretext Horizons's proffered lawful reason for refusing to hire the former employees. This determination also is supported by substantial evidence. Horizons asserted at the administrative proceedings that the former employees were not hired because many of them were not needed, and because they were not competent employees. Fern ndez testified that the former employee's unfitness was determined after he personally observed them, and that their incompetence is evidenced by the fact that the hotel had gone into bankruptcy. The Board, adopting the ALJ's findings, discredited Fern ndez' testimony and rejected Horizons's proffered justification, noting that Horizons submitted no evidence tending to prove that Fern ndez personally observed each former employee, and that it failed to prove its contention that the service employees caused the hotel's bankruptcy. The Board concluded that Horizons's retention of PEC for recruiting services, and its solicitation of applications from former service-unit employees, was conduct intended as a smoke screen to conceal its scheme to keep the Union out of the Carib Inn. Again, this conclusion is well supported by substantial evidence. The Board, in adopting the ALJ's findings, concluded that Horizons violated 8(a)(3) and (1) of the Act, 29 U.S.C. 8(a)(1), (3). This determination is supported by substantial evidence and stands without error. -21-
3. Sections 8(a)(5) and (1), 29 U.S.C. 158(a)(1),
3. Sections 8(a)(5) and (1), 29 U.S.C. 158(a)(1), (5)
(5) The Board determined, in adopting the findings of the ALJ, that Horizons violated 8(a)(5) and (1) of the Act, 29 U.S.C. 8(a)(1), (5), by refusing to bargain collectively with the Union, which represented employees of the service and casino units. Horizons asserts that this finding is in error, unsupported by substantial evidence. Section 8(a)(5) of the Act, 29 U.S.C. 158(a)(5), provides that it is an unfair labor practice for an employer "to refuse to bargain collectively with the representatives of his employees." Where an employer violates 8(a)(5) of the Act, 29 U.S.C. 8(a)(5), by refusing to bargain collectively, it necessarily violates 8(a)(1) of the Act, 29 U.S.C. 8(a)(1), which disallows employers to "interfere with, restrain, or coerce" employees in the exercise of their organizational rights. See, e.g., Fall River Dyeing & Finishing Corp., 482 U.S. at 34 &
___ ____ ___________________________________ n.2. Under 8(a)(5), 29 U.S.C. 158(a)(5), "an employer is obligated to bargain with the union representing its predecessor's employees if: (1) the new employer is a 'successor' to the old . . . and (2) a majority of the successor's employees previously were employed by the predecessor." Asseo v. Centro M dico Del Turabo, 900 F.2d 445,
_____ ________________________ 450-51 (1st Cir. 1990)(citing Fall River Dying & Finishing Corp.,
__________________________________ 482 U.S. at 43-52). If these two criteria are satisfied, "a rebuttable presumption of majority status arises, leading to a -22-
consequent duty to bargain in good faith." Id. at 451.
__ Where a successor employer's unlawful hiring practices preclude the possibility of a majority status in its work force, however, the successor violates the Act by refusing to bargain collectively with the union that had represented the predecessor's employees. Elastic Stop Nut Div. of Harvard Ind.,
_____________________________________ 921 F.2d at 1282. Thus, with regard to the former union employees of the hotel's service unit, our affirmance of the Board's determination that Horizons violated 8(a)(3) of the Act, 29 U.S.C. 158(a)(3), by refusing to hire them because of their union affiliation compels affirmance of the determination that Horizons violated 8(a)(5), 29 U.S.C. 158(a)(5), as a duty to bargain with the employees' union representatives arose from the violation of 8(a)(3). See Elastic Stop Nut Div. of
___ _________________________ Harvard Ind., 921 F.2d at 1282.
____________ With regard to the hotel's casino-unit employees, the Board's finding of a violation of 8(a)(5), 29 U.S.C. 158(a)(5), is supported by substantial evidence. The Board, in adopting the ALJ's findings, found that the casino continued operations after transfer of possession of the hotel to Horizons on June 1, and that Horizons operated the casino through June 23, 1986. The Board determined that, with respect to casino operations, Horizons was a successor employer. Fourteen of Horizons's twenty-four casino-unit employees were former union employees of the hotel's casino unit. The fact that greater than one-half of the employees in -23-
Horizons's casino unit had been union employees of Horizons's predecessor raises a rebuttable presumption that there existed in the casino unit a "majority status." See Asseo, 900 F.2d at 450-
___ _____ 51. Horizons does not assert that it was able to overcome this presumption. Horizons therefore had a duty to bargain with representatives of the former casino-unit employees. Its failure to do so violated 8(a)(5) and (1) of the Act, 29 U.S.C. 158(a)(1), (5). C. The Board's Order
C. The Board's Order
_________________ Horizons argues that the portion of the Board's order requiring it to "cancel, on request by the Union, any changes in wages and benefits that [Horizons] made when it began operations" is "inappropriate." After a review of the record, we conclude that the Board's order was a reasonable remedy fashioned to address Horizons's violations of 8(a)(1), (3) and (5) of the Act, 29 U.S.C. 158(a)(1), (3), (5). See Horizon Air Services,
___ _____________________ Inc., 761 F.2d at 32-33 (citations omitted)("We respect the
____ Board's special competence and expertise in fashioning remedies. And, where the Board's design is planned out with due regard to supportable findings, sensible reasoning, and an accurate view of the governing law, there is no room for judicial intervention."). V. CONCLUSION
V. CONCLUSION The ALJ's findings, adopted by the Board, are supported by substantial evidence on the record as a whole and stand without error. Horizons's request for review is denied, and the
______ Board's request for enforcement of its order is granted.
_______ -24-
|
{
"pile_set_name": "FreeLaw"
}
|
Raef al-Maarri
Raef al-Maarri () was an officer in the Syrian Army and a deputy of Colonel Jassem Alwan.
Politically aligned with the Nasserists, supporters of Egyptian president Gamal Abdel Nasser, Maarri and Alwan orchestrated a failed coup attempt against the Ba'athist-dominated government that took power in the coup d'état of 8 March 1963, which toppled the secessionist government of Nazim al-Qudsi and Khalid al-Azm. The latter two themselves gained power after a coup that ended the union with Egypt in the United Arab Republic. The Nasserists were major participants in the 8 March coup, but were increasingly sidelined by the Ba'athists who executed a mass purging of Nasserists and political independents beginning in late April.
Maarri and Alwan planned a counter coup against the Ba'athists with the aid of the Arab Nationalist Movement in Syria and Egyptian intelligence. The insurrection was launched on 18 July, but was violently quelled by the security forces led Amin al-Hafiz, the Ba'athist Interior Minister. Several Nasserist officers were arrested and executed in the immediate aftermath, but Maarri managed to flee the authorities and went into hiding in the Ghouta countryside of Damascus with Alwan. After being discovered and apprehended, both were tried by a military court where Maarri pleaded guilty to his role in the abortive coup, stating it was an attempt to ensure the unification process with Egypt and Iraq would continue in light of the Ba'athists' perceived anti-unionist actions. Maarri was sentenced to death, but the sentence was later reduced to life imprisonment on 10 December. He was released a year later in December 1964 with Alwan and several other alleged participants in the July coup in an amnesty agreement. Afterward, the men were escorted to the border with Lebanon from which they departed for the Egyptian embassy in Beirut to seek asylum in Egypt, which Egypt granted.
References
Category:Nasserists
Category:Syrian colonels
Category:Syrian exiles
Category:Syrian Arab nationalists
|
{
"pile_set_name": "Wikipedia (en)"
}
|
The order also forbids Americans from doing business with any other sector that the authorities consider pertinent.
Before an audience comprised of migrants from different Latin American countries, Bolton recognized that many have endured “horrors” at the hands of the Cuban, Venezuelan and Nicaraguan governments. He said that the Trump administration is committed to fighting dictators performing atrocities in neighbouring countries.
In response to such allegations, Venezuela’s Nicolás Maduro said the sanctions are “crazy” and “schizophrenic.” He added that his country is not going to kneel down before the American imperialism.
In a televised announcement, Maduro said his government is now certifying 32 gold fields that “are going to set Venezuela as the second largest gold reserve on Earth”.
The politician said the massive mining project will be financed by both the public and the private sector and is expected to generate $5 billion in 2019.
As a reference, in the first nine months of 2018, Venezuela sold 23.62 tonnes of gold to Turkey for about $900 million.
Maduro also said that his government is installing 54 gold processing plants. The first one already in operation, named Sarrapia, is located in the southeastern Bolívar state and it is currently able to process 45 kilograms of gold. However, the expectation is that it reaches the mark of 90 kilos of gold processed by July 2019.
|
{
"pile_set_name": "OpenWebText2"
}
|
Cleveland Chiropractic College Off Campus Apartments
Ready for an Apartment near CCC?
Has the time come for you to get out of the dorm and move into an off campus CCC apartment? Perhaps the options available from the Cleveland Chiropractic housing office no longer meet your needs and you would like to find a cheap apartment close to the CCC campus. If so, you can search for off campus Cleveland Chiropractic apartments with MyNewPlace's college housing search.
Although Cleveland Chiropractic student housing may be very conveniently close to campus, moving to an off campus apartment can be a great way to save money, put some distance in between yourself and an RA, get accustomed to living in your own apartment and building up rental history.
CCC apartments for rent are available close to campus and in other neighborhoods around Los Angeles, California. Using our map based university apartment finder, you can find off campus housing near campus to ensure you can still make it to class on time.
We can help you find off campus CCC apartments that will best suit your collegiate lifestyle; search Cleveland Chiropractic apartments by the number of bedrooms, price, neighborhood or a range of other amenities.
Map & Local Information
Local Talk
It's tough to live in LA without a car, but if you want an area where you can forget about your car for the weekend, try an apartment near the beach in Santa Monica or Venice Beach. Stow a beach cruiser bike in your apartment and you can go all weekend without getting in a car, with plenty of restaurants, bars, and shopping nearby.
Living in the Westwood neighborhood in Los Angeles as a college student is a guaranteed good time out. With UCLA, USC and SMC within driving distance of your apartment, college frat, sorority and sporting events are definitely in your future. If these things do not appeal to you, take a stab at Jerry’s Famous Deli for late night eats with the stars, Ohara’s where everyone will know your name or the Hollywood bowl for some of the best concerts in SoCal.
You can find the perfect Los Angeles apartment by using the filters on the search page to set the number of bedrooms and maximum rent. You can also search apartments by neighborhood by entering the neighborhood in the search box.
Happy apartment hunting!
While it is hard to define “local nightlife” in a city and county as large as Los Angles, my recommendation is based on locality that highlights the best attributes of L.A…The weather of course. Griffith Park/Los Feliz has the perfect mixture of karaoke, dive, lounges, and sports bars that are tailored within easy walking distance to the residence that reside there.
Eco friendly apartments in Los Angeles is a difficult standard by which to judge and you'd have to check with apartments individually to find out what kind of gray water or green roof types of features that their buildings incorporate.
With so much to do in Los Angeles, it's hard to pin down an ideal weekend. Outdoor lovers can begin their weekend with a trip to the sprawling Griffith Park, one of the largest urban parks in the world, and then head to the Venice Beach Boardwalk for some excellent shopping and dining. After some people watching on the boardwalk, head to one of LA's many museums, like the Natural History Museum, the J. Paul Getty Museum, or Madame Tussaud's Wax Museum. Top off your perfect Los Angeles weekend with a relaxing trip to the San Antonio Winery.
The area that is known as Downtown LA is the central business district of Los Angeles. However, it is also home to the city's Grand Avenue cultural corridor. Although the neighborhood had deteriorated somewhat after the advent of the automobile and freeways, the area has turned itself around drastically in recent years, in part due to new buildings, bars, hotels, shops, and restaurants sprouting up across the neighborhood. Located in Beverly Hills, Rodeo Drive, of course, is one of the most famous--albeit expensive--shopping destinations in the world.
Yes. In fact, Los Angeles has more museums per capita than any other city in the world. Some of the city's art museums are among the most notable. These include the Los Angeles County Museum of Art, the Getty Center, and the Museum of Contemporary Art. In addition, Gallery Row is home to a plethora of art galleries, which draws thousands during the monthly Downtown Art Walk. Other museums include the California Science Center, the Museum of Neon Art, the Natural History Museum of Los Angeles County, and the Hollywood Wax Museum.
Yes, there are quite a few local sporting events in Los Angeles. Los Angeles is home to several professional sports teams, including the Los Angeles Dodgers of Major League Baseball, the Los Angeles Kings of the National Hockey League, the Los Angeles Clippers and Los Angeles Lakers of the National Basketball Association, and the Los Angeles Sparks of the Women's National Basketball Association. For Major League Soccer, the Los Angeles Galaxy and Club Deportivo Chivas USA are based in nearby Carson, California. In addition, the week-long US Open of Surfing takes place every summer in nearby Huntington Beach, California.
That's a great question, but we have no good way to really search for that mainly because we haven't found many apartments who describe themselves or advertise themselves as being eco friendly or green. We have many articles on our blog about living green in an apartment, but we'd recommend looking at apartments that allow you to walk or bike rather than drive and have recycling and composting programs. You can inquire further to see if buildings have grey water systems or a green roof or use eco friendly paint, carpet, etc.
|
{
"pile_set_name": "Pile-CC"
}
|
Spirit Rock
Spirit Rock may refer to:
Places
Spirit Rock Meditation Center, Woodacre, Marin County, California
People
Prahlad Friedman, American professional poker player from Los Angeles, California
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Makeover for girls games
Play Little Lovely Girl Make Up for free online,more Make Up Games for girls on hotgamesforgirls.com March 1, 2015 – 02:36 am
Playing Games
My Perfect Scarf Make Up
In autumn, scarfs are the essential weapons of girls. They not only can keep warm, but also play a decorative role, they make girls look beautiful! There are many ways to tie a scarf, at the same time, it is quite an art to make a perfect scarfs and makeup.
Jewelry Design Race
You will get a jewelry design match. If you really like to design jewelry, pls come here. You could design and do the jewelry as the sample. If computer win you, you will lose! Come on!
Halloween Pumpkin Cake
A fun Halloween themed game where you get to bake pumpkin cake! Mix all the ingredients and put the cake in the oven for this pumpkin filled holiday dish. A favorite food for the American Thanksgiving celebration and also anytime jack-o?lanterns start to be in season it's great to have pumpkin cake.
A Big Picnic
With the fresh air, is it possible to have a big picnic in the forest garden? I think so, that will be a enjoyment in the life. Dress me up with fresh beautiful dress and go to have a big picnic now!
Do you like this game? Yes No
The little girl is very lovely. Her friends all like to play with her. And she is pround with that. Now help her make up and make her be more lovely.
Source: www.hotgamesforgirls.com
You might also like:
makeover games for girls
Doll Makeover Games for Girls
Gameplay Shining Girl Makeover Game
We had a camping party at that age
2006-02-08 09:54:56 by jlc4msc
And had a great blast with it. My only concern would be how cold it may get at night there? If it gets too cold, it could ruin camping out since you'd be sitting there shivering.
But really, she's 8. Just invite some friends over, play some silly little games, let them sit around and talk big girl talk, maybe do a makeover or something for the girls and she'll love it. They're still pretty easy to please at that age
Little Girl Salon (Kindle Tablet Edition)Mobile Application (LiBii)
· Spa Section
· Makeup Section
· Dress up Section
· 5 dynamic and vivid backgrounds to choose ( Special Launch! Strongly Recommend to have a try )
· 3 lovely little girls from different continents to choose
· Many pretty hair styles and hair colors to choose
· Try on dozens of different lipsticks, eye colors, eye-shadows, mascaras, and more
· A lot of colorful dresses, tops, pants and skirts to choose
· Plentiful shoes of different styles to choose
· A huge variety of decoration items, including earrings, necklaces, bracelets, and headgears
Barbie Real Makeover game for girls
Horse Games › Horse Grooming Games for Girls
Horse Breeding Games Horseland - This game is online. You join and you can play a girl or boy, choose your own horse or dog. This game is fun for little girls and teens alike. Horseland is a free online game that you can play...
Barbie Games › Barbie Video Girl's
FBI warning for new Barbie STORY HIGHLIGHTS FBI issues a cyber crime alert to law agencies about new Barbie Video Girl Alert is also inadvertently sent to media outlets Pedophiles could use the doll s videotaping feature...
Makeover Games › Girly games Room Makeover
Some activity ideas, in no particular order: You could ask her to choose an outfit for you. If that s overwhelming, then ask her to choose a single piece of an outfit. Tell her that you want to wear panties to work and ask...
Cooking Games › Powerpuff Girls Cooking games
Here is a pretty girl, she is packing dresses to go for a vacation trip. She is confused t Scooby has a new challenge now! He has to race with his shadow to win the game. Use spaceb Help Woody getting to the other side by jumping...
Fashion Games › Barbie Girl Fashion games
Barbie Girl Autumn Fashion Barbie is a girl that loves fashion. During the summer we selected loads of bikinis for her, but it is way too cold for that now. Autumn has started and Barbie would like to wear a snug warm sweater...
SNIPPETS
The United States of America (commonly abbreviated to the United States, the U.S., the USA, America, and the States) is a federal constitutional republic comprising fifty states and a federal district. The country is situated mostly in central North America, where...
Rock and roll (often written as rock & roll or rock 'n' roll) is a genre of popular music that originated and evolved in the United States during the late 1940s and early 1950s, primarily from a combination of African American blues, country, jazz, and gospel music...
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Listings custom font size in beamer
I have a beamer frame like this:
\documentclass{beamer}
\usepackage{listings}
\begin{document}
\begin{frame}[fragile]
\begin{lstlisting}[basicstyle=\tiny]
Long code
{
...
}
\end{lstlisting}
\end{frame}
\end{document}
What I need is even smaller font than \tiny - is that somehow possible?
I've also tried this:
\documentclass{beamer}
\usepackage{listings}
\begin{document}
\begin{frame}[fragile]
\fontsize{2pt}{0.5pt}
\selectfont
\begin{lstlisting}
Long code
{
...
}
\end{lstlisting}
\end{frame}
\end{document}
Which doesn't look good since some symbols - e.g. '{', '}', '<', '>' are larger.
A:
As you can tell from the warnings your MWE causes, some symbols are not available in 2pt font size and are substituted with symbols in 5pt.
I'm not really sure what the purpose of such a small font is, but as a workaround you could use the smallest available font which contains your symbols (5pt) but make the slides larger to get the same ratio between frame size and font.
The following example uses frame twice the normal size:
\documentclass{beamer}
\usepackage{listings}
\makeatletter
\setlength\beamer@paperwidth{25.60cm}
\setlength\beamer@paperheight{19.20cm}
\geometry{%
papersize={\beamer@paperwidth,\beamer@paperheight},
hmargin=2cm,%
vmargin=0cm,%
head=1cm,% might be changed later
headsep=0pt,%
foot=1cm% might be changed later
}
\makeatother
\AtBeginDocument{\fontsize{22pt}{24pt}\selectfont}
\begin{document}
\begin{frame}[fragile]
normal text
\fontsize{5pt}{7pt}
\selectfont
\begin{lstlisting}
Long code
{
...
}
\end{lstlisting}
\end{frame}
\end{document}
Another approach would be to look for a font that contains all your symbols in 2pt
|
{
"pile_set_name": "StackExchange"
}
|
Q:
How to properly call a single server from multiple actors / web handlers using Akka HTTP?
I have a service (let's call it Service A) which uses Akka Server HTTP to handle incoming requests.
Also I have 3rd party application (Service B) which provides several web services.
The purpose of service A is to transform client requests, call one or multiple web services of service B, merge/transform results and serve it back to a client.
I am using Actors for some parts, and just Future for other.
To make a call to Service B, I use Akka HTTP client.
Http.get(actorSystem).singleRequest(HttpRequest.create()
.withUri("http://127.0.0.1:8082/test"), materializer)
.onComplete(...)
The issue is, a new flow is created per each Service A request, and if there are multiple concurrent connections, it results in akka.stream.OverflowStrategy$Fail$BufferOverflowException: Exceeded configured max-open-requests value of [32] error
I already asked this question and got a suggestion to use a single Flow How to properly call Akka HTTP client for multiple (10k - 100k) requests?
While it works for a batch of requests coming from a single place, I don't know how to use a single Flow from all my concurrent request handlers.
What is the correct "Akka-way" to do it?
A:
I think you could use Source.queue to buffer your requests. The code below assume that you need to get the answer from 3rd party service, so having a Future[HttpResponse] is very welcomed. This way you could also provide an overflow strategy to prevent resource starvation.
import akka.actor.ActorSystem
import akka.http.scaladsl.Http
import akka.http.scaladsl.model.{HttpRequest, HttpResponse}
import akka.stream.scaladsl.{Keep, Sink, Source}
import akka.stream.{ActorMaterializer, OverflowStrategy}
import scala.concurrent.duration._
import scala.concurrent.{Await, Future, Promise}
import scala.util.{Failure, Success}
import scala.concurrent.ExecutionContext.Implicits.global
implicit val system = ActorSystem("main")
implicit val materializer = ActorMaterializer()
val pool = Http().cachedHostConnectionPool[Promise[HttpResponse]](host = "google.com", port = 80)
val queue = Source.queue[(HttpRequest, Promise[HttpResponse])](10, OverflowStrategy.dropNew)
.via(pool)
.toMat(Sink.foreach({
case ((Success(resp), p)) => p.success(resp)
case ((Failure(e), p)) => p.failure(e)
}))(Keep.left)
.run
val promise = Promise[HttpResponse]
val request = HttpRequest(uri = "/") -> promise
val response = queue.offer(request).flatMap(buffered => {
if (buffered) promise.future
else Future.failed(new RuntimeException())
})
Await.ready(response, 3 seconds)
(code copied from my blog post)
A:
Here is Java version of the accepted answer
final Flow<
Pair<HttpRequest, Promise<HttpResponse>>,
Pair<Try<HttpResponse>, Promise<HttpResponse>>,
NotUsed> flow =
Http.get(actorSystem).superPool(materializer);
final SourceQueue<Pair<HttpRequest, Promise<HttpResponse>>> queue = Source.<Pair<HttpRequest, Promise<HttpResponse>>>
queue(BUFFER_SIZE, OverflowStrategy.dropNew())
.via(flow)
.toMat(Sink.foreach(p -> p.second().complete(p.first())), Keep.left())
.run(materializer);
...
public CompletionStage<HttpResponse> request(HttpRequest request) {
log.debug("Making request {}", request);
Promise<HttpResponse> promise = Futures.promise();
return queue.offer(Pair.create(request, promise))
.thenCompose(buffered -> {
if (buffered instanceof QueueOfferResult.Enqueued$) {
return FutureConverters.toJava(promise.future())
.thenApply(resp -> {
if (log.isDebugEnabled()) {
log.debug("Got response {} {}", resp.status(), resp.getHeaders());
}
return resp;
});
} else {
log.error("Could not buffer request {}", request);
return CompletableFuture.completedFuture(HttpResponse.create().withStatus(StatusCodes.SERVICE_UNAVAILABLE));
}
});
}
|
{
"pile_set_name": "StackExchange"
}
|
Because 80% of product life-cycle cost is determined during the concept phase, companies should view design optimization as an important strategy for keeping overall product cost as low as possible. Design optimization also generates operational advantage by reducing lead time, defect rates, and nonconformance costs.
The “design to value” approach, which can be applied to new and existing products, identifies the most relevant sources of value, uncovers value-creating opportunities, enables cross-functional collaboration to identify potential design changes, and assesses, prioritizes, and implements the recommended changes.
Design to value is not a one-time event; rather, it’s an ongoing product development process driven by optimization of targeted design criteria. Done well, it can create significant procurement savings.
Three Steps to Design Optimization
Design to value is a three-step process that develops winning products and services at the best economics over the total product life-cycle.
Design Criteria Prioritization. What is the definition of value that is making the case for change? Use customer insights, competitive benchmarking, and other data to identify the value you’re trying to unlock, such as serving new customers or improving product quality. From there, you can identify and prioritize design criteria.
Catalyst Process. By generating fact-based ideas from cross-functional teams, external sources, and neutral parties, this process breaks down silos and addresses trade-offs for breakthrough decision-making. The goal of collaboration is to align on customer needs and product design requirements.
Execution Management. To succeed in design to value, it’s critical to set clear accountability, allow for forward-looking course corrections, and stay transparent on what matters most. An initiative-tracking tool can help monitor the project from concept to full value capture.
Any process has its unique challenges and obstacles. For the best design to value results, pay special attention to these areas:
Information and Analysis. Are you relying on gut feelings or viewing your business too narrowly? Use fact-based analysis to uncover new insights and create one version of the truth.
Execution. Is there a lack of follow-through and unrealized impact? Execution management ensures accountability and results.
Four Keys to Cultural Change
Design optimization requires a strong commitment to cultural change. To generate ongoing procurement savings, companies must embed design to value in their corporate culture. Here are four thoughts to keep in mind.
There’s always more to learn. Research and understand the differences between your products and the best your industry has to offer. Invest in knowing exactly what your customers want and how to create value for them. Internally, address any conflicting sources of information, and align your organization around a single truth that defines your objective.
Are you making full use of external and internal expertise? Do so by fostering cross-functional and collaborative processes for uncovering new insights. Don’t be afraid to ask the hard questions that may challenge the status quo and force trade-offs in design decisions.
Invest in dedicated resources for design to value, and make regular iteration cycles and ongoing cross-functional communication integral to all processes. Transition from early, top-down mandates to broad-based change, using design to value as part of a continuous improvement mindset.
Getting It Right Pays Off
Reducing complexity in consumer durables led to a $2 billion reduction of the cost base.
Through comprehensive product redesign, a rail client saw its total costs decrease by 20%.
Using a rapid diagnostic, a consumer packaged goods client realized a total savings of $30 million.
The Boston Consulting Group is an Equal Opportunity Employer. All qualified applicants will receive consideration for employment without regard to race, color, age,religion, sex, sexual orientation, gender identity / expression,national origin, protected veteran status, or any other characteristic protected under federal, state or local law,where applicable.
This website uses cookies to improve functionality and performance. If you continue browsing the site, you are giving implied consent to the use of cookies on this website. See our Cookie Policy for details.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Getting 'Coikoe' in http request instead of 'Cookie'
Our website is receiving http requests from a user which contains 'Coikoe' tag instead of 'Cookie'.
Http request object received from firefox is mentioned below :
com.pratilipi.servlet.UxModeFilter doFilter: REQUEST : GET http://www.pratilipi.com/books/gujarati HTTP/1.1
Host: http//www.pratilipi.com
User-Agent: Mozilla/5.0 (Windows NT 6.2; WOW64; rv:39.0) Gecko/20100101 Firefox/39.0
Accept: text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8
Accept-Language: en-US,en;q=0.5
Referer: http://www.pratilipi.com/?action=login
Coikoe: _gat=1; visit_count=1; page_count=2
X-AppEngine-Country: XX
X-AppEngine-Region: xx
X-AppEngine-City: XXXXXX
X-AppEngine-CityLatLong: 12.232344,12.232445
Http request object received from google chrome is mentioned below :
com.pratilipi.servlet.UxModeFilter doFilter: REQUEST : GET http//www.pratilipi.com/books/hindi HTTP/1.1
Host: http//www.pratilipi.com
Accept: text/html,application/xhtml+xml,application/xml;q=0.9,image/webp,*/*;q=0.8
User-Agent: Mozilla/5.0 (Windows NT 6.2; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/43.0.2357.132 Safari/537.36
Referer: http//www.pratilipi.com
Accept-Language: en-US,en;q=0.8,ta;q=0.6
Coikoe: _gat=1; visit_count=1; page_count=1
X-AppEngine-Country: XX
X-AppEngine-Region: xx
X-AppEngine-City: xxxxxx
X-AppEngine-CityLatLong: 12.232344,12.232445
User is using window 8 system.
Question : Why is this happening and how can I solve it? I have never seen anything like this before. Anyone has come accross anything like this
Thank You
A:
This user will be using some sort of privacy proxy.
The same happens for the Connection request header as explained in Cneonction and nnCoection HTTP headers: the proxy mangles the header so it won't be recognized by the receiver, but by merely shuffling some letters around the TCP packet's checksum will remain the same.
|
{
"pile_set_name": "StackExchange"
}
|
The Secret of NIMH (ENGLISH)
The Secret of NIMH (Jerry Goldsmith). The first Don Bluth's animated film out of his work for Disney supposed also the first score for animation written by Jerry Goldsmith. The composer insisted from the beginning on composing the music as if it was a real action movie, avoiding the traditional Mickey Mousing used in Disney's movies, point to what the producers acceded.
With a few good melodies and a great sung theme, the soundtrack was originally edited in vinyl in 1982, whereas several editions have been released later in CD with similar content.
In 2015, and after a deep search in the vault of 20th Century Fox, some of Goldsmith's masters were found, from which Intrada releases the expanded and re-mastered score. Due that the original album was containing almost the whole score, this edition does not adds great quantity of content with regard to the original edition, limiting itself to adding the lost track At Your Service, besides three extra demos of the vocal theme Flying Dreams. Also, the 2015 edition includes an expanded booklet with notes about the film and the score.
|
{
"pile_set_name": "Pile-CC"
}
|
Is Measles Here To Stay?
Enlarge this image toggle caption solidcolours/Getty Images solidcolours/Getty Images
In 2000, the Pan American Health Organization announced a monumental public health achievement: Widespread vaccination efforts, overseen by the Centers for Disease Control and Prevention, had effectively eliminated measles from the United States.
The disease, which before the vaccination era affected 3 million to 4 million people in the U.S. each year, was now isolated to small, contained outbreaks connected to international travel.
This year's record-setting outbreak threatens that achievement.
Since January, over 700 cases of measles have been reported in 22 states. Most of the affected had never been vaccinated. Sixty people have been hospitalized, and the case numbers continue to climb, although in some regions, like the Pacific Northwest, outbreaks have subsided.
Though the current numbers are dwarfed by the scale of cases in the first half of the 20th century, they're still meaningful, says René Najera, an epidemiologist and the editor of the vaccine education website History of Vaccines.
"We are getting very close to a tipping point. If cases continue to escalate, the U.S. could lose its elimination status," says Najera.
Loading...
Don't see the graphic above? Click here.
A disease is considered eliminated from a country when it can no longer be contracted within its borders, though cases tied to international travel — like those that have happened since 2000 — can still occur.
Losing elimination status would mark a failure of one of the biggest public health achievements in our history.
Before the 1960s, "measles was basically a universal experience of childhood," says James Colgrove, a public health historian at Columbia University.
Essentially everyone got it. Of the millions infected each year in the U.S., 400 to 500 would die, tens of thousands would be hospitalized and hundreds would face serious complications, like encephalitis, according to the CDC.
"People had experienced the harm measles could do and so were receptive to the vaccine when it came out," says Najera.
The first steps toward a measles vaccine were taken in 1954, when John F. Enders and Dr. Thomas C. Peebles collected throat swabs and blood samples from children at a Boston school that had just experienced an outbreak.
Enders and his lab managed to isolate and culture the measles virus and eventually adapted it to chicken embryos, later resulting in the release of a vaccine in 1963. In 1968, a more effective vaccine was developed by Maurice Hilleman and colleagues, and this is the same measles vaccine (combined with a mumps and rubella vaccine) used in the U.S. today.
"The measles vaccine was widely accepted and welcomed," says Najera. Between 1964 and 1974, the number of measles cases in the U.S. plummeted. During this time, states began adopting laws requiring proof of immunization to enroll in public schools. "These kinds of laws helped drive the immunization effort," says Colgrove.
Loading...
Don't see the graphic above? Click here.
By 1978, vaccination efforts had been going so well that the CDC set the goal of eliminating measles from the U.S. by 1982. Amesh Adalja, a physician and an infectious disease expert at Johns Hopkins University, explains that achieving elimination requires "herd immunity," or a level of immunity among a population such that the chances of vulnerable people (like infants or the immunocompromised) contracting the virus are exceedingly small.
"Measles is one of the most contagious infectious diseases, which means that you need more than 93% immunity to protect a population," says Adalja. "One dose of the vaccine turned out to not be quite enough."
In 1989, measles surged to 18,193 cases, around 40% of which occurred in vaccinated children. After that outbreak, public health officials began recommending two doses of the measles vaccine. That recommendation, in conjunction with redoubled efforts to vaccinate lower-income communities, worked. Measles rates continued to drop, allowing the Pan American Health Organization to declare the disease eliminated from the U.S. in 2000.
"It was an enormous public health achievement, particularly because measles is so contagious," says Colgrove.
Of course, in the years since, measles outbreaks have occurred, but all have stemmed from international travel. In 2014, 383 cases were reported among Ohio's Amish community, which has low vaccination rates. Two Amish men returned from typhoon relief work in the Philippines and unknowingly brought back the virus, fueling the outbreak. In 2015, an outbreak occurred at Disneyland, where 147 cases were suspected to have originated from a traveler from the Philippines.
Every outbreak since elimination was declared has eventually fizzled out, as the virus hit the wall of herd immunity, keeping the elimination status of the U.S. intact.
But now, public health officials worry that the country's elimination status could be cracking as measles mounts a comeback. "If things don't change, we could be back in a United States where measles is not eliminated," says Najera.
That would not mean that the U.S. would go back to having 3 million to 4 million people affected each year; vaccination levels are high enough to prevent that. But outbreaks would become more common.
Unvaccinated young children have the highest risk of contracting measles and developing rare but serious complications from the disease.
"Statistically speaking, once we get above 1,000 cases of measles, we're going to have a death," says Najera. "For an entirely preventable disease, that's unacceptable."
"We aren't there yet, but we are getting very close," says Najera. "If these numbers continue to climb and new cases pop up that aren't associated with foreign travel, we're there."
Most cases in the current outbreak are linked to travel, but Adalja says the longer the outbreak goes on, the harder it is to trace any given case back to an introduction by a traveler. As the outbreak simmers, the concern is that the domestic reservoir of measles is growing, making it more likely for vulnerable people to pick up an infection within U.S. borders.
The U.S. could reach that point within several months, according to Adalja. "If these chain of outbreaks continue burning for a year, we'd be in a position to question the elimination status," he says. The cause? Vaccine refusals.
"We hadn't been threatened with losing our elimination status before vaccine refusal rates went up," says Adalja. "Because of the inaction of certain individuals, they've allowed measles to come back. These are completely preventable outbreaks."
State-by-state measles, mumps and rubella, or MMR, vaccine coverage varies, ranging from 85% in Missouri to 98% in Massachusetts, according to 2017 data from the CDC. And some local communities have even lower rates.
Najera says states and local governments should be taking action now. Many already have. On April 9, the New York City health commissioner ordered all unvaccinated individuals living or working in Brooklyn to get vaccinated or face a $1,000 fine, and on April 19 a judge upheld the order. The Washington state legislature is currently considering bills to remove personal exemptions for the MMR vaccine.
"If we do everything possible to get people vaccinated, we might contain this outbreak," says Najera. "But we're not there yet."
"The 200-year history of vaccines has shown that it's always a challenge to maintain high levels of immunity because any vaccination program will inevitably become a victim of its own success," says Colgrove. "The better vaccines work, the more people think they don't need them anymore."
Jonathan Lambert is a freelance science journalist based in Washington, D.C. You can follow him on Twitter: @evolambert.
|
{
"pile_set_name": "OpenWebText2"
}
|
Fourteen anti-war activists may have made history today in a Las Vegas courtroom when they turned a misdemeanor trespassing trial into a possible referendum on America’s newfound taste for remote-controlled warfare.
|
{
"pile_set_name": "Pile-CC"
}
|
commandlinefu_id: 6853
translator:
weibo: ''
hide: true
command: |-
nmap -p 22 10.3.1.1/16 | grep -B 4 "open"
summary: |-
Get a list of ssh servers on the local subnet
|
{
"pile_set_name": "Github"
}
|
Q:
How to get physical memory and cpu used by particular process in windows?
Hi this is my code that prints the physical memory used by some process displayed in bytes , when i am converting bytes into kb by google converter. The value shown in task manager for memory usage is less than output given by my code. Also i want to know the Cpu used by the same process ?
I found this question on Stack overflow,CPU USAGE that provides guidance in knowing cpu usage,but i want to know CPU usage for some Particular process id ,instead of current process as mentioned in my code, Can i achieve the same with the code provided.
Any guidance would be appreciated.
int main( void )
{
HANDLE hProcess;
PROCESS_MEMORY_COUNTERS pmc;
DWORD processID = 4696;
// Print information about the memory usage of the process.
hProcess = OpenProcess( PROCESS_QUERY_INFORMATION |
PROCESS_VM_READ,
FALSE, processID );
if (NULL == hProcess)
return 1;
if ( GetProcessMemoryInfo( hProcess, &pmc, sizeof(pmc)) )
{
printf( "\tWorkingSetSize: %u\n", pmc.WorkingSetSize );
}
CloseHandle( hProcess );
return 0;
}
A:
CPU
From the answer linked, you want to use your 'hProcess' handle instead of the 'self' handle from the sample.
Turn this:
self = GetCurrentProcess();
GetProcessTimes(self, &ftime, &ftime, &fsys, &fuser);
...
Into this:
GetProcessTimes(hProcess, &ftime, &ftime, &fsys, &fuser);
...
Memory
The Working Set is comprised of Private (heap, stack, etc) + Shared (typically dll/exe code pages). What specific column in Task Manager (and what OS) are you referencing?
|
{
"pile_set_name": "StackExchange"
}
|
Asian Ladyboy Shiho Kanda gets fucked at Shemale Japan Hardcore. We are delighted to welcome 18-year old Shiho Kanda who makes her debut on the site today in this explosive hardcore. Shiho has appeared on our sister site Shemale Japan in three steamy solo sets so her fans have been patiently waiting for her to lose her on-screen virginity! Dressed in slutty schoolgirl attire this teen crossdresser shows she is far from innocent as she takes the cock like a true pro!
|
{
"pile_set_name": "OpenWebText2"
}
|
using System.IO;
using System.Net;
using System.Security.Principal;
using System.Web;
using NUnit.Framework;
using Umbraco.Web.WebApi.Filters;
namespace Umbraco.Tests.Web.AngularIntegration
{
[TestFixture]
public class AngularAntiForgeryTests
{
[TearDown]
public void TearDown()
{
HttpContext.Current = null;
}
[Test]
public void Can_Validate_Generated_Tokens()
{
using (var writer = new StringWriter())
{
HttpContext.Current = new HttpContext(new HttpRequest("test.html", "http://test/", ""), new HttpResponse(writer));
string cookieToken, headerToken;
AngularAntiForgeryHelper.GetTokens(out cookieToken, out headerToken);
Assert.IsTrue(AngularAntiForgeryHelper.ValidateTokens(cookieToken, headerToken));
}
}
[Test]
public void Can_Validate_Generated_Tokens_With_User()
{
using (var writer = new StringWriter())
{
HttpContext.Current = new HttpContext(new HttpRequest("test.html", "http://test/", ""), new HttpResponse(writer))
{
User = new GenericPrincipal(new HttpListenerBasicIdentity("test", "test"), new string[] {})
};
string cookieToken, headerToken;
AngularAntiForgeryHelper.GetTokens(out cookieToken, out headerToken);
Assert.IsTrue(AngularAntiForgeryHelper.ValidateTokens(cookieToken, headerToken));
}
}
}
}
|
{
"pile_set_name": "Github"
}
|
A Monte-Carlo-based and GPU-accelerated 4D-dose calculator for a pencil beam scanning proton therapy system.
The presence of respiratory motion during radiation treatment leads to degradation of the expected dose distribution, both for target coverage and healthy tissue sparing, particularly for techniques like pencil beam scanning proton therapy which have dynamic delivery systems. While tools exist to estimate this degraded four-dimensional (4D) dose, they typically have one or more deficiencies such as not including the particular effects from a dynamic delivery, using analytical dose calculations, and/or using nonphysical dose-accumulation methods. This work presents a clinically useful 4D-dose calculator that addresses each of these shortcomings. To quickly compute the 4D dose, the three main tasks of the calculator were run on graphics processing units (GPUs). These tasks were (a) simulating the delivery of the plan using measured delivery parameters to distribute the plan amongst 4DCT phases characterizing the patient breathing, (b) using an in-house Monte Carlo simulation (MC) dose calculator to determine the dose delivered to each breathing phase, and (c) accumulating the doses from the various breathing phases onto a single phase for evaluation. The accumulation was performed by individually transferring the energy and mass of dose-grid subvoxels, a technique that models the transfer of dose in a more physically realistic manner. The calculator was run on three test cases, with lung, esophagus, and liver targets, respectively, to assess the various uncertainties in the beam delivery simulation as well as to characterize the dose-accumulation technique. Four-dimensional doses were successfully computed for the three test cases with computation times ranging from 4-6 min on a server with eight NVIDIA Titan X graphics cards; the most time-consuming component was the MC dose engine. The subvoxel-based dose-accumulation technique produced stable 4D-dose distributions at subvoxel scales of 0.5-1.0 mm without impairing the total computation time. The uncertainties in the beam delivery simulation led to moderate variations of the dose-volume histograms for these cases; the variations were reduced by implementing repainting or phase-gating motion mitigation techniques in the calculator. A MC-based and GPU-accelerated 4D-dose calculator was developed to estimate the effects of respiratory motion on pencil beam scanning proton therapy treatments. After future validation, the calculator could be used to assess treatment plans and its quick runtime would make it easily usable in a future 4D-robust optimization system.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
/*
Copyright 2017 The Kubernetes Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
// This package has the automatically generated typed clients.
package v1alpha1
|
{
"pile_set_name": "Github"
}
|
/**
* Copyright (c) 2010 Yahoo! Inc. All rights reserved.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License. See accompanying LICENSE file.
*/
package org.apache.oozie.command.bundle;
import org.apache.oozie.BundleJobBean;
import org.apache.oozie.client.Job;
import org.apache.oozie.command.CommandException;
import org.apache.oozie.executor.jpa.BundleJobGetJPAExecutor;
import org.apache.oozie.service.JPAService;
import org.apache.oozie.service.Services;
import org.apache.oozie.test.XDataTestCase;
public class TestBundleJobXCommand extends XDataTestCase {
private Services services;
@Override
protected void setUp() throws Exception {
super.setUp();
services = new Services();
services.init();
cleanUpDBTables();
}
@Override
protected void tearDown() throws Exception {
services.destroy();
super.tearDown();
}
/**
* Test: submit bundle job, then check job info
*
* @throws Exception
*/
public void testBundleJobInfo1() throws Exception {
BundleJobBean job = this.addRecordToBundleJobTable(Job.Status.PREP, false);
JPAService jpaService = Services.get().get(JPAService.class);
assertNotNull(jpaService);
BundleJobGetJPAExecutor bundleJobGetjpa = new BundleJobGetJPAExecutor(job.getId());
job = jpaService.execute(bundleJobGetjpa);
assertEquals(job.getStatus(), Job.Status.PREP);
BundleJobBean bundleJob = (new BundleJobXCommand(job.getId())).call();
assertEquals(0, bundleJob.getCoordinators().size());
assertEquals(bundleJob.getStatus(), Job.Status.PREP);
assertEquals(bundleJob.getId(), job.getId());
}
/**
* Test: jobId is wrong
*
* @throws Exception
*/
public void testBundleJobInfoFailed() throws Exception {
this.addRecordToBundleJobTable(Job.Status.PREP, false);
try {
new BundleJobXCommand("bundle-id").call();
fail("Job doesn't exist. Should fail.");
}
catch (CommandException ce) {
// Job doesn't exist. Exception is expected.
}
}
}
|
{
"pile_set_name": "Github"
}
|
WASHINGTON — At least 18 infants and toddlers younger than 2 years old were separated from their parents for at least 20 days because of the Trump administration’s “zero tolerance” policy at the southwestern border, according to a report released on Friday by a House committee.
Those findings were gleaned from records that the House Oversight and Reform Committee obtained under subpoena on at least 2,648 children who were separated from their families, the youngest being just 4 months old.
Some of the children were kept apart for as long as six months and 241 of the children were kept in Border Patrol custody longer than 72 hours, some as long as a week. Under federal regulations, migrant children must be transferred to shelters managed by the Department of Health and Human Services after three days in Border Patrol custody.
“My hope is that we can all agree on several basic points,” Representative Elijah E. Cummings of Maryland, the committee chairman, said on Friday. “Anyone in the custody of our government — especially a child — must be treated humanely and with respect.”
|
{
"pile_set_name": "OpenWebText2"
}
|
Religious dogma in the Middle Ages helped create the modern domestic chicken, research suggests.
Scientists found traits such as reduced aggression, faster egg-laying and an ability to live in close proximity to other birds emerged in chickens in about AD 1000.
Chicken evolution might have been strongly influenced by the impact of Christian beliefs on what people ate.
During the Middle Ages, religious edicts enforced fasting and the exclusion of four-legged animals from menus.
However, the consumption of chickens and eggs was permitted during fasts.
Increasing urbanisation might have helped drive the evolution of modern domesticated chickens, the study, published in the journal Molecular Biology and Evolution, said.
“Ancient DNA allows us to observe how genes have changed in the past, but the problem has always been to get high enough time resolution to link genetic evolution to potential causes,” Oxford University lead researcher Dr Liisa Loog said.
“But with enough data and a novel statistical framework, we now have timings that are precise enough to correlate them with ecological and cultural shifts.”
Chickens were domesticated from Asian jungle fowl around 6000 years ago.
But the new study, which combined DNA data from archaeological chicken bones with statistical modelling, showed some of the most important features of the present-day chicken arose in the high Middle Ages during a time of soaring demand for poultry.
They traced the evolutionary history of more than 70 chickens, looking for changes in the THSR gene that determines levels of aggression.
Natural selection favoured chickens with THSR variants that helped them cope with living close to one another, the study found.
THSR variants also led to faster egg laying and a reduced fear of humans.
A thousand years ago, just 40 per cent of the chickens studied had this gene, which is present in all modern domesticated chickens.
“We tend to think that there were wild animals and then there were domestic animals rather than thinking about the selection pressures on domestic plants and animals that varied through time,” Dr Loog said.
“This study shows how easy it is to turn a trait into something that becomes fixed in an animal in an evolutionary blink of an eye.”
Remnants of ancient crops have provided researchers with clues that could help map the movement of humans across the globe more than 1300 years ago.
The University of Queensland-led international study has uncovered the first direct archaeological evidence that Madagascar was colonised by a Southeast Asian community.
UQ School of Social Science archaeologist Dr Alison Crowther said genetic research had confirmed that the inhabitants of Madagascar shared close ancestry with Southeast Asians, but archaeologists had until now struggled to find evidence of their early presence on the island.
“We have now identified 2443 individual crop remains,” she said.
“The remains were obtained through archaeological excavations at 18 ancient settlement sites in Madagascar, the Comoros and coastal eastern Africa dating back to the 7th to 12th centuries.
“What was amazing to us was the stark contrast that emerged between the crops on the east African coast and offshore islands versus those on Madagascar and the nearby Comoros Islands.
“The more we looked, the starker the contrast became.
“The samples taken from sites on Madagascar and the Comoros contained few or no African crops, but were instead dominated by species such as Asian rice, mung bean and Asian cotton,” she said.
By examining where else in the Indian Ocean these crops were grown, and drawing on historical and linguistic data, the team was able to make a strong case that the crops reached Madagascar from Island Southeast Asia.
Fellow researcher and Max Planck Institute for the Science of Human History Director of Archaeology Dr Nicole Boivin said there was still a lot to learn about the island’s past.
“But what is exciting is that we finally have a way of providing a window into the island’s highly mysterious Southeast Asian settlement and distinguishing it from settlement by mainland Africans,” she said.
“This means that archaeologists can use those remains to finally start to provide real material insights into the colonisation process.”
The research team plans to return to Madagascar to continue the work. Dr Crowther said much work remains to be done.
“We are keen to understand who these people were and what impact they had,” she said.
The team’s findings are published in Proceedings of the National Academy of Sciences.
All chickens descend from south east Asia, new archaeological research has found, with scientists dubbing these common ancestors the “great, great grandmothers of the chicken world”.
The team of researchers from the University of New England (Armidale, Australia) studied the ancient DNA – known as mitochondrial DNA – preserved within 48 archaeological chicken bones and found the same DNA signature present in bones from Europe, Thailand, the Pacific, Chile, the Dominican Republic and Spanish colonial sites in Florida.
Project researcher Dr Alison Storey says chickens have been domesticated for at least 5400 years and it has been difficult to determine the ancient origin and dispersal of chickens because of the way successive civilisations carried the domesticated poultry with them wherever they went.
“What we found is that one of the sequences in the different chicken bones was very similar over a wide geographic area. This tells us that the chickens that we found in archaeological sites all over the world shared an ancient ancestor who was domesticated somewhere in southeast Asia a long time ago,” Dr Storey told the ABC.
“All of our domestic chickens are descended from a few hens that I like to think of as the ‘great, great grandmothers’ of the chicken world,” she says.
The report, published in the journal PLos ONE, has implications for the world of human movement as much as it does for the DNA of poultry. The report says: “Understanding when chickens were transported out of domestication centres and the directions in which they were moved provides information about prehistoric migration, trade routes, and cross cultural diffusion.”
More than ten thousands of bone fragments were recovered from the Lingjing site, Henan Province during 2005 and 2006. By taking statistical analyses of the skeletal elements of the two predominant species in this assemblage, aurochs (Bos primigenius) and horse (Equus caballus), scientists from the Institute of Vertebrate Paleontology and Paleoanthropology (IVPP), Chinese Academy of Sciences, and Henan Provincial Institute of Cultural Relics and Archaeology, found that hominids at this site have already practiced sophisticated hunting techniques and subsistence strategies and may be quite familiar with the ecological and anatomical characteristics and nutritional values of the large-sized prey animals and can accordingly take different processing and handling strategies at the hunting site, as reported in the journal of Science China Earth Sciences, 2012, 55 (2).
The Lingjing site is located in the west part of Lingjing town, about 15 km to the northwest of the Xuchang City, Henan Province and stands at an elevation point of 117 m. Initially discovered in the middle of the 20th century, this site was re-excavated by researchers from the Henan Provincial Institute of Cultural Relics and Archaeology during 2005 to 2006. Within an area of about 300 m2, the Lingjing site yielded nearly 20 fragments of human fossils, 10 thousands of stone artifacts and more than 10000 pieces of animal fossils. Within the Chinese Paleolithic cultural system, it is of the transitional status between the Early and Later Paleolithic Age. Animal fossils in statistics are primarily from the stratum bearing the hominid fossils – the “Lower Cultural Layer”.
Researchers assessed the differential influences and weights of a variety of taphonomic agencies in the formation of the assemblage, and found hominid hunting and the subsequent disarticulation, slaughtering, and their transport of the bone elements of the prey species are the main factors accounting for the formation of the present assemblage.
After observing the distributional patterns of cut marks on the long bones of animals from the site, researchers found that most cut marks were on the midshaft portions of the bone (185 pieces, 98.45%), whereas only two pieces of distal epiphysis and one piece of proximal epiphysis (1.06% and 0.53%) were cut-marked. And of all the cut-marked long bones, 34% and 41% specimens belong to the upper and middle limbs of herbivores respectively, whereas only 25% belong to the lower limbs. This data suggests that hominids at the Lingjing site first accessed the animal resources prior to the carnivores and cut off the meat on the long bones.
Mortality patterns for two dominant species of the Lingjing site indicate that both animals have the mortality profiles of prime-adults dominated and accompanied by a small proportion of juvenile individuals, implying that hominids there already had relatively mature and systematical living strategies and social organizations in this period.
The distributions of the long bone circumferences and bone lengths could partially reflect the differential modifications of the hominids and carnivores on archaeofauna. The long bone circumferences of most specimens of the Lingjing assemblage is less than 25%, which is identical to that of hominid sites, but much different from that of the carnivore lairs. The lengths of 1300 pieces of long bones measured, are mostly distributed in the area of 3–6 or 6–9 cm, clearly displaying hominids’ influences on the archaeofauna at the Lingjing site.
There is a big difference between the skeletal element profiles of aurochs and horse in the Lingjing assemblage. There are relatively more fragments of horse’s skulls and mandibles, but its long bones are almost absent from the site. Perhaps, just as modern humans did, hominids always preferred to transport all the skeletal parts of the horses back to their base-camps whereas they dropped most of the bones of the aurochs in the killing sites. As compared to the artiodactyls, skeletal elements of the equids have relatively stronger muscle attachment points, and even after a more detailed field processing (such as defleshings, etc.) there will still be a large amount of nutritional components attached to the bone surfaces. If hominids dropped the bones in the field, it will inevitably have resulted in the loss of much nutrients. Furthermore, the marrow cavities within the long bones of equids are significantly smaller and its marrow content is mainly inside the spongy parts of the bones, which cannot be efficiently utilized by ancient humans.
The taphonomic study of the Lingjing site shows that this fauna is not a consequence of a large-scale hunting activity, instead it is just a final synthesis of several episodes of small-scale hunting events. For homonids with limited resources, perhaps the most sensible choice is to move those skeletal elements which still have much nutritional contents adhered, back to the base-camp, where they not only have enough time, but also have technology and capacity to extract nutrition thoroughly from those bones.
“The study of skeletal element profiles is an essential tool to reconstruct hominid behaviors, their social activities or the functions of archaeological sites”, said study lead author Dr. ZHANG Shuangquan of the IVPP, “This study initiatively identifies hominid’s differential treatment of the bones of aurochs and horse in the Paleolithic record of East Asia”.
A team led by Professor Raj Somadeva has recently made finds supporting the theory that Sri Lankan Culture is not borrowed from any other country or region, as has long been supposed. The expedition is excavating a site near Haldummulla town, 835 metres above sea level on the Southern Platform of central hills – the oldest recognisable human settlement in Sri Lanka at a significant altitude.
According to Somadeva, considerable evidence of a well organised prehistoric hunting culture and civilisation were earlier found in minor excavations and caves.
Somadeva says this represents the transition from hunting to agriculture around 3000 years ago. The stone tools and graves uncovered in Ranchamadama and Haldummulla represent more or less the same period, yet the fragments of pottery and stone tools and other archaeological evidence discovered in Ranchamadama in 2009 prove that Sri Lankan prehistoric man migrated from higher Haldummulla to lower Ranchamadama later.
As Somadeva points out, the Horton Plains which the prehistoric Sri Lankan people are believed to have inhabited is a further 600 metres above Haldummulla, itself a mountainous region. People living in the hills gradually migrated to lower plains around 5000 BCE, probably owing to the widespread drought which hit the highlands during that time. In their journey to the lower regions of the island, the people found some special stones with a high concentration of iron, trapped in the precipices, and it is these stones that have been found deposited in the graves.
In 2010 the team excavated graves on the way to Tamil Mahavidyalaya of Haldummulla – the highest elevation thus far. There they unearthed three large funeral vessels of clay resembling boats, each the size of a human body and containing burnt earth, as well as fragments of pots made with the potter’s wheel and filled with funeral ashes, and tools made of the special iron-rich stones. Remains of human habitation adjacent to the graves included tools and pottery similar to that found in the graves. The practising of funeral rites and the employment of potter’s wheel were the distinctive marks of the primitive agricultural society. The remains uncovered in Haldummulla signals prehistoric man’s transition from hunting to agriculture, however excavations are still at a experimental stage.
|
{
"pile_set_name": "Pile-CC"
}
|
She Was Enslaved by Salvadoran Guerrillas. That Makes Her Ineligible for Asylum.
She watched as Salvadoran guerrillas made her husband dig his own grave and then murdered him. She was forced to cook, clean, and wash clothes for the guerrillas under threat of death. But after she fled El Salvador for the United States, she was denied asylum. And on Wednesday, the government upheld that denial because her forced labor constituted “material support” for terrorism.
The problem for the asylum seeker, identified in legal documents by the initials ACM, is that US law prevents anyone who has engaged in “terrorist activity” from receiving protection from persecution. That includes providing material support such as a “safe house” or weapons. The question before the Justice Department’s Board of Immigration Appeals was whether cooking, cleaning, and washing clothes counted as material support. On Wednesday, the board found in a 2-1 ruling that it did.
The ruling comes as the Trump administration pushes to close “loopholes” in the asylum system that it says enable “chronic” fraud, noting that most Central Americans lose their asylum claims. In October, Attorney General Jeff Sessions attacked “dirty immigration lawyers” for their role in promoting “rampant abuse and fraud” in the asylum system. But in reality, many asylum seekers are denied because of court rulings and obscure laws like the one that prevent people like ACM from gaining asylum—people fleeing extreme persecution who would seem to be perfect candidates for asylum.
ACM was pressed into involuntary servitude by Salvadoran guerrillas in 1990, during the country’s brutal civil war. She entered the United States without authorization in 1991 and later applied for asylum. A New York immigration judge, Noel Brennan, denied her asylum claim in 2016 but blocked her from being removed from the United States under the Convention Against Torture, citing her “slavery at the hands of the guerrillas.” The Department of Homeland Security appealed that ruling later the same year, sending the case to the Board of Immigration Appeals. On Wednesday, the board upheld Brennan’s asylum decision and requested that Brennan reconsider the decision to protect her from deportation.
The board found that ACM’s domestic work “aided [guerrillas] in continuing their mission of armed and violent opposition to the Salvadoran Government.” Board members Patricia Cole and Roger Pauley, who joined the board under Presidents Bill Clinton and George W. Bush, respectively, wrote that while her “assistance may have been relatively minimal, if she had not provided the cooking and cleaning services she was forced to perform, another person would have needed to do so.”
ACM’s lawyers say they will now appeal the decision to the Second Circuit Court of Appeals in New York. Dawn Pipek Guidone, a Long Island attorney who has worked on the case pro bono since 2004, says the decision “is a travesty of justice.” Nicholas Mundy, a Brooklyn-based lawyer who is working with Guidone pro bono, says that when he first heard about the case, he couldn’t believe that the government was trying to block asylum.
Board Member Linda Wendtland, another Bush-era appointee, dissented from the Pauley and Cole’s view that cooking and cleaning “performed—as a slave—for Salvadoran guerrillas” meets the legal bar for material support. She wrote that the majority’s sweeping definition of aiding terrorists is “without effective limits and would lead to absurd results”:
[P]roviding a glass of water to a thirsty individual who happened to belong to a terrorist organization would constitute material support of that organization, because the individual otherwise would have needed to obtain water from another source. Providing medical care to a flu-stricken member of a terrorist organization would also qualify as material support, since the individual otherwise would have needed to seek help from another doctor. Myriad other everyday activities that involve the crossing of paths with individuals who happen to be members of terrorist organizations would also be covered, such as…cooking breakfast or doing laundry for one’s spouse who is a member.
Brennan said in her 2016 decision that ACM’s distress was “palpable” as she described the “physical and psychological abuse” the guerrillas inflicted. “As she told of the circumstances regarding her husband’s brutal death, she broke down, and when questioned in detail about it had further tears,” Brennan said. She would have granted asylum if ACM had not “cooked and cleaned and washed clothes and otherwise [given] what is ‘material’ support” to her captors. The material support also appeared to include being coerced into shooting at bottles and trees for weapons training. ACM said she found the training repulsive and feigned sickness so she could go back to cooking and cleaning.
An excerpt from Judge Brennan’s ruling.
The fact that her labor was performed under threat of death was, from a legal perspective, irrelevant. In 2016, the Board of Immigration Appeals ruled in a separate case that there is no exception for assisting terrorists under “duress.” That case centered on Marleny Hernandez, who ran a store and hotel in the 1990s in the small town of El Bordo, Colombia. The Revolutionary Armed Forces of Colombia, the guerrilla group known as FARC after its Spanish initials, repeatedly threatened Hernandez and demanded that she give them food and other goods from her store, according to court documents. Hernandez eventually complied. After she stopped providing assistance and let Colombian police stay in her hotel, the guerrillas attacked her town and burned down her store and hotel. A FARC commander later put a gun to her head and demanded that she stop helping the police. Hernandez fled for the United States soon after but was denied asylum.
Despite the rulings, it is not impossible for people who meet the legal definition of supporting terrorism to receive asylum. The secretaries of state and homeland security can provide a waiver for people who undertook “terrorism-related” actions that make them ineligible for immigration benefits. DHS’s website states that the “definition of terrorism-related activity is relatively broad and may apply to individuals and activities not commonly thought to be associated with terrorism.”
In Hernandez’s case, the appeals board said Congress’ authorization of the waiver is evidence that the law does not include an exception for helping terrorists under duress. Pauley and Cole cited the authority to grant waivers on Wednesday as evidence that there is no “quantitative” limit for what counts as supporting terrorism. Something is either material support or it isn’t, they decided. But to be eligible for the waiver, Guidone says her client would need to concede that she provided material support, a claim that her lawyers strongly dispute.
In February, the Second Circuit in New York denied an appeal from Hernandez. Judge Christopher Droney backed the decision but wrote in a concurring opinion that he had “serious concerns” that the waiver program did not meet US obligations under international law. The 1967 UN refugee protocol, to which the United States is a party, prohibits removing eligible asylum seekers unless they pose a security threat. Droney stated that it is clear that “Congress did not intend to allow DHS to remove otherwise-eligible asylees who do not present genuine security threats to the United States—a description that seems very likely to apply to Hernandez, and perhaps, others like her.”
The Second Circuit may soon have a chance to weigh in on whether forced labor counts as material support for terrorists. Guidone says her client will be vindicated by the appeal. Mundy adds that the case is striking a chord. “The public and the press is realizing how literally crazy that determination is,” he says. “And how unfair and unjust it is.”
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Android TranslateAnimation - Moving an image from the right side of the screen into the screen
I am desperate right now and I really really need some help. I want an image to move in from the right of the screen into it.
Initially, the image exists outside the screen area. However, based on an event, I want it to slide in.
Does anyone know how this can be done? I read in a tutorial(http://developerlife.com/tutorials/?p=343) online that if "the animation effects extend beyond the screen region then they are clipped outside those boundaries".
Hence, according to this tutorial, this is not possible. However, remember the android 2.2 lock screens? The two images (for unlocking and putting it on silence) used to slide in from left and right side of the screen respectively.
I can make my image slide in from the left side of the screen but not from the right. Any ideas on how I can get this done???
If you want to see my code, I can put it up.
A:
This is actually pretty simple. In your layout, position the ImageView to where you want it at the end of the animation and either set its visibility to INVISIBLE or GONE, depending on your layout needs. Then when the event occurs, start a TranslateAnimation with starting coordinates set using RELATIVE_TO_PARENT with the x of 1.0 (all the way to the right) and the destination x coordinates of 0.0 with type RELATIVE_TO_SELF so that your image end up in the position determined by the layout. Make sure to also turn on the visibility as you start the animation.
PS. It's important that whatever ViewGroup your ImageView is nested under extends all the way to the right of the screen. Otherwise the ImageView will be clipped against its parent's bounds.
|
{
"pile_set_name": "StackExchange"
}
|
On-line removal of volatile fatty acids from CELSS anaerobic bioreactor via nanofiltration.
The CELSS resource recovery system, which is a waste-processing system, uses aerobic and anaerobic bioreactors to recover plants nutrients and secondary foods from the inedible biomass. The anaerobic degradation of the inedible biomass, by means of culture of rumen bacteria, generates organic compounds such as volatile fatty acids (VFA) (acetic, propionic, butyric) and ammonia. The presence of VFA in the bioreactor medium at fairly low concentrations decreases the microbial population's metabolic reactions due to end-product inhibition. Technologies to remove VFA continuously from the bioreactor are of high interest. Several candidate technologies were analyzed, such as organic solvent liquid-liquid extraction, adsorption and/or ion exchange, dialysis, electrodialysis, and pressure-driven membrane separation processes. The proposed technique for the on-line removal of VFA from the anaerobic bioreactor was a nanofiltration membrane recycle bioreactor. In order to establish the nanofiltration process performance variables before coupling it to the bioreactor, a series of experiments was carried out using a 10,000 molecular weight cutoff (MWCO) tubular ceramic membrane module. The variables studied were the bioreactor slurry permeation characteristics, such as: the permeate flux, VFA and nutrient removal rates as a function of applied transmembrane pressure, fluid recirculation velocity, suspended matter concentration, and process operating time. Results indicated that the permeate flux, VFA, and nutrients removal rates are directly proportional to the fluid recirculation velocity in the range between 0.6 and 1.0 m/s, applied pressure when these are lower than 1.5 bar, and inversely proportional to the total suspended solids concentration in the range between 23,466 and 34,880 mg/L. At applied pressure higher than 1.5 bar the flux is not more linearly dependent due to concentration polarization and fouling effects over the membrane surface. It was also found that the permeate flux declines rapidly during the first 5-8 h, and then levels off with a diminishing rate of flux decay.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Direct nitric oxide imaging in cultured hippocampal neurons with diaminoanthraquinone and confocal microscopy.
A method for the direct measurement of intracellular nitric oxide (NO) production stimulated by penicillin G (PG) in cultured hippocampal neurons with diaminoanthraquinone (DAA) using laser scanning confocal microscopy (LSCM) was developed. Intracellular DAA fluorescence could specifically represent NO production based on two facts: (1) 3-morpholinosydnonimine, a NO donor, could dose-dependently increase DAA fluorescence; and (2) haemoglobin, a NO scavenger, could inhibit the increase of DAA fluorescence. The PG dose-dependently increased the intercellular level of glutamate (Glu, 5 min after stimulation) and the intracellular NO production (30 min throughout stimulation). The increase of NO production could be reversed by N(w)-nitro- l -arginine (a NO synthase inhibitor), and also by d (-)2-amino-5-phosphonovaleric acid, a subtype of Glu receptor antagonist. These results revealed that DAA could be used to indicate real-time and kinetic intracellular NO production of hippocampal neurons with higher sensitivity, specificity and accuracy.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Residual symptoms and functionality in depressed outpatients: A one-year observational study in Switzerland with escitalopram.
Residual depressive symptoms are associated with a poor prognosis for relapse or recurrence and are recognized as impeding factors of functionality. Recovery to the pre-depression level of functioning should be the goal of treatment. To evaluate outcomes in depressed outpatients treated with escitalopram regarding response, recovery, residual symptoms, functionality and ability to work over 48 weeks. 3278 outpatients were evaluated at weeks 8, 24 and 48. A simple questionnaire was used to rate severity of illness, impairment of functionality, treatment response, tolerability, presence and severity of residual symptoms, whether remission with residual symptoms or recovery was achieved, and to what degree the patient was able to work. Data over the full 48-week period were available for 75.8% of patients, for whom treatment response was rated as "very good" or "good" in 81%. However, only 42% of the completing patients achieved recovery without residual symptoms, while 41% were rated as remitters with residual symptoms. Lack of energy/motivation was the most common reported residual symptom and was present in 23.5% of patients at study end. Concentration difficulties were present in 15.8% and impaired sleep in 13.9% of patients. Complete inability to work decreased from 36% at baseline to 9% at week 48, while full-time working capacity increased from 37% to 62%. Non-controlled observational real life study using simple ratings rather than established rating scales. <50% of patients completing a one-year antidepressant treatment regimen were rated as being symptomatically fully recovered, and ≈50% still reported functional deficits.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Clinical features and prognosis of heart failure in women. A 5-year prospective study.
Although heart failure (HF) is frequent and causes significant morbidity and mortality in women, data on the prognosis of women hospitalized for a first episode of HF are scarce. This study was designed to describe the clinical characteristics and treatment of HF in women and to assess the effect of gender on long-term survival. We prospectively included consecutive patients admitted for a first episode of HF in all healthcare establishments of the Somme department (France) during the year 2000. Baseline characteristics and long-term prognosis were evaluated and compared according to gender. 799 patients were included (389 women and 410 men). Women were older, had a higher prevalence of hypertension and renal insufficiency, and a lower prevalence of coronary artery disease. Prescription of HF medication at discharge was not significantly different between women and men. The prevalence of HF with preserved ejection fraction was higher in women. Five-year overall survival rates were not significantly different between women and men (39% vs. 41%, p=0.58). Cardiovascular mortality in women with HF was comparable with that observed in men. The 5-year survival in women was dramatically lower than the expected 5-year survival of the age-matched general population of women. On multivariable analysis, older age, cancer, stroke, diabetes, renal insufficiency, and lower natraemia were independent predictors of 5-year mortality in women. The prognosis after a first episode of HF in women is severe, comparable to that observed in men, with a 5-year survival rate of 39% and a dramatic excess mortality compared to the general population of women.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Introduction
============
As a common type of inflammatory arthritis, gout is typically characterized by an elevated concentration of serum uric acid (hyperuricemia) and a subsequent deposition of monosodium urate (MSU) crystals in and around joints ([@b1-ijmm-45-04-1047]-[@b3-ijmm-45-04-1047]). The prevalence of gout in developed countries has been reported to be 1-3.9% ([@b1-ijmm-45-04-1047]-[@b3-ijmm-45-04-1047]). In addition, due to changes in dietary habits and an increasing aging population, the prevalence of gout has increased over past decades in China ([@b4-ijmm-45-04-1047],[@b5-ijmm-45-04-1047]). Patients with gout often present with metabolic diseases, including diabetes mellitus, hypertriglyceridemia and obesity, in addition to hypertension ([@b6-ijmm-45-04-1047]). In total, 16% of patients with gout exhibit ischemic heart disease and metabolic syndrome ([@b7-ijmm-45-04-1047]). Insulin resistance serves a key function in the pathogenesis of metabolic syndrome. Hyperuricemia in patients with metabolic syndrome is likely caused by insulin resistance, since insulin promotes uric acid and sodium reabsorption in the proximal tubule ([@b8-ijmm-45-04-1047],[@b9-ijmm-45-04-1047]).
Gout is etiologically heterogeneous as environmental and genetic components are involved ([@b1-ijmm-45-04-1047]-[@b3-ijmm-45-04-1047]). Although an unhealthy diet and lifestyle are risk factors for hyperuricemia, genetic factors were revealed to serve a greater function in the development of gout compared with environmental factors ([@b10-ijmm-45-04-1047]-[@b12-ijmm-45-04-1047]). Various previous genome-wide association studies (GWASs) have improved the understanding of the genes that regulate serum uric acid levels and increase susceptibility to gout ([@b13-ijmm-45-04-1047]-[@b15-ijmm-45-04-1047]). Among the loci revealed to be associated with gout, solute carrier family 2 member 9 and ATP-binding cassette super-family G member 2 (*ABCG2*) are the two most important genes identified to serve a function in gout development ([@b10-ijmm-45-04-1047]-[@b12-ijmm-45-04-1047]). Two important pathways, including renal and gut excretion of uric acid, have been revealed to regulate hyperuricemia levels, and each of these pathways are associated with glycolysis ([@b16-ijmm-45-04-1047]). However, previous studies based on GWAS research in independent individuals were only able to explain \~7% of the variance in serum urate concentrations, and only a portion of those loci were confirmed to be associated with the risk of gout ([@b17-ijmm-45-04-1047],[@b18-ijmm-45-04-1047]).
Gout is heritable and has tendency to cluster in families ([@b12-ijmm-45-04-1047],[@b19-ijmm-45-04-1047],[@b20-ijmm-45-04-1047]). In total, \~20% of patients with gout were reported to have a family history of this disease. The risk of gout is significantly higher in patients who have first-degree relatives affected by this disease compared with the normal population ([@b19-ijmm-45-04-1047]). A previous segregation and linkage analysis of familial gout revealed an autosomal-arbitrary major gene model, which indicated a genetic basis for familial gout ([@b20-ijmm-45-04-1047]). A previous population-based study was performed in a Taiwanese population to estimate the degree of familial aggregation of gout, and it was revealed that genetic factors serve a substantial function in the development of gout ([@b19-ijmm-45-04-1047]).
The present study aimed to identify the potential pathogenic genetic causes of 3 pedigrees with a familial aggregation of gout using whole-exome sequencing (WES) technology and diverse bioinformatics analysis, including genetic interaction networks, disease ontology (DO) and gene ontology analysis.
Materials and methods
=====================
Patient recruitment
-------------------
Patients (n=10) who were attending a clinic for arthritis were recruited between July 2016 and June 2017. Additionally, three families were recruited in the present study as: i) Presenting with autosomal dominant inheritance and ii) healthy family members agreed to participation in the present study. Patient information is summarised in [Table I](#tI-ijmm-45-04-1047){ref-type="table"}. The present study was conducted according to the principles outlined in the Declaration of Helsinki. The study protocol was approved by the Ethics Committee of The First Affiliated Hospital, Wenzhou Medical University (Wenzhou, China; approval no. 2018-020). Written informed consent was obtained from all participants or their guardians. Patients with gout were clinically evaluated by physicians based on the 2015 gout classification criteria by the American College of Rheumatology/European League Against Rheumatism Collaborative Initiative ([@b21-ijmm-45-04-1047]). Patients with inherited metabolic disorders, including Lesch-Nyhan syndrome, were excluded from the present study. Autoantibodies and human leukocyte antigen B27 (HLA-B27) tests were negative in all patients and X-ray analyses of the affected joints were performed to exclude other potential diseases. The classical symptoms of patients with gout are characterized by the rapid development of monoarticular arthritis, which is accompanied by swelling and redness of the first metatarsophalangeal joint (MTP1).
WES and variant calling
-----------------------
The human genome hg19 was used as the reference genome. Genomic DNA was extracted from peripheral blood leukocytes. In total, 2 *µ*g genomic DNA from each sample was sheared to fragment with a length of 150 base pairs (bp) using the Covaris S220. Subsequently, ligation of small fragments of DNA with A-tail and adapters was conducted. A genomic library was constructed subsequent to the amplification of adapter-ligated DNA using an Agilent SureSelect Library Prep kit (Agilent Technologies, Inc.) according to the manufacturer\'s protocol, and the samples from each individual were marked with a unique index. Whole-exome capture was performed using the Agilent SureSelect Human All Exon v5 kit (Agilent Technologies, Inc.) according to the manufacturer\'s protocol. High throughput sequencing was performed using an Illumina HiSeq 4000 sequencer (Illumina, Inc.).
All raw sequencing data obtained from these three families were processed in a similar manner, according to a customized bioinformatics pipeline ([@b22-ijmm-45-04-1047]). To remove sequence adapters and low-quality reads, the raw reads were filtered using the FastQC software program, version 1.11.4 (<http://www.bioin-formatics.babraham.ac.uk/projects/fastqc/>). The filtration criteria excluded Phred-scaled quality scores \<30 and read lengths \<80 bp. Subsequent to removing the low-quality reads, the remaining reads were used for further analysis. FastQ reads were aligned to the human reference genome (GRCh37/hg19) using the Burrows-Wheeler alignment tool ([@b23-ijmm-45-04-1047]) and further visualized using SplicingViewer software ([@b24-ijmm-45-04-1047]). Then, Genome Analysis ToolKit (GATK; version 4.0.10.0; <https://gatk.broadinstitute.org/hc/en-us>) was used to remove duplicated reads and reads mapped to multiple genome locations. In addition, local realignment and map quality score recalibration were performed. Candidate variants were then identified using the GATK Unified Genotype (version 4.0.10.0; <https://gatk.broadinstitute.org/hc/en-us>).
Variant annotation and prioritization
-------------------------------------
mirTrios with an integrated ANNOVAR tool were used to annotate all the detected mutations according to an in-house pipeline ([@b25-ijmm-45-04-1047]). The minor allele frequency (MAF) was obtained for each variant from publicly available databases ([@b25-ijmm-45-04-1047]), including ExAC, UK10K, dbSNP147, 1000 Genomes and ESP6500, and from in-house exome data. The detected variants with a MAF \>0.01% present in any of the aforementioned databases were removed ([@b26-ijmm-45-04-1047]). Subsequently, the effects of the detected variants were predicted using four tools: i) Polymorphism Phenotyping v2 (PolyPhen2) ([@b27-ijmm-45-04-1047]); ii) Likelihood Ratio Test (LRT) (<https://evomics.org/resources/likelihood-ratio-test/>); iii) MutationTaster ([@b28-ijmm-45-04-1047]); and iv) Functional Analysis through Hidden Markov Models (FATHMM) ([@b29-ijmm-45-04-1047]). A missense variant was considered deleterious if the variant was predicted to be deleterious or damaging by ≥3 of the four genetic prediction tools. The remaining variants were considered to be high-confidence causative variants.
Protein structural modeling
---------------------------
The amino acid sequence of human protein kinase CGMP-dependent 2 (PRKG2) was retrieved from Uniprot (<http://www.uniprot.org/uniprot/Q13237>). Crystal structures of the wild-type PRKG2 protein were obtained from the protein data bank (PDB; <http://www.rcsb.org/structure/5BV6>) and visualized using PyMol software (version 1.8) (<https://pymol.org/2/>). Homology modelling of mutated PRKG2 protein structures was performed using SWISS-MODEL (<https://swissmodelexpasy.org/>.) ([@b30-ijmm-45-04-1047]). In total, 120 residues were modelled in the PRKG2 structure, including 102 residues in the cGMP-binding region.
Collection of candidate genes for hyperuricemia and gout
--------------------------------------------------------
Various candidate genes for hyperuricemia and gout were reported in previous studies. The literature search was performed in June 2017 by searching \'gout\' AND \'genes\' in PubMed (<https://www.ncbi.nlm.nih.gov/pubmed>). Then all genes in all literature obtained were included. Following the literature search, the candidate genes associated with hyperuricemia and gout were collected and are listed in [Table SI](#SD1-ijmm-45-04-1047){ref-type="supplementary-material"}.
Construction of gene co-expression and protein-protein interaction (PPI) networks
---------------------------------------------------------------------------------
Temporally rich transcriptome data extracted from the Genotype-Tissue Expression (GTEx) project (<https://gtexportal.org/home/>, accessed January 2018) were used to build the co-expression network. The Pearson correlation coefficients (r) for the gene co-expression levels were calculated for each pairwise combination between different genes. To investigate similarities among the genes forming the PPI network and analyse their functions, significantly enriched DO terms were identified using the R package DOSE (version 2.0) and a hypergeometric test ([@b31-ijmm-45-04-1047]). To assess function similarities between previously reported genes ([Table SI](#SD1-ijmm-45-04-1047){ref-type="supplementary-material"}) associated with gout and the core risk genes identified in the present study, a PPI network was built. PPI data downloaded from STRING V10 (<https://string-db.org>) ([@b32-ijmm-45-04-1047]) were used for PPI network analysis. To further investigate the gene functions in the PPI network, biological processes (BP) analysis was conducted using ClueGO v2.3.3 ([@b33-ijmm-45-04-1047]), a plug-in of Cytoscape.
Results
=======
Characteristics of the patient cohort
-------------------------------------
The patient cohort for the present study was composed of three families ([Figs. 1A](#f1-ijmm-45-04-1047){ref-type="fig"}, [2A](#f2-ijmm-45-04-1047){ref-type="fig"} and [3](#f3-ijmm-45-04-1047){ref-type="fig"}). All patients experienced acute monoarticular arthritis affecting the MTP1 and/or knee. The affected joint made walking difficult, was painful to the touch and was occasionally accompanied by fever. Tophus was observed in some of the patients ([Fig. 1B](#f1-ijmm-45-04-1047){ref-type="fig"}), and metabolic disorders, including hypertension, diabetes and hyperlipemia, were identified. The clinical data are presented in [Table I](#tI-ijmm-45-04-1047){ref-type="table"}. The serum urate level was \>480 *µ*mol/l in most cases, and in numerous cases it was \>600 *µ*mol/l. Synovial fluid from a number of the patients presented MSU crystals and erosions based on conventional radiography of the affected joint. Autoantibodies and HLA-B27 tests were negative in all patients ([Table SII](#SD1-ijmm-45-04-1047){ref-type="supplementary-material"}). All affected patients were diagnosed with gout.
Detection of candidate deleterious mutations
--------------------------------------------
To determine the genetic etiology of these families, WES was performed in the three probands. In total, \~13.53 Gb high-quality data was obtained on mean subsequent to removing sequencing adapters and low-quality sequences ([Table SIII](#SD1-ijmm-45-04-1047){ref-type="supplementary-material"}). For each sample, ≥98.68% of the high-quality data was matched with the human reference genome Hg19. Effective sequence on target was \>4.91 Gb, with a minimum of 39.10% fraction of effective bases on target following the removal of polymerase chain reaction duplications. The mean sequencing depth for each sample was 110.16-fold, with \>99.00% of target regions being covered at a 4-fold sequencing depth, 98.50% at 10-fold depth and 97.20% at 20-fold depth. Collectively, the quality control data demonstrated a high reliability, which was fundamental for the subsequent analyses.
Subsequent to removing low-quality reads, adapters and duplicated reads from the raw sequencing data, a total of 541,954 single nucleotide variations (SNVs) and 84,415 indels were identified using the GATK tool, which included 67,707 SNVs and 2,200 indels in exonic and splicing regions. Subsequent to applying variant filtration against multiple databases, the number of rare SNVs and indels causing protein change with MAF \<0.001 was reduced to 228 and 29, respectively. As a result, following effect prediction by Polyphen2, LRT, Mutation Taster and FATHMM, the variants predicted to be deleterious by \>2 prediction tools were validated by Sanger sequencing. Finally, three SNVs in the coding regions of three gout-associated genes were retained and confirmed following Sanger sequencing validation ([Table II](#tII-ijmm-45-04-1047){ref-type="table"}).
Sanger sequencing validation and co-segregation testing
-------------------------------------------------------
Analysis of WES data indicated a missense mutation (p.Lys157Glu) in the *ABCG2* gene in the proband F1:II:1 of family 1 presenting typical symptoms of gout ([Fig. 1](#f1-ijmm-45-04-1047){ref-type="fig"} and [Table I](#tI-ijmm-45-04-1047){ref-type="table"}). The ABCG2 protein is involved in the excretion of urate from the intestine and kidney, and its dysfunction causes extrarenal urate underexcretion type ([@b34-ijmm-45-04-1047]) and/or renal urate underexcretion type gout ([@b35-ijmm-45-04-1047]). The heterozygous missense mutation (c.469A\>G) causing a lysine (Lys) to glutamic acid (Glu) substitution was located at the amino acid 157. Subsequently, Sanger sequencing confirmed the presence of this mutation in the patient\'s affected father while his unaffected mother and sister did not present the A to G change at cDNA nucleotide 469 ([Fig. 1A](#f1-ijmm-45-04-1047){ref-type="fig"}). The MAF of p.Lys157Glu was 8.24×10^−6^ and was predicted to be deleterious by all four effect prediction tools ([Table II](#tII-ijmm-45-04-1047){ref-type="table"}). Additionally, the residue 157Lys is highly conserved among different vertebrate species ([Fig. 1C](#f1-ijmm-45-04-1047){ref-type="fig"}). Subsequently, the tissue specificity of the expression of the human *ABCG2* was examined in all major tissues and organs using the Human Protein Atlas database (<https://www.proteinatlas.org>). *ABCG2* exhibited the most abundant protein expression in the small intestine ([Fig. 1D](#f1-ijmm-45-04-1047){ref-type="fig"}). The results reflected abundant mRNA expression in the luminal membrane of the intestine with 136.8 transcripts per million (TPM).
Another heterozygous missense mutation (c.752A\>G; p.Asn251Ser) located in exon 5 of *PRKG2* gene was detected in proband F2:II:1 and his affected brother F2:II:9, as well as in the patient III9 ([Fig. 2A](#f2-ijmm-45-04-1047){ref-type="fig"}). cGMP-dependent protein kinase 2 (cGKII)/*PRKG2* is involved in the regulation of aldosterone and renin secretion ([@b36-ijmm-45-04-1047]). In total, nine unaffected family members presented wild-type alleles ([Fig. 2A](#f2-ijmm-45-04-1047){ref-type="fig"}). Importantly, this mutation was not previously observed in any public database. The residue 251Asn was revealed to be evolutionarily conserved ([Fig. 2B](#f2-ijmm-45-04-1047){ref-type="fig"}) and *PRKG2* expression was identified to be enriched in the small intestine (18.36 TPM), mainly in glandular cells ([Fig. 2C](#f2-ijmm-45-04-1047){ref-type="fig"}). In the F3, the proband F3:II:1 and his two affected sons shared the same missense mutation consisting of a G to C substitution (c.12G\>C) in *ADRB3* ([Fig. 3](#f3-ijmm-45-04-1047){ref-type="fig"}). *ADRB3* is part of the adrenergic system, which is involved in the regulation of lipid metabolism and glucose homeostasis ([@b37-ijmm-45-04-1047]). This single-nucleotide change resulted in a non-synonymous substitution (p.Trp4Cys). PolyPhen2 predicted that this variant was likely damaging ([Table II](#tII-ijmm-45-04-1047){ref-type="table"}). Sanger sequencing validated that six healthy family members presented homozygous wild-type alleles for *ADRB3* ([Fig. 3](#f3-ijmm-45-04-1047){ref-type="fig"}). Similarly to the aforementioned two residues, this position was predicted to be evolutionary conserved by the GERP++ tool (<https://omictools.com/gerp-tool>).
Protein structural modeling
---------------------------
Previous GWAS studies identified single nucleotide polymorphisms (SNPs) in these three genes that were associated with gout ([@b38-ijmm-45-04-1047]-[@b40-ijmm-45-04-1047]). All SNPs and three candidate mutations identified in the present study were mapped to schematic representations of *ABCG2*, *PRKG2* and *ADRB2* genes ([Fig. 4A](#f4-ijmm-45-04-1047){ref-type="fig"}). Except for the two mutations in*PRKG2*, all the other mutations were located in the protein functional domains. Furthermore, p.Lys157Glu mutation in *ABCG2* was located in the same highly conserved ABC transporter domain as the pathogenic missense variant Gln141Lys, which has been revealed to be associated with an increase in serum uric acid levels ([@b41-ijmm-45-04-1047]). The Asn251Ser mutation was in the cGMP-binding region of *PRKG2*; however, rs768867227 and rs10033237 SNPs, which were previously reported to cause gout, were present in non-coding regions ([@b42-ijmm-45-04-1047]).
In order to further study the functional defects caused by mutations in the protein structure, the potential structural differences between the wild-type and mutant proteins were investigated. Therefore, numerous differences were identified between the wild-type and mutant *PRKG2* proteins. The wild-type structure (5BV6) was downloaded from the PDB. In the wide-type protein, there were seven hydrogen bonds at residue 251 (Asn); one bond was revealed between Asn251 and Glu191, and the other six connected Asn251 to water molecules ([Fig. 4B](#f4-ijmm-45-04-1047){ref-type="fig"}). The mutated structural modelling revealed the formation of two different hydrogen bonds, one between the mutated Ser251 and Thr250, and another between the mutated Ser251 and Tyr189 ([Fig. 4B](#f4-ijmm-45-04-1047){ref-type="fig"}).
Functional analysis of the co-expression and PPI networks
---------------------------------------------------------
Previous studies have identified that gout-associated genes are closely associated with urate excretion ([@b10-ijmm-45-04-1047]-[@b12-ijmm-45-04-1047]). To further investigate the expression pattern of the three candidate genes (*ABCG2*, *PRKG2* and *ADRB2*) identified in the present study and to examine whether their expression patterns were similar to other gout-associated genes identified in previous studies, the transcriptomic data in the small intestinal tissue from the GTEx project were analysed. Based on the co-expression network, these three genes demonstrated similar expression patterns with numerous gout-associated genes, with a Pearson correlation coefficient ranging between 0.602 and 0.898 ([Fig. 5A](#f5-ijmm-45-04-1047){ref-type="fig"}). Among these three genes, the number of candidate genes co-expressed with the *ABCG2* gene was the largest (n≤39). Furthermore, to identify functional similarities among these co-expressed genes that may have a function in the development of gout, significantly enriched DO terms were identified using the R package DOSE. Among the top ten most statistically significant DO terms with Bonferroni corrected P\<0.05 ([Fig. 5B](#f5-ijmm-45-04-1047){ref-type="fig"}; [Table SIV](#SD1-ijmm-45-04-1047){ref-type="supplementary-material"}), the majority of the terms were associated with cardiovascular and metabolic diseases, supporting the idea that gout is often accompanied by metabolic syndrome. The two directly associated terms, hyperuricemia \[false discovery rate (FDR)=8.02×10^−14^, hypergeometric test\] and gout (FDR=2.32×10^−12^, hypergeometric test) were the most statistically significant, indicating the significant enrichment of the co-expressed genes in hyperuricemia and gout.
To investigate the association between the three candidate genes and other gout candidate genes, data from the STRING v10 database were analysed. The STRING database contains PPIs, including physical and functional associations. As a result, a total of 79 candidate genes were included in the PPI network ([Fig. 6A](#f6-ijmm-45-04-1047){ref-type="fig"}) with the interaction score ranging between 150 and 967. Solute carrier family 22 member 1 exhibited the strongest interaction with *ABCG2*, which is expressed in the kidney and mediates the transport of xenobiotics, endogenous organic anions and urate ([@b43-ijmm-45-04-1047]). *PRKG2* exhibited the strongest interaction with inositol 1,4,5-trisphosphate receptor type 1, which was previously reported to be associated with high serum uric acid concentrations ([@b44-ijmm-45-04-1047]). In the next step, all 79 candidate genes in the PPI network were used in the BP with ClueGO plugin. A total of 40 enriched BP terms were divided into eight groups ([Fig. 6B](#f6-ijmm-45-04-1047){ref-type="fig"}) and terms in the same group had similar biological functions. In total, two groups served direct functions in the metabolism of uric acid, and the terms in the two groups with the most significant statistical significance were \'purine nucleoside monophosphate biosynthetic process\' and \'urate transport\'. \'Glycometabolism\' and \'anion transport\' groups were also identified following data enrichment analysis. The detailed results of the BP analysis are presented in [Table SV](#SD1-ijmm-45-04-1047){ref-type="supplementary-material"}.
Discussion
==========
Gout is a complex disorder characterised by clinical and genetic heterogeneity, and the genetic mechanism underlying gout remains unclear, mainly because i) previous studies focused on sporadic cases; and ii) genotyping chips were unable to identify rare or novel variants. To address these two critical issues, the present study aimed to reveal candidate rare/novel mutations in large pedigrees with gout aggregation. A previous complex segregation and linkage analysis of familial gout revealed an autosomal-arbitrary major gene model ([@b20-ijmm-45-04-1047]). WES is able to provide insights into the pathogeny of hereditary diseases and extend molecular diagnosis ([@b45-ijmm-45-04-1047]-[@b48-ijmm-45-04-1047]). Therefore, WES was performed in three families with gout. Subsequent to employing previously established filtering strategies, three candidate variants were identified in these three families.
In the proband F1:II:1, one novel missense mutation was revealed in *ABCG2* (c.469A\>G, p.Lys157Glu), and it was predicted to be deleterious by all four functional prediction tools.*ABCG2* has been reported to be an important factor involved in the reduction of urate transport rates ([@b40-ijmm-45-04-1047]) and in a pathway regulating fructose metabolism, which is associated with obesity ([@b13-ijmm-45-04-1047],[@b49-ijmm-45-04-1047]). The patient in F1 presenting the *ABCG2* mutation exhibited early onset-gout and was overweight, and these symptoms are in line with the pathological features of gout. The two most commonly reported dysfunctional SNPs are Gln126Ter (rs72552713) and Gln141LysK (rs2231142), which are located in the ABC domain, which is considered to be critical for the interactions between the intracellular loops of the transmembrane portion of the protein ([@b40-ijmm-45-04-1047]). The presence of the Q141K polymorphism in the ABC transporter domain was previously reported to induce a 2-fold decrease in urate efflux ([@b50-ijmm-45-04-1047]). The mutation p.Lys157Glu identified in the present study is located in the ABC transporter domain, indicating that the pathogenic mechanism of this mutation is caused by dysfunctions in this functional domain. Furthermore, a previous study has identified three common and 19 rare non-synonymous variants of *ABCG2* in patients with gout and functional assays were performed to determine the urate transport activity of each*ABCG2* variant ([@b51-ijmm-45-04-1047]). Almost all rare variants identified in the present study exhibited lower urate transport and almost completely inhibited *ABCG2* activity compared with the wild-type protein, as assessed by functional assays performed to determine the urate transport activity of each *ABCG2* variant.
The second mutation identified was present in *ADRB3*, which encodes a β-3-adrenergic receptor and has been revealed to serve an important function in the regulation of lipolysis and glucose homeostasis ([@b37-ijmm-45-04-1047],[@b39-ijmm-45-04-1047]). Hyperuricemia and gout are closely associated with metabolic disorders, including obesity, dyslipidaemia, glucose intolerance and hypertension ([@b52-ijmm-45-04-1047],[@b53-ijmm-45-04-1047]). Wang *et al* ([@b20-ijmm-45-04-1047]) and Huang *et al* ([@b54-ijmm-45-04-1047]) reported that a p.Trp64Arg variant was associated with hyperuricemia in Chinese male patients. A similar study investigating Spanish patients identified that a p.Trp64Arg polymorphism in *ADRB3* gene may increase the risk of hyperuricemia ([@b55-ijmm-45-04-1047]). Therefore, the missense mutation c.12G\>C in the *ADRB3* gene revealed in the present study was spatially near the same intracellular loop affected in the p.Trp64Arg mutation, and it is thus expected to be involved in the development of basal metabolic diseases including dyslipidaemia, which was confirmed by the fact that patients with gout in Family 3 had hyperlipemia and hyperbilirubinemia.
The third mutation identified in the present study was located in the *PRKG2* gene. Accumulating evidence has demonstrated that the cGMP signalling pathway serves important functions in urate cycles, and *PRKG2* is a cGKII gene ([@b42-ijmm-45-04-1047]). One case-control study revealed that there was a correlation between the polymorphisms rs768867227 and rs10033237 in *PRKG2*, and gout susceptibility ([@b56-ijmm-45-04-1047]). Each of these polymorphisms are located in non-coding regions. Although the biological function of combined rs10033237 and rs7688672 in the *PRKG2* gene has not been elucidated, dysfunctions in *PRKG2* may result in hypertension by destroying the renin-angiotensin-aldosterone system, and may result in hyperuricemia ([@b42-ijmm-45-04-1047]). The renin-angiotensin-aldosterone system in the patients in Family 3 carrying heterozygous missense mutations (c.752A\>G and Asn251Ser) in *PRKG2* was potentially impaired. An impaired renin-angiotensin-aldosterone system may cause hyperuricemia, which was consistent with the presence of hypertension in the patients in Family 3. Furthermore, a previous study ([@b57-ijmm-45-04-1047]) demonstrated that *PRKG2* serves a key function in mediating M1 polarization and phagocytotic activity by regulating the levels of monosodium urate and lipopolysaccharides.
Excretion of uric acid requires specialized transporters located in renal tubule cells and intestinal epithelial cells ([@b58-ijmm-45-04-1047]). Accordingly, direct intestinal secretion is considered as a substantial contributor to the extra-renal elimination of uric acid ([@b59-ijmm-45-04-1047]). It is estimated that \~30% of uric acid is excreted by the intestine ([@b60-ijmm-45-04-1047]). Numerous gout-associated genes are highly expressed in the small intestine, including *ABCG2* and *PRKG2* detected in the present study ([@b10-ijmm-45-04-1047]-[@b12-ijmm-45-04-1047]). The co-expression network revealed that gout-associated genes share similar expression patterns with *ABCG2*, *PRKG2* and *ADRB3* in the small intestine. *ABCG2* is a well-characterized urate transporter in the intestine, and the molecular function of *ABCG2* was previously identified ([@b10-ijmm-45-04-1047]-[@b12-ijmm-45-04-1047]). The functional interactions between proteins are crucial for their biological function, and their systematic characterization may increase current understanding of molecular systems biology ([@b61-ijmm-45-04-1047]). The STING network constructed using *ABCG2*, *PRKG2* and *ADRB3* contained a number of gout-associated genes, suggesting that the pathogenic mechanism of these genes may share the same pathway.
Gout is a metabolic disorder caused by urate overproduction and/or reduced urate excretion ([@b62-ijmm-45-04-1047]). According to previous studies, gout is associated with five major metabolic syndromes and/or consequences of metabolic syndrome: Hypertension, cardiovascular disease, insulin resistance and diabetes, obesity and hyperlipidaemia ([@b63-ijmm-45-04-1047]-[@b65-ijmm-45-04-1047]). In the present study, a DO analysis was performed on the genes identified in the co-expression network, and three DO terms associated with the cardiovascular system, including cardiovascular system disease, hypertension and artery disease, were in the top 10 significantly enriched terms. By directly impairing the vascular endothelium and the renal system, high serum urate levels may increase blood pressure ([@b66-ijmm-45-04-1047]). Other enriched terms were mainly associated with obesity. Following a data analysis performed on data from 517 participants in the Bogalusa Heart Study, Muntner *et al* ([@b67-ijmm-45-04-1047]) suggested that an elevated body mass index was associated with high levels of uric acid. Furthermore, the BP analysis of the genes in the PPI network contained terms including \'hexose transmembrane transport\' and \'regulation of insulin secretion\', and the two groups involved in glycose metabolism have been reported to affect the transport of uric acid ([@b68-ijmm-45-04-1047]-[@b70-ijmm-45-04-1047]). The majority of the enriched BP terms were revealed to be involved in metabolite transports, which are closely associated with urate transport.
Despite recent advancements in the understanding of the mechanism underlying gout, the number of families involved in the present study was small; therefore, the statistical power for the autosomal dominant inheritance model in gout was limited, although the model was previously proposed according to statistical analyses based on large sample sizes ([@b19-ijmm-45-04-1047],[@b20-ijmm-45-04-1047]). In addition, no functional genomics studies were performed in the present study. Therefore, the sample size of the study should be expanded to provide stronger evidence for the Mendelian genetic inheritance of gout. Copy number variations were not analysed in the present study ([@b71-ijmm-45-04-1047],[@b72-ijmm-45-04-1047]). Furthermore, functional experiments are necessary to further determine the function of the mutations detected in gout pathogenesis.
Collectively, to the best of our knowledge, the present study is the first to use WES to dissect rare or novel genetic variants using pedigree and family aggregation analyses. Among the three families, three deleterious mutations in three different gout pathogenic genes were identified. The present results increase the current knowledge of the genotypic heterogeneity underlying the phenotypic heterogeneity of gout, which assists not only clinical diagnoses but also potential personalized therapy.
Supplementary Data
==================
Not applicable.
Funding
=======
The present study was supported by the Zhejiang Provincial Natural Science Foundation (grant no. LY20H100001) and the Wenzhou Science and Technology Bureau (grant no. Y20180129).
Availability of data and materials
==================================
All the datasets generated and/or analysed in the present study are available from the corresponding author upon reasonable request.
Authors\' contributions
=======================
XX and JJ conceived and designed the study. ZC and ZZ performed the experiments. HC and CZ collected and analysed the experimental data. LZ wrote the article. LS helped revise the article. All authors read and approved the final manuscript.
Ethics approval and consent to participate
==========================================
This study was conducted according to the principles outlined in the Declaration of Helsinki. The study protocol was approved by the Ethics Committee of The First Affiliated Hospital, Wenzhou Medical University (Wenzhou, China; approval no. 2018-020). Written informed consent was obtained from all participants or their guardians.
Patient consent for publication
===============================
The patients provided written informed consent regarding the publication of the case details and any associated images.
Competing interests
===================
The authors declare that they have no competing interests.
{#f1-ijmm-45-04-1047}
{#f2-ijmm-45-04-1047}
{#f3-ijmm-45-04-1047}
{#f4-ijmm-45-04-1047}
{#f5-ijmm-45-04-1047}
{#f6-ijmm-45-04-1047}
######
Clinical data of patients with gout in three large pedigrees.
Individual ID Sex Age (years) Age at onset (years) Uric acid (mg/l) Hyperuricemia (+/−) Arthritis Tophi Comorbidities
--------------- ----- ------------- ---------------------- ------------------ --------------------- ----------- ------- --------------- ---- ---- ---- ----
F1_I:1 M 48 30 579 \+ \+ \+ \+ \+ \+ \+ −
F1_II:1 M 20 15 801 \+ \+ \+ \+ \+ − \+ −
F2_II:1 M 67 55 617 \+ \+ \+ \+ − − \+ \+
F2_II:7 M 51 38 580 \+ \+ \+ \+ − − \+ \+
F2_II:11 F 68 − 364 − − − − − − \+ −
F2_III:1 M 40 35 499 \+ \+ \+ \+ − − − \+
F2_III:9 M 34 28 610 \+ \+ − − − − \+ \+
F3_II:2 F 78 70 647 \+ \+ \+ \+ \+ − − \+
F3_III:2 F 52 52 474 \+ \+ − \+ \+ − \+ \+
F3_III:3 F 62 − 463 \+ − − \+ \+ − \+ \+
BMI, body mass index; F, female; M, male.
######
Summary of mutations detected by whole-exome sequencing of patients with gout.
Individual ID Chromosome Gene Position (hg19) Type Protein change ExAC Polyphen2 LRT MutationTaster FATHMM
--------------- ------------ --------- ----------------- ---------- ---------------- ------------- ----------------- ------------- ----------------- -----------
F1:II:1 Chr4 *ABCG2* 89052275 Missense p.K157E 8.24×10^−6^ Likely damaging Deleterious Disease causing Damaging
F2:II:1 Chr4 *PRKG2* 82090913 Missense p.N251S \- Benign Deleterious Disease causing Damaging
F3:II:1 Chr8 *ADRB3* 37823976 Missense p.W4C 6.49×10^−5^ Likely damaging Neutral Disease causing Tolerable
ABCG2, ATP-binding cassette super-family G member 2; PRKG2, protein kinase CGMP-dependent 2; ADRB3, adrenoceptor β3; Polyphen2, Polymorphism Phenotyping v2; LRT, Likelihood Ratio Test; FATHMM, Functional Analysis through Hidden Markov Models; ExAC, Exome Aggregation Consortium.
[^1]: Contributed equally
|
{
"pile_set_name": "PubMed Central"
}
|
Ex-Dortmund boss reveals Aubameyang's bad behaviour in bid to force Arsenal move
Peter Stoger has admitted that the Gabon international refused to attend team meetings during his final weeks at the club
Pierre-Emerick Aubameyang missed team meetings and refused to run during training as he sought to force through his £56 million ($73.5m) move from to , according to the side’s former coach.
Peter Stoger took over at Dortmund in December 2017 following the sacking of Peter Bosz, by which time Aubameyang was being heavily linked with a move away from the club during the January transfer window.
The Gabon international has made a promising start to life in north London, recording 19 goals in 26 appearances as the club had made its transition to life under Unai Emery, but Stoger says he was always fighting a losing battle to keep Aubameyang in .
“He left me no other choice,” the Austrian told Sport Bild .
"He trained well four days of the week. But to underline his wish for a transfer, he skipped team meetings before games or refused to run during the final training.
“We did our best to keep him for at least another half a year, but Auba wasn’t ready for that.”
Aubameyang had been linked with a move away from the Bundesliga before joining the Gunners.
In 2015 he was heavily tipped to be on the verge of moving to but the switch never materialised, and the former forward went onto have his most prolific season the following year, netting 40 goals in all competitions during 2016-17.
Aubameyang’s goals helped Emery’s side to 11 consecutive wins in the early weeks of the season, with Sunday’s strike in their 2-2 draw with - his seventh in the league this season - moving him level with Eden Hazard at the front of the race for the Premier League Golden Boot
“Honestly, I got along well with him although he kept me pretty busy for four weeks" said Stoger, who stepped down at Dortmund in the summer after guiding the side to fourth in the Bundesliga.
"But Auba personally apologised to me before joining Arsenal.
“He told me that his behaviour had nothing to do with my person and that he had felt my support.”
Arsenal will be hopeful they will not need to call Aubameyang into action when they host Blackpool in the on Wednesday, instead giving him some rest ahead of Saturday's crunch clash with .
|
{
"pile_set_name": "OpenWebText2"
}
|
import * as React from 'react'
import { StyleContext, TypeContext } from '../Lines';
import { classes, addClass } from '../Globals';
import "./Lines.css"
export interface FormGroupProps {
labelText?: React.ReactChild;
controlId?: string;
ctx: StyleContext;
labelHtmlAttributes?: React.HTMLAttributes<HTMLLabelElement>;
htmlAttributes?: React.HTMLAttributes<HTMLDivElement>;
helpText?: React.ReactChild;
children?: React.ReactNode;
}
export function FormGroup(p: FormGroupProps) {
const ctx = p.ctx;
const tCtx = ctx as TypeContext<any>;
const errorClass = tCtx.errorClass;
const errorAtts = tCtx.errorAttributes && tCtx.errorAttributes();
if (ctx.formGroupStyle == "None") {
const c = p.children as React.ReactElement<any>;
return (
<span {...p.htmlAttributes} className={errorClass} {...errorAtts}>
{c}
</span>
);
}
const labelClasses = classes(
ctx.formGroupStyle == "SrOnly" && "sr-only",
ctx.formGroupStyle == "LabelColumns" && ctx.labelColumnsCss,
ctx.formGroupStyle == "LabelColumns" ? ctx.colFormLabelClass : ctx.labelClass,
);
let pr = tCtx.propertyRoute;
var labelText = p.labelText ?? (pr?.member?.niceName);
const label = (
<label htmlFor={p.controlId} {...p.labelHtmlAttributes} className={addClass(p.labelHtmlAttributes, labelClasses)} >
{labelText}
</label>
);
const formGroupClasses = classes(p.ctx.formGroupClass, p.ctx.formGroupStyle == "LabelColumns" ? "row" : undefined, errorClass);
return (
<div
title={ctx.titleLabels && typeof labelText == "string" ? labelText : undefined}
{...p.htmlAttributes}
className={addClass(p.htmlAttributes, formGroupClasses)}
{...errorAtts}>
{ctx.formGroupStyle != "BasicDown" && label}
{
ctx.formGroupStyle != "LabelColumns" ? p.children :
(
<div className={p.ctx.valueColumnsCss} >
{p.children}
{p.helpText && ctx.formGroupStyle == "LabelColumns" && <small className="form-text text-muted">{p.helpText}</small>}
</div>
)
}
{ctx.formGroupStyle == "BasicDown" && label}
{p.helpText && ctx.formGroupStyle != "LabelColumns" && <small className="form-text text-muted">{p.helpText}</small>}
</div>
);
}
|
{
"pile_set_name": "Github"
}
|
11:54 am ET 12/9/2016Intraday data is at least 15 minutes delayed; All prices are in the local currency; Time is ET.
Stock Price Details
Shares Outstanding
19 million
Market Cap
$61 million
Return on Equity ttm
6.64%
Last Dividend
GVP:US does not pay a dividend
Earnings
EPS: Year Actual ttm
0.086
EPS: Year Est. -- ttm
--
EPS: Quarterly Actual --
0.00
EPS: Quarterly Est. --
--
Price/Earnings ttm
37.92
Relative Price/Earnings
1.860
Earnings Growth Rate
36.59
Company Description
GSE Systems, Inc. designs, develops, and delivers business and technology solutions. The Company applies process control and simulation software, systems, and services to the energy, process, and manufacturing industries worldwide. Products are used in the specialty chemical, food and beverage, petroleum refining, pharmaceutical, power generation, and metals industries.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
MySQL - ODBC connect fails, Workbench connect works
I am trying to install and test a MySQL ODBC Connector on my machine (Windows 7) to connect to a remote MySQL DB server, but, when I configure and test the connection, I keep getting the following error:
Connection Failed
[MySQL][ODBC 5.3(w) Driver]Access denied for user 'root'@'(my host)' (using password: YES):
The problem is, I can connect with MySQL Workbench (remotely - from my local machine to the remote server) just fine. I have read this FAQ extensively but it's not helping out. I have tried:
Checking if mysql is running on the server (it is. I even tried restarting it many times);
Checking if the port is listening for connection on the remote server. It is.
Connecting to the remote server using MySQL Workbench. It works.
Checking if the IP address and Ports of the remote database are correct;
Checking if the user (root) and password are correct;
Re-entering the password on the ODBC config window;
Checking and modifying the contents of the "my.conf" on the remote server to allow connections from all sides (0.0.0.0);
Including (my host) on the GRANT HOST tables from mySQL (I also tried the wildcard '%' but it's the same as nothing);
Running a FLUSH HOSTS; And FLUSH PRIVILEGES; command on the remote mySQL server to reset the privilege cache;
Turning off my Firewall during the configuration of the ODBC driver;
Checked if the MySQL variable 'skip_networking' is OFF in order to allow remote connections.
What is frustrating is that I can connect with MySQL Workbench on my local machine (with the same IP/user/password), just not with ODBC.
What could I be doing wrong, or what could be messing up my attempt to connect with ODBC?
Update: I managed to set up the ODBC driver and get it running correctly on the server side. I can connect there to the localhost using a command line (with the "isql" command). But I still can't connect over remotely with my Windows 7 machine.
A:
Solved.
As it turns out, it was a permissions problem. I ran the following command on the remote server SQL:
GRANT ALL PRIVILEGES ON *.* TO 'root'@'(my_host)' IDENTIFIED BY '(my_password)';
I had run the previous command, but without the "IDENTIFIED BY" password. Then, to reset the mysql permissions cache, I also ran
FLUSH PRIVILEGES;
And now it works.
|
{
"pile_set_name": "StackExchange"
}
|
Virulence quenching with a prenylated isoflavanone renders the Malagasy legume Dalbergia pervillei resistant to Rhodococcus fascians.
The phytopathogenic Actinomycete Rhodococcus fascians induces leafy galls on a wide range of hosts, causing major economical losses in the ornamentals industry. Although differences in the responsivity occur within species, no plant tested so far could be considered resistant to R. fascians strain D188 infection. Here, we observed that members of the genus Dalbergia, which belong to the Fabaceae, did not develop leafy galls when challenged with R. fascians and we set out to unravel the mechanism of this recalcitrance. Whereas organic extracts of Dalbergia tissues exhibited toxicity towards the bacteria, more importantly, dichloromethane bark extracts inhibited the induction of bacterial virulence gene expression without any apparent loss of viability, illustrating that resistance is likely multifactorial. The virulence quencher was identified as a new prenylated isoflavanone, termed perbergin, and specifically targeted the AttR regulon (a LysR-type transcriptional regulator) which is imperative for the switch of R. fascians from an epiphytic to a pathogenic lifestyle. The mode of action of perbergin demonstrated that just like in Gram-negative host-microbe interactions, also in Gram-positive phytopathogens autoregulation is being targeted by the plant as an efficient means of defence. Moreover, the identification of perbergin opens the path to disease control in affected nurseries.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Q:
nodejs mongodb driver native query issue
It turns a funny error in Node.js mongodb, if I put the form below:
locals.collection.find(filter, req.query);
returns me the following error:
MongoError: query selector must be an object
Now if I manually put the query works.
I'm having this problem a long time, and I've tried several ways.
locals.collection.find({slug:'somak'}, req.query);
I am using the following function:
exports.findAll = function(req, res, next) {
var locals = {},
section = req.params.section,
query = req.query,
filter = {};
if(query.filter) {
filter = query.filter.replace(/"(\w+)"\s*:/g, '$1:');
filter = filter.replace(/["]/g, "'");
}
console.log(filter);
delete query.filter;
async.series([
function(callback) {
MongoClient.connect(url, function(err, db) {
if (err) return callback(err);
locals.collection = db.collection(section);
callback();
});
},
function(callback) {
locals.collection.count(filter, function (err, result){
if (err) return callback(err);
locals.count = result;
callback();
});
},
function(callback) {
var cursor = locals.collection.find({slug:'somak'}, req.query);
if(req.query.page) {
cursor = cursor.skip(Math.abs(req.query.limit) * --req.query.page);
}
cursor.toArray(function(err, docs) {
if (err) return callback(err);
locals.docs = docs;
callback();
});
}
],
function(err) { //This function gets called after the three tasks have called their "task callbacks"
if (err) return next(err);
// Here locals will be populated with 'count' and 'docs'
res.json({
count: locals.count,
data: locals.docs
});
});
A:
Just use JSON.parse:
exports.findAll = function(req, res, next) {
var locals = {},
section = req.params.section,
query = req.query,
filter = {};
if(query.filter) {
filter = JSON.parse(query.filter);
}
delete query.filter;
...
|
{
"pile_set_name": "StackExchange"
}
|
Tuesday, February 21, 2012
How To Have Fun Following the Stock Market
Over the course of 40 years, I have been following the stock market. Obviously, I have a bit of a personal interest, but it’s also fun to make up my own mind about what it all means. And, of course, it’s a bit like rooting for a team – with the added fun that, over the long term, the stock market has gone up by about 10% per year, so you tend to win at the end of the day a bit more frequently than you lose – definitely not the case with some of my sports teams.
So let’s talk about how I might do it (bearing in mind, of course, that these are brief glimpses via a TV stock market ticker in places like restaurants or on the radio while travelling on occasional days, plus checking the results at night as part of looking for good news to go to sleep with). The first thing I do is, concentrate on the S&P 500. The Dow Jones, I have found, isn’t always representative of the overall stock market, because its selection of stocks is a bit quirky; and, of course, the NASDAQ is too heavily high-tech-weighted. The S&P contains stocks from both, and so, if the NASDAQ goes one way and the Dow goes another, as happens surprisingly often, you can pretty much count on the S&P being somewhere in the middle.
The next thing I do is remind myself that the S&P 500 does not include income from dividends. According to studies I have seen, those dividends add about 2.15% to the S&P’s return each year. So, if the S&P is down a little on a given day, I can comfort myself with the reflection that so far in the year, it has actually returned, say, 1% more than the number suggests. If you want a further comforter, S&P publishes “total return” (S&P 500 plus dividends for the year so far). And that doesn’t include reinvestment of dividends, which, if the market has gone up by 15% so far, will yield you another 0.15% by the end of the year (p.s., due to the magic of compounding, that will be nothing to sneeze at in 5 years or so). See, I’m winning already!
If I happen to be able to look at the stock market before the opening bell, the only thing I look for is “S&P futures”. That happens to be a fairly reliable indicator of where the stock market will hover around until about 2-2:30 pm … more on that later. Be careful of the name, because there’s another S&P futures market whose abbreviation is very similar, but which tends to be negative when S&P futures is positive, and vice versa.
And then there’s one more thing I can do, and pretty much do every day. That is, look to see if it’s sunny out. You see, I live near Boston, reasonably near NYC – near enough to guess what the weather is like around 8 or 8:30 in the morning, when the traders go into NYSE to prepare for the day’s session. A fascinating study a while back showed that when those traders see sunny weather outside, they tend to be more optimistic in their outlook, and so the S&P 500 tends to go up more often. And so, when it’s sunny out at that time, no matter whether it’s pouring the rest of the day, I am more likely to anticipate a good day. It’s sunny this morning! I’m going to win, yay!
Unfortunately, I find that the news rarely gives a good indication on what will move the market today, no matter when in the day you check. After many years of listening to them, I tend to distrust ex post explanations. So I just check, if I’m lucky enough to see, what is happening around 10:30-11, when the spurt of the S&P 500 to its futures level has been pretty much over for a good half hour. On the rare occasions when the futures projection is countered by sudden events, that’s when the big drops or big gains will show up. Yay! The Fed is going to give guidance today, and traders usually overestimate the effect on the positive side before they announce around 2!
If by some amazing chance I get a chance around lunch to watch the S&P 500 update on an every-half-minute basis, I can watch the dance of the buyers and sellers. The way it plays out is, these days, a surge up of less than a point as buyers buy the prices up, followed by a drop of less than a point as sellers sell the price down. It’s only after 2-3 minutes that you can see whether the overall trend is up or down – unless a thrilling jump up suddenly moves the market up by a point or more. Or an annoying big drop down interrupts the festivities. To heck with the business news – where’s the sports?
But the real surprises tend to occur around 2-2:30, when suddenly the market can go completely away from the futures prediction. It almost always is due to breaking news – the Fed, late-in-the-day government reports, political news, late news from Europe. If no break occurs then, the futures prediction is probably good for the rest of the day. Yay if it was sunny this morning!
And then the final bell rings at 4, and about 4:04 to 4:06 you get the final S&P 500 figure of the day. But, oddly enough, if the S&P is up more than 1% (these days, about 13 points), I don’t get too happy, and if it’s down more than 1%, I don’t get too sad. Because if traders really understood what was happening, there’s no way there would be jumps like that. I’m a cynical guy; as far as I’m concerned, traders can be pretty unsophisticated in their fears and enthusiasms, so what this tells me is that traders are running around like chickens because it’s going to take them forever to see that the latest news, ultimately, is no big deal. And since that kind of thing can last for months, I just sit and wait until sanity arrives, with my own idea of where the S&P 500 should be. On the other hand, if it reaches the point where Intel is at 60 times earnings (as it was in 2000), or 5 times, that’s real craziness.
Next, I factor in yearly cycles. The one I like right now (or maybe “like” is too strong) is the end-of-the-month cycle in which, I suspect, traders start trading the price back towards the value at the beginning of the month, to show gains in their monthly performance report if there are any, or because they have oversold through panic and now are just waiting until the price comes back up through lack of sellers in order to cut their losses. That tends to mean that I pay less attention starting around the 21st. Ho-hum.
The next thing I like to anticipate is the quarterly period from about Month 1 Day 15 to about early in Month 2 when companies make their earnings reports. Those companies, I really suspect, manage their numbers to analysts’ estimates. And that means, most times, many more times where the companies beat the numbers by a little, and the stock market keeps bouncing up, bit by bit. Or, there’s negative news, but the earnings reports match it until the panic goes away (or outlast the reports, in a few cases). Fun times. Less than 1% S&P 500 daily increases. Yay!
And then there is the full yearly cycle in which, many times, the “Christmas rally” tends to take place right after New Years’, followed by continued upward movement to the later part of April, followed by slow and at the end more rapid decline to mid-October, followed by comeback until the end of the year. This varies a lot, but it typically means that about 2/3 of the year is an up-tick. Yay! And if it isn’t, one of my sports teams won again. Yay!
But the best part of it all is those times during the year when the S&P 500 is really on a hot streak, or at the end of the year. If the S&P 500 is on a tear, I can sit down and fantasize what my teeny S&P 500 index fund has grown to. If I’m at the end of a down year, I can sit down and remind myself that the underlying S&P 500 is growing by 10% per year, blithely ignoring inflation and eventual capital gains taxes (don’t rain on my parade!) And at the end of the year I can raise a toast, to my teeny S&P 500 index fund that over the last 25 years of 10% average returns has grown 10-fold, to a slightly less teeny amount, and fantasize that if life were just that index fund, I would be rich, rich beyond the dreams of avarice, and that my stock-market team had therefore won the Super Bowl.
No comments:
Wayne Kernochan
About Me
I have recently retired. Before retirement, I was a long-time computer industry analyst at firms like Aberdeen Group and Yankee Group, and before that a programmer at Prime Computer and Computer Corp. of America. Sloan/MIT MBA, Cornell Computer Science Master's, and Harvard college degrees. Used to play the violin, and have written unpublished books about personal finance, violin playing, and the relationship between religion and mathematics, as well as three plays, two musicals, a screenplay on climate change, short stories, and poetry. I intend to use this blog in future both to continue to enjoy the computing field and to pursue my interests in many other areas (e.g., climate change, history, issues of the day).
|
{
"pile_set_name": "Pile-CC"
}
|
Description and variability of temporal venous vascularization: clinical relevance in temporoparietal free flap technique.
The few studies on the venous vascularization of the temporal area indicate a high variability among individuals. The preoperative knowledge of the venous vascularization of the temporal area is critical for microsurgical reconstruction, such as temporoparietal fascia free flap, and especially in understanding the anatomy of the veins for flap survival. Therefore, we conducted an anatomic study to confirm the classification of Legre et al. and a radiologic study to examine the venous network of the temporal area. We found three frequent patterns of the temporal venous network: (1) Type I (the most common), with a predominant temporal vein; (2) Type II, with a predominant posterior auricular vein; (3) Type III, when both veins were equally important. Because of this great variability, the use of a temporal flap for reconstruction of the head and neck should be restricted, and the examination of venous vascularization appears to be necessary before surgery. Here, we report a three-dimensional description of the venous temporal vascularization by computer tomography, which is particularly useful before temporoparietal flaps.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
* Exported from MasterCook *
KOUSHARI (LENTILS, MACARONI AND RICE IN OIL)
Recipe By :
Serving Size : 6 Preparation Time :0:00
Categories : Vegetarian Ethnic
Amount Measure Ingredient -- Preparation Method
-------- ------------ --------------------------------
1 c Ads iswid (brown lentils)
Water
Salt
1 c Small macaroni noodles
1 c Short grain rice
2 tb Olive oil
1 c Tomato puree
-----TA'LEYA II-----
2 lg Onions
1/4 c Olive oil
1 Garlic clove (or more)
-- finely chopped
This is classed as an 'oil' dish by Coptic Egyptians
and is prepared during periods of fasting when animal
products cannot be taken. You may cook the lentils,
macaroni and rice simultaneously in 3 pots, or if,
like me, you like to keep pots to a minimum, use the
method given. This is the way they prepare it in
Egypt anyway.
Place lentils in a sieve and wash well under running
water. Place in a large pot and add 3 cups water and
1 teaspoon salt. Bring to the boil, then simmer for 1
hour until tender but still intact. Drain and keep
aside.
Clean same pot and add 4 cups water. Bring to the
boil, add 2 teaspoons salt and the macaroni. Stir
constantly until water returns to the boil and cook,
uncovered, for 15 minutes until tender. Stir
occasionally. Drain and keep aside. Clean pot again
and dry.
Wash rice well in sieve under running water and drain.
Heat oil in pot and fry rice over medium heat for 2-3
minutes. Add 2 cups water and 1 teaspoon salt and
bring to the boil, stirring occasionally. Cover and
simmer over low heat for 15 minutes or until tender.
Leave covered off the heat for 5 minutes for grains to
separate.
Prepare the ta'leya (directions below), add tomato
puree and bring to the boil.
Add lentils and macaroni to cooked rice and toss
together lightly with a fork. Pour hot ta'leya and
tomato mixture on top, toss again and cover pot.
Leave over low heat for 10 minutes. Serve hot.
TA'LEYA: Halve peeled onions lengthwise then slice
thinly to give semicircles. Heat olive oil in a pan,
add onions and fry over medium heat until golden
brown. Add garlic and cook a minute longer.
Source: The Complete Middle East Cookbook, by Tess
Mallos Typed for you by Karen Mintzias
- - - - - - - - - - - - - - - - - -
|
{
"pile_set_name": "Pile-CC"
}
|
NUMBER 13-15-00378-CR
COURT OF APPEALS
THIRTEENTH DISTRICT OF TEXAS
CORPUS CHRISTI - EDINBURG
____________________________________________________________
JOSE GUADALUPE REYES, Appellant,
v.
THE STATE OF TEXAS, Appellee.
____________________________________________________________
On appeal from the 206th District Court
of Hidalgo County, Texas.
____________________________________________________________
MEMORANDUM OPINION
Before Chief Justice Valdez and Justices Rodriguez and Perkes
Memorandum Opinion Per Curiam
Appellant, Jose Guadalupe Reyes, attempted to perfect an appeal from a
conviction for indecency with a child. We dismiss the appeal for want of jurisdiction.
Sentence in this matter was imposed on July 10, 2015. No motion for new trial
was filed. Notice of appeal was filed on August 13, 2015. On August 14, 2015, the
Clerk of this Court notified appellant that it appeared that the appeal was not timely
perfected. Appellant was advised that the appeal would be dismissed if the defect was
not corrected within ten days from the date of receipt of the Court’s directive. Appellant
has not responded to this notice.
Texas Rule of Appellate Procedure 26.2 provides that an appeal is perfected when
notice of appeal is filed within thirty days after the day sentence is imposed or suspended
in open court unless a motion for new trial is timely filed. TEX. R. APP. P. 26.2(a)(1). The
time within which to file the notice may be enlarged if, within fifteen days after the deadline
for filing the notice, the party files the notice of appeal and a motion complying with Rule
10.5(b) of the Texas Rules of Appellate Procedure. See id. 26.3. Although the notice
of appeal herein was filed within the 15-day time period for filing a motion for extension
of time to file notice of appeal, no such motion for extension of time was filed. See id.
This Court's appellate jurisdiction in a criminal case is invoked by a timely filed
notice of appeal. Olivo v. State, 918 S.W.2d 519, 522 (Tex. Crim. App. 1996). “When
a notice of appeal is filed within the fifteen-day period but no timely motion for extension
of time is filed, the appellate court lacks jurisdiction.” Olivo, 918 S.W.2d at 522. Absent
a timely filed notice of appeal, a court of appeals does not obtain jurisdiction to address
the merits of the appeal in a criminal case and can take no action other than to dismiss
the appeal for want of jurisdiction. Slaton v. State, 981 S.W.2d 208, 210 (Tex. Crim. App.
1998).
Appellant may be entitled to an out-of-time appeal by filing a post-conviction writ
of habeas corpus returnable to the Texas Court of Criminal Appeals; however, the
availability of that remedy is beyond the jurisdiction of this Court. See TEX. CODE CRIM.
2
PROC. ANN. art. 11.07, § 3(a) (Vernon 2005); see also Ex parte Garcia, 988 S.W.2d 240
(Tex. Crim. App. 1999).
The appeal is DISMISSED FOR WANT OF JURISDICTION.
PER CURIAM
Do not publish.
TEX. R. APP. P. 47.2(b).
Delivered and filed the 17th
day of September, 2015.
3
|
{
"pile_set_name": "FreeLaw"
}
|
1 of 3 jailed Pussy Riot members freed
Nataliya Vasilyeva, Associated Press | AP
MOSCOW (AP) — A Moscow appeals court on Wednesday unexpectedly freed one of the jailed Pussy Riot members, but upheld the two-year prison sentence for the two others jailed for an irreverent protest against President Vladimir Putin.
All three women were convicted in August of hooliganism motivated by religious hatred. They argued in court on Wednesday that their impromptu performance inside Moscow's main cathedral in February was political in nature and not an attack on religion.
The Moscow City Court ruled that Yekaterina Samutsevich's sentence should be suspended because she was thrown out of the cathedral by guards before she could remove her guitar from its case and take part in the performance.
"The punishment for an incomplete crime is much lighter than for a completed one," said Samutsevich's lawyer, Irina Khrunova. "She did not participate in the actions the court found constituted hooliganism."
Dressed in neon-colored miniskirts and tights, with homemade balaclavas on their heads, the women performed a "punk prayer" asking Virgin Mary to save Russia from Putin as he headed into a March election that would hand him a third term.
"If we unintentionally offended any believers with our actions, we express our apologies," said Samutsevich, who along with Maria Alekhina and Nadezhda Tolokonnikova spoke in court from inside a glass cage known colloquially as the "aquarium."
"The idea of the protest was political, not religious," she said. "In this and in previous protests we acted against the current government of the president, and against the Russian Orthodox Church as an institution of the Russian government, against the political comments of the Russian patriarch. Exactly because of this I don't consider that I committed a crime."
The case has been condemned in the U.S. and Europe, where it has been seen as an illustration of Putin's intensifying crackdown on dissent after his return to the presidency after four years as prime minister.
Putin, however, recently said two-year sentence was justified because "It is impermissible to undermine our moral foundations, moral values, to try to destroy the country."
The appeal was postponed from Oct. 1 after Samutsevich fired her lawyers. Prosecutors criticized the move as a delaying tactic.
Her father, Stanislav Samutsevich, attributed his daughter's release mostly to the change in lawyers. He said he was deeply sorry for the two others, who are expected to be sent to a prison colony to serve out their sentences.
Defense lawyers said Putin's remarks amounted to pressure on the appeals court. "I want a ruling on President Putin on the inadmissibility of his meddling in a court decision," defense lawyer Mark Feigin said.
The Russian Orthodox Church had said the appeals court should show leniency if the three women repented. But the defendants said Wednesday that they could not repent because they harbored no religious hatred and had committed no crime. Their protest, they said, was against Putin and the church hierarchy for openly supporting his rule.
Patriarch Kirill has expressed strong support for Putin, praising his leadership as "God's miracle." He described the punk performance as part of an assault by "enemy forces" on the church.
The judge repeatedly interrupted the defendants when their statements turned to politics, but they persisted in speaking their minds.
"We will not be silent. And even if we are in Mordovia or Siberia (where prisoners in Russia are often sent to serve out their terms) we won't be silent," Alekhina said.
A lawyer representing cathedral staff, Alexei Taratukhin, said the verdict should be upheld because the women's actions "had nothing to do with politics, democracy or freedom."
Tolokonnikova appealed to Russians for understanding.
"I don't consider myself guilty. But again I ask all those who are listening to me for the last time: I don't want people to be angry at me: Yes, I'm going to prison, but I don't want anyone to think that there is any hatred in me."
Defense lawyers asked the court to take into consideration that Tolokonnikova and Alekhin both have a young child.
The Moscow City Court began Wednesday's hearing by dismissing two defense motions, including one to call more witnesses to the performance inside Christ the Savior Cathedral.
|
{
"pile_set_name": "OpenWebText2"
}
|
Stefan Dennis
Stefan Dennis (born 29 October 1958) is an Australian actor and singer best known for playing the role of cold-hearted and ruthless businessman Paul Robinson in the soap opera Neighbours from its first episode in March 1985 to the present day. He departed Neighbours in 1993, but returned in 2004 and has played Paul ever since. During his time away from Neighbours he was a cast member of Scottish soap opera River City. He is also known for his 1989 hit single "Don't It Make You Feel Good", which reached Number 16 in the Irish and UK Singles Chart.
Biography
Dennis was born in Tawonga, Victoria but his family moved to Queensland for 12 years, where he did most of his schooling. He started showing his genuine interest in music and acting at the age of seven and was eleven years old when he started in amateur theatre in Queensland. His debut with this first theatre company was in Oliver!. Also, at this time he and his brother formed a vocal duo and performed on many occasions. They played at weddings, charity events, and some large concerts.
By the age of 14, Dennis was convinced he wanted to go into the entertainment business. He understood the pitfalls associated with choosing the career of an entertainer, so he decided to get a trade behind him to support him through the times when he might be out of work. He left school at 15 and took an apprenticeship as a chef. On completion of his chef's certificate, he moved from the Gold Coast to Melbourne. In the following five years, he worked hard gaining knowledge and experience.
Dennis started out in guest roles on programmes such as Cop Shop, Skyways, Carson's Law, Young Ramsay, Prisoner, Home, The Henderson Kids, The Sullivans, The Young Doctors and many others. Dennis has a number of credits to his name. He had a major role in The Henderson Kids, a co-lead in an ABC children's show called Infinity Limited, and he co-starred in The Flying Doctors mini-series. In 1984, he auditioned for the roles of Shane Ramsay and Des Clarke in a new soap opera, Neighbours where he was later cast as Paul Robinson instead. Through the role in Neighbours came opportunities like appearing at the Royal Variety Performance along with other cast members.
After finishing Neighbours in 1992, Dennis moved to the UK and worked on a variety of TV shows and theatre productions. He appeared in many pantomimes, plays, and musicals. In 1994, he played Mickey in Blood Brothers, touring in New Zealand and Australia before returning to the UK to appear in the show in both the West End, and in a national tour of the UK. He appeared in many television shows, including Dream Team, River City, The Bill and Casualty. He also returned to Australia from time to time for guest roles in shows such as Blue Heelers, Good Guys Bad Guys and Stingers. Dennis has worked as a voiceover artist for many years both in Australia and the UK.
He was part of the team that set a new world record in 1995 for 24-hour endurance outdoor karting. The team – Stefan Dennis, David Brabham, Russ Malkin, Steve Malkin – set the record of 1664.7 km on a 1.3 km track at Brooklands, Weybridge, Surrey, UK on 24 and 25 February 1995. While in the UK, Dennis became a partner in Lex Film Entertainment, and was associate producer on the film The Truth About Love. He also met and married his wife, Gail. The couple have two sons, Cameron and Declan, and a daughter Darci. The family are now back living in Australia.
He returned to Neighbours at the end of 2004, and was a regular character once again as of 2005, signing a three-year contract which ran to the end of 2008, which he has now extended. He is the only current cast member who appeared in the first episode, although he is not the longest serving due to his long break. Of his role in Neighbours, Dennis has said that people struggle to tell the difference between himself and the character and "shy away" from him because "they think I'm going to bark at them". He has conceded that it could be a testament to his acting and says "It's a real compliment though, as people know the character that well, they actually think I am like him in real life".. As a matter of fact, although he portrays Paul Robinson as having a prosthetic leg, he has two good legs of his own.
In 2009, Dennis was stalked by two fans while presenting the Best Villain award at the British Soap Awards. He hosted a documentary special celebrating Neighbours 30th anniversary titled Neighbours 30th: The Stars Reunite, which aired in Australia and the UK in March 2015. In 2018, Dennis appeared in the recurring role of Michael Armstrong QC in the sixth series of Wentworth.
Dennis' older brother, John, was killed by a drunk driver at the age of 12. Of the sentencing, Dennis has said: "That driver was fined just $50 for what he did. And that same weekend someone who killed a koala at Currumbin Sanctuary got fined $200. So … well, that's hard." Dennis has used the incident to raise awareness about drink driving via his Twitter account.
Music
In 1989, Dennis started a side-line music career, and released the single "Don't It Make You Feel Good", which reached No. 16 in the UK Singles Chart, in May of that year. He released a second single, "This Love Affair", which reached No. 67 in the UK in October 1989.
Filmography
Television
Cop Shop
Neighbours – Paul Robinson
The Sullivans
The Young Doctors (1982)
Infinity Limited (1983) – as "Rick"
Prisoner – as "Shayne Berkley"
Young Ramsay (1 March 1980) – as "Sid Atkinson" in episode: "Gift Horse"
Prisoner (1981) – as "Peter Richards"
Five Mile Creek (3 April 1985) – as "Boy No. 2" in episode: "The Best of Mates"
The Flying Doctors (1985) (mini series) – as "Doug Hennassy"
The Henderson Kids (1985) as "Terry"
The Office (1996) – as "Nigel"
World Fun (1997) – as "Stefan C Dyson"
Blue Heelers (1 July 1997) – as "Colin Docker" in episode: "Poetic Justice"
Good Guys Bad Guys (14 April 1998) – as "Andy Caesar" in episode: "Don't Cry for Me Arch 'n' Tina"
Stingers (22 February 1999) – as "Snr. Com. Karl Hiller" in episode: "Nothing Personal"
The Big Breakfast (14 December 2001) – as himself
Dream Team (2001–2002) – as "Samuel Irving"
River City (2002–2003) – as "Dr. Marcus McKenzie"
Casualty (9 November 2002) – as "Mark Christie"
The Bill (7 May 2003) – as "Gene Bishop"
Rove Live (19 July 2005) – as Himself
Neighbours 30th: The Stars Reunite (2015) – as Himself
Wentworth (2018) – Michael Armstrong
Films
Channel Chaos (1984) – Actor as "Cameraman"
The Truth About Love (2004) – Production as associate producer – Actor as "Dougie"
Theatre
1990/91 – Robin Hood – Liverpool, UK
1991/92 – Aladdin – Southampton, UK
1992/93 – Cinderella – Bournemouth, UK
1993 – Whose Life is It Anyway? – UK Tour
1993/94 – Jack and the Beanstalk – Wimbledon, London, UK
1994 – Blood Brothers – Australia
1994 – Blood Brothers – New Zealand
1994/95 – Peter Pan – Blackpool, UK
1995 – Blood Brothers – UK
1995 – Point of Death – UK Tour
1997 – Murder by Misadventure – UK Tour
1998/99 – Aladdin – Weston-super-Mare, UK
2000 – Fool for Love – Edinburgh, UK
2007 – Aladdin – Aberdeen, UK
2009/10 – Cinderella – Wolverhampton Grand Theatre, UK
References
External links
Official Stefan Dennis Website
Photographs of Dennis as Paul Robinson
Category:Australian male film actors
Category:Australian male musical theatre actors
Category:Australian male soap opera actors
Category:Australian male television actors
Category:Australian male singers
Category:Male actors from Victoria (Australia)
Category:Living people
Category:1958 births
Category:20th-century Australian male actors
Category:20th-century Australian singers
Category:21st-century Australian male actors
Category:21st-century Australian singers
Category:20th-century male singers
Category:21st-century male singers
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Hemodynamic significance of increased lung uptake of thallium-201.
To determine the hemodynamic significance of increased lung thallium-201 uptake, resting thallium images in 23 normal subjects and 90 patients with various cardiac diseases were reviewed. Significant thallium uptake in the lung was observed in 60 cases and was especially frequently in mitral valvular disease (19 of 19 cases) and in myocardial infarction (25 of 37 cases). Chest radiographs of most of these patients showed pulmonary congestion or edema (50 or 69 cases). Pulmonary wedge pressure was measured in 25 of these patients and was significantly higher than in those of normal thallium uptake in the lung. Assessment of lung thallium uptake at the time of myocardial imaging can be used as a noninvasive means for evaluation of pulmonary venous hypertension.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Opinion issued April 16, 2004
In The
Court of Appeals
For The
First District of Texas
NO. 01–04–00144–CV
ABIODUN HENRI LAGOYE AND JOHNNY H. GEE, Appellants
V.
ETAN MIRWISS, Appellee
On Appeal from the 125th District Court
Harris County, Texas
Trial Court Cause No. 2002-37638
MEMORANDUM OPINIONAppellants Abiodun Henri Lagoye and Johnny H. Gee have neither established
indigence, nor paid all the required fees. See Tex. R. App. P. 5 (requiring payment
of fees in civil cases unless indigent), 20.1 (listing requirements for establishing
indigence); see also Tex. Gov’t Code Ann. §§ 51.207, 51.941(a), 101.041 (Vernon
Supp. 2004) (listing fees in court of appeals); Fees Civ. Cases B(1), (3) (listing fees
in court of appeals). After being notified that this appeal was subject to dismissal,
appellants Abiodun Henri Lagoye and Johnny H. Gee did not adequately respond.
See Tex. R. App. P. 5 (allowing enforcement of rule); 42.3(c) (allowing involuntary
dismissal of case).
The appeal is dismissed for nonpayment of all required fees. All pending
motions are denied.
PER CURIAM
Panel consists of Justices Taft, Higley, and Bland.
|
{
"pile_set_name": "FreeLaw"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.