text stringlengths 8 5.77M |
|---|
################################################################################
#
# dillo
#
################################################################################
DILLO_VERSION = 3.0.5
DILLO_SOURCE = dillo-$(DILLO_VERSION).tar.bz2
DILLO_SITE = http://www.dillo.org/download
DILLO_LICENSE = GPL-3.0+
DILLO_LICENSE_FILES = COPYING
# configure.ac gets patched, so autoreconf is necessary
DILLO_AUTORECONF = YES
DILLO_DEPENDENCIES = fltk zlib \
$(if $(BR2_PACKAGE_LIBICONV),libiconv)
DILLO_CONF_ENV = ac_cv_path_FLTK_CONFIG=$(STAGING_DIR)/usr/bin/fltk-config
ifeq ($(BR2_PACKAGE_OPENSSL),y)
DILLO_CONF_OPTS += --enable-ssl
DILLO_DEPENDENCIES += openssl
else
DILLO_CONF_OPTS += --disable-ssl
endif
ifeq ($(BR2_PACKAGE_LIBPNG),y)
DILLO_CONF_OPTS += --enable-png
DILLO_DEPENDENCIES += libpng
DILLO_CONF_ENV += PNG_CONFIG=$(STAGING_DIR)/usr/bin/libpng-config
else
DILLO_CONF_OPTS += --disable-png
endif
ifeq ($(BR2_PACKAGE_JPEG),y)
DILLO_CONF_OPTS += --enable-jpeg
DILLO_DEPENDENCIES += jpeg
else
DILLO_CONF_OPTS += --disable-jpeg
endif
ifeq ($(BR2_TOOLCHAIN_HAS_THREADS),y)
DILLO_CONF_OPTS += --enable-threaded-dns
else
DILLO_CONF_OPTS += --disable-threaded-dns
endif
$(eval $(autotools-package))
|
// Copyright (c) 2016 GeometryFactory (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// 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 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
// SPDX-License-Identifier: GPL-3.0+
//
//
// Author(s) : Sebastien Loriot
#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERNAL_FACE_GRAPH_UTILS_H
#define CGAL_POLYGON_MESH_PROCESSING_INTERNAL_FACE_GRAPH_UTILS_H
#include <CGAL/license/Polygon_mesh_processing/corefinement.h>
#include <CGAL/Polygon_mesh_processing/orientation.h>
#include <CGAL/property_map.h>
#include <boost/type_traits/is_const.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/type_traits/remove_reference.hpp>
#include <boost/mpl/if.hpp>
#include <fstream>
#include <sstream>
#include <set>
namespace CGAL {
namespace Polygon_mesh_processing {
namespace Corefinement {
template <typename G>
struct No_mark
{
friend bool get(No_mark<G>,
typename boost::graph_traits<G>::edge_descriptor)
{
return false;
}
friend void put(No_mark<G>,
typename boost::graph_traits<G>::edge_descriptor, bool)
{}
};
template<class G,
class EdgeMarkMap>
void mark_all_edges(G& tm, EdgeMarkMap& edge_mark_map)
{
BOOST_FOREACH(typename boost::graph_traits<G>::edge_descriptor ed,
edges(tm))
{
put(edge_mark_map, ed, true);
}
}
template<class G>
void mark_all_edges(G&, No_mark<G>&)
{} //nothing to do
template<class G,
class EdgeMarkMap,
class HalfedgeRange>
void unmark_edges( G& tm,
EdgeMarkMap& edge_mark_map,
const HalfedgeRange& hedges)
{
BOOST_FOREACH(typename boost::graph_traits<G>::halfedge_descriptor hd, hedges)
put(edge_mark_map, edge(hd, tm), false);
}
template <class G,
class HalfedgeRange>
void unmark_edges( G&,
No_mark<G>&,
const HalfedgeRange&)
{} //nothing to do
template <class G,
class edge_descriptor,
class EdgeMarkMapIn,
class EdgeMarkMapOut>
void copy_edge_mark(edge_descriptor ed_in,
edge_descriptor ed_out,
const EdgeMarkMapIn& edge_mark_map_in,
EdgeMarkMapOut& edge_mark_map_out)
{
if(get(edge_mark_map_in, ed_in))
put(edge_mark_map_out, ed_out, true);
}
template <class G,
class edge_descriptor,
class EdgeMarkMapOut>
void copy_edge_mark(edge_descriptor,
edge_descriptor,
No_mark<G>,
EdgeMarkMapOut)
{} // nothing to do
template <class G,
class edge_descriptor,
class EdgeMarkMapIn>
void copy_edge_mark(edge_descriptor,
edge_descriptor,
EdgeMarkMapIn,
No_mark<G>)
{} // nothing to do
template <class G,
class edge_descriptor>
void copy_edge_mark(edge_descriptor,
edge_descriptor,
No_mark<G>,
No_mark<G>)
{} // nothing to do
template <class G,
class EdgeMarkMapIn,
class EdgeMarkMapOut>
void copy_edge_mark(G& g,
const EdgeMarkMapIn & edge_mark_map_in,
EdgeMarkMapOut& edge_mark_map_out)
{
BOOST_FOREACH(typename boost::graph_traits<G>::edge_descriptor ed, edges(g))
if(get(edge_mark_map_in, ed))
put(edge_mark_map_out, ed, true);
}
template <class G,
class EdgeMarkMapOut>
void copy_edge_mark(G&,
const No_mark<G> &,
EdgeMarkMapOut&)
{} // nothing to do
template <class G,
class EdgeMarkMapIn>
void copy_edge_mark(G&,
const EdgeMarkMapIn&,
No_mark<G>&)
{} // nothing to do
template <class G>
void copy_edge_mark(G&,
const No_mark<G>&,
No_mark<G>&)
{} // nothing to do
// Parts to get default property maps for output meshes based on the value type
// of input vertex point maps.
template <typename Point_3, typename vertex_descriptor>
struct Dummy_default_vertex_point_map
{
typedef vertex_descriptor key_type;
typedef Point_3 value_type;
typedef Point_3 reference;
typedef boost::read_write_property_map_tag category;
inline friend
value_type
get(Dummy_default_vertex_point_map, key_type)
{
CGAL_assertion(false ||
!"This property map should not be used."
"Check the value type of the output vpm vs that of input");
return Point_3();
}
inline friend
void
put(Dummy_default_vertex_point_map, key_type, value_type)
{
CGAL_assertion(false ||
!"This property map should not be used."
"Check the value type of the output vpm vs that of input");
}
};
template <class Point_3, class NamedParameter, class PolygonMesh>
struct TweakedGetVertexPointMap
{
typedef typename GetVertexPointMap<PolygonMesh,
NamedParameter>::type Default_map;
typedef typename boost::is_same<Point_3,
typename boost::property_traits<Default_map>::value_type>::type Use_default_tag;
typedef typename boost::mpl::if_<
Use_default_tag,
Default_map,
Dummy_default_vertex_point_map<Point_3,
typename boost::graph_traits<PolygonMesh>::vertex_descriptor >
>::type type;
};
template <class PT, class NP, class PM>
boost::optional< typename TweakedGetVertexPointMap<PT, NP, PM>::type >
get_vpm(const NP& np, boost::optional<PM*> opm, boost::true_type)
{
if (boost::none == opm) return boost::none;
return boost::choose_param(
boost::get_param(np, internal_np::vertex_point),
get_property_map(boost::vertex_point, *(*opm)) );
}
template <class PT, class NP, class PM>
boost::optional< typename TweakedGetVertexPointMap<PT, NP, PM>::type >
get_vpm(const NP&, boost::optional<PM*> opm, boost::false_type)
{
if (boost::none == opm) return boost::none;
return typename TweakedGetVertexPointMap<PT, NP, PM>::type();
}
//
template <class TriangleMesh>
struct Default_visitor{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::face_descriptor face_descriptor;
void before_subface_creations(face_descriptor /*f_old*/,TriangleMesh&){}
void after_subface_creations(TriangleMesh&){}
void before_subface_created(TriangleMesh&){}
void after_subface_created(face_descriptor /*f_new*/,TriangleMesh&){}
void before_face_copy(face_descriptor /*f_old*/, TriangleMesh&, TriangleMesh&){}
void after_face_copy(face_descriptor /*f_old*/, TriangleMesh&,
face_descriptor /* f_new */, TriangleMesh&){}
// calls commented in the code and probably incomplete due to the migration
// see NODE_VISITOR_TAG
/*
void new_node_added( std::size_t node_id,
Intersection_type type,
halfedge_descriptor principal_edge,
halfedge_descriptor additional_edge,
bool is_target_coplanar,
bool is_source_coplanar)
{}
// autorefinement only
void new_node_added_triple_face(std::size_t node_id,
face_descriptor f1,
face_descriptor f2,
face_descriptor f3,
const TriangleMesh& tm)
{}
void new_vertex_added(std::size_tnode_id,
vertex_descriptor vh,
TriangleMesh& tm){}
*/
};
template < class TriangleMesh,
class VertexPointMap,
class Node_id,
class Node_vector,
class CDT,
class UserVisitor>
void
triangulate_a_face(
typename boost::graph_traits<TriangleMesh>::face_descriptor current_face,
TriangleMesh& tm,
Node_vector& nodes,
const std::vector<Node_id>& node_ids,
typename std::vector<typename boost::graph_traits<TriangleMesh>
::vertex_descriptor>& node_id_to_vertex,
std::map<std::pair<Node_id,Node_id>,
typename boost::graph_traits<TriangleMesh>
::halfedge_descriptor>& edge_to_hedge,
const CDT& cdt,
const VertexPointMap& vpm,
UserVisitor& user_visitor)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::vertex_descriptor vertex_descriptor;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::edge_descriptor edge_descriptor;
//insert the intersection point interior to the face inside the mesh and
//save their vertex_descriptor
CGAL_assertion( node_ids.size()== std::set<Node_id>(node_ids.begin(), node_ids.end()).size() );
BOOST_FOREACH(Node_id node_id, node_ids)
{
vertex_descriptor v=add_vertex(tm);
// user_visitor.new_vertex_added(node_id, v, tm); // NODE_VISITOR_TAG
nodes.call_put(vpm, v, node_id, tm);
CGAL_assertion(node_id_to_vertex.size()>node_id);
node_id_to_vertex[node_id]=v;
}
//insert the new halfedge and set their incident vertex
//grab edges that are not on the convex hull (these have already been created)
for (typename CDT::Finite_edges_iterator it=cdt.finite_edges_begin();
it!=cdt.finite_edges_end(); ++it)
{
typename CDT::Vertex_handle cdt_v0=it->first->vertex( cdt.ccw(it->second) );
typename CDT::Vertex_handle cdt_v1=it->first->vertex( cdt.cw(it->second) );
// consider edges not on the convex hull (not on the boundary of the face)
// and create the corresponding halfedges
if ( !cdt.is_infinite(it->first->vertex(it->second)) &&
!cdt.is_infinite(cdt.mirror_vertex(it->first,it->second)) )
{
edge_descriptor e=add_edge(tm);
halfedge_descriptor h=halfedge(e,tm), h_opp=opposite(h,tm);
Node_id i0=cdt_v0->info(), i1=cdt_v1->info();
CGAL_assertion( node_id_to_vertex[i0]!=GT::null_vertex());
CGAL_assertion( node_id_to_vertex[i1]!=GT::null_vertex());
vertex_descriptor v0=node_id_to_vertex[i0], v1=node_id_to_vertex[i1];
set_target(h,v0,tm);
set_target(h_opp,v1,tm);
set_halfedge(v0,h,tm);
set_halfedge(v1,h_opp,tm);
edge_to_hedge[std::make_pair(i0,i1)]=h_opp;
edge_to_hedge[std::make_pair(i1,i0)]=h;
}
}
//grab triangles.
user_visitor.before_subface_creations(current_face,tm);
for (typename CDT::Finite_faces_iterator it=cdt.finite_faces_begin(),
it_end=cdt.finite_faces_end();;)
{
typename CDT::Vertex_handle cdt_v0=it->vertex(0);
typename CDT::Vertex_handle cdt_v1=it->vertex(1);
typename CDT::Vertex_handle cdt_v2=it->vertex(2);
Node_id i0=cdt_v0->info(), i1=cdt_v1->info(), i2=cdt_v2->info();
CGAL_assertion(edge_to_hedge.count(std::make_pair(i0,i1))!= 0);
CGAL_assertion(edge_to_hedge.count(std::make_pair(i1,i2))!= 0);
CGAL_assertion(edge_to_hedge.count(std::make_pair(i2,i0))!= 0);
halfedge_descriptor h01=edge_to_hedge[std::make_pair(i0,i1)];
halfedge_descriptor h12=edge_to_hedge[std::make_pair(i1,i2)];
halfedge_descriptor h20=edge_to_hedge[std::make_pair(i2,i0)];
CGAL_assertion(target(h01,tm)==node_id_to_vertex[i1]);
CGAL_assertion(target(h12,tm)==node_id_to_vertex[i2]);
CGAL_assertion(target(h20,tm)==node_id_to_vertex[i0]);
set_next(h01,h12,tm);
set_next(h12,h20,tm);
set_next(h20,h01,tm);
//update face halfedge
set_halfedge(current_face,h01,tm);
//update face of halfedges
set_face(h01,current_face,tm);
set_face(h12,current_face,tm);
set_face(h20,current_face,tm);
if ( ++it!=it_end )
{
user_visitor.before_subface_created(tm);
current_face=add_face(tm);
user_visitor.after_subface_created(current_face,tm);
}
else
break;
}
user_visitor.after_subface_creations(tm);
}
template <class PolygonMesh>
class Border_edge_map {
typedef std::size_t Node_id;
typedef boost::graph_traits<PolygonMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::edge_descriptor edge_descriptor;
typedef boost::unordered_map<edge_descriptor,
std::pair<Node_id,Node_id> > Intersection_edge_map;
const Intersection_edge_map* intersection_edges;
const PolygonMesh* tm;
public:
// required by the property forwarder of the filtered_graph in boost
Border_edge_map()
: intersection_edges(NULL)
, tm(NULL)
{}
Border_edge_map(const Intersection_edge_map& intersection_edges,
const PolygonMesh& tm)
: intersection_edges(&intersection_edges)
, tm(&tm)
{}
friend
bool get(const Border_edge_map& map, edge_descriptor e)
{
if ( is_border(e,*map.tm) ) return false;
return map.intersection_edges->count(e)!=0;
}
};
template<class PolygonMesh>
struct Patch_description{
typedef boost::graph_traits<PolygonMesh> GT;
typedef typename GT::face_descriptor face_descriptor;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::vertex_descriptor vertex_descriptor;
std::vector<face_descriptor> faces;
std::set<vertex_descriptor> interior_vertices;
std::vector<halfedge_descriptor> interior_edges;
std::vector<halfedge_descriptor> shared_edges;
bool is_initialized;
Patch_description(): is_initialized(false) {};
};
// shared_edges will be filled by halfedges pointing in the patch
// that are inside `is_intersection_edge`, thus mesh boundary halfedges
// are not necessarily inside.
template <class PolygonMesh, class FaceIndexMap, class IsIntersectionEdge>
void extract_patch_simplices(
std::size_t patch_id,
PolygonMesh& pm,
const FaceIndexMap& fids,
const std::vector<std::size_t>& patch_ids,
std::vector<typename boost::graph_traits<PolygonMesh>::face_descriptor>& patch_faces,
std::set<typename boost::graph_traits<PolygonMesh>::vertex_descriptor>& interior_vertices,
std::vector<typename boost::graph_traits<PolygonMesh>::halfedge_descriptor>& interior_edges,
std::vector<typename boost::graph_traits<PolygonMesh>::halfedge_descriptor>& shared_edges,
const IsIntersectionEdge& is_intersection_edge)
{
typedef boost::graph_traits<PolygonMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::vertex_descriptor vertex_descriptor;
typedef typename GT::face_descriptor face_descriptor;
BOOST_FOREACH(face_descriptor f, faces(pm))
{
if ( patch_ids[ get(fids, f) ]==patch_id )
{
patch_faces.push_back( f );
BOOST_FOREACH(halfedge_descriptor h,
halfedges_around_face(halfedge(f, pm),pm))
{
if ( !is_intersection_edge.count(edge(h, pm)) )
{
if ( h < opposite(h,pm) || is_border(opposite(h,pm),pm) )
interior_edges.push_back( h );
}
else
shared_edges.push_back(h);
}
}
}
std::set<vertex_descriptor> border_vertices;
BOOST_FOREACH(halfedge_descriptor h, shared_edges)
{
border_vertices.insert( target(h,pm) );
// if the model is not closed i.e. patch_border_halfedge is not cycle-only
border_vertices.insert( source(h,pm) );
}
BOOST_FOREACH(halfedge_descriptor h, interior_edges)
{
if ( !border_vertices.count( target(h,pm) ) )
interior_vertices.insert( target(h,pm) );
if ( !border_vertices.count( source(h,pm) ) )
interior_vertices.insert( source(h,pm) );
}
}
template <class PolygonMesh, class FaceIndexMap, class IsIntersectionEdge>
struct Patch_container{
// data members
std::vector< Patch_description<PolygonMesh> > patches;
// external data members
PolygonMesh& pm;
const std::vector<std::size_t>& patch_ids;
const FaceIndexMap& fids;
const IsIntersectionEdge& is_intersection_edge;
// constructor
Patch_container(
PolygonMesh& pm,
const std::vector<std::size_t>& patch_ids,
const FaceIndexMap& fids,
const IsIntersectionEdge& is_intersection_edge,
std::size_t nb_patches
) : patches(nb_patches)
, pm(pm)
, patch_ids(patch_ids)
, fids(fids)
, is_intersection_edge(is_intersection_edge)
{}
Patch_description<PolygonMesh>& operator[](std::size_t i) {
if ( !patches[i].is_initialized )
{
extract_patch_simplices(
i, pm,
fids, patch_ids,
patches[i].faces, patches[i].interior_vertices,
patches[i].interior_edges, patches[i].shared_edges,
is_intersection_edge
);
patches[i].is_initialized=true;
}
return patches[i];
}
/// debug
std::ostream& dump_patch(std::size_t i, std::ostream& out)
{
typedef boost::graph_traits<PolygonMesh> GT;
typedef typename GT::vertex_descriptor vertex_descriptor;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::face_descriptor face_descriptor;
Patch_description<PolygonMesh>& patch=this->operator[](i);
out << "OFF\n" << patch.interior_vertices.size() +
patch.shared_edges.size();
out << " " << patch.faces.size() << " 0\n";
std::map<vertex_descriptor, int> vertexid;
int id=0;
BOOST_FOREACH(vertex_descriptor vh, patch.interior_vertices)
{
vertexid[vh]=id++;
out << get(vertex_point, pm, vh) << "\n";
}
BOOST_FOREACH(halfedge_descriptor hh, patch.shared_edges)
{
vertexid[target(hh, pm)]=id++;
out << get(vertex_point, pm, target(hh, pm)) << "\n";
}
BOOST_FOREACH(face_descriptor f, patch.faces)
{
out << "3 " << vertexid[source(halfedge(f,pm),pm)] <<
" " << vertexid[target(halfedge(f,pm),pm)] <<
" " << vertexid[target(next(halfedge(f,pm),pm),pm)] << "\n";
}
return out;
}
void dump_patches(const boost::dynamic_bitset<>& selection, std::string prefix)
{
for (std::size_t i=selection.find_first();
i < selection.npos; i = selection.find_next(i))
{
std::stringstream ss;
ss << prefix << "-" << i << ".off";
std::ofstream output(ss.str().c_str());
dump_patch(i, output);
}
}
};
template <class PolygonMesh,
class MarkedEdgeSet>
typename boost::graph_traits<PolygonMesh>::halfedge_descriptor
next_marked_halfedge_around_target_vertex(
typename boost::graph_traits<PolygonMesh>::halfedge_descriptor h,
const PolygonMesh& pm,
const MarkedEdgeSet& marked_edges)
{
CGAL_assertion( marked_edges.count(edge(h,pm))!= 0 );
typename boost::graph_traits<PolygonMesh>::halfedge_descriptor nxt =
next(h, pm);
while( !marked_edges.count(edge(nxt,pm)) )
{
nxt=next(opposite(nxt,pm),pm);
}
CGAL_assertion(nxt!=h);
return nxt;
}
template <class PolygonMesh,
class EdgeMap,
class VertexMap,
class VertexPointMap,
class VertexPointMapOut,
class IntersectionEdgeMap>
void import_polyline(
PolygonMesh& output,
typename boost::graph_traits<PolygonMesh>::halfedge_descriptor h1,
typename boost::graph_traits<PolygonMesh>::halfedge_descriptor h2,
const PolygonMesh& pm1,
const PolygonMesh& pm2,
std::size_t nb_segments,
EdgeMap& pm1_to_output_edges,
EdgeMap& pm2_to_output_edges,
VertexMap& pm1_to_output_vertices,
const IntersectionEdgeMap& intersection_edges1,
const IntersectionEdgeMap& intersection_edges2,
const VertexPointMap& vpm1,
const VertexPointMap& /*vpm2*/,
const VertexPointMapOut& vpm_out,
std::vector<typename boost::graph_traits<PolygonMesh>
::edge_descriptor>& output_shared_edges)
{
typedef boost::graph_traits<PolygonMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::vertex_descriptor vertex_descriptor;
output_shared_edges.push_back(add_edge(output));
halfedge_descriptor h_out = halfedge(output_shared_edges.back(),output);
//make sure the first vertex does not already exist
vertex_descriptor src = GT::null_vertex();
std::pair< typename VertexMap::iterator, bool > insert_res=
pm1_to_output_vertices.insert( std::make_pair( source(h1,pm1), src ) );
if( insert_res.second )
{
src = add_vertex(output);
set_halfedge(src, opposite(h_out,output),output);
put(vpm_out, src, get(vpm1, source(h1,pm1)));
insert_res.first->second = src;
}
else
src = insert_res.first->second;
//make sure the target vertex does not already exist if it is a polyline endpoint
vertex_descriptor tgt=GT::null_vertex();
if ( nb_segments==1 )
{
insert_res =
pm1_to_output_vertices.insert( std::make_pair( target(h1,pm1), tgt ) );
if( insert_res.second )
{
tgt = add_vertex(output);
set_halfedge(tgt, h_out, output);
put(vpm_out, tgt, get(vpm1, target(h1,pm1)));
insert_res.first->second = tgt;
}
else
tgt = insert_res.first->second;
}
else{
tgt = add_vertex(output);
set_halfedge(tgt, h_out, output);
put(vpm_out, tgt, get(vpm1, target(h1,pm1)));
}
//update source and target vertex of the edge created
set_target(h_out, tgt, output);
set_target(opposite(h_out,output), src, output);
halfedge_descriptor prev_out=h_out;
halfedge_descriptor prev1=h1;
halfedge_descriptor prev2=h2;
//set the correspondance
pm1_to_output_edges.insert(
std::make_pair(edge(prev1, pm1), edge(prev_out, output)) );
pm2_to_output_edges.insert(
std::make_pair(edge(prev2, pm2), edge(prev_out, output)) );
src=tgt;
for (std::size_t i=1; i<nb_segments; ++i)
{
//create new edge
output_shared_edges.push_back(add_edge(output));
h_out = halfedge(output_shared_edges.back(),output);
//get the new edge
h1 = next_marked_halfedge_around_target_vertex(prev1, pm1, intersection_edges1);
h2 = next_marked_halfedge_around_target_vertex(prev2, pm2, intersection_edges2);
//if this is the final segment, only create a target vertex if it does not exist
if (i+1!=nb_segments)
{
tgt=add_vertex(output);
set_halfedge(tgt, h_out, output);
put(vpm_out, tgt, get(vpm1, target(h1,pm1)));
}
else{
std::pair< typename VertexMap::iterator, bool > insert_res =
pm1_to_output_vertices.insert(std::make_pair(target(h1,pm1), tgt));
if (insert_res.second)
{
tgt=add_vertex(output);
set_halfedge(tgt, h_out, output);
put(vpm_out, tgt, get(vpm1, target(h1,pm1)));
insert_res.first->second = tgt;
}
else
tgt = insert_res.first->second;
}
set_target(h_out, tgt, output);
set_target(opposite(h_out, output), src, output);
prev_out=h_out;
prev1 = h1;
prev2 = h2;
src = tgt;
pm1_to_output_edges.insert(
std::make_pair(edge(prev1, pm1), edge(prev_out, output)) );
pm2_to_output_edges.insert(
std::make_pair(edge(prev2, pm2), edge(prev_out, output)) );
}
}
template <class TriangleMesh, bool reverse_patch_orientation>
struct Triangle_mesh_extension_helper;
template <class TriangleMesh>
struct Triangle_mesh_extension_helper<TriangleMesh, true>
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::edge_descriptor edge_descriptor;
typedef typename GT::face_descriptor face_descriptor;
typedef boost::unordered_map< edge_descriptor, edge_descriptor> Edge_map;
Edge_map& tm_to_output_edges;
const TriangleMesh& tm;
TriangleMesh& output;
Triangle_mesh_extension_helper(Edge_map& tm_to_output_edges,
const TriangleMesh& tm,
TriangleMesh& output)
: tm_to_output_edges(tm_to_output_edges)
, tm(tm)
, output(output)
{}
halfedge_descriptor get_hedge(halfedge_descriptor h_tm)
{
CGAL_assertion( tm_to_output_edges.count(edge(h_tm, tm))!=0 );
const std::pair<edge_descriptor, edge_descriptor>& key_and_value =
*tm_to_output_edges.find(edge(h_tm, tm));
return halfedge(key_and_value.first,tm) != h_tm
? halfedge(key_and_value.second, output)
: opposite(halfedge(key_and_value.second, output), output);
}
cpp11::array<halfedge_descriptor,3>
halfedges(face_descriptor f)
{
halfedge_descriptor h=halfedge(f,tm);
return make_array( get_hedge( h ),
get_hedge( prev(h,tm) ),
get_hedge( next(h,tm) ) );
}
};
template <class TriangleMesh>
struct Triangle_mesh_extension_helper<TriangleMesh, false>
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::edge_descriptor edge_descriptor;
typedef typename GT::face_descriptor face_descriptor;
typedef boost::unordered_map< edge_descriptor, edge_descriptor> Edge_map;
Edge_map& tm_to_output_edges;
const TriangleMesh& tm;
TriangleMesh& output;
Triangle_mesh_extension_helper(Edge_map& tm_to_output_edges,
const TriangleMesh& tm,
TriangleMesh& output)
: tm_to_output_edges(tm_to_output_edges)
, tm(tm)
, output(output)
{}
halfedge_descriptor get_hedge(halfedge_descriptor h_tm)
{
CGAL_assertion( tm_to_output_edges.count(edge(h_tm, tm))!=0 );
const std::pair<edge_descriptor, edge_descriptor>& key_and_value =
*tm_to_output_edges.find(edge(h_tm, tm));
return halfedge(key_and_value.first,tm) == h_tm
? halfedge(key_and_value.second, output)
: opposite(halfedge(key_and_value.second, output), output);
}
cpp11::array<halfedge_descriptor,3>
halfedges(face_descriptor f)
{
halfedge_descriptor h=halfedge(f,tm);
return make_array( get_hedge( h ),
get_hedge( next(h,tm) ),
get_hedge( prev(h,tm) ) );
}
};
template < bool reverse_patch_orientation,
class TriangleMesh,
class PatchContainer,
class VertexPointMap,
class VertexPointMapOut,
class EdgeMarkMapOut,
class EdgeMarkMapIn ,
class UserVisitor>
void append_patches_to_triangle_mesh(
TriangleMesh& output,
const boost::dynamic_bitset<>& patches_to_append,
PatchContainer& patches,
const VertexPointMapOut& vpm_out,
const VertexPointMap& vpm_tm,
EdgeMarkMapOut& edge_mark_map_out,
const EdgeMarkMapIn& edge_mark_map_in,
boost::unordered_map<
typename boost::graph_traits<TriangleMesh>::edge_descriptor,
typename boost::graph_traits<TriangleMesh>::edge_descriptor
>& tm_to_output_edges,
UserVisitor& user_visitor)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::edge_descriptor edge_descriptor;
typedef typename GT::vertex_descriptor vertex_descriptor;
typedef typename GT::face_descriptor face_descriptor;
const TriangleMesh& tm = patches.pm;
Triangle_mesh_extension_helper<TriangleMesh, reverse_patch_orientation>
helper(tm_to_output_edges, tm, output);
for (std::size_t i=patches_to_append.find_first();
i < patches_to_append.npos;
i = patches_to_append.find_next(i))
{
#ifdef CGAL_COREFINEMENT_POLYHEDRA_DEBUG
#warning the size of tm_to_output_edges will increase at each step \
when adding new patches by the size of internal edges. \
Maybe the use of a copy would be better since we do not need \
the internal edges added?
#endif
Patch_description<TriangleMesh>& patch = patches[i];
std::vector<halfedge_descriptor> interior_vertex_halfedges;
//insert interior halfedges and create interior vertices
BOOST_FOREACH(halfedge_descriptor h, patch.interior_edges)
{
edge_descriptor new_edge = add_edge(output), ed = edge(h,tm);
// copy the mark on input edge to the output edge
copy_edge_mark<TriangleMesh>(ed, new_edge,
edge_mark_map_in, edge_mark_map_out);
halfedge_descriptor new_h = halfedge(new_edge, output);
tm_to_output_edges[ed] = new_edge;
set_face(new_h, GT::null_face(), output);
set_face(opposite(new_h, output), GT::null_face(), output);
CGAL_assertion(is_border(new_h, output));
CGAL_assertion(is_border(opposite(new_h,output), output));
//create a copy of interior vertices only once
if ( halfedge(target(h,tm),tm)==h &&
patch.interior_vertices.count(target(h, tm)) )
{
vertex_descriptor v = add_vertex(output);
set_halfedge(v, new_h, output);
set_target(new_h, v, output);
put(vpm_out, v, get(vpm_tm, target(h, tm) ) );
interior_vertex_halfedges.push_back( new_h );
}
if ( halfedge(source(h,tm),tm)==opposite(h,tm) &&
patch.interior_vertices.count(source(h,tm)) )
{
vertex_descriptor v = add_vertex(output);
halfedge_descriptor new_h_opp = opposite(new_h, output);
set_halfedge(v, new_h_opp, output);
set_target(new_h_opp, v, output);
put(vpm_out, v, get(vpm_tm, source(h, tm) ) );
interior_vertex_halfedges.push_back( new_h_opp );
}
}
//create faces and connect halfedges
BOOST_FOREACH(face_descriptor f, patch.faces)
{
cpp11::array<halfedge_descriptor,3> hedges = helper.halfedges(f);
user_visitor.before_face_copy(f, patches.pm, output);
face_descriptor new_f = add_face(output);
user_visitor.after_face_copy(f, patches.pm, new_f, output);
set_halfedge(new_f, hedges[0], output);
for (int i=0;i<3;++i)
{
CGAL_assertion(hedges[i]!=GT::null_halfedge());
set_next(hedges[i], hedges[(i+1)%3], output);
set_face(hedges[i], new_f, output);
}
}
// handle interior edges that are on the border of the mesh:
// they do not have a prev/next pointer set since only the pointers
// of patch interior halfedges part a face have been. In the following
// (i) we set the next/prev pointer around interior vertices on the mesh
// boundary and (ii) we collect interior mesh border halfedges incident to
// a patch border vertex and set their next/prev pointer (possibly of
// another patch)
// Containers used for step (ii) for collecting mesh border halfedges
// with source/target on an intersection polyline that needs it prev/next
// pointer to be set
std::vector<halfedge_descriptor> border_halfedges_source_to_link;
std::vector<halfedge_descriptor> border_halfedges_target_to_link;
BOOST_FOREACH(halfedge_descriptor h, patch.interior_edges)
if (is_border_edge(h,tm))
{
if (!is_border(h, tm)) h=opposite(h, tm);
vertex_descriptor src = source(h, tm);
vertex_descriptor tgt = target(h, tm);
if (reverse_patch_orientation) std::swap(src, tgt);
if ( !patch.interior_vertices.count(src) )
border_halfedges_source_to_link.push_back(helper.get_hedge(h));
if ( !patch.interior_vertices.count(tgt) ){
border_halfedges_target_to_link.push_back(helper.get_hedge(h));
continue; // since the next halfedge should not be in the same patch
}
CGAL_assertion( is_border(h, tm) &&
is_border(prev(h, tm),tm) &&
is_border(next(h, tm),tm));
// step (i)
halfedge_descriptor h_out=helper.get_hedge(h);
halfedge_descriptor h_out_next = reverse_patch_orientation
? helper.get_hedge(prev(h,tm))
: helper.get_hedge(next(h,tm));
CGAL_assertion(is_border(h_out,output) && is_border(h_out_next,output));
set_next(h_out, h_out_next, output);
}
// now the step (ii) we look for the candidate halfedge by turning around
// the vertex in the direction of the interior of the patch
BOOST_FOREACH(halfedge_descriptor h_out, border_halfedges_target_to_link)
{
halfedge_descriptor candidate =
opposite(prev(opposite(h_out, output), output), output);
CGAL_assertion_code(halfedge_descriptor start=candidate);
while (!is_border(candidate, output)){
candidate=opposite(prev(candidate, output), output);
CGAL_assertion(candidate!=start);
}
set_next(h_out, candidate, output);
}
BOOST_FOREACH(halfedge_descriptor h_out, border_halfedges_source_to_link)
{
halfedge_descriptor candidate =
opposite(next(opposite(h_out, output), output), output);
while (!is_border(candidate, output))
candidate = opposite(next(candidate, output), output);
set_next(candidate, h_out, output);
}
// For all interior vertices, update the vertex pointer
// of all but the vertex halfedge
BOOST_FOREACH(halfedge_descriptor h_out, interior_vertex_halfedges)
{
vertex_descriptor v = target(h_out, output);
halfedge_descriptor next_around_vertex=h_out;
do{
CGAL_assertion(next(next_around_vertex, output) != GT::null_halfedge());
next_around_vertex=opposite(next(next_around_vertex, output), output);
set_target(next_around_vertex, v, output);
}while(h_out != next_around_vertex);
}
// For all patch boundary vertices, update the vertex pointer
// of all but the vertex halfedge
BOOST_FOREACH(halfedge_descriptor h, patch.shared_edges)
{
//check for a halfedge pointing inside an already imported patch
halfedge_descriptor h_out = helper.get_hedge(h);
CGAL_assertion( next(h_out, output)!=GT::null_halfedge() );
// update the pointers on the target
halfedge_descriptor next_around_target=h_out;
vertex_descriptor v=target(h_out, output);
do{
next_around_target = opposite(next(next_around_target, output), output);
set_target(next_around_target, v, output);
}while(next(next_around_target, output)!=GT::null_halfedge() &&
next_around_target!=h_out &&
!is_border(next_around_target, output));
// update the pointers on the source
halfedge_descriptor next_around_source=prev(h_out, output);
CGAL_assertion(next_around_source!=GT::null_halfedge());
v = source(h_out, output);
do{
set_target(next_around_source, v, output);
next_around_source = prev(opposite(next_around_source, output), output);
}while( next_around_source!=GT::null_halfedge() &&
next_around_source!=opposite(h_out, output) &&
!is_border(next_around_source, output));
}
}
}
template < class TriangleMesh,
class IntersectionEdgeMap,
class VertexPointMap,
class VertexPointMapOut,
class EdgeMarkMap1,
class EdgeMarkMap2,
class EdgeMarkMapOut,
class IntersectionPolylines,
class PatchContainer,
class UserVisitor>
void fill_new_triangle_mesh(
TriangleMesh& output,
const boost::dynamic_bitset<>& patches_of_tm1_to_import,
const boost::dynamic_bitset<>& patches_of_tm2_to_import,
PatchContainer& patches_of_tm1,
PatchContainer& patches_of_tm2,
bool reverse_orientation_of_patches_from_tm1,
bool reverse_orientation_of_patches_from_tm2,
const IntersectionPolylines& polylines,
const IntersectionEdgeMap& intersection_edges1,
const IntersectionEdgeMap& intersection_edges2,
const VertexPointMap& vpm1,
const VertexPointMap& vpm2,
const VertexPointMapOut& vpm_out,
const EdgeMarkMap1& edge_mark_map1,
const EdgeMarkMap2& edge_mark_map2,
EdgeMarkMapOut& edge_mark_map_out,
std::vector< typename boost::graph_traits<TriangleMesh>::edge_descriptor>&
output_shared_edges,
UserVisitor& user_visitor)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::vertex_descriptor vertex_descriptor;
typedef typename GT::edge_descriptor edge_descriptor;
// this is the miminal number of edges that will be marked (intersection edge).
// We cannot easily have the total number since some patch interior edges might be marked
output_shared_edges.reserve(
std::accumulate(polylines.lengths.begin(),polylines.lengths.end(),std::size_t(0)) );
//add a polyline inside O for each intersection polyline
std::size_t nb_polylines = polylines.lengths.size();
boost::unordered_map<vertex_descriptor, vertex_descriptor> tm1_to_output_vertices;
boost::unordered_map<edge_descriptor, edge_descriptor> tm1_to_output_edges,
tm2_to_output_edges;
for (std::size_t i=0; i < nb_polylines; ++i)
if (!polylines.to_skip.test(i))
import_polyline(output,
polylines.tm1[i], polylines.tm2[i],
patches_of_tm1.pm,
patches_of_tm2.pm,
polylines.lengths[i],
tm1_to_output_edges, tm2_to_output_edges,
tm1_to_output_vertices,
intersection_edges1, intersection_edges2,
vpm1, vpm2, vpm_out,
output_shared_edges);
//import patches of tm1
if (reverse_orientation_of_patches_from_tm1)
append_patches_to_triangle_mesh<true>(output,
patches_of_tm1_to_import,
patches_of_tm1,
vpm_out,
vpm1,
edge_mark_map_out,
edge_mark_map1,
tm1_to_output_edges,
user_visitor);
else
append_patches_to_triangle_mesh<false>(output,
patches_of_tm1_to_import,
patches_of_tm1,
vpm_out,
vpm1,
edge_mark_map_out,
edge_mark_map1,
tm1_to_output_edges,
user_visitor);
//import patches from tm2
if (reverse_orientation_of_patches_from_tm2)
append_patches_to_triangle_mesh<true>(output,
patches_of_tm2_to_import,
patches_of_tm2,
vpm_out,
vpm2,
edge_mark_map_out,
edge_mark_map2,
tm2_to_output_edges,
user_visitor);
else
append_patches_to_triangle_mesh<false>(output,
patches_of_tm2_to_import,
patches_of_tm2,
vpm_out,
vpm2,
edge_mark_map_out,
edge_mark_map2,
tm2_to_output_edges,
user_visitor);
}
template <class TriangleMesh,
class PatchContainer,
class EdgeMap>
void disconnect_patches(
TriangleMesh& tm1,
const boost::dynamic_bitset<>& patches_to_remove,
PatchContainer& patches_of_tm1,
const EdgeMap& tm1_edge_to_tm2_edge, //map intersection edges of tm1 to the equivalent in tm2
EdgeMap& new_tm1_edge_to_tm2_edge) //map the new intersection edges of tm1 to the equivalent in tm2
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::face_descriptor face_descriptor;
// disconnect each patch one by one
for (std::size_t i=patches_to_remove.find_first();
i < patches_to_remove.npos;
i = patches_to_remove.find_next(i))
{
Patch_description<TriangleMesh>& patch=patches_of_tm1[i];
std::vector<halfedge_descriptor> new_patch_border;
// start the duplicate step
std::size_t nb_shared_edges = patch.shared_edges.size();
new_patch_border.reserve( nb_shared_edges );
boost::unordered_map<halfedge_descriptor, halfedge_descriptor> old_to_new;
// save faces inside the patch and set the halfedge
// to be duplicated on the boundary
std::vector<face_descriptor> face_backup;
face_backup.reserve( nb_shared_edges );
BOOST_FOREACH(halfedge_descriptor h, patch.shared_edges)
{
face_backup.push_back( face(h, tm1) );
set_face(h, GT::null_face(), tm1);
}
// look for the prev/next halfedges after the patch will be disconnected
// for the halfedges to be duplicated
std::vector<halfedge_descriptor> shared_next, shared_prev;
shared_next.reserve( nb_shared_edges );
shared_prev.reserve( nb_shared_edges );
BOOST_FOREACH(halfedge_descriptor h, patch.shared_edges)
{
halfedge_descriptor nxt=next(h, tm1);
while(!is_border(nxt, tm1))
nxt=next(opposite(nxt, tm1), tm1);
shared_next.push_back(nxt);
// setting prev is only needed in case tm1 is open
// and the intersection polyline intersects its boundary
halfedge_descriptor prv=prev(h, tm1);
while( !is_border(prv, tm1) )
prv=prev(opposite(prv, tm1), tm1);
shared_prev.push_back(prv);
set_halfedge(target(h, tm1), h, tm1);
set_halfedge(source(h, tm1), opposite(h, tm1), tm1); //only needed if tm1 is open
}
// now duplicate the edge and set its pointers
for(std::size_t k=0; k<nb_shared_edges; ++k)
{
halfedge_descriptor h = patch.shared_edges[k];
halfedge_descriptor new_hedge = halfedge(add_edge(tm1), tm1);
set_next(new_hedge, next(h, tm1), tm1);
set_next(prev(h, tm1), new_hedge, tm1);
set_face(new_hedge, face_backup[k], tm1);
set_target(new_hedge, target(h, tm1), tm1);
set_target(opposite(new_hedge,tm1), source(h, tm1), tm1);
set_halfedge(face_backup[k], new_hedge, tm1);
new_patch_border.push_back(new_hedge);
set_face(opposite(new_hedge, tm1), GT::null_face(), tm1);
old_to_new.insert( std::make_pair(h, new_hedge) );
CGAL_assertion( next(opposite(new_hedge, tm1), tm1)==GT::null_halfedge() );
CGAL_assertion( prev(opposite(new_hedge, tm1), tm1)==GT::null_halfedge() );
CGAL_assertion( next(prev(new_hedge, tm1), tm1) == new_hedge );
CGAL_assertion( prev(next(new_hedge, tm1), tm1) == new_hedge );
}
// update next/prev pointer of new hedges in case it is one of the new hedges
BOOST_FOREACH(halfedge_descriptor h, new_patch_border)
if (is_border(next(h, tm1), tm1))
set_next(h, old_to_new[next(h,tm1)], tm1);
// set next/prev pointers on the border of the neighbor patch
for(std::size_t k=0; k<nb_shared_edges; ++k)
{
halfedge_descriptor h = patch.shared_edges[k];
set_next(h, shared_next[k], tm1);
set_next(shared_prev[k], h, tm1);
}
// update next/prev pointers on the border of the patch
BOOST_FOREACH(halfedge_descriptor h, new_patch_border)
{
halfedge_descriptor h_opp = opposite(h, tm1);
//set next pointer if not already set
if ( next(h_opp, tm1)==GT::null_halfedge() )
{
// we visit faces inside the patch we consider
halfedge_descriptor candidate = opposite(prev(h, tm1), tm1);
while ( !is_border(candidate, tm1) )
candidate = opposite(prev(candidate, tm1), tm1);
set_next(h_opp, candidate, tm1);
}
CGAL_assertion( prev(next(h_opp, tm1), tm1)==h_opp );
// set prev pointer if not already set
if ( prev(h_opp, tm1) == GT::null_halfedge() )
{
halfedge_descriptor candidate = opposite(next(h, tm1), tm1);
while ( !is_border(candidate, tm1) )
candidate = opposite(next(candidate, tm1), tm1);
set_next(candidate, h_opp, tm1);
}
CGAL_assertion( prev(next(h_opp, tm1), tm1) == h_opp );
CGAL_assertion( is_border(prev(h_opp, tm1), tm1) );
CGAL_assertion( is_border(next(h_opp, tm1), tm1) );
}
// end of the duplicate step
CGAL_assertion( new_patch_border.size() == nb_shared_edges );
for (std::size_t k=0; k < nb_shared_edges; ++k){
CGAL_assertion( target(patch.shared_edges[k], tm1) == target(new_patch_border[k], tm1) );
CGAL_assertion( source(patch.shared_edges[k], tm1) == source(new_patch_border[k], tm1) );
CGAL_assertion( is_border_edge(new_patch_border[k], tm1) );
CGAL_assertion( !is_border(new_patch_border[k], tm1) );
CGAL_assertion( is_border(next(opposite(new_patch_border[k], tm1), tm1), tm1) );
CGAL_assertion( is_border(prev(opposite(new_patch_border[k], tm1), tm1), tm1) );
typename EdgeMap::const_iterator it_res =
tm1_edge_to_tm2_edge.find( edge(patch.shared_edges[k], tm1) );
CGAL_assertion( it_res != tm1_edge_to_tm2_edge.end() );
new_tm1_edge_to_tm2_edge[
patch.shared_edges[k]==halfedge(it_res->first, tm1)
? edge(new_patch_border[k], tm1)
: edge(opposite(new_patch_border[k], tm1), tm1) ] = it_res->second;
}
patch.shared_edges.swap(new_patch_border);
}
}
template <class TriangleMesh,
class PatchContainer,
class IntersectionPolylines,
class EdgeMap,
class VertexPointMap,
class EdgeMarkMapIn1,
class EdgeMarkMapIn2,
class EdgeMarkMapOut,
class UserVisitor>
void compute_inplace_operation_delay_removal_and_insideout(
TriangleMesh& tm1,
TriangleMesh& tm2,
const boost::dynamic_bitset<>& patches_of_tm1_to_keep,
const boost::dynamic_bitset<>& patches_of_tm2_to_import,
PatchContainer& patches_of_tm1,
PatchContainer& patches_of_tm2,
bool reverse_patch_orientation_tm2,
const IntersectionPolylines& polylines,
const VertexPointMap& vpm1,
const VertexPointMap& vpm2,
EdgeMarkMapIn1&,
const EdgeMarkMapIn2& edge_mark_map2,
const EdgeMarkMapOut& edge_mark_map_out1,
EdgeMap& disconnected_patches_edge_to_tm2_edge,
UserVisitor& user_visitor)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::edge_descriptor edge_descriptor;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef boost::unordered_map<edge_descriptor, edge_descriptor> Edge_map;
Edge_map tm2_edge_to_tm1_edge, tm1_edge_to_tm2_edge;
//maps intersection edges from tm2 to tm1
std::size_t nb_polylines = polylines.lengths.size();
for(std::size_t i=0; i<nb_polylines; ++i)
{
halfedge_descriptor h1 = polylines.tm1[i];
halfedge_descriptor h2 = polylines.tm2[i];
std::size_t nb_segments = polylines.lengths[i];
for (std::size_t k=0;;)
{
tm2_edge_to_tm1_edge[edge(h2, tm2)]=edge(h1, tm1);
tm1_edge_to_tm2_edge[edge(h1, tm1)]=edge(h2, tm2);
if (++k==nb_segments) break;
h2 = next_marked_halfedge_around_target_vertex(h2, tm2,
patches_of_tm2.is_intersection_edge);
h1=next_marked_halfedge_around_target_vertex(h1, tm1,
patches_of_tm1.is_intersection_edge);
}
}
#ifdef CGAL_COREFINEMENT_POLYHEDRA_DEBUG
#warning do not try to disconnect if the patch is isolated? i.e opposite(border_edge_of_patch)->is_border()
#endif
// disconnect patches inside tm2
// For the patches scheduled to be removed, their patch descriptions
// in patches_of_tm1 will be updated so that is_intersection_edge are
// the newly created halfedges within disconnect_patches.
// Note that disconnected_patches_edge_to_tm2_edge also refers to those halfedges
//init the map with the previously filled one (needed when reusing patches in two operations)
disconnected_patches_edge_to_tm2_edge=tm1_edge_to_tm2_edge;
disconnect_patches(tm1, ~patches_of_tm1_to_keep, patches_of_tm1,
tm1_edge_to_tm2_edge, disconnected_patches_edge_to_tm2_edge);
//we import patches from tm2
if (reverse_patch_orientation_tm2)
append_patches_to_triangle_mesh<true>(tm1,
patches_of_tm2_to_import,
patches_of_tm2,
vpm1,
vpm2,
edge_mark_map_out1,
edge_mark_map2,
tm2_edge_to_tm1_edge,
user_visitor);
else
append_patches_to_triangle_mesh<false>(tm1,
patches_of_tm2_to_import,
patches_of_tm2,
vpm1,
vpm2,
edge_mark_map_out1,
edge_mark_map2,
tm2_edge_to_tm1_edge,
user_visitor);
}
template <class TriangleMesh,
class PatchContainer,
class EdgeMarkMap>
void
remove_patches(TriangleMesh& tm,
const boost::dynamic_bitset<>& patches_to_remove,
PatchContainer& patches,
const EdgeMarkMap& edge_mark_map)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::face_descriptor face_descriptor;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::vertex_descriptor vertex_descriptor;
for (std::size_t i=patches_to_remove.find_first();
i < patches_to_remove.npos;
i = patches_to_remove.find_next(i))
{
Patch_description<TriangleMesh>& patch=patches[i];
// put the halfedges on the boundary of the patch on the boundary of tm
BOOST_FOREACH(halfedge_descriptor h, patch.shared_edges)
set_face(h, GT::null_face(), tm);
// set next/prev relationship of border halfedges
BOOST_FOREACH(halfedge_descriptor h, patch.shared_edges)
{
halfedge_descriptor nxt=next(h, tm);
while(!is_border(nxt,tm))
nxt=next(opposite(nxt, tm), tm);
set_next(h, nxt, tm);
set_halfedge(target(h, tm), h, tm);
}
// edges removed must be unmarked to avoid issues when adding new elements
// that could be marked because they retrieve a previously set property
unmark_edges(tm, edge_mark_map, patch.interior_edges);
// In case a ccb of the patch is not a cycle (the source and target vertices
// are border vertices), the first halfedge of that ccb will not have its
// prev pointer set correctly. To fix that, we consider all interior edges
// and check for one that is on the border of the patch and that is incident
// to a border vertex and use it to get the missing prev pointer.
BOOST_FOREACH(halfedge_descriptor h, patch.interior_edges)
if(is_border_edge(h, tm))
{
if (is_border(h, tm)) h=opposite(h, tm);
if ( !patch.interior_vertices.count(target(h, tm)) )
{
// look for the halfedge belonging to shared_edges
// having the prev pointer not correctly set
halfedge_descriptor nxt=next(h, tm);
while(!is_border(nxt, tm))
nxt=next(opposite(nxt, tm), tm);
CGAL_assertion( is_border(nxt, tm) );//we marked it above!
// now update the prev pointer
halfedge_descriptor prv=prev(opposite(h, tm), tm);
set_next(prv, nxt, tm);
set_halfedge(target(prv, tm), prv, tm);
}
}
//now remove the simplices
BOOST_FOREACH(halfedge_descriptor h, patch.interior_edges)
remove_edge(edge(h, tm), tm);
BOOST_FOREACH(face_descriptor f, patch.faces)
remove_face(f, tm);
BOOST_FOREACH(vertex_descriptor v, patch.interior_vertices)
remove_vertex(v, tm);
}
}
template <class TriangleMesh,
class PatchContainer,
class VertexPointMap,
class EdgeMarkMapIn1,
class EdgeMarkMapIn2,
class EdgeMarkMapOut1,
class UserVisitor>
void compute_inplace_operation(
TriangleMesh& tm1,
const TriangleMesh& /*tm2*/,
const boost::dynamic_bitset<>& patches_of_tm1_to_keep,
const boost::dynamic_bitset<>& patches_of_tm2_to_import,
PatchContainer& patches_of_tm1,
PatchContainer& patches_of_tm2,
bool reverse_patch_orientation_tm1,
bool reverse_patch_orientation_tm2,
const VertexPointMap& vpm1,
const VertexPointMap& vpm2,
EdgeMarkMapIn1& edge_mark_map_in1,
const EdgeMarkMapIn2& edge_mark_map_in2,
EdgeMarkMapOut1& edge_mark_map_out1,
boost::unordered_map<
typename boost::graph_traits<TriangleMesh>::edge_descriptor,
typename boost::graph_traits<TriangleMesh>::edge_descriptor
>& tm2_edge_to_tm1_edge,
UserVisitor& user_visitor)
{
typedef boost::unordered_map<
typename boost::graph_traits<TriangleMesh>::edge_descriptor,
typename boost::graph_traits<TriangleMesh>::edge_descriptor> EdgeMap;
//clean up patches not kept
remove_patches(tm1, ~patches_of_tm1_to_keep, patches_of_tm1, edge_mark_map_in1);
// transfer marks of edges of patches kept to the output edge mark property
copy_edge_mark<TriangleMesh>(tm1, edge_mark_map_in1, edge_mark_map_out1);
if (reverse_patch_orientation_tm1){
Polygon_mesh_processing::
reverse_face_orientations_of_mesh_with_polylines(tm1);
// here we need to update the mapping to use the correct border
// halfedges while appending the patches from tm2
BOOST_FOREACH(typename EdgeMap::value_type& v, tm2_edge_to_tm1_edge)
v.second=edge(opposite(halfedge(v.second, tm1), tm1), tm1);
}
//we import patches from tm2
if ( reverse_patch_orientation_tm2 )
append_patches_to_triangle_mesh<true>(tm1,
patches_of_tm2_to_import,
patches_of_tm2,
vpm1,
vpm2,
edge_mark_map_out1,
edge_mark_map_in2,
tm2_edge_to_tm1_edge,
user_visitor);
else
append_patches_to_triangle_mesh<false>(tm1,
patches_of_tm2_to_import,
patches_of_tm2,
vpm1,
vpm2,
edge_mark_map_out1,
edge_mark_map_in2,
tm2_edge_to_tm1_edge,
user_visitor);
}
template <class TriangleMesh,
class IntersectionPolylines,
class PatchContainer,
class EdgeMap>
void compute_border_edge_map(
const TriangleMesh& tm1,
const TriangleMesh& tm2,
const IntersectionPolylines& polylines,
PatchContainer& patches_of_tm1,
PatchContainer& patches_of_tm2,
EdgeMap& tm2_edge_to_tm1_edge)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
std::size_t nb_polylines = polylines.lengths.size();
for( std::size_t i=0; i<nb_polylines; ++i)
{
if (polylines.to_skip.test(i)) continue;
halfedge_descriptor h1 = polylines.tm1[i];
halfedge_descriptor h2 = polylines.tm2[i];
std::size_t nb_segments = polylines.lengths[i];
for (std::size_t k=0;;)
{
tm2_edge_to_tm1_edge[edge(h2, tm2)]=edge(h1, tm1);
if (++k==nb_segments) break;
h2 = next_marked_halfedge_around_target_vertex(
h2, tm2, patches_of_tm2.is_intersection_edge);
h1 = next_marked_halfedge_around_target_vertex(
h1, tm1, patches_of_tm1.is_intersection_edge);
}
}
}
template <class TriangleMesh,
class PatchContainer,
class IntersectionPolylines,
class VertexPointMap,
class EdgeMarkMapIn1,
class EdgeMarkMapIn2,
class EdgeMarkMapOut1,
class UserVisitor>
void compute_inplace_operation(
TriangleMesh& tm1,
const TriangleMesh& tm2,
const boost::dynamic_bitset<>& patches_of_tm1_to_keep,
const boost::dynamic_bitset<>& patches_of_tm2_to_import,
PatchContainer& patches_of_tm1,
PatchContainer& patches_of_tm2,
bool reverse_patch_orientation_tm1,
bool reverse_patch_orientation_tm2,
const VertexPointMap& vpm1,
const VertexPointMap& vpm2,
const EdgeMarkMapIn1& edge_mark_map_in1,
const EdgeMarkMapIn2& edge_mark_map_in2,
const EdgeMarkMapOut1& edge_mark_map_out1,
const IntersectionPolylines& polylines,
UserVisitor& user_visitor)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::edge_descriptor edge_descriptor;
boost::unordered_map<edge_descriptor, edge_descriptor> tm2_edge_to_tm1_edge;
//maps intersection edges from tm2 to the equivalent in tm1
compute_border_edge_map(tm1, tm2,
polylines,
patches_of_tm1, patches_of_tm2,
tm2_edge_to_tm1_edge);
compute_inplace_operation(tm1, tm2,
patches_of_tm1_to_keep, patches_of_tm2_to_import,
patches_of_tm1, patches_of_tm2,
reverse_patch_orientation_tm1,
reverse_patch_orientation_tm2,
vpm1,
vpm2,
edge_mark_map_in1,
edge_mark_map_in2,
edge_mark_map_out1,
tm2_edge_to_tm1_edge,
user_visitor);
}
// function used to remove polylines imported or kept that are incident only
// to patches not kept for the operation P_ptr is used for storing
// the result. We look for edges with halfedges both on the border of
// the mesh. The vertices incident only to such edges should be removed.
// Here to detect vertices that should be kept, we abuse the fact that
// the halfedge to be removed and incident to a vertex that should not be
// removed will still have its next pointer set to a halfedge part of
// the result.
template <class TriangleMesh, class PatchContainer>
void remove_unused_polylines(
TriangleMesh& tm,
const boost::dynamic_bitset<>& patches_to_remove,
PatchContainer& patches)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::vertex_descriptor vertex_descriptor;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::edge_descriptor edge_descriptor;
std::set<vertex_descriptor> vertices_to_remove;
std::set<edge_descriptor> edges_to_remove;
for (std::size_t i = patches_to_remove.find_first();
i < patches_to_remove.npos;
i = patches_to_remove.find_next(i))
{
Patch_description<TriangleMesh>& patch=patches[i];
BOOST_FOREACH(halfedge_descriptor h, patch.shared_edges)
{
if (is_border(h, tm) && is_border(opposite(h, tm), tm)){
vertices_to_remove.insert(target(h, tm));
vertices_to_remove.insert(source(h, tm));
edges_to_remove.insert(edge(h, tm));
}
}
}
BOOST_FOREACH(vertex_descriptor v, vertices_to_remove)
{
bool to_remove=true;
BOOST_FOREACH(halfedge_descriptor h, halfedges_around_target(v,tm))
if (!is_border(h, tm) || !is_border(opposite(h,tm),tm))
{
to_remove=false;
// in case the vertex halfedge was one that is going to remove,
// update it
set_halfedge(v, h, tm);
break;
}
if (to_remove)
remove_vertex(v,tm);
}
BOOST_FOREACH(edge_descriptor e, edges_to_remove)
remove_edge(e,tm);
}
template <class TriangleMesh, class PatchContainer, class EdgeMarkMap>
void remove_disconnected_patches(
TriangleMesh& tm,
PatchContainer& patches,
const boost::dynamic_bitset<>& patches_to_remove,
EdgeMarkMap& edge_mark_map)
{
typedef boost::graph_traits<TriangleMesh> GT;
typedef typename GT::vertex_descriptor vertex_descriptor;
typedef typename GT::halfedge_descriptor halfedge_descriptor;
typedef typename GT::face_descriptor face_descriptor;
for (std::size_t i=patches_to_remove.find_first();
i < patches_to_remove.npos;
i = patches_to_remove.find_next(i))
{
Patch_description<TriangleMesh>& patch = patches[i];
// edges removed must be unmarked to avoid issues when adding new elements
// that could be marked because they retrieve a previously set property
unmark_edges(tm, edge_mark_map, patch.interior_edges);
BOOST_FOREACH(halfedge_descriptor h, patch.interior_edges)
remove_edge(edge(h, tm), tm);
// There is no shared halfedge between duplicated patches even
// if they were before the duplication. Thus the erase that follows is safe.
// However remember that vertices were not duplicated which is why their
// removal is not handled here (still in use or to be removed in
// remove_unused_polylines())
BOOST_FOREACH(halfedge_descriptor h, patch.shared_edges)
remove_edge(edge(h, tm), tm);
BOOST_FOREACH(face_descriptor f, patch.faces)
remove_face(f, tm);
BOOST_FOREACH(vertex_descriptor v, patch.interior_vertices)
remove_vertex(v, tm);
}
}
} } } // CGAL::Polygon_mesh_processing::Corefinement
#endif // CGAL_POLYGON_MESH_PROCESSING_INTERNAL_FACE_GRAPH_UTILS_H
|
import React from 'react';
import cn from 'classnames';
import { ConditionalHandler } from '../../lib/ConditionalHandler';
import { LENGTH_FULLDATE, MAX_FULLDATE, MIN_FULLDATE } from '../../lib/date/constants';
import { InternalDateComponentType } from '../../lib/date/types';
import { Theme } from '../../lib/theming/Theme';
import { DatePickerLocale, DatePickerLocaleHelper } from '../DatePicker/locale';
import { InputLikeText } from '../../internal/InputLikeText';
import { locale } from '../../lib/locale/decorators';
import { ThemeContext } from '../../lib/theming/ThemeContext';
import { CalendarIcon } from '../../internal/icons/16px';
import { DateFragmentsView } from './DateFragmentsView';
import { jsStyles } from './DateInput.styles';
import { Actions, extractAction } from './helpers/DateInputKeyboardActions';
import { InternalDateMediator } from './helpers/InternalDateMediator';
export interface DateInputState {
selected: InternalDateComponentType | null;
valueFormatted: string;
inputMode: boolean;
focused: boolean;
dragged: boolean;
}
export interface DateInputProps {
value: string;
error?: boolean;
warning?: boolean;
disabled?: boolean;
/**
* Минимальная дата.
* @default '01.01.1900'
*/
minDate: string;
/**
* Максимальная дата
* @default '31.12.2099'
*/
maxDate: string;
/**
* Ширина поля
* @default 125
*/
width: string | number;
withIcon?: boolean;
/**
* Размер поля
* @default 'small'
*/
size: 'small' | 'large' | 'medium';
onBlur?: (x0: React.FocusEvent<HTMLElement>) => void;
onFocus?: (x0: React.FocusEvent<HTMLElement>) => void;
/**
* Вызывается при изменении `value`
*
* @param value - строка в формате `dd.mm.yyyy`.
*/
onValueChange?: (value: string) => void;
onKeyDown?: (x0: React.KeyboardEvent<HTMLElement>) => void;
}
@locale('DatePicker', DatePickerLocaleHelper)
export class DateInput extends React.Component<DateInputProps, DateInputState> {
public static __KONTUR_REACT_UI__ = 'DateInput';
public static defaultProps = {
value: '',
minDate: MIN_FULLDATE,
maxDate: MAX_FULLDATE,
size: 'small',
width: 125,
};
private iDateMediator: InternalDateMediator = new InternalDateMediator();
private inputLikeText: InputLikeText | null = null;
private dateFragmentsView: DateFragmentsView | null = null;
private isMouseDown = false;
private isMouseFocus = false;
private ignoringDelimiter = false;
private locale!: DatePickerLocale;
private blurEvent: React.FocusEvent<HTMLElement> | null = null;
private theme!: Theme;
private conditionalHandler = new ConditionalHandler<Actions, [React.KeyboardEvent<HTMLElement>]>()
.add(Actions.MoveSelectionLeft, () => this.shiftSelection(-1))
.add(Actions.MoveSelectionRight, () => this.shiftSelection(1))
.add(Actions.Separator, () => this.pressDelimiter())
.add(Actions.MoveSelectionFirst, () => this.selectDateComponent(this.iDateMediator.getLeftmostType()))
.add(Actions.MoveSelectionLast, () => this.selectDateComponent(this.iDateMediator.getRightmostType()))
.add(Actions.Increment, () => this.shiftDateComponent(1))
.add(Actions.Decrement, () => this.shiftDateComponent(-1))
.add(Actions.Digit, e => this.inputValue(e))
.add(Actions.ClearSelection, () => this.clearSelected())
.add(Actions.ClearOneChar, () => this.clearOneChar())
.add(Actions.FullSelection, () => this.fullSelection())
.add(Actions.WrongInput, () => this.blink())
.build();
constructor(props: DateInputProps) {
super(props);
this.state = {
valueFormatted: '',
selected: null,
inputMode: false,
focused: false,
dragged: false,
};
}
public componentDidUpdate(prevProps: DateInputProps, prevState: DateInputState) {
if (
prevProps.value !== this.props.value ||
prevProps.minDate !== this.props.minDate ||
prevProps.maxDate !== this.props.maxDate ||
this.iDateMediator.isChangedLocale(this.locale)
) {
this.updateFromProps();
}
this.selectNode();
}
public selectNode = () => {
const type = this.state.selected;
const dateFragmentsView = this.dateFragmentsView && this.dateFragmentsView.getRootNode();
if (type === null || !this.inputLikeText || !dateFragmentsView) {
return;
}
if (type === InternalDateComponentType.All) {
this.inputLikeText.selectInnerNode(dateFragmentsView, 0, 5);
return;
}
const index = this.iDateMediator.getTypesOrder().indexOf(type);
if (index > -1) {
this.inputLikeText.selectInnerNode(dateFragmentsView, index * 2, index * 2 + 1);
}
};
public componentDidMount(): void {
this.updateFromProps();
}
public blur() {
if (this.inputLikeText) {
this.inputLikeText.blur();
}
}
public focus() {
if (this.inputLikeText) {
this.inputLikeText.focus();
}
}
public blink() {
if (this.inputLikeText) {
this.inputLikeText.blink();
}
}
public render() {
return (
<ThemeContext.Consumer>
{theme => {
this.theme = theme;
return this.renderMain();
}}
</ThemeContext.Consumer>
);
}
private renderMain() {
const { focused, selected, inputMode, valueFormatted } = this.state;
const fragments = focused || valueFormatted !== '' ? this.iDateMediator.getFragments() : [];
return (
<InputLikeText
width={this.props.width}
ref={this.inputLikeTextRef}
size={this.props.size}
disabled={this.props.disabled}
error={this.props.error}
warning={this.props.warning}
onBlur={this.handleBlur}
onFocus={this.handleFocus}
onKeyDown={this.handleKeyDown}
onMouseDownCapture={this.handleMouseDownCapture}
onPaste={this.handlePaste}
rightIcon={this.renderIcon()}
onDoubleClickCapture={this.handleDoubleClick}
onMouseDragStart={this.handleMouseDragStart}
onMouseDragEnd={this.handleMouseDragEnd}
value={this.iDateMediator.getInternalString()}
>
<DateFragmentsView
ref={this.dateFragmentsViewRef}
fragments={fragments}
onSelectDateComponent={this.handleSelectDateComponent}
selected={selected}
inputMode={inputMode}
/>
</InputLikeText>
);
}
private renderIcon = () => {
const { withIcon, size, disabled = false } = this.props;
if (withIcon) {
const theme = this.theme;
const iconStyles = cn({
[jsStyles.icon(theme)]: true,
[jsStyles.iconSmall(theme)]: size === 'small',
[jsStyles.iconMedium(theme)]: size === 'medium',
[jsStyles.iconLarge(theme)]: size === 'large',
[jsStyles.iconDisabled(theme)]: disabled,
});
return (
<span className={iconStyles}>
<CalendarIcon />
</span>
);
}
return null;
};
private handleFocus = (e: React.FocusEvent<HTMLElement>) => {
this.setState(prevState => ({
focused: true,
selected: this.isMouseDown && !prevState.focused ? prevState.selected : this.iDateMediator.getLeftmostType(),
}));
if (this.props.onFocus) {
this.props.onFocus(e);
}
};
private handleBlur = (e: React.FocusEvent<HTMLElement>) => {
const restored = this.iDateMediator.restore();
this.updateValue({ focused: false, selected: null, inputMode: false });
if (this.props.onBlur) {
if (restored) {
e.persist();
this.blurEvent = e;
} else {
this.props.onBlur(e);
}
}
};
private handleMouseDownCapture = (e: React.MouseEvent<HTMLSpanElement>) => {
const isFragment = this.dateFragmentsView ? this.dateFragmentsView.isFragment(e.target) : false;
if (this.state.focused && !isFragment) {
e.preventDefault();
}
this.isMouseFocus = !this.state.focused;
this.isMouseDown = isFragment;
};
private handleSelectDateComponent = (type: InternalDateComponentType) => {
if (!(this.isMouseFocus && this.iDateMediator.isEmpty())) {
this.selectDateComponent(type);
}
this.isMouseFocus = false;
this.isMouseDown = false;
};
private handleMouseDragStart = () => {
this.setState({ dragged: true, selected: null });
};
private handleMouseDragEnd = () => {
const selection = getSelection();
if (
selection &&
selection.toString().length === LENGTH_FULLDATE &&
this.state.selected !== InternalDateComponentType.All
) {
this.selectDateComponent(InternalDateComponentType.All);
}
};
private handleKeyDown = (e: React.KeyboardEvent<HTMLElement>) => {
if (this.conditionalHandler(extractAction(e), e)) {
e.preventDefault();
}
if (this.props.onKeyDown) {
this.props.onKeyDown(e);
}
};
private handlePaste = (e: React.ClipboardEvent<HTMLElement>) => {
const pasted = e && e.clipboardData.getData('text').trim();
if (pasted && this.iDateMediator.validateString(pasted)) {
this.iDateMediator.paste(pasted);
this.updateValue();
}
};
private handleDoubleClick = () => {
this.selectDateComponent(InternalDateComponentType.All);
};
private inputLikeTextRef = (el: InputLikeText | null) => {
this.inputLikeText = el;
};
private dateFragmentsViewRef = (el: DateFragmentsView | null) => {
this.dateFragmentsView = el;
};
private selectDateComponent = (selected: InternalDateComponentType | null): void => {
this.setState({ selected, inputMode: false });
};
private updateValue = (state: Partial<DateInputState> = {}): void => {
const valueFormatted = this.iDateMediator.getString();
this.setState({ ...state, valueFormatted } as DateInputState, this.emitChange);
};
private updateFromProps = (): void => {
this.iDateMediator.update(this.props, this.locale);
this.updateValue();
};
private fullSelection = (): void => {
this.selectDateComponent(InternalDateComponentType.All);
};
private pressDelimiter = (): void => {
const value = this.iDateMediator.get(this.state.selected);
if (value !== null && value !== '') {
if (!this.ignoringDelimiter) {
this.shiftSelection(1);
}
this.ignoringDelimiter = false;
}
};
private emitChange = (): void => {
const value = this.iDateMediator.getInternalString();
if (this.props.value === value) {
return;
}
if (this.props.onValueChange) {
this.props.onValueChange(value);
}
if (this.blurEvent && this.props.onBlur) {
this.props.onBlur(this.blurEvent);
this.blurEvent = null;
}
};
private clearSelected = (): void => {
const selected = this.state.selected === null ? this.iDateMediator.getLeftmostType() : this.state.selected;
this.iDateMediator.clear(selected);
this.updateValue({
inputMode: false,
selected: selected === InternalDateComponentType.All ? this.iDateMediator.getLeftmostType() : selected,
});
};
private clearOneChar = (): void => {
const { selected, inputMode } = this.state;
const nextType = selected === null ? this.iDateMediator.getRightmostType() : selected;
if (this.iDateMediator.isNull(nextType)) {
this.shiftSelection(-1);
return;
}
if (selected === InternalDateComponentType.All) {
this.iDateMediator.clear(InternalDateComponentType.All);
this.updateValue({ selected: this.iDateMediator.getLeftmostType() });
return;
}
this.iDateMediator.deleteOneCharRight(nextType, inputMode);
this.updateValue({
inputMode: this.iDateMediator.get(nextType) !== null,
selected: nextType,
});
};
private shiftDateComponent = (step: number): void => {
const { selected } = this.state;
const changed = this.iDateMediator.shiftDateComponent(selected, step);
if (!changed) {
this.blink();
return;
}
this.updateValue({
inputMode: false,
selected: selected === InternalDateComponentType.All ? this.iDateMediator.getLeftmostType() : selected,
});
};
private shiftSelection = (step: number): void => {
const selected = this.iDateMediator.getShiftedType(this.state.selected, step);
if (selected !== this.state.selected) {
this.setState({ selected, inputMode: false });
}
};
private inputValue = (event: React.KeyboardEvent<HTMLElement>): void => {
let selected = this.state.selected;
if (selected === InternalDateComponentType.All) {
selected = this.iDateMediator.getLeftmostType();
this.iDateMediator.clear(InternalDateComponentType.All);
this.setState({ selected });
}
const inputMode = this.iDateMediator.inputKey(event.key, selected, this.state.inputMode);
if (!inputMode) {
this.ignoringDelimiter = true;
this.shiftSelection(1);
}
this.updateValue({ inputMode });
};
}
|
Q:
remove all dependencies of a jar within a maven assembly
I am trying to create a zip file that includes two folders each folder will contain a plugin of a certain dependency within the pom. I am currently able to create the correct structure but I would like to make sure that the jar of the first dependency for example does not fall within that of the second.
my current pom structure is as follows:
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
<modelVersion>4.0.0</modelVersion>
<parent>
<groupId>PARENT-GROUP</groupId>
<artifactId>PARENT-ARTIFACT</artifactId>
<version>0.2.0-SNAPSHOT</version>
</parent>
<groupId>GROUP-ID</groupId>
<artifactId>ARTIFACT-ID</artifactId>
<properties>
<main.project>MAIN-PROJECT</main.project>
<plugin.version>0.0.1-SNAPSHOT</plugin.version>
<plugin.artifact>PLUGIN-ID</plugin.artifact>
</properties>
<dependencies>
<dependency>
<groupId>PLUGIN-GROUP</groupId>
<artifactId>${plugin.artifact}</artifactId>
<version>${plugin.version}</version>
</dependency>
<dependency>
<groupId>SECOND-DEPENDENCY</groupId>
<artifactId>SECOND-ARTIFACT-ID</artifactId>
<version>${project.parent.version}</version>
</dependency>
</dependencies>
<build>
<finalName>${main.project}-${project.parent.version}</finalName>
<plugins>
<plugin>
<artifactId>maven-assembly-plugin</artifactId>
<version>2.4</version>
<executions>
<execution>
<phase>package</phase>
<goals>
<goal>single</goal>
</goals>
</execution>
</executions>
<configuration>
<appendAssemblyId>false</appendAssemblyId>
<descriptors>
<descriptor>${project.basedir}/src/zip.xml</descriptor>
</descriptors>
</configuration>
</plugin>
</plugins>
</build>
</project>
As can be seen I have two dependencies within the pom that I am getting. The output I would like to have is the following folder structure
main\lib: contains the second dependency jar with all it's dependencies within the same folder.
main\plugin\plugin: contains all of the first dependency (the plugin and all it's dependency) both folders should not include the dependency of the first and vice versa. So far I have come up with the following assembly xml
<assembly
xmlns="http://maven.apache.org/plugins/maven-assembly-plugin/assembly/1.1.0"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://maven.apache.org/plugins/maven-assembly-plugin/assembly/1.1.0 http://maven.apache.org/xsd/assembly-1.1.0.xsd">
<id>release</id>
<formats>
<format>zip</format>
</formats>
<includeBaseDirectory>false</includeBaseDirectory>
<dependencySets>
<dependencySet>
<outputDirectory>/lib</outputDirectory>
<unpack>false</unpack>
<useProjectArtifact>false</useProjectArtifact>
<excludes>
<exclude>
*:${plugin.artifact}
</exclude>
</excludes>
</dependencySet>
<dependencySet>
<outputDirectory>/plugins/${plugin.artifact}-${plugin.version}/${plugin.artifact}-${plugin.version}</outputDirectory>
<unpack>false</unpack>
<useProjectArtifact>false</useProjectArtifact>
<excludes>
<exclude>
*:SECOND-ARTIFACT-ID
</exclude>
</excludes>
</dependencySet>
</dependencySets>
</assembly>
This give me the write folder structure but includes the dependencies in both I would like to know if there is a better way to exclude the dependencies of each of the jars automatically instead of excluding them one by one
A:
Helping other people with the solution if they are looking for it. All you will need to perform is adding within the dependencySet an extra tag user transitive filtering and set it to true.
<dependencySet>
<outputDirectory>/lib</outputDirectory>
<unpack>false</unpack>
<useProjectArtifact>false</useProjectArtifact>
<useTransitiveFiltering>true</useTransitiveFiltering>
<excludes>
<exclude>
*:${plugin.artifact}
</exclude>
</excludes>
</dependencySet>
this will make sure that the excludes dependencies are filtered.
|
Children with physical disability: gaps in service provision, problems joining in.
To describe the reported experiences of the estimated 14 500 New Zealand children with a physical disability and those of their families and whanau (extended families). We have used data from the Household Disability Survey conducted in 2002 to obtain this information. These children and their carers reported a number of perceived unmet needs in all areas covered in the survey: service and assistance, transport, accommodation and education. Thus an estimated 24% reported an unmet need for equipment, and 10% an unmet need for home modification. Around 9% reported having to fund respite care themselves. Of particular note was the proportion of children who had difficulties joining in games and sport at school (59%), going on school outings or camps (28%), playing at school (47%), and or making friends (35%). In all, an estimated 67% of children had one or more problems taking part at school. More could be done to help such families and to facilitate the full participation of these children. |
Tania's sight is restored
At five years of age, Tania had developed a cataract in her right eye - by the time she was 10, she was blind in both eyes. Her family’s lack of financial resources meant Tania was deprived of treatment she desperately needed.
Approximately 40,000 children in Bangladesh are blind - 12,000 cases due to cataract
Tania stopped going to school and had started losing contact with friends, becoming increasingly isolated due to her blindness.
With the help of The Fred Hollows Foundation, in partnership with the Bangladesh National Institute of Ophthalmology in Dhaka, Tania’s sight was restored and she has now returned to school.
More than 650,000 people in Bangladesh suffer from cataract blindness and there is an annual incidence of 130,000 cases. An estimated 6.65 million adults need glasses.
The Foundation currently operates in 14 districts in partnership with government and non-government organisations’ hospitals. The Foundation supported 4,968 cataract surgeries in Bangladesh last year. A further 21,310 other sight saving or improving interventions and 74,392 screenings were also supported by The Foundation in 2011. |
Maximilien Rubel 1973
Marx, theoretician of anarchism
Source: L'Europe en formation, no 163-164, octobre-novembre 1973;
Transcribed: for marxists.org by Adam Buick;
Translated: by Adam Buick;
CopyLeft: Creative Commons (Attribute & ShareAlike) marxists.org 2005.
Marx has been badly served by disciples who have succeeded neither in assessing the limits of his theory nor in determining its standards and field of application and has ended up by taking on the role of some mythical giant, a symbol of the omniscience and omnipotence of homo faber, maker of his own destiny.
The history of the School remains to be written, but at least we know how it came into being: Marxism, as the codification of a misunderstood and misinterpreted body of thought, was born and developed at a time when Marx’s work was not yet available in its entirely and when important parts of it remained unpublished. Thus, the triumph of Marxism as a State doctrine and Party ideology preceded by several decades the publication of the writings where Marx set out most clearly and completely the scientific basis and ethical purpose of his social theory. That great upheavals took place which invoked a body of thought whose major principles were unknown to the protagonists in the drama of history should have been enough to show that Marxism was the greatest, if not the most tragic, misunderstanding of the century. But at the same time this allows us to appreciate the significance of the theory held by Marx that it is not revolutionary ideas or moral principles which bring about changes in society, but rather human and material forces; that ideas and ideologies very often serve only to disguise the interest of the class in whose interests the upheavals take place. Political Marxism cannot appeal to Marx’s science and at the same time escape the critical analysis which that science uses to unmask the ideologies of power and exploitation.
Marxism as the ideology of a master class has succeeded in emptying the concepts of socialism and communism, as Marx and his forerunners understood them, of their original meaning and has replaced it with the picture of a reality which is its complete negation. Although closely linked to the other two, a third concept – anarchism – seems however to have escaped this fate of becoming a mystification. But while people know that Marx had very little sympathy for certain anarchists, it is not so generally known that despite this he still shared the anarchist ideal and objectives: the disappearance of the State. It is therefore pertinent to recall that in embracing the cause of working class emancipation, Marx started off in the anarchist tradition rather than in that of socialism or communism; and that, when finally he chose to call himself a “communist,” for him this term did not refer to one of the communist currents which then existed, but rather to a movement of thought and mode of action which had yet to be founded by gathering together all the revolutionary elements which had been inherited from existing doctrines and from the experience of past struggles.
In the reflections which follow we will try to show that, under the name communism, Marx developed a theory of anarchism; and further, that in fact it was he who was the first to provide a rational basis for the anarchist utopia and to put forward a project for achieving it. In view of the limited scope of the present essay we will only put this forward as an item for discussion. Proof by means of quotations will be reduced to a minimum so as to better bring out the central argument: Marx theoretician of anarchism.
I
When in Paris in February 1845, on the eve of his departure for exile in Brussels, Marx signed a contract with a German publisher he committed himself to supplying in a few months a work in two volumes entitled “A Critique of Politics and Political Economy” without suspecting that he had imposed on himself a task which would take up his while life and of which he would be able to carry out only a largish fragment.
The choice of subject was no accident. Having given up all hope of a university career, Marx had carried over into his political journalism the results of his philosophical studies. His articles in the Rheinische Zeitung of Cologne led the fight for freedom of the press in Prussia in the name of a liberty which he conceived of as the essence of Man and as the attire of human nature; but also in the name of a State understood as the realisation of rational freedom, as “the great organism, in which legal, moral, and political freedom must be realised, and in which the individual citizen in obeying the laws of the state only obeys the natural laws of his own reason, of human reason.”[1] But the Prussian censorship soon silenced the philosopher-journalist. Marx, in the solicitude of a study retreat, did not take long to ask himself about the real nature of the State and about the rational and ethical validity of Hegel’s political philosophy. We know what was the fruit of this meditation enriched by the study of the history of the bourgeois revolutions in France, Great Britain and the United States: apart from an incomplete and unpublished work, The Critique of Hegel’s Philosophy of the State (1843), two polemical essays, Introduction to the Critique of Hegel’s Philosophy of Right and On the Jewish Question (Paris, 1844). These two writings in fact form a single manifesto in which Marx identifies once and for all and condemns unreservedly the social institutions – the State and Money – which he saw as at the origin of the evils and defects from which modern society suffered and would go on suffering until a new social revolution came to abolish them. At the same time Marx praised the force – the modern proletariat – which, after having been the main victim of these two institutions, was going to put an end to their reign as well as to every other form of class domination, political and economic. The self-emancipation of the proletariat would be the complete emancipation of humanity; after the total loss of humanity the total victory of the human.
In the intellectual development of Marx the rejection of the State and Money and the affirmation that the proletariat was a liberating class came before his studies of political economy; they preceded also his discovery of the materialist conception of history, the “guiding line” which directed his later historical researches. His break with Hegel’s philosophy of law and politics on the one hand and his critical study of bourgeois revolutions on the other allowed him to establish clearly the ethical postulates of his future social theory for which the scientific basis was to be provided by the critique of political economy. Having understood the revolutionary role of democracy and legislative power in the genesis of the bourgeois State and governmental power, Marx made use of the illuminating analysis of two shrewd observers of the revolutionary possibilities of American democracy, Alexis de Tocqueville and Thomas Hamilton, to lay down a rational basis for an anarchist utopia as the conscious aim of the revolutionary movement of the class which his master Saint Simon had called “the most numerous and most poor.” Since the critique of the State led him to envisage the possibility of a society free from all political authority, he had to go on to make a critique of the economic system which ensured the material basis of the State. The ethical rejection of money also implied an analysis of political economy, the science of the enrichment of some and of the impoverishment of others. Later he was to describe the research he was about to begin on the “anatomy of bourgeois society” and it was by engaging in this work of social anatomy that he was to work out his methodology. Later the rediscovery of the Hegelian dialectic would help him to establish the plan of the “Economy” under six “headings” or “books”: Capital, Landed Property, Wage Labour; The State, Foreign Trade, World Market (see Preface to the Critique of Political Economy, 1859). In fact, this double “triad” of items for research corresponds to the two problems which he had proposed to deal with fourteen years previously in the work which was to contain a critique of both political economy and politics. Marx began his work with the critical analysis of the capitalist mode of production, but he hoped to live and work long enough not only to complete this but also, once he had completed the first triad of headings, to begin on the second triad which would thus have found the Book on the State.[2] The theory of anarchism would thus have found in Marx its first recognised exponent without there being any need to prove this indirectly. The misunderstanding of the century of Marxism as an ideology of the State was the result of the fact that Marx never wrote this book. It was this which has allowed the masters of a State apparatus labelled socialist to include Marx among the proponents of State socialism or communism, indeed even of “authoritarian” socialism.
Certainly, like every revolutionary teaching, that of Marx is not free from ambiguities. It is by cleverly exploiting these ambiguities and by referring to certain personal attitudes of the master that some of his unscrupulous disciples have succeeded in putting his work at the service of doctrines and actions which represent, in relation to both its basic truth and its declared objective, its complete negation. At a time when many decades of regression in human relations have called into question all theories, values, systems and projects, it is important to gather together the intellectual heritage of an author who, aware of the limits of his research, made the call for critical self-education and revolutionary self-emancipation the permanent principle of the workers’ movement. It is not up to posterity burdened with overwhelming responsibilities to judge a man who can no longer plead his cause; but on the other hand it is our duty to take up a teaching which was completely oriented towards the future, a future which certainly became our catastrophic present but which mostly still remains to be created.
II
We repeat: the “Book” on the State, foreshadowed in the plan of the Economy but which remained unwritten, could only have contained the theory of society freed from the State, anarchist society. Although not directly intended for this work, the materials and works prepared or published by Marx in the course of his literary activity allow us both to put forward this hypothesis about the content of the planned work and to work out what its general structure would have been. While the first triad of headings was part of the critique of political economy, the second would have put forward essentially a critique of politics. Following on from the critique of capital, the critique of the State would have established what determined the political evolution of modern society, just as the purpose of Capital (followed by the Books on “Landed Property” and “Wage Labour”) was to “lay bare the economic law of motion of modern society” (cf. Preface to Capital, 1867). In the same way that the principles and postulates which motivated Marx when making his critique of capital are to be found in his published and unpublished writings prior to the Critique of Political Economy (1859), so we can extract from these writings those which would have guided him in developing his criticism of the State. It would however be a mistake to suppose that at this time Marx’s thought on the nature of politics was established in its final form, with no possibility of modifying details and closed to all theoretical enrichment. Quite the contrary. The problem of the State never ceased to concern Marx not only because he failed to keep the moral engagement to finish his master work, but above all because it was constantly kept in his mind by his participation and polemical confrontations after September 1864 within the International Workingmen’s Association and by political events, particularly the rivalry for leadership between France and Prussia on the one hand and Russia and Austria on the other. The Europe of the Treaty of Vienna had then become no more than a fiction, while two important social phenomena had made their appearance on the scene of history: movements for national liberation and the workers’ movement. The struggle between nations and the class struggle, which were difficult to reconcile from a purely conceptual point of view, were to raise problems of theory requiring decisions by Marx and Engels which could not but bring them into contradiction with their own revolutionary principles. Engels made a speciality of differentiating between peoples and nations according to how, in his eyes, they could or could not claim the historical right to national existence. Their sense of historical realities prevented the two friends from following Proudhon in the way of a federalism which, in the situation of the time, must have seemed both a pure abstraction and an impure utopia; but they risked falling into a nationalism which was incompatible with the universalism of the modern proletariat they had posited.
If Proudhon, by his federalist aspirations, seems to be nearer than Marx to the anarchist position, the picture changes when we consider Proudhon’s overall conception of the reforms which should lead to the abolition of capital and the State. The almost excessive praise of which Proudhon is the object in the Holy Family (1845) should not mislead us. From this time on there were deep theoretical differences between the two men; the praise had only been conceded to the French socialist with a very important reservation: Proudhon’s critique of property was implicit in the bourgeois economic system, but however valid it might be it did not call into question the social relations of the system which it criticised. Quite the contrary. In Proudhon’s doctrine, the economic categories, which were theoretical expressions of the institutions of capital, were all systematically preserved. Proudhon’s merit was to have revealed the inherent contradictions of economic science and to have shown the immorality of bourgeois morality and law; his weakness was to have accepted the categories and institutions of the capitalist economy and to have respected, in his programme of reforms and solutions, all the instruments of the bourgeois class and its political power: wages, credit, banks, exchange, price, value, profit, interest, taxes, competition, monopoly. After applying the dialectic of the negation in his analysis of the evolution of law and legal systems, he stopped half-way by not extending his critical method of the negation to the capitalist economy. Proudhon opened the way for such a criticism, but it was Marx who was to create this new method of criticism and to try to use it as a weapon in the struggle of labour against capital and the State.
Proudhon had made his critique of bourgeois economics and law in the name of bourgeois morality; Marx was to make his criticism in the name of proletarian ethics, whose standards of judgement were taken from quite a different vision of human society. To do this he only had to follow to its logical conclusion Proudhon’s – or rather Hegel’s – principle of negation: the Justice of which Proudhon dreamed could only be established by the negation of justice just as philosophy could only be put into practice by the negation of philosophy, i.e., by a social revolution which would at last allow humanity to become social and society to be become human. This would be the end of the pre-history of humanity and the beginning of individual life, the appearance of fully-developed Man, with all-round faculties, the coming of complete Man. Marx opposed the realist morality of Proudhon, which sought to save the “good side” of bourgeois institutions, with the ethic of a utopia whose demands would be measured by the possibilities offered by a science and technology sufficiently developed to provide for the needs of the race. Marx opposed an anarchism which respected the plurality of classes and social categories, which favoured the division of labour and which was hostile to the associationists proposed by the utopians, with an anarchism which rejected social classes and the division of labour, a communism which took over all in utopian socialism that could be achieved by a proletariat which was conscious of its emancipating role and which had become master of the forces of production. However, in spite of these divergent means – in particular, as we shall see, a different attitude towards political action – the two types of anarchism aimed at a common end which the Communist Manifesto defined in these terms:
“In place of the old bourgeois society, with its classes and class antagonisms, we shall have an association, in which the free development of each is the condition for the free development of all.”
III
Marx refused to invent recipes for the cooking pots of the future, but he did better – or worse – than this: he wanted to show that historical necessity – like some blind fate – was leading humanity to a situation of crisis where it would face a decisive dilemma: to be destroyed by its own technical inventions or to survive thanks to a leap in consciousness which would allow it to break with all the forms of alienation and servitude which had marked the stages of its history. Only this dilemma was fated, the actual choice would be left to the social class which had every reason to reject the existing order and to establish a fundamentally different mode of existence. The modern proletariat was potentially the material and moral force that was capable of taking up this universally significant task of salvation. However this potential force could not become real until the bourgeois period had been completed. For the bourgeoisie too had a historical role to play. If it had not always been conscious of this, then its apologists had had the task of reminding it of its civilising role. In creating the world in its image, the bourgeoisie of the industrially developed countries embourgeoisified and proletarianised the societies which progressively fell under its political and economic control. Seen from the viewpoint of proletarian interests, these instruments of conquest, capital and the State, were just means of servitude and suppression, but when the relations of capitalist production and therefore of capitalist States had been firmly established on a world scale, then the internal contradictions of the world market would reveal the limits of capital accumulation and provoke a state of permanent crisis which would endanger the foundations of the enslaved societies and threaten the very survival of the human race. The hour of the proletarian revolution would sound the world over.
By extrapolating reasonably we have been able to see the logical conclusions of the dialectical method employed by Marx in laying bare the economic law of movement of modern society. We could back up this view with textual references beginning with the remarks on methodology which can be gleaned from many of Marx’s writings dating from different periods. It is no less true that the hypothesis which Marx most frequently offers us in his political works is that of the proletarian revolution in the countries which have known a long period of bourgeois civilization and capitalist economy; such a revolution would mark the beginning of a process of development which would gradually involve the rest of the world, historical progress being hastened through the revolution being contagious. But whatever the hypothesis Marx had in mind, one thing is clear: his social theory had no place for a third revolutionary way where countries which lacked the historical experience of developed capitalism and bourgeois democracy would show the way to proletarian revolution to countries which had had a long capitalist and bourgeois past.
We recall with particular insistence these elementary truths of the conception of history called materialist because the Marxist mythology born with the 1917 Russian revolution has succeeded in imposing on the uniformed – and they were legion – another view of the process of this revolution: humanity divided into two economic and political systems, the capitalist world dominated by the industrially developed countries and the socialist world the model for which, the USSR, had reached the rank of second world power following a “proletarian” revolution. In fact, the industrialisation of Russia has been due to the creation and exploitation of an immense proletariat and not to its triumph and abolition. The fiction of the “dictatorship of the proletariat” forms part of the arsenal of ideas which the new masters have imposed in the interests of their own power: six decades of nationalist and military barbarism on a world scale explain the mental confusion of an intelligentsia which has been completely misled by the myth of “socialist October.” [3]
Since we cannot deepen the discussion here we will restrict ourselves to expressing our point of view in the form of an alternative: either the materialist theory of social development has some scientific validity – Marx himself was naturally persuaded of this – and in this case the “socialist” world is a myth or the socialist world really exists and the materialist theory of social development is completely and totally invalidated. On the first hypothesis the myth of the socialist world is perfectly explained: it would be the fruit of a well-organised ideological campaign by the “first workers’ State” aimed at disguising its real nature. On the second hypothesis the materialist theory of how the world would become socialist would certainly be disproved, but the ethical and utopian demands of Marx’s teaching would have been achieved; in other words, refuted by history as a man of science, Marx would have triumphed as a revolutionary.
The myth of “really existing socialism” has been constructed in order to morally justify one of the most powerful forms of dominating and exploitative society that history had known. The problem of the nature of this society has completely confused those most informed about the theories, doctrines and ideas which together form the intellectual heritage of socialism, communism and anarchism. Of these three schools – or currents – of the movement of ideas which seeks a fundamental change in human society, anarchism has suffered the least from this perversion. Not having created a real theory of revolutionary practice, it has been able to preserve itself from the political and ideological corruption which has struck the two other schools of thought. Originating from dreams and longings for the past as well as from rejection and revolt, anarchism was formed as a radical criticism of the principle of authority in all its forms, and it is above all as such that it was incorporated into the materialist conception of history. This latter is essentially the view that the historical evolution of humanity passes by progressive stages from a permanent state of social antagonism to a mode of existence based on social harmony and individual development. The common aim of pre-Marxian radical and revolutionary doctrines became an integral part of Marx’s anarchist communism just as the social criticism transmitted by the anarchist utopia had. With Marx, utopian anarchism was enriched by a new dimension, that of the dialectical understanding of the workers’ movement as an ethical self-liberation embracing the whole of humanity. The dialectical element in a theory claiming to be scientific, indeed naturalistic, caused an intellectual strain which was inevitably the source of the fundamental ambiguity with which Marx’s teaching and activity is indelibly marked. Marx, who was a militant as well as a theorist, did not always seek to harmonise in his political activity the ends and means of anarchist communism. But the fact that he failed as a militant does not mean that he therefore ceased to be the theoretician of anarchism . It is thus right to apply to his own theory the ethical thesis which he formulated with regard to Feuerbach’s materialism (1845):
“The question whether human thinking can pretend to objective truth is not a theoretical but a practical question. Man must prove the truth, i.e. the reality and power, the ‘this-sideness’ of his thinking in practice” . [4]
IV
The negation of the State and capitalism by the most numerous and most poor class appears in Marx as an ethical imperative before he demonstrated dialectically that it was a historical necessity. In its first form, in Marx’s critical assessment of the French Revolution, it represented a decisive choice to be made: the objective which according to Marx humanity should strive to achieve. This objective was precisely human emancipation by going beyond political emancipation. The freest political State – of which the Unites States of America provided the only example – made Man a slave because it intervened as mediator between Man and his freedom, just like the Christ in whom the religious person vests his own divinity. Man when politically emancipated still only had an imaginary sovereignty. As a sovereign being enjoying the Rights of Man he led a double existence: that of a citizen of the political community and that of an individual member of society; that of a heavenly and that of an earthly being. As a citizen he was free and sovereign in the skies of politics, that universal kingdom of equality. As an individual he was degraded in his real life, bourgeois life, and reduced to the level of a means for his neighbour; he was the plaything of alien forces, material and moral, such as the institutions of private property, culture, religion, etc. Bourgeois society separated from the political State was the realm of egoism, of the war of each against all, of the separation of man from man. Political democracy had not freed Man from religion by ensuring his religious liberty, any more than it freed him from property in guaranteeing him the right to property. Similarly when it granted everyone the freedom to choose his occupation political democracy maintained occupational slavery and egoism. Bourgeois society was the world of trafficking and profiting, the reign of money, the universal power which had subjected politics and hence the State.
Such, in summary, was Marx’s initial thesis. It was a critique of the State and capital and it belonged to anarchist thought rather than to any socialism or communism. There was not yet anything scientific about it, but it implicitly appealed to and based itself on an ethical conception of the destiny of humanity in that it insisted on the need of doing something within the framework of historical time. This is why he did not just make a critique of political emancipation – that it reduced man to being an egoistic monad and an abstract citizen – but put forward both the end to be achieved and the means of achieving it:
“Only when the real, individual man re-absorbs in himself the abstract citizen, and as an individual human being has become a species-being in his everyday life, in his particular work, and in his particular situation, only when man has recognized and organized his “own powers” as social powers, and, consequently, no longer separates social power from himself in the shape of political power, only then will human emancipation have been accomplished.” [5]
Marx developed his own theory by starting from the Social Contract of Rousseau, the theoretician of the abstract citizen and precursor of Hegel. Rejecting only partially the political alienation which these two thinkers proposed, he arrived at the vision of a human and social emancipation that would re-establish the individual as a complete being with fully developed faculties. This rejection was only partial because this state of political alienation, as a fact of history, could not be abolished by an act of will. Political emancipation was “a great progress,” it was even the last form of human emancipation within the established order, and it is as such that it could serve as a means to overthrow this order and inaugurate the stage of real human emancipation. The means and the end were dialectical opposites but were reconciled ethically in the consciousness of the modern proletariat which thus became the bearer and historical subject of the revolution. The proletariat, as a class in which were concentrated all the evils and which embodied the well-known crimes of all society, possessed a universal character as a result of its universal poverty. It could not emancipate itself without emancipating all spheres of society, and it was by putting into practice the demands of this ethic of emancipation that it would abolish itself as a proletariat.
Where Marx speaks of philosophy as the “head” and intellectual arm of the human emancipation of which the proletariat would be the “heart,” we prefer to speak of an ethic in order to show that it is not a question of metaphysical speculation but a problem of existence: people should not interpret a caricature of the world but should change it by giving it a human face. No speculative philosophy had any solution to offer Man for his problems of existence. This was why Marx, when he made the revolution a categorical imperative, reasoned from a normative ethic and not from a philosophy of history or a sociological theory. Because he could not and did not want to limit himself to a purely ethical demand for the regeneration of humanity and society Marx’s interest was then aroused by one particular science: the science of the production of the means of existence according to the law of capital.
Marx thus undertook the study of political economy as a means of struggling for the cause to which from that time on he was to devote his whole declassé “bourgeois” existence. What till then had only been a visionary institution and an ethical choice was to become a theory of economic development and a study of what determined societies. But it was also to be active participation in the social movement whose task was to put into practice the ethical demands which derived from the conditions of existence of the modern proletariat. Both the vision of a society without State, without classes, without monetary exchange, without religious and intellectual fears and the analysis which revealed the process of evolution that would lead by successive steps to forms of anarchist and communist society implied a theoretical critique of the capitalist mode of production. Marx was to write later:
“Even when a society has got upon the right track for the discovery of the natural laws of its movement . . . it can neither clear by bold leaps, nor remove by legal enactments, the obstacles offered by the successive phases of its normal development. But it can shorten and lessen the birth-pangs.” ( Preface to Capital, Volume I)
In short, Marx set out to demonstrate scientifically what he was already persuaded of intuitively and what appeared to him to be ethically necessary. It was in his first attempt at a critique of political economy that he came to analyse capital from a sociological point of view as the power to command labour and its products, a power which the capitalist possessed not by virtue of his personal or human qualities but as the owner of property. The wages system was a form of slavery; any authoritarian raising of wages would only mean better rations for the slaves:
“Even the equality of wages, which Proudhon demands, would merely transform the relation of the present-day worker to his work into the relation of all men to work. Society would then be conceived as an abstract capitalist.” [6]
Economic slavery and political servitude went together. Political emancipation, i.e., the recognition of the Rights of Man by the modern State, had the same significance as the recognition of slavery by the State of antiquity (The Holy Family, 1845). The worker was a slave to his paid occupation and also to his own egoistic needs experienced as alien needs. People were just as much subject to political servitude in the democratic representative State as in a constitutional monarchy. “In the modern world, everybody is at the same time a slave and a member of the community,” although the servitude of bourgeois society takes the form of the maximum of freedom (ibid.). Property, industry and religion, which are generally regarded as guarantees of individual liberty, were in fact institutions which sanctified this state of servitude. Robespierre, Saint-Just and their partisans failed because they did not distinguish antiquity based on real slavery from the modern representative State based on emancipated slavery, i.e., bourgeois society with its universal competition, its unbridled private interests and its alienated individualism. Napoleon, who understood perfectly the nature of the modern State and modern society, considered the State as an end in itself and bourgeois society as the instrument of his political ambitions. To satisfy the egoism of the French nation, he instituted permanent war in place of permanent revolution. His defeat confirmed the victory of the liberal bourgeoisie which in 1830 was finally able to make its dreams of 1789 become true: to make the constitutional representative State the social expression of its monopoly of power and sectional interests.
Marx, as a permanent observer of both the political evolution and economic development of French society, was constantly concerned with the problem of Bonapartism. [7] He considered that the French Revolution was the classic period of the political idea and that the Bonapartist tradition was a constant of the internal and external politics of France. He also outlined a theory of modern Caesarism which, even if it seemed to contradict in part the methodological principles of his theory of the State, did not modify his initial anarchist vision. For at the very time he was getting ready to set out the basic principles of his materialist conception of history he had formulated the following conception of the State which places him amongst the most radical anarchism:
“The existence of the state is inseparable from the existence of slavery ... The more powerful a state and hence the more political a nation, the less inclined it is to explain the general principle governing social ills and to seek out their causes by looking at the principle of the state – i.e., at the actual organization of society of which the state is the active, self-conscious and official expression.” [8]
The example of the French Revolution seemed to him at that time to be sufficiently convincing to make him put forward a view which only corresponded in part to the political sociology which he was soon to set out in the German Ideology, but which can be found much later in his reflections on the Second Empire and the 1871 Commune.
“Far from identifying the principle of the state as the source of social ills, the heroes of the French Revolution held social ills to be the source of political problems. Thus Robespierre regarded great wealth and great poverty as an obstacle to pure democracy. He therefore wished to establish a universal system of Spartan frugality. The principle of politics is the will.” [9]
When twenty-seven years later in connexion with the Paris Commune Marx was to return to the historical origins of the political absolutism which the Bonapartist State represented, he was to see in the centralisation carried out by the French Revolution the continuation of the traditions of the monarchy:
“The centralized State machinery which, with its ubiquitous and complicated military, bureaucratic, clerical and judiciary organs, entoils (enmeshes) the living civil society like a boa constrictor, was first forged in the days of absolute monarchy as a weapon of nascent modern society in its struggle of emancipation from feudalism ... The first French Revolution with its task to found national unity (to create a nation) . . . was, therefore, forced to develop, what absolute monarchy had commenced, the centralization and organization of State power, and to expand the circumference and the attributes of the State power, the number of its tools, its independence, and its supernaturalist sway of real society . . . Every minor solitary interest engendered by the relations of social groups was separated from society itself, fixed and made independent of it and opposed to it in the form of State interest, administered by State priests with exactly determined hierarchical functions.” [10]
This passionate denunciation of the power of the State in some way sums up all the work of study and critical reflection which Marx carried out in this field: his confrontation with the moral and political philosophy of Hegel; the period during which he worked out the materialist conception of history; his fifteen years of political and professional journalism; and, not to be forgotten, his intense activity within the International Workingmen’s Association. The Commune seems to have given Marx the opportunity to put the finishing touches to his thoughts on the problem for which he had reserved one of the six books of his Economy and to give a picture, if only in outline, of that free association of free men whose coming had been announced by the Communist Manifesto.
“This was, therefore, a revolution not against this or that, legitimate, constitutional, republican or imperialist form of State power. It was a revolution against the State itself, of this supernaturalist abortion of society, a resumption by the people for the people of its own social life.” [11]
V
Comparing how the serfs had been emancipated from the feudal regime with the emancipation of the modern working class, Marx noted that, unlike the proletarians, the serfs had to struggle to allow existing social conditions to develop freely and as a result could only arrive at “free labour.” The proletarians, on the other hand, had, in order to affirm themselves as individuals, to abolish their own social condition; since this was the same as that of the whole of society, they had to abolish wage labour. And he added this sentence which from then on was to serve as the theme of both his literary work and his activity as a communist militant:
“Thus they [the proletarians] find themselves directly opposed to the form in which, hitherto, the individuals, of which society consists, have given themselves collective expression, that is, the State. In order, therefore, to assert themselves as individuals, they must overthrow the State.” [12]
This view, which was nearer to the anarchism of Bakunin than to that of Proudhon, was not uttered in the heat of the moment nor was it the rhetoric of a politician haranguing a workers’ meeting. It was the logical conclusion, expressed as a revolutionary demand, of the whole development of a theory whose purpose was to demonstrate the “historical necessity” of the anarchist commune. In other words, in Marx’s theory, the coming of “human society” was seen as the outcome of a long historical process. Eventually, a social class would arise which would comprise the immense majority of the population of industrial society and which as such would be capable of carrying out a creative revolutionary task. It was to show the logic of this development that Marx sought to establish a causal link between scientific progress – above all that of the natural sciences – and, on the one hand, political and legal institutions and, on the other, the behaviour of antagonistic social classes. Unlike Engels, Marx did not consider that the future revolutionary transformation would take place in the same way as past revolutions, like a cataclysm of Nature crushing men, things and consciousness. With the coming of the modern working class, the human race began the cycle of its real history; it entered on the way of reason and became capable of making its dreams come true and of giving itself a destiny in accordance with its creative faculties. The conquests of science and technology made such an outcome possible, but the proletariat had to intervene in order to prevent the bourgeoisie and capital from changing this evolution into a march into the abyss:
“The victories of art seem bought by the loss of character. At the same pace that mankind masters nature, man seems to become enslaved to other men or to his own infamy.” [13]
So the proletarian revolution would not be a political adventure; it would be a universal act, carried out consciously by the immense majority of the members of society after they had become conscious of the necessity and the possibility of the total regeneration of humanity. As history had become world history the threat of enslavement by capital and its market extended all over the Earth. As a consequence there had to arise a mass consciousness and will fully oriented towards a fundamental and complete change of human relationships and social institutions. So long as people’s survival is threatened by the danger of a barbarism of planetary dimensions, the communist and anarchist dreams and utopias represent the intellectual source of rational projects and practical reforms which can give the human race the taste of a life according to the standards of a reason and an imagination both oriented towards renewing the destiny of humanity.
There is no leap from the realm of necessity to the realm of freedom, as Engels thought, and there cannot be a direct transition from capitalism to anarchism. The economic and social barbarism brought about by the capitalist mode of production cannot be abolished by a political revolution prepared, organised and led by an elite of professional revolutionaries claiming to act and think in the name and for the benefit of the exploited and alienated majority. The proletariat, formed into a class and a party under the conditions of bourgeois democracy, liberates itself by struggling to conquer this democracy: it turns universal suffrage, which up till then had been “an instrument of deception,” into a means of emancipation. A class which comprises the immense majority of modern society only takes alienating political action in order to triumph over politics and only conquers State power to use it against the formerly dominant minority. The conquest of political power is by nature a “bourgeois” act; it only becomes a proletarian action by the revolutionary aim which the authors of this overthrow give to it. This is the meaning of the historical period which Marx was not afraid to call the “dictatorship of the proletariat,” precisely to differentiate it from a dictatorship exercised by an elite, dictatorship in the Jacobin and Blanquist sense of the term. Certainly, Marx, in claiming the merit of having discovered the secret of the historical development of modes of production and domination, could not have foreseen that his teaching would be usurped by professional revolutionaries and other politicians claiming the right to personify the dictatorship of the proletariat. In fact, he only envisaged this form of social transition for countries whose proletariat had been able to make use of the period of bourgeois democracy to create its own institutions and made itself the dominant class in society. Compared with the many centuries of violence and corruption that capitalism had needed to come to dominate the world, the length of the process of transition to anarchist society would be shorter and less violent to the extent that the concentration of political power would bring a mass proletariat face to face with a numerically weak bourgeoisie:
“The transformation of scattered private property, arising from individual labour, into capitalist private property is, naturally, a process, incomparably more protracted, violent, and difficult, than the transformation of capitalistic private property, already practically resting on socialized production, into socialized property. In the former case, we had the expropriation of the mass of the people by a few usurpers; in the latter, we have the expropriation of a few usurpers by the mass of the people.” [14]
Marx did not work out all the details of a theory of the transition; in fact noticeably different views can be found in the various theoretical and practical outlines which are scattered throughout his works. Nevertheless, throughout these differences, indeed contradictory statements, a basic principle remains intact and constant to the extent of allowing a coherent reconstruction of such a theory. It is perhaps on this point that the myth of the founding of “Marxism” by Marx and Engels is seen at its most harmful. While the former made the postulate of a proletarian self-activity the criterion of all genuine class action and all genuine conquest of political power, the latter ended up, particularly after the death of his friend, by separating the two elements in the creation of the workers’ movement: the class action – the Selbsttätigkeit – of the proletariat on the one hand and the policy of the party on the other. Marx thought that communist and anarchist self-education was, more than any isolated political act, an integral part of the revolutionary activity of the workers: it was the workers’ task to make themselves fit for the conquest and exercise of political power as a means of resisting attempts by the bourgeoisie to reconquer and recover its power. The proletariat had to temporarily and consciously form itself into a material force in order to defend its right and project to transform society by progressively establishing the Human Community. It was in struggling to affirm itself as a force of abolition and creation that the working class – which “of all the instruments of production is the most productive” – took up the dialectical project of creative negation; it took the risk of political alienation in order to make politics superfluous. Such a project had nothing in common with the destructive passion of a Bakunin or the anarchist apocalypse of a Coeurderoy. Revolutionary purism had no place in this political project whose aim was to make real the potential supremacy of the oppressed and exploited masses. Marx thought that the International Workingmen’s Association, which combined the power of numbers with a revolutionary spirit conceived of in a quite different way from Proudhonian anarchism, could become such a fighting organisation. In joining the IWMA, Marx did not abandon the position he had taken against Proudhon in 1847, when he put forward an anti-political anarchism to be achieved by a political movement:
“Does this mean that after the fall of the old society there will be a new class domination culminating in a new political power? No ... The working class, in the course of its development, will substitute for the old civil society an association which will exclude classes and their antagonism, and there will be no more political power properly so-called, since political power is precisely the official expression of antagonism in civil society. Meanwhile the antagonism between the proletariat and the bourgeoisie is a struggle of class against class, a struggle which carried to its highest expression is a total revolution. Indeed, is it at all surprising that a society founded on the opposition of classes should culminate in brutal contradiction, the shock of body against body, as its final denouement? Do not say that social movement excludes political movement. There is never a political movement which is not at the same time social. It is only in an order of things in which there are no more classes and class antagonisms that social evolutions will cease to be political revolutions.” [15]
Marx’s point here is quite realistic and free from all idealism. This address to the future must be clearly understood to be the expression of a normative project committing the workers to behave as revolutionaries while struggling politically. “The working class is revolutionary or it is nothing” (letter to J.B. Schweitzer, 1865). This is the language of a thinker whose rigorous dialectic, in contrast to a Proudhon or a Stirner, rejects impressing people by the systematic use of gratuitous paradox and verbal violence. And while everything is not and cannot be settled by this demonstration of means and ends, its merit is at least to urge the victims of alienated labour to understand and educate themselves through undertaking together a great work of collective creation. In this sense, Marx’s appeal remains relevant, despite the triumph of Marxism and even because of it.
The limits of this essay do not allow us to go further in proving this. So we will limit ourselves to citing three texts which demolish in advance the legend – Bakuninist and Leninist – of a Marx “worshipper of the State” and “apostle of State communism” or of the dictatorship of the proletariat as the dictatorship of a party, indeed of a single man:
(a) “Marginal Notes on Bakunin’s book State and Anarchy (Geneva, 1873, in Russian).” Main themes: dictatorship of the proletariat and the maintenance of small peasant property; economic conditions and social revolution; disappearance of the State and the transformation of political functions into administrative functions of self-managed co-operative communes.
(b) Critique of the Programme of the German Workers Party (Gotha Programme) (1875). Main themes: the two phases of communist society based on the co-operative mode of production; the bourgeoisie as a revolutionary class; the international action of the working class; criticism of the “iron law of wages”; revolutionary role of workers’ productive co-operatives; primary education freed from the influence of religion and the State; revolutionary dictatorship of the proletariat as a political transition to the transformation of State functions into social functions.
(c) The Peasant Commune and Revolutionary Perspectives in Russia (Reply to Vera Zasulitch)(1881). Main themes: the rural commune as an element of regeneration of Russian society; ambivalence of the commune and influence of historical background; development of the commune and the crisis of capitalism; peasant emancipation and taxation; negative influences and risks of disappearance of the commune; the Russian commune, threatened by the State and capital, will only be saved by the Russian revolution.
These three documents to some extent make up the essence of the book which Marx considered writing on the State.
It can be seen from these remarks that Marx expressly presented his social theory as an attempt at an objective analysis of a historical movement and not as a moral or political code of revolutionary practice aimed at establishing an ideal society; as the laying bare of a process of development involving things and individuals and not as a collection of rules for use by parties and elites seeking power. This, however, is only the external and declared aspect of a theory which has two conceptual tracks, one rigorously determined, the other freely making its way towards the visionary aim of an anarchist society:
“The social revolution of the nineteenth century cannot take its poetry from the past but only from the future. It cannot begin with itself before it has stripped away all superstition about the past.” [16]
The past is an unchangeable necessity; and the observer, equipped with all the instruments of analysis, is in a position to explain the series of phenomena which have been perceived. But while it is a vain hope that all the dreams which humanity, through its prophets and visionaries, has entertained will come true, the future could at least bring an end to the institutions which have reduced people’s lives to a permanent state of servitude in all social fields. This is, briefly, the link between theory and utopia in the teaching of Marx who expressly proclaimed himself an “anarchist” when he wrote:
“All socialists see anarchy as the following program: Once the aim of the proletarian movement – i.e., abolition of classes – is attained, the power of the state, which serves to keep the great majority of producers in bondage to a very small exploiter minority, disappears, and the functions of government become simple administrative functions.” [17]
Post Script [18]
The essay above does not take into account the ideas of Frederick Engels on the State and anarchism. Without entering into the details of his view, we can say that it does not completely coincide with that of Marx, although it too proposes the final disappearance of the State. The most important passages in this connection are to be found in Anti-Dühring (1877-8) which to some extent had Marx’s imprimatur. Engels here sees the conquest of State power and the transformation of the means of production into State property as the self-abolition of the proletariat and the abolition of class antagonisms, indeed of “the suppression of the State as State.” Further on he describes this “abolition” of the State as “a dying out” of the State: “Der Staat wird nicht ‘abgeschafft’, er stirbt ab.” After Marx’s death, drawing his inspiration from the notes left by his friend on Lewis Henry Morgan’s Ancient Society, Engels again dealt with the subject but in a wider socio-historical context. The highest form of the State, the democratic republic, is considered by Engels as the final phase of politics during which the decisive struggle between the bourgeoisie and proletariat will take place; the exploited class becomes ready for self-emancipation and forms itself into an independent party: “universal suffrage is the gauge of the maturity of the working class” – and that suffices to do away with capitalism and the State, and hence with class society. “Along with them [i.e., classes] the State will inevitably fall. The society ... will put the whole of the machinery of State where it will then belong: into the Museum of Antiquities, by the side of the spinning wheel and the bronze axe.” [19] See also Engels’s letters to Philip Van Patten of 18 April 1883 and to Edward Bernstein of 28 January 1884. In the latter Engels quotes some passages from the Poverty of Philosophy (1847) and the Communist Manifesto (1848) to prove “that we proclaimed the end ["Aufhören"] of the State before there were really any anarchists.” Engels undoubtedly exaggerated – a mention only of William Godwin would invalidate this view, without referring to the others who were won over to anarchism through reading Political Justice (1793).
Notes
1. “The Leading Article in No. 179 of the Kölnische Zeitung.” Rheinische Zeitung, 10-14 July 1842.
2. See “plan et méthode de l'Economie” in M. Rubel, Marx, Critique du Marxisme, Payot, Paris, 1974, pp. 369-401.
3. See Marx, Critique du Marxisme, pp. 63-168, for a further development of the themes of the myth of “proletarian October” and of Russian society as a form of capitalism.
4. Second Thesis on Feuerbach, as translated in Karl Marx, Selected Writings in Sociology and Social Philosophy, edited T.B. Bottomore and M. Rubel, Pelican, 1963, p. 82.
5. “On the Jewish Question,” Deutsch-französische Jarbücher, February 1844.
6. Economic and Philosophical Manuscripts, section on “Estranged Labour,” 1844.
7. See M. Rubel, Karl Marx devant le bonapartisme, Mouton & Co., Paris-The Hague, 1960.
8. “Critical Remarks on the Article: The King of Prussia and Social Reform. By a Prussian,” Vorwärts, 7 and 10 August 1844.
9. Ibid.
10. The Civil War in France, First Draft, section on ‘The Character of the Commune’, 1871.
11. Ibid.
12. The German Ideology, 1845, edited by C.J. Arthur, Lawrence & Wishart, London, 1970, p. 85.
13. Speech at anniversary of the People’s Paper, 14 April 1856.
14. Capital, Vol. I, end of chapter XXXII.
15. Poverty of Philosophy, 1847, chapter II, part 5.
16. The Eighteenth Brumaire of Louis Napoleon, 1851.
17. Fictitious Splits in the International, 1872.
18. 1976, for this translation.
19. The Origin of the Family, Private Property, and the State, chapter IX. |
Generation of ultra-stable Pickering microbubbles via poly alkylcyanoacrylates.
A range of solution conditions (pH, surfactant concentration and type) have been tested for the polymerization of alkyl cyanoacrylates (ethyl (ECA), butyl (BCA) and octyl (OCA)) into nanoparticles (NPs) potentially capable of stabilizing highly unstable microbubbles (MBs) of air in aqueous solutions. The optimum system was butyl cyanoacrylate (BCA) polymerized into PBCA particles at pH 4 in the presence of 1 wt.% Tyloxapol surfactant. These PBCA particles were highly effective at stabilizing MBs of only a few microns in size for at least 2 months. Microscopy over a range of length scales clearly indicated that these particles were stabilized via a Pickering mechanism. Only a relatively low volume fraction (ca. 1 vol.%) of MBs could be obtained via a single aeration step of a 0.7 wt.% dispersion of PBCA particles in a high shear mixer. Although this could be increased to 2 and 3 vol.% by second and third aerations, this reflects the difficulty of obtaining and maintaining rapid enough particle coverage of small bubbles even under turbulent conditions. Similar sizes and yields of PBCA particles could be obtained in the absence of surfactants, but these particles, with or without addition of surfactant afterwards, could not stabilize MBs. We estimate that approximately one quarter of the Tyloxapol when present during polymerization is incorporated into the particles on polymerization, which somehow imparts the correct surface hydrophobicity and contact angle to the particles at the A/W interface, making such particles so very effective as Pickering MB stabilizers. |
The present invention relates generally to an improved train, and more specifically to articulated couplings between the cars of integral trains and an intermodal integral train for transporting highway vehicles having their own wheels or other types of loads, without wheels, such as containers.
The design of special cars to be used in a railroad system to carry containers or trucks or truck trailers have generally been modifications of existing railroad stock. These systems have not been designed to operate in the normal railway environment which imposes shock leads on the cars during switching and operating periods, and thus, have not taken advantage of the fact that these lighter loads could be designed for if cars were never uncoupled for switching operations. The economy and operation of the lighter weight trains that could thus be designed, as well as economies in the cost of original material were not taken into account.
An integral train can be made up of a number of subtrains called elements. Each element consists of one or two power cabs (locomotives) and a fixed number of essentially permanently coupled cars. The cars and power cabs are tightly coupled together in order to reduce the normal slack between the cars. The reduction of the slack results in a corresponding reduction in the dynamic forces which the cars are required to withstand during the run in and out of the train slack. The reduction of the dynamic forces allows for the use of lighter cars, which allows for an increase in the cargo weight for a given overall train weight and therefore an increase in train efficiency. Additional improvements in efficiency were to be obtained through the truck design and from other sources.
A complete train would consist of one or more elements. The elements could be rapidly and automatically connected together to form a single train. It is expected that in certain cases elements would be dispatched to pick up cargo and then brought together to form a single train. The cargo could then be transported to the destination and the elements separated. Each element could then deliver its cargo to the desired location. Each element would be able to function as a separate train or as a portion of a complete train. The complete train could be controlled from any element in the train. The most likely place for control would be the element at the head end of the train, but it was anticipated that under circumstances such as a failure in the leading unit, the train would be controlled from a following element.
Federal Regulations require brake inspections whenever a train is made up and periodically during its operation. The inspection Procedure involves the application and release of the train brakes and an inspection of each car on the train to verify that the brakes function as expected. This process is very time consuming. The communications cable running through the train makes it possible for the control system automatically and rapidly to perform the brake inspection.
It is well known that when trains go around a sharp curve, the railroad truck must rotate relative to the body to allow the train to negotiate the curve. Various railroad truck constructions have been provided to allow this to happen. Similarly, articulated couplings have been provided between cars to help steer the railroad cars around the turns. These generally have included adjustable linkages connecting the cars to each other and laterally displaced to complementarily elongate and contract. In some trains, a common railroad truck has been provided between adjacent cars which constitutes the articulated coupling. The cars are joined to the truck to pivot at a point along their longitudinal axis and rods are provided at both ends of the truck and connected to each of the cars such that the axle of the truck bisects the angle defined by the adjacent lateral axis of the adjacent cars.
Although these systems have been designed for yaw or rotation about the vertical axis defined by the pin connection therebetween, and for pitch or rotation about the lateral axis due to height variations along the longitudinal axis of the track, but they have not been designed to limit roll or rotation about the longitudinal axis at the articulated coupling. Prior art articulated couplings have a male member received longitudinally in a female member and a vertical pin inserted. The longitudinal stress on the coupling has to be relieved before the pin can be removed for decoupling.
Thus, it is an object of the present invention to provide an articulated coupling which facilitates yaw and pitch while limiting roll.
Another object of the present invention is to provide a uniquely designed train system to accommodate containers, trucks and truck trailers.
A further object of the present invention is to provide an articulated joint which is easily decoupled.
Yet another object of the present invention is to provide a unique car structure which is essentially a continuous platform.
A still further object of the present invention is to provide a slack-free, wear self-compensating coupling between cars.
These and other objects of the invention are attained by providing a central coupling and one or more pairs of pivoted side bearings or couplings spaced along the lateral axis of the cars. The central coupling is at the longitudinal axis of the car and between two side bearings which are laterally spaced therefrom. The central coupling which is mated at adjacent ends of adjacent cars to transmit draft forces, facilitate the pivoting of the cars relative to each other about a vertical axis at the first coupling or yaw, facilitate pivoting about a lateral axis at the coupling or pitch and permit relative roll motion. The pivoted side bearings, however, restrict pivoting about the longitudinal axis or roll facilitating yaw and pitch. Thus, in totality the coupling system components cooperates to facilitate Yaw and pitch while restricting roll.
The preferred structure of the side bearings, includes a cylindrical female member coaxial with the lateral axis of the body and a male member having a concave surface for receiving the respective female members. While the female members are fixed to one end of the body, the male members contact a horizontal surface on the other end of the body to move on the body and allow the male members to be coaxial with the axis of the mating female members of an adjacent car. Each pair of side bearings include structure which maintains the respective male members coaxial along an axis parallel to the axis of the female members of the adjacent car during mating. This structure includes side faces on the male and female members spaced along the lateral axis so as to engage during mating to produce the alignment.
The male and female members of the central coupling, which is on the longitudinal axis, have mating spherical surfaces to faciliate pivoting about the vertical axis. The center of these coincident spherical surfaces is on the axis of the side cylindrical part of the side bearinqs. The female member of the central coupling includes a pair of collars, one of which moves along the longitudinal axis in a direction to tighten the spherical female surface formed between the two yokes to maintain close clearance in the central coupling. Since the central coupling is the only coupling which must be opened to permit the separation of cars, the cars are readily separated or assembled by disassembling only the central coupling.
Other objects, advantages and novel features of the present invention will become apparent from the following detailed description of the invention when considered in conjunction with the accompanying drawings. |
Rhydymwyn F.C.
Rhydymwyn F.C. are a football club form Rhydymwyn, Wales. They are members of the Welsh National League and play at Dolfechlas Road.
Club home colours are all blue while away colours are red shirts, white shorts and white socks.
History
Rhydymwyn Football Club was founded in 1911. They came into existence, playing in local soccer, in the old Halkyn and Clwyd Leagues. They would remain in these leagues until moving up to the Welsh Alliance League in 1990. They immediately consolidated their progress by finishing fourth in their first season, and also reaching the final of the Cookson Cup. Their second campaign saw them finish in sixth place, and also reach the final of the North Wales Coast FA Challenge Cup, where they lost 2-1 to the then HFS Loans League side, Colwyn Bay. They finished fourth again in 1993, and also won the Alves Cup. The following year saw them third on goal difference, after a three-way tie with Llangefni Town and Llanfairpll. The 1994/95 season saw them capture the Welsh Alliance League title, and gain promotion to the Cymru Alliance League]. They also won the FAW Trophy, beating Taffs Wells 1-0 in the final played at Caersws. The 1995/96 season saw them finish a respectable fifth in the Cymru Alliance League. They also retained the FAW Trophy, beating Penrhyncoch at Newtown. 1996/97 saw them finish second in the league behind Rhayader Town, before taking the title in the 1997/98 season. Various reasons prevented the club from being promoted to the League of Wales. The club has progressed, not only on the field but off it as well. They obtained a £75,000 pavilion funded by Delyn Borough Council, and also received a £26,000 Sport Lot Award to extend their function room. Much of their progress was down to then manager Ken Knowles and a committee made up of committed local people. When Ken Knowles decided to retire after eleven seasons in charge, the club decided to appoint a player/manager from within their ranks. Unfortunately, the plan backfired, and the club had to resign from the Cymru Alliance League, due mainly to a lack of players. After returning to the Welsh Alliance League, the club was successful again. In the 2003/04 season they reached the finals of both the Barritt and Cookson Cups. They won the Cookson Cup but narrowly lost the Barritt Cup, under the caretaker manager, Phil Eaton.
The following season saw them strongly contest the league championship, only to lose by one point to eventual champions, Bodedern. They also reached the final of the FAW Trophy, losing 3 - 1
to Swansea-based side West End at Rhayader. Since those successes, the club struggled under a different manager, with mid-table finishes within the Welsh Alliance. Success returned to the club in the 2007/08 season when they defeated Barmouth and Dyffyn United to win the Barritt Cup for the first time at Farrar Road, Bangor. The 2008/09 season saw a big improvement in the Welsh Alliance when they finished runners-up behind Bethesda Athletic. The momentum continued in 2009/10 season and the club stayed in pole position, winning eight out of the first nine games winning promotion back to the Huws Gray Alliance with an overall record of 21 wins, 4 draws and only 5 defeats. In that first season back in the Huws Gray Alliance things didn't go to plan and at the end of the season the club dropped out of the Huws Gray Alliance with just 18 points, finishing in 14th position. The club found themselves back in the third tier of Welsh football but this time in the Welsh National League rather than the Welsh Alliance due to new boundary changes coming into force. The club also decided to appoint Daniel Seamarks as their new manager and it was his task to rebuild the team and fortunes. In that first season Rhydymwyn finished in a highly respectful second position and they were able to gain promotion back to the Huws Gray Alliance as champions FC Cefn chose to withdraw their application for Promotion. So in season 2012-13 the see saw affect continued with Rhydymwyn back in the Huws Gray alliance. Rhydymwyn secured 28 points that season and ended up finishing in 14th position. This time the club knew that they would be safe as only 2 clubs were going to gain promotion and Rhyl were going to be promoted to the Welsh Premier as champions of the Huws Gray Alliance. Rhydymwyn had been higher up the table earlier in the season and their league position slipped as security was guaranteed. Rhydymwyn have now got the task of building on that and will be looking to move further up the table in season 2013-14 despite limited resources and funds.
2014-15 was a sad season in the history of Rhydymwyn fc because of unforeseen circumstances they were not able to raise a team.
Honours
Cymru Alliance
1997–98
Welsh Alliance League
1994–95
2009–10
Current squad
References
External links
Rhydymwyn Football Club on Football Association of Wales
Rhydymwyn Football Club on Welsh Alliance League
Category:Football clubs in Wales
Category:Welsh Alliance League clubs
Category:Association football clubs established in 1878
Category:Cymru Alliance clubs |
<nav class="navbar">
<div class="logo">
<h1><a ui-sref="home">{{ $ctrl.name }}</a></h1>
</div>
<div class="nav-links">
<span><a ui-sref="about">about</a></span>
</div>
</nav>
|
Well, after almost 48 hours of being cooped up in the hotel/convention center, I made it out to the Strip. It was HOT. It was probably the hottest it has been since I got here and it was 9PM. The desert heat has no clock.
It's great seeing all of the lights and people. The new thing that I wanted to see was City Center. It's the new (and long awaited) multi-use complex next to the Bellagio. It has two hotel/casino's (Aria and Mandarin Oriental) as well as condo's and a high-end mall. Think of Rodeo Drive covered and air conditioned. The architecture is really impressive with a very contemporary design and decor. The Aria casino was almost anti Las Vegas in it's layout. The stereotypical layout is very scattered with many opportunities for getting lost. This casino had wide and well defined pathways and all of the tables and machines were in tidy rows
A note for people traveling to Vegas. ALWAYS have a bottle of water when you walk the strip. Dehydration creeps up on you. Also, avoid the insane prices in hotels for bottled water/sodas and snacks. Across from the Monte Carlo is a number of 24 hours stores (CVS, Walgreens, ABC stores) to get all of your snacks and drinks. There is also an abundance of what I call the "Flickers." These are the men and women passing out (and FLICKING) brochures for the strip clubs and escort services. When you are tired of your work, just think, "I could be outside in the August desert heat passing out brochures for strip clubs/escorts."
Krispy Kreme is also big here. Every casino has KK donuts in their coffee shops and food courts. |
Q:
How to find the largest number in the array
I have an array of grades(g) which is an int[] and I'm trying to find the largest grade in that array. I have tried this:
public static String highestGradeName(int[] g, String[] n) {
String highStudent;
int highest = g[0];
for (int i=1; i < g.length; i++) {
if (highest < g[i]) {
highStudent = n[i+1];
return (highStudent);
}
}
return null;
}
I have another array which is a String array and contains the names of the students, I have the return null there because it said it needed a return statement however I didn't plan on it ever being null. What's causing it to return null instead of highstudent?
I've used the exact code to find the lowest grade and it works fine the only thing I did to this one was change the if statement from highest > g[i] to highest < g[i].
A:
Returning from inside the loop is wrong, as you can always have an even larger number later on in the array. You should keep the index of the highest grade and just return the corresponding name at the end:
public static String highestGradeName(int[] g, String[] n) {
int highest = 0;
for (int i = 1; i < g.length; i++) {
if (g[highest] < g[i]) {
highest = i;
}
}
return n[highest];
}
|
Assessment of the risks for human health of adenoviruses, hepatitis A virus, rotaviruses and enteroviruses in the Buffalo River and three source water dams in the Eastern Cape.
Buffalo River is an important water resource in the Eastern Cape Province of South Africa. The potential risks of infection constituted by exposure to human enteric viruses in the Buffalo River and three source water dams along its course were assessed using mean values and static quantitative microbial risk assessment (QMRA). The daily risks of infection determined by the exponential model [for human adenovirus (HAdV) and enterovirus (EnV)] and the beta-Poisson model (for hepatitis A virus (HAV) and rotavirus (RoV)) varied with sites and exposure scenario. The estimated daily risks of infection values at the sites where the respective viruses were detected, ranged from 7.31 × 10(-3) to 1 (for HAdV), 4.23 × 10(-2) to 6.54 × 10(-1) (RoV), 2.32 × 10(-4) to 1.73 × 10(-1) (HAV) and 1.32 × 10(-4) to 5.70 × 10(-2) (EnV). The yearly risks of infection in individuals exposed to the river/dam water via drinking, recreational, domestic or irrigational activities were unacceptably high, exceeding the acceptable risk of 0.01% (10(-4) infection/person/year), and the guideline value used as by several nations for drinking water. The risks of illness and death from infection ranged from 6.58 × 10(-5) to 5.0 × 10(-1) and 6.58 × 10(-9) to 5.0 × 10(-5), respectively. The threats here are heightened by the high mortality rates for HAV, and its endemicity in South Africa. Therefore, we conclude that the Buffalo River and its source water dams are a public health hazard. The QMRA presented here is the first of its kinds in the Eastern Cape Province and provides the building block for a quantitatively oriented local guideline for water quality management in the Province. |
You get the seven articles below in a downloadable PDF. The Spotlight is made possible in part by a grant from the Wallace Foundation, which supports coverage of public school leadership, extended and expanded learning time, and arts learning. More at www.wallacefoundation.org.
Linda Hicks' mission became clear when she took the helm of Battle Creek's schools: Ensure that students get the STEM skills they need to land a job with one of the area’s food manufacturers or research facilities. |
Rudra UNO is luxury homes that are being developed at Sector 150 Noida. The residential township has been facilitated with the most amazing apartments on Noida Expressway. Rudra has developed numerous residential projects in NCR that all are fantastic in specifications and architecture. The Rudra UNO flats apartments bring to you 2/3/4 BHK golf view apartments in the vicinity of Noida. It is a project which will be able to provide you with a great infrastructure that easily comes with eco friendly environment. In all the projects which have been completed by the Rudra group, the people are living happily with luxurious life at sector 150 Noida. You will find that the township comprises of G+22 high rise building with amazing golf view apartments on Noida Expressway. The prices of these apartments starts from 40 Lacs onward for luxury living. You will be provided with amenities like Swimming Pool, Kids Play Area, Banquet Hall, Indoor Games, Vastu Compliant, Lawn, Spa, Jacuzzi, Yoga, Gymnasium, Jogging Track, Meditation, Amphitheater and many more. It will also be having a Green Garden, International schools, Playing Field, amenities shops. Come and make your abode in this beautiful township.
Here, one can be able to enjoy world class facilities and amenities like parks, gym, club house, swimming pool, shopping complex, 24 hours water supply, power back up, beautiful landscape, gymnasium and also a fully air conditioned party hall. If you are one of them who want to add a touch of elegance in their life style then you need to invest your money in this newly launched project named as Supertech Capetown Sector 74 Noida. This project is only a source to opening the doors of new possibilities and dreams that imagine by everyone.
Rudra UNO is put at a wonderful area and will be finished by industry titan that is Rudra Group. The undertaking is amazing and having present day includes that is useful for their purchasers. Rudra UNO is situated at one of the top most area that is Sector 150 Noida.
The residential township of Gaur Atulyam flat is located at Omicron 1, Greater Noida and it has been brought to you by Gaursons India. Gaursons India is amongst the well known realty firms.
Here, you will be able to get 2/3/4 BHK apartments equipped with outstanding specifications. The opulent amenities of the project are available at cheap and affordable prices.
The builders have done an excellent job of selecting a peaceful and pollution free environment for developing its new project.
When you stay here, the meadows as well as the lush green lawns inside the campus are a visual treat for the visitors and serve as a splendid retreat for the residents. The elevators and the lobbies here are kept clean that further enhances the appearance of the entire premises. You will also be able to enjoy watching the twilight from your balcony which takes you to an ecstatic state.
The apartments here are just as much fabulous as the exteriors as all of them have gleaming tiles that feel like cushion when you walk on. You will get big sized kitchens that will be able to provide you with a lot of comfort with granite topped counters; there is also a provision for geyser and RO water. You will also find a clubhouse in the township that has been set in the midst of lush green landscapes that is air-conditioned, beauty salon, spa, library, badminton, swimming pool etc. Gaur city 2 is a new residential and commercial township project which is placed at Greater Noida west. It has modern facilities like swimming pool, commercial spaces, hotel, hospital and school etc.
The project is situated in a green belt and hence the quality of air will be very pure and the surrounding will be green and a big relief and relaxation to the mind and the body. Further most of the flats are on the side of the sun and therefore there will not be any dearth of sunlight. The apartments have been very carefully and stylishly designed keeping in mind quality with comfort. The price range is also very attractive. The promoter believes in offering total customer satisfaction and evidence to this is found in almost each and every aspect of construction, facilities, amenities. They also have tie ups with many banks and financial institutions. Hence it would be easy for customers to get the best of loans at the best of terms and conditions. When all the above are taken together and looked at in one single entity, there is no reason to believe that Ajnara Grand Heritage will indeed be a grand way to change life for the better.
The trend of keeping people happy and satisfied them is a concept that steadily catching up in India. With work culture changing and businesses becoming more and more people want to live in a place that not only give a heart grabbing view but also presents lots of comfortable and convenience. Just like them the vacationers also wants a house where they can enjoy their vacation with comfortable and pleasurable way. If you are one of them who want to enjoy their life in a heart grabbing place where all luxurious amenities and features are available.
Considering these facts, there are lots of real estate developers and builders that develop several residential and commercial properties that might be suited all desire needs of customers. If you are one of them who looking for such type of apartments, then Rudra Jagdambe Apartments is one of the best options for you.
As per the requirement of modern world, it offers 2/3/4 BHK apartments where you will get all desire amenities and features within pocket suited cost. One of the best things of this property is that it has been constructed by the leading real estate developers with expertise to build luxurious homes with modern amenities. Buying the property at its constructed stage will provide a good opportunity to grab the benefit of owning a home at pocket suited cost.
Are you interesting to buy real estate property at Noida Extension (Greater Noida West)? There are sevrial types of the real estate properties are available at Noida Extension which include villas, Flats ,Apartments, Khoties and Farm Houses. Investor Mart is a real estate agency which offers commercial and residential properties in Delhi NCR.
Amrapali Real Estate Group is one of the famous real estate builders and the name of trust when it comes to invest in your dream residential as well as commercial property in Noida Extension. It is one of the quickest growing companies in the national capital region of India. In present time, they have constructed lots of spectacular homes in a primary location with contemporary features and a comfortable way of life. One of the most important thing about this group that need to be describe here is that they start residential as well as commercial operation after addressing the need and requirement of modern people.
Today, they will come up with their successfully completed project named as Amrapali Sapphire Flats. In this project, you will get 2, 3, and 4 BHK apartments which are designed according to Vastu friendly layout as well as lots of other Eco-friendly features. Like the other projects, it is also have lots of amenities and facilities that suit all the needs of modern people within pocket suited cost.
Author’s bio: I am Ishita Chauhan want to buy such type of luxurious property but lack of information and high raises prices, I cannot be able to get it. But through this project my dream is converted into reality. |
Specificity of hepatic iron uptake from plasma transferrin in the rat.
1. The role of specific interaction between transferrin and its receptors in iron uptake by the liver in vivo was investigated using 59Fe-125I-labelled transferrins from several animal species, and adult and 15-day rats. Transferrin-free hepatic uptake of 59Fe was measured 2 or 0.5 hr after intravenous injection of the transferrins. 2. Rat, rabbit and human transferrins gave high and approximately equal levels of hepatic iron uptake while transferrins from a marsupial (Sentonix brachyurus), lizard, crocodile, toad and fish gave very low uptake values. Chicken ovotransferrin resulted in higher uptake than with any other species of transferrin. 3. Iron uptake by the femurs (as a sample of bone marrow erythroid tissue) and, in another group of 19-day pregnant animals by the placentas and fetuses, was also measured, for comparison with the liver results. The pattern of uptake from the different transferrins was found to be similar to that of iron uptake by the liver except that with femurs, placentas and fetuses ovotransferrin gave low values comparable to those of the other non-mammalian species. 4. It is concluded that iron uptake by the liver from plasma transferrin in vivo is largely or completely dependent on specific transferrin-receptor interaction. The high hepatic uptake of iron from ovotransferrin was probably mediated by the asialoglycoprotein receptors on hepatocytes. |
In the third episode of the second season of Big Little Lies, an eight-year-old girl named Amabella goes into a “coma” in her school classroom. It’s not really a coma—it’s more like a panic attack—but it is enough to send her mother, Renata Klein (Laura Dern) into a fit. Amabella was physically bullied throughout the first season, and Renata—the Sheryl Sandberg–esque CEO of a Silicon Valley company and the only mother among her cohort with a powerful day job—spent a lot of time screaming her head off at anyone she thought might be responsible. She fingered the wrong child as the bully, and proceeded to verbally torture that child’s mother (Jane, played by a soft-spoken Shailene Woodley) for months. When the true bully emerged—one of a pair of twins whose mother, Celeste (Nicole Kidman), received regular brutal beatings at home from her husband Perry and so began to mimic his father’s violent behaviors—Renata had to recant.
But in Big Little Lies, no one ever stays calm for too long. When Amabella passes out, Renata has another excuse to go ballistic in public. A children’s therapist dressed as Little Bo Peep—likely the sort of thousand-dollar-an-hour specialists that roam the moneyed enclaves of the California coast—has a session with Amabella and determines that she is not being bullied again; she is simply overwhelmed by the concept of climate change. “She is worried about the end of the world,” the therapist tells Renata and her husband, Gordon, who are already enmeshed into their own serious crisis. In the pilot, Renata learns that Gordon made some bad (read: deeply illegal) investments, and now the FBI is seizing everything they own, much of which came from Renata’s corporate hustling.
So it doesn’t take much to set Renata off. She stomps into Otter Bay Elementary school in a shiny snakeskin blazer with fury in her eyes and confronts her daughter’s teacher and the principal about teaching climate change in the classroom. “What possesses two idiots like yourselves to teach eight-year-olds that the planet is doomed?” she barks. She calls the principal “a smoker who hasn’t been laid in 15 fucking years.” She howls over their protestations. And then, in her final chilling blow as a human monsoon, she yells, “I will be rich again! I will rise up. I will buy a fucking polar bear for every kid in this school.”
Later, in the same episode, Reese Witherspoon’s character, the pert perfectionist Madeline Martha Mackenzie, gives a mostly incoherent speech at a parent assembly, arguing against teaching young children about what may happen to the planet. “That the whole world might go kapooey?” she says into the microphone, on the verge of tears. “They need to know that? I think part of the problem is, we lie to our kids. We fill their head with Santa Claus and happy endings when most of us know most endings to most stories fucking suck. There aren’t a lot of happy endings for a lot of people, you know? Be it climate change, be it guns in schools.”
When Big Little Lies finished its stunning first season, which ended with the murder of Perry at a school fundraiser, I wrote that it was the best show that we have about the blue ache at the edge of California, how it was really a western about loneliness and isolation disguised as soapy housewife noir. That BLL is about what happens when people push all the way to the foamy frontiers searching for fulfillment, and how when they still don’t find it there, they have to manufacture it elsewhere: in infidelity, in codependent, twisted, violent relationships, hubris, gossip, corruption, lies. The show was a perfect jewel box of wealth and secrets, gleaming with the lawlessness that comes with living in mansions up against big waves and thinking that consequences can’t apply to you. |
// @copyright 2017-2018 zzu_softboy <zzu_softboy@163.com>
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 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.
//
// Created by zzu_softboy on 2017/08/01.
#include <iostream>
#include <cstring>
#include "php/Zend/zend_inheritance.h"
#include "php/Zend/zend.h"
#include "zapi/vm/IteratorBridge.h"
#include "zapi/vm/AbstractClass.h"
#include "zapi/vm/internal/AbstractClassPrivate.h"
#include "zapi/vm/ObjectBinder.h"
#include "zapi/vm/AbstractMember.h"
#include "zapi/vm/StringMember.h"
#include "zapi/vm/BoolMember.h"
#include "zapi/vm/FloatMember.h"
#include "zapi/vm/NumericMember.h"
#include "zapi/vm/NullMember.h"
#include "zapi/vm/Property.h"
#include "zapi/ds/Variant.h"
#include "zapi/ds/StringVariant.h"
#include "zapi/ds/NumericVariant.h"
#include "zapi/ds/DoubleVariant.h"
#include "zapi/ds/BoolVariant.h"
#include "zapi/ds/ArrayVariant.h"
#include "zapi/lang/Method.h"
#include "zapi/lang/StdClass.h"
#include "zapi/lang/Constant.h"
#include "zapi/lang/Method.h"
#include "zapi/lang/Interface.h"
#include "zapi/lang/Parameters.h"
#include "zapi/kernel/NotImplemented.h"
#include "zapi/kernel/OrigException.h"
#include "zapi/protocol/AbstractIterator.h"
#include "zapi/protocol/ArrayAccess.h"
#include "zapi/protocol/Countable.h"
#include "zapi/protocol/Serializable.h"
#include "zapi/protocol/Traversable.h"
#include "zapi/utils/PhpFuncs.h"
#include "zapi/utils/CommonFuncs.h"
namespace zapi
{
namespace vm
{
using zapi::ds::BoolVariant;
using zapi::ds::StringVariant;
using zapi::ds::DoubleVariant;
using zapi::ds::NumericVariant;
using zapi::ds::ArrayVariant;
using zapi::lang::Constant;
using zapi::lang::Variant;
using zapi::lang::Method;
using zapi::lang::Interface;
using zapi::lang::Parameters;
using zapi::lang::StdClass;
using zapi::vm::Property;
using zapi::vm::ObjectBinder;
using zapi::vm::IteratorBridge;
using zapi::protocol::Countable;
using zapi::protocol::Traversable;
using zapi::protocol::Serializable;
using zapi::protocol::ArrayAccess;
using zapi::protocol::AbstractIterator;
using zapi::kernel::NotImplemented;
using zapi::kernel::Exception;
using zapi::kernel::process_exception;
using zapi::utils::std_php_memory_deleter;
namespace internal
{
namespace
{
AbstractClassPrivate *retrieve_acp_ptr_from_cls_entry(zend_class_entry *entry)
{
// we hide the pointer in entry->info.user.doc_comment
// the format is \0 + pointer_address
// if entry->info.user.doc_comment length > 0 or nullptr no pointer hide in it
while (entry->parent && (nullptr == entry->info.user.doc_comment ||
ZSTR_LEN(entry->info.user.doc_comment) > 0))
{
// we find the pointer in parent classs
entry = entry->parent;
}
const char *comment = ZSTR_VAL(entry->info.user.doc_comment);
// here we retrieve the second byte, it have the pointer infomation
return *reinterpret_cast<AbstractClassPrivate **>(const_cast<char *>(comment + 1));
}
void acp_ptr_deleter(zend_string *ptr)
{
zend_string_release(ptr);
}
#define MAX_ABSTRACT_INFO_CNT 3
#define MAX_ABSTRACT_INFO_FMT "%s%s%s%s"
#define DISPLAY_ABSTRACT_FN(idx) \
ai.afn[idx] ? ZEND_FN_SCOPE_NAME(ai.afn[idx]) : "", \
ai.afn[idx] ? "::" : "", \
ai.afn[idx] ? ZSTR_VAL(ai.afn[idx]->common.function_name) : "", \
ai.afn[idx] && ai.afn[idx + 1] ? ", " : (ai.afn[idx] && ai.cnt > MAX_ABSTRACT_INFO_CNT ? ", ..." : "")
typedef struct _zend_abstract_info {
zend_function *afn[MAX_ABSTRACT_INFO_CNT + 1];
int cnt;
int ctor;
} zend_abstract_info;
void verify_abstract_class_function(zend_function *fn, zend_abstract_info *ai) /* {{{ */
{
if (fn->common.fn_flags & ZEND_ACC_ABSTRACT) {
if (ai->cnt < MAX_ABSTRACT_INFO_CNT) {
ai->afn[ai->cnt] = fn;
}
if (fn->common.fn_flags & ZEND_ACC_CTOR) {
if (!ai->ctor) {
ai->cnt++;
ai->ctor = 1;
} else {
ai->afn[ai->cnt] = NULL;
}
} else {
ai->cnt++;
}
}
}
void verify_abstract_class(zend_class_entry *ce) /* {{{ */
{
void *func;
zend_abstract_info ai;
memset(&ai, 0, sizeof(ai));
ZEND_HASH_FOREACH_PTR(&ce->function_table, func) {
verify_abstract_class_function(reinterpret_cast<zend_function *>(func), &ai);
} ZEND_HASH_FOREACH_END();
if (ai.cnt) {
zend_error(E_ERROR, "Class %s contains %d abstract method%s and must therefore be declared abstract or implement the remaining methods (" MAX_ABSTRACT_INFO_FMT MAX_ABSTRACT_INFO_FMT MAX_ABSTRACT_INFO_FMT ")",
ZSTR_VAL(ce->name), ai.cnt,
ai.cnt > 1 ? "s" : "",
DISPLAY_ABSTRACT_FN(0),
DISPLAY_ABSTRACT_FN(1),
DISPLAY_ABSTRACT_FN(2)
);
}
}
} // anonymous namespace
ContextMapType AbstractClassPrivate::sm_contextPtrs;
AbstractClassPrivate::AbstractClassPrivate(const char *className, lang::ClassType type)
: m_name(className),
m_type(type),
m_self(nullptr, acp_ptr_deleter)
{}
zend_class_entry *AbstractClassPrivate::initialize(AbstractClass *cls, const std::string &ns, int moduleNumber)
{
m_apiPtr = cls;
zend_class_entry entry;
std::memset(&entry, 0, sizeof(zend_class_entry));
if (ns.size() > 0 && ns != "\\") {
m_name = ns + "\\" + m_name;
}
if ("Person" == m_name) {
}
// initialize the class entry
INIT_CLASS_ENTRY_EX(entry, m_name.c_str(), m_name.size(), getMethodEntries().get());
entry.create_object = &AbstractClassPrivate::createObject;
entry.get_static_method = &AbstractClassPrivate::getStaticMethod;
// check if traversable
if (m_apiPtr->traversable()) {
entry.get_iterator = &AbstractClassPrivate::getIterator;
entry.iterator_funcs.funcs = IteratorBridge::getIteratorFuncs();
}
// check if serializable
if (m_apiPtr->serializable()) {
entry.serialize = &AbstractClassPrivate::serialize;
entry.unserialize = &AbstractClassPrivate::unserialize;
}
if (m_parent) {
if (m_parent->m_implPtr->m_classEntry) {
m_classEntry = zend_register_internal_class_ex(&entry, m_parent->m_implPtr->m_classEntry);
} else {
std::cerr << "Derived class " << m_name << " is initialized before base class " << m_parent->m_implPtr->m_name
<< ": base class is ignored" << std::endl;
// ignore base class
m_classEntry = zend_register_internal_class(&entry);
}
} else {
m_classEntry = zend_register_internal_class(&entry);
}
// register the interfaces of the class
for (std::shared_ptr<AbstractClass> &interface : m_interfaces) {
if (interface->m_implPtr->m_classEntry) {
zend_do_implement_interface(m_classEntry, interface->m_implPtr->m_classEntry);
} else {
// interface that want to implement is not initialized
std::cerr << "Derived class " << m_name << " is initialized before base class "
<< interface->m_implPtr->m_name << ": interface is ignored"
<< std::endl;
}
}
m_classEntry->ce_flags = static_cast<uint32_t>(m_type);
for (std::shared_ptr<AbstractMember> &member : m_members) {
member->initialize(m_classEntry);
}
// save AbstractClassPrivate instance pointer into the info.user.doc_comment of zend_class_entry
// we need save the address of this pointer
AbstractClassPrivate *selfPtr = this;
m_self.reset(zend_string_alloc(sizeof(this), 1));
// make the string look like empty
ZSTR_VAL(m_self)[0] = '\0';
ZSTR_LEN(m_self) = 0;
std::memcpy(ZSTR_VAL(m_self.get()) + 1, &selfPtr, sizeof(selfPtr));
// save into the doc_comment
m_classEntry->info.user.doc_comment = m_self.get();
return m_classEntry;
}
std::unique_ptr<zend_function_entry[]>& AbstractClassPrivate::getMethodEntries()
{
if (m_methodEntries) {
return m_methodEntries;
}
m_methodEntries.reset(new zend_function_entry[m_methods.size() + 1]);
size_t i = 0;
for (std::shared_ptr<Method> &method : m_methods) {
zend_function_entry *entry = &m_methodEntries[i++];
method->initialize(entry, m_name.c_str());
}
// the last item must be set to 0
// let zend engine know where to stop
zend_function_entry *last = &m_methodEntries[i];
memset(last, 0, sizeof(*last));
return m_methodEntries;
}
zend_object_handlers *AbstractClassPrivate::getObjectHandlers()
{
if (m_intialized) {
return &m_handlers;
}
memcpy(&m_handlers, &std_object_handlers, sizeof(zend_object_handlers));
if (!m_apiPtr->clonable()) {
m_handlers.clone_obj = nullptr;
} else {
m_handlers.clone_obj = &AbstractClassPrivate::cloneObject;
}
// function for array access interface
m_handlers.count_elements = &AbstractClassPrivate::countElements;
m_handlers.write_dimension = &AbstractClassPrivate::writeDimension;
m_handlers.read_dimension = &AbstractClassPrivate::readDimension;
m_handlers.has_dimension = &AbstractClassPrivate::hasDimension;
m_handlers.unset_dimension = &AbstractClassPrivate::unsetDimension;
m_handlers.get_debug_info = &AbstractClassPrivate::debugInfo;
// functions for magic properties handlers __get, __set, __isset and __unset
m_handlers.write_property = &AbstractClassPrivate::writeProperty;
m_handlers.read_property = &AbstractClassPrivate::readProperty;
m_handlers.has_property = &AbstractClassPrivate::hasProperty;
m_handlers.unset_property = &AbstractClassPrivate::unsetProperty;
// functions for method is called
m_handlers.get_method = &AbstractClassPrivate::getMethod;
m_handlers.get_closure = &AbstractClassPrivate::getClosure;
// functions for object destruct
m_handlers.dtor_obj = &AbstractClassPrivate::destructObject;
m_handlers.free_obj = &AbstractClassPrivate::freeObject;
// functions for type cast
m_handlers.cast_object = &AbstractClassPrivate::cast;
m_handlers.compare_objects = &AbstractClassPrivate::compare;
// we set offset here zend engine will free ObjectBinder::m_container
// resource automatic
// this offset is very important if you set this not right, memory will leak
m_handlers.offset = ObjectBinder::calculateZendObjectOffset();
m_intialized = true;
return &m_handlers;
}
AbstractClassPrivate::~AbstractClassPrivate()
{}
zend_object *AbstractClassPrivate::createObject(zend_class_entry *entry)
{
if (!(entry->ce_flags & (ZEND_ACC_TRAIT|ZEND_ACC_EXPLICIT_ABSTRACT_CLASS|ZEND_ACC_INTERFACE|ZEND_ACC_IMPLEMENT_INTERFACES|ZEND_ACC_IMPLEMENT_TRAITS))) {
verify_abstract_class(entry);
}
// here we lose everything from AbstractClass object
// of course we are in static method of AbstractClass
// but we need get pointer to it, we need some meta info in it and we must
// instantiate native c++ class associated with the meta class
AbstractClassPrivate *abstractClsPrivatePtr = retrieve_acp_ptr_from_cls_entry(entry);
// note: here we use StdClass type to store Derived class
std::shared_ptr<StdClass> nativeObject(abstractClsPrivatePtr->m_apiPtr->construct());
if (!nativeObject) {
// report error on failure, because this function is called directly from the
// Zend engine, we can call zend_error() here (which does a longjmp() back to
// the Zend engine)
zend_error(E_ERROR, "Unable to instantiate %s", entry->name->val);
}
// here we assocaited a native object with an ObjectBinder object
// ObjectBinder can make an relationship on nativeObject and zend_object
// don't warry about memory, we do relase
// maybe memory leak
ObjectBinder *binder = new ObjectBinder(entry, nativeObject, abstractClsPrivatePtr->getObjectHandlers(), 1);
return binder->getZendObject();
}
zend_object_handlers *AbstractClassPrivate::getObjectHandlers(zend_class_entry *entry)
{
AbstractClassPrivate *abstractClsPrivatePtr = retrieve_acp_ptr_from_cls_entry(entry);
return abstractClsPrivatePtr->getObjectHandlers();
}
zend_object *AbstractClassPrivate::cloneObject(zval *object)
{
zend_class_entry *entry = Z_OBJCE_P(object);
ObjectBinder *objectBinder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(entry);
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *origObject = objectBinder->getNativeObject();
std::unique_ptr<StdClass> newNativeObject(meta->clone(origObject));
// report error on failure (this does not occur because the cloneObject()
// method is only installed as handler when we have seen that there is indeed
// a copy constructor). Because this function is directly called from the
// Zend engine, we can call zend_error() (which does a longjmp()) to throw
// an exception back to the Zend engine)
if (!newNativeObject) {
zend_error(E_ERROR, "Unable to clone %s", entry->name);
}
ObjectBinder *newObjectBinder = new ObjectBinder(entry, std::move(newNativeObject), selfPtr->getObjectHandlers(), 1);
zend_objects_clone_members(newObjectBinder->getZendObject(), objectBinder->getZendObject());
if (!entry->clone) {
meta->callClone(newNativeObject.get());
}
return newObjectBinder->getZendObject();
}
int AbstractClassPrivate::countElements(zval *object, zend_long *count)
{
Countable *countable = dynamic_cast<Countable *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
if (countable) {
try {
*count = countable->count();
return ZAPI_SUCCESS;
} catch (Exception &exception) {
process_exception(exception);
return ZAPI_FAILURE; // unreachable, prevent some compiler warning
}
} else {
if (!std_object_handlers.count_elements) {
return ZAPI_FAILURE;
}
return std_object_handlers.count_elements(object, count);
}
}
zval *AbstractClassPrivate::readDimension(zval *object, zval *offset, int type, zval *returnValue)
{
// what to do with the type?
//
// the type parameter tells us whether the dimension was read in READ
// mode, WRITE mode, READWRITE mode or UNSET mode.
//
// In 99 out of 100 situations, it is called in regular READ mode (value 0),
// only when it is called from a PHP script that has statements like
// $x =& $object["x"], $object["x"]["y"] = "something" or unset($object["x"]["y"]),
// the type parameter is set to a different value.
//
// But we must ask ourselves the question what we should be doing with such
// cases. Internally, the object most likely has a full native implementation,
// and the property that is returned is just a string or integer or some
// other value, that is temporary WRAPPED into a zval to make it accessible
// from PHP. If someone wants to get a reference to such an internal variable,
// that is in most cases simply impossible.
ArrayAccess *arrayAccess = dynamic_cast<ArrayAccess *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
if (arrayAccess) {
try {
return toZval(arrayAccess->offsetGet(offset), type, returnValue);
} catch (Exception &exception) {
process_exception(exception);
return nullptr; // unreachable, prevent some compiler warning
}
} else {
if (!std_object_handlers.read_dimension) {
return nullptr;
} else {
return std_object_handlers.read_dimension(object, offset, type, returnValue);
}
}
}
void AbstractClassPrivate::writeDimension(zval *object, zval *offset, zval *value)
{
ArrayAccess *arrayAccess = dynamic_cast<ArrayAccess *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
if (arrayAccess) {
try {
arrayAccess->offsetSet(offset, value);
} catch (Exception &exception) {
process_exception(exception);
}
} else {
if (!std_object_handlers.write_dimension) {
return;
} else {
std_object_handlers.write_dimension(object, offset, value);
}
}
}
int AbstractClassPrivate::hasDimension(zval *object, zval *offset, int checkEmpty)
{
ArrayAccess *arrayAccess = dynamic_cast<ArrayAccess *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
if (arrayAccess) {
try {
if (!arrayAccess->offsetExists(offset)) {
return false;
}
if (!checkEmpty) {
return true;
}
return zapi::empty(arrayAccess->offsetGet(offset));
} catch (Exception &exception) {
process_exception(exception);
return false; // unreachable, prevent some compiler warning
}
} else {
if (!std_object_handlers.has_dimension) {
return false;
}
return std_object_handlers.has_dimension(object, offset, checkEmpty);
}
}
void AbstractClassPrivate::unsetDimension(zval *object, zval *offset)
{
ArrayAccess *arrayAccess = dynamic_cast<ArrayAccess *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
if (arrayAccess) {
try {
arrayAccess->offsetUnset(offset);
} catch (Exception &exception) {
process_exception(exception);
}
} else {
if (!std_object_handlers.unset_dimension) {
return;
}
return std_object_handlers.unset_dimension(object, offset);
}
}
zend_object_iterator *AbstractClassPrivate::getIterator(zend_class_entry *entry, zval *object, int byRef)
{
// by-ref is not possible (copied from SPL), this function is called directly
// from the Zend engine, so we can use zend_error() to longjmp() back to the
// Zend engine)
// TODO but why
if (byRef) {
zend_error(E_ERROR, "Foreach by ref is not possible");
}
Traversable *traversable = dynamic_cast<Traversable *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
ZAPI_ASSERT_X(traversable, "AbstractClassPrivate::getIterator", "traversable can't be nullptr");
try {
AbstractIterator *iterator = traversable->getIterator();
ZAPI_ASSERT_X(iterator, "AbstractClassPrivate::getIterator", "iterator can't be nullptr");
// @mark native memory alloc
// we are going to allocate an extended iterator (because php nowadays destructs
// the iteraters itself, we can no longer let c++ allocate the buffer + object
// directly, so we first allocate the buffer, which is going to be cleaned up by php)
void *buffer = emalloc(sizeof(IteratorBridge));
IteratorBridge *iteratorBridge = new (buffer)IteratorBridge(object, iterator);
return iteratorBridge->getZendIterator();
} catch (Exception &exception) {
process_exception(exception);
return nullptr; // unreachable, prevent some compiler warning
}
}
int AbstractClassPrivate::serialize(zval *object, unsigned char **buffer, size_t *bufLength, zend_serialize_data *data)
{
Serializable *serializable = dynamic_cast<Serializable *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
// user may throw an exception in the serialize() function
try {
std::string value = serializable->serialize();
*buffer = reinterpret_cast<unsigned char *>(estrndup(value.c_str(), value.length()));
*bufLength = value.length();
} catch (Exception &exception) {
process_exception(exception);
return ZAPI_FAILURE; // unreachable, prevent some compiler warning
}
return ZAPI_SUCCESS;
}
int AbstractClassPrivate::unserialize(zval *object, zend_class_entry *entry, const unsigned char *buffer,
size_t bufLength, zend_unserialize_data *data)
{
object_init_ex(object, entry);
Serializable *serializable = dynamic_cast<Serializable *>(ObjectBinder::retrieveSelfPtr(object)->getNativeObject());
// user may throw an exception in the unserialize() function
try {
serializable->unserialize(reinterpret_cast<const char *>(buffer), bufLength);
} catch (Exception &exception) {
// user threw an exception in its method
// implementation, send it to user space
php_error_docref(NULL, E_NOTICE, "Error while unserializing");
return ZAPI_FAILURE;
}
return ZAPI_SUCCESS;
}
HashTable *AbstractClassPrivate::debugInfo(zval *object, int *isTemp)
{
try {
ObjectBinder *objectBinder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(Z_OBJCE_P(object));
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *nativeObject = objectBinder->getNativeObject();
zval infoZval = meta->callDebugInfo(nativeObject).detach(true);
*isTemp = 1;
return Z_ARR(infoZval);
} catch (const NotImplemented &exception) {
if (!std_object_handlers.get_debug_info) {
return nullptr;
}
return std_object_handlers.get_debug_info(object, isTemp);
} catch (Exception &exception) {
process_exception(exception);
// this statement will never execute
return nullptr;
}
}
zval *AbstractClassPrivate::readProperty(zval *object, zval *name, int type, void **cacheSlot, zval *rv)
{
// what to do with the type?
//
// the type parameter tells us whether the property was read in READ
// mode, WRITE mode, READWRITE mode or UNSET mode.
//
// In 99 out of 100 situations, it is called in regular READ mode (value 0),
// only when it is called from a PHP script that has statements like
// $x =& $object->x, $object->x->y = "something" or unset($object->x->y)
// the type parameter is set to a different value.
//
// But we must ask ourselves the question what we should be doing with such
// cases. Internally, the object most likely has a full native implementation,
// and the property that is returned is just a string or integer or some
// other value, that is temporary WRAPPED into a zval to make it accessible
// from PHP. If someone wants to get a reference to such an internal variable,
// that is in most cases simply impossible.
// retrieve the object and class
try {
ObjectBinder *objectBinder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(Z_OBJCE_P(object));
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *nativeObject = objectBinder->getNativeObject();
std::string key(Z_STRVAL_P(name), Z_STRLEN_P(name));
auto iter = selfPtr->m_properties.find(key);
if (iter != selfPtr->m_properties.end()) {
// self defined getter method
return toZval(iter->second->get(nativeObject), type, rv);
} else {
return toZval(meta->callGet(nativeObject, key), type, rv);
}
} catch (const NotImplemented &exception) {
if (!std_object_handlers.read_property) {
// TODO here maybe problems
return nullptr;
}
return std_object_handlers.read_property(object, name, type, cacheSlot, rv);
} catch (Exception &exception) {
process_exception(exception);
// this statement will never execute
return nullptr;
}
}
void AbstractClassPrivate::writeProperty(zval *object, zval *name, zval *value, void **cacheSlot)
{
try {
ObjectBinder *objectBinder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(Z_OBJCE_P(object));
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *nativeObject = objectBinder->getNativeObject();
std::string key(Z_STRVAL_P(name), Z_STRLEN_P(name));
auto iter = selfPtr->m_properties.find(key);
if (iter != selfPtr->m_properties.end()) {
if (iter->second->set(nativeObject, value)) {
return;
}
zend_error(E_ERROR, "Unable to write to read-only property %s", key.c_str());
} else {
meta->callSet(nativeObject, key, value);
}
} catch (const NotImplemented &exception) {
if (!std_object_handlers.write_property) {
return;
}
std_object_handlers.write_property(object, name, value, cacheSlot);
} catch (Exception &exception) {
process_exception(exception);
}
}
int AbstractClassPrivate::hasProperty(zval *object, zval *name, int hasSetExists, void **cacheSlot)
{
try {
ObjectBinder *objectBinder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(Z_OBJCE_P(object));
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *nativeObject = objectBinder->getNativeObject();
std::string key(Z_STRVAL_P(name), Z_STRLEN_P(name));
// here we need check the hasSetExists
if (selfPtr->m_properties.find(key) != selfPtr->m_properties.end()) {
return true;
}
if (!meta->callIsset(nativeObject, key)) {
return false;
}
if (2 == hasSetExists) {
return true;
}
Variant value = meta->callGet(nativeObject, key);
if (0 == hasSetExists) {
return value.getType() != Type::Null;
} else {
return value.toBool();
}
} catch (const NotImplemented &exception) {
if (!std_object_handlers.has_property) {
return false;
}
return std_object_handlers.has_property(object, name, hasSetExists, cacheSlot);
} catch (Exception &exception) {
process_exception(exception);
return false;
}
}
void AbstractClassPrivate::unsetProperty(zval *object, zval *name, void **cacheSlot)
{
try {
ObjectBinder *objectBinder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(Z_OBJCE_P(object));
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *nativeObject = objectBinder->getNativeObject();
std::string key(Z_STRVAL_P(name), Z_STRLEN_P(name));
if (selfPtr->m_properties.find(key) == selfPtr->m_properties.end()) {
meta->callUnset(nativeObject, key);
return;
}
zend_error(E_ERROR, "Property %s can not be unset", key.c_str());
} catch (const NotImplemented &exception) {
if (!std_object_handlers.unset_property) {
return;
}
std_object_handlers.unset_property(object, name, cacheSlot);
} catch (Exception &exception) {
process_exception(exception);
}
}
zend_function *AbstractClassPrivate::getMethod(zend_object **object, zend_string *methodName, const zval *key)
{
zend_function *defaultFuncInfo = std_object_handlers.get_method(object, methodName, key);
if (defaultFuncInfo) {
return defaultFuncInfo;
}
// if exception throw before delete the memory will be relase after request cycle
zend_class_entry *defClassEntry = (*object)->ce;
assert(defClassEntry);
std::string contextKey(defClassEntry->name->val, defClassEntry->name->len);
contextKey.append("::");
contextKey.append(methodName->val, methodName->len);
CallContext *callContext = nullptr;
auto targetContext = sm_contextPtrs.find(contextKey);
if (targetContext != sm_contextPtrs.end()) {
callContext = targetContext->second.get();
} else {
std::shared_ptr<CallContext> targetContext(reinterpret_cast<CallContext *>(emalloc(sizeof(CallContext))), std_php_memory_deleter);
callContext = targetContext.get();
std::memset(callContext, 0, sizeof(CallContext));
zend_internal_function *func = &callContext->m_func;
func->type = ZEND_INTERNAL_FUNCTION;
func->module = nullptr;
func->handler = AbstractClassPrivate::magicCallForwarder;
func->arg_info = nullptr;
func->num_args = 0;
func->required_num_args = 0;
func->scope = defClassEntry;
func->fn_flags = ZEND_ACC_CALL_VIA_HANDLER;
func->function_name = methodName;
callContext->m_selfPtr = retrieve_acp_ptr_from_cls_entry(defClassEntry);
sm_contextPtrs[contextKey] = std::move(targetContext);
}
return reinterpret_cast<zend_function *>(callContext);
}
zend_function *AbstractClassPrivate::getStaticMethod(zend_class_entry *entry, zend_string *methodName)
{
zend_function *defaultFuncInfo = zend_std_get_static_method(entry, methodName, nullptr);
if (defaultFuncInfo) {
return defaultFuncInfo;
}
// if exception throw before delete the memory will be relase after request cycle
std::string contextKey(entry->name->val, entry->name->len);
contextKey.append("::");
contextKey.append(methodName->val, methodName->len);
contextKey.append("static");
CallContext *callContext = nullptr;
auto targetContext = sm_contextPtrs.find(contextKey);
if (targetContext != sm_contextPtrs.end()) {
callContext = targetContext->second.get();
} else {
std::shared_ptr<CallContext> targetContext(reinterpret_cast<CallContext *>(emalloc(sizeof(CallContext))), std_php_memory_deleter);
callContext = targetContext.get();
std::memset(callContext, 0, sizeof(CallContext));
zend_internal_function *func = &callContext->m_func;
func->type = ZEND_INTERNAL_FUNCTION;
func->module = nullptr;
func->handler = &AbstractClassPrivate::magicCallForwarder;
func->arg_info = nullptr;
func->num_args = 0;
func->required_num_args = 0;
func->scope = nullptr;
func->fn_flags = ZEND_ACC_CALL_VIA_HANDLER | ZEND_ACC_STATIC;
func->function_name = methodName;
callContext->m_selfPtr = retrieve_acp_ptr_from_cls_entry(entry);
sm_contextPtrs[contextKey] = std::move(targetContext);
}
return reinterpret_cast<zend_function *>(callContext);
}
int AbstractClassPrivate::getClosure(zval *object, zend_class_entry **entry, zend_function **retFunc,
zend_object **objectPtr)
{
// @mark is this really right ?
zend_class_entry *defClassEntry = Z_OBJCE_P(object);
assert(defClassEntry);
std::string contextKey(defClassEntry->name->val, defClassEntry->name->len);
contextKey.append("::__invoke");
CallContext *callContext = nullptr;
auto targetContext = sm_contextPtrs.find(contextKey);
if (targetContext != sm_contextPtrs.end()) {
callContext = targetContext->second.get();
} else {
std::shared_ptr<CallContext> targetContext(reinterpret_cast<CallContext *>(emalloc(sizeof(CallContext))), std_php_memory_deleter);
callContext = targetContext.get();
std::memset(callContext, 0, sizeof(CallContext));
zend_internal_function *func = &callContext->m_func;
func->type = ZEND_INTERNAL_FUNCTION;
func->module = nullptr;
func->handler = &AbstractClassPrivate::magicInvokeForwarder;
func->arg_info = nullptr;
func->num_args = 0;
func->required_num_args = 0;
func->scope = *entry;
func->fn_flags = ZEND_ACC_CALL_VIA_HANDLER;
func->function_name = nullptr;
callContext->m_selfPtr = retrieve_acp_ptr_from_cls_entry(Z_OBJCE_P(object));
sm_contextPtrs[contextKey] = std::move(targetContext);
}
*retFunc = reinterpret_cast<zend_function *>(callContext);
*objectPtr = Z_OBJ_P(object);
return ZAPI_SUCCESS;
}
class ScopedFree
{
public:
ScopedFree(ContextMapType &map, const std::string &key)
: m_key(key),
m_map(map)
{}
~ScopedFree()
{
m_map.erase(m_key);
}
private:
std::string m_key;
ContextMapType &m_map;
};
void AbstractClassPrivate::magicCallForwarder(INTERNAL_FUNCTION_PARAMETERS)
{
CallContext *callContext = reinterpret_cast<CallContext *>(execute_data->func);
assert(callContext);
bool isStatic = false;
AbstractClass *meta = callContext->m_selfPtr->m_apiPtr;
zend_class_entry *defClassEntry = callContext->m_selfPtr->m_classEntry;
zend_internal_function *func = &callContext->m_func;
zend_string *funcName = func->function_name;
std::string contextKey(defClassEntry->name->val, defClassEntry->name->len);
contextKey.append("::");
contextKey.append(funcName->val, funcName->len);
if (!func->scope) {
contextKey.append("static");
}
ScopedFree scopeFree(sm_contextPtrs, contextKey);
const char *name = ZSTR_VAL(funcName);
try {
Parameters params(getThis(), ZEND_NUM_ARGS());
StdClass *nativeObject = params.getObject();
if (nativeObject) {
zval temp = meta->callMagicCall(nativeObject, name, params).detach(false);
ZVAL_COPY(return_value, &temp);
} else {
isStatic = true;
zval temp = meta->callMagicStaticCall(name, params).detach(false);
ZVAL_COPY(return_value, &temp);
}
} catch (const NotImplemented &exception) {
if (isStatic) {
zend_error(E_ERROR, "Undefined static method %s::%s", meta->getClassName().c_str(), name);
} else {
zend_error(E_ERROR, "Undefined instance method %s of %s", name, meta->getClassName().c_str());
}
} catch (Exception &exception) {
process_exception(exception);
}
}
void AbstractClassPrivate::magicInvokeForwarder(INTERNAL_FUNCTION_PARAMETERS)
{
CallContext *callContext = reinterpret_cast<CallContext *>(execute_data->func);
assert(callContext);
AbstractClass *meta = callContext->m_selfPtr->m_apiPtr;
zend_class_entry *defClassEntry = callContext->m_selfPtr->m_classEntry;
assert(defClassEntry);
// @mark is this really right ?
std::string contextKey(defClassEntry->name->val, defClassEntry->name->len);
contextKey.append("::__invoke");
ScopedFree scopeFree(sm_contextPtrs, contextKey);
try {
Parameters params(getThis(), ZEND_NUM_ARGS());
StdClass *nativeObject = params.getObject();
zval temp = meta->callMagicInvoke(nativeObject, params).detach(false);
ZVAL_COPY(return_value, &temp);
} catch (const NotImplemented &exception) {
zend_error(E_ERROR, "Function name must be a string");
} catch (Exception &exception) {
process_exception(exception);
}
}
int AbstractClassPrivate::cast(zval *object, zval *retValue, int type)
{
ObjectBinder *objectBinder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(Z_OBJCE_P(object));
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *nativeObject = objectBinder->getNativeObject();
try {
zval temp;
switch (static_cast<Type>(type)) {
case Type::Numeric:
temp = meta->castToInteger(nativeObject).detach(false);
break;
case Type::Double:
temp = meta->castToDouble(nativeObject).detach(false);
break;
case Type::Boolean:
temp = meta->castToBool(nativeObject).detach(false);
break;
case Type::String:
temp = meta->castToString(nativeObject).detach(false);
break;
default:
throw NotImplemented();
break;
}
ZVAL_COPY(retValue, &temp);
return ZAPI_SUCCESS;
} catch (const NotImplemented &exception) {
if (!std_object_handlers.cast_object) {
return ZAPI_FAILURE;
}
return std_object_handlers.cast_object(object, retValue, type);
} catch (Exception &exception) {
process_exception(exception);
return ZAPI_FAILURE;
}
}
int AbstractClassPrivate::compare(zval *left, zval *right)
{
try {
zend_class_entry *entry = Z_OBJCE_P(left);
if (entry != Z_OBJCE_P(right)) {
throw NotImplemented();
}
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(entry);
AbstractClass *meta = selfPtr->m_apiPtr;
StdClass *leftNativeObject = ObjectBinder::retrieveSelfPtr(left)->getNativeObject();
StdClass *rightNativeObject = ObjectBinder::retrieveSelfPtr(right)->getNativeObject();
return meta->callCompare(leftNativeObject, rightNativeObject);
} catch (const NotImplemented &exception) {
if (!std_object_handlers.compare_objects) {
return 1;
}
return std_object_handlers.compare_objects(left, right);
} catch (Exception &exception) {
// a Exception was thrown by the extension __compare function,
// pass this on to user space
process_exception(exception);
return 1;
}
}
void AbstractClassPrivate::destructObject(zend_object *object)
{
ObjectBinder *binder = ObjectBinder::retrieveSelfPtr(object);
AbstractClassPrivate *selfPtr = retrieve_acp_ptr_from_cls_entry(object->ce);
try {
StdClass *nativeObject = binder->getNativeObject();
if (nativeObject) {
selfPtr->m_apiPtr->callDestruct(nativeObject);
}
} catch (const NotImplemented &exception) {
zend_objects_destroy_object(object);
} catch (Exception &exception) {
// a regular zapi::kernel::Exception was thrown by the extension, pass it on
// to PHP user space
process_exception(exception);
}
}
void AbstractClassPrivate::freeObject(zend_object *object)
{
ObjectBinder *binder = ObjectBinder::retrieveSelfPtr(object);
binder->destroy();
}
zval *AbstractClassPrivate::toZval(Variant &&value, int type, zval *rv)
{
zval result;
if (type == 0 || value.getRefCount() <= 1) {
result = value.detach(true);
} else {
// editable zval return a reference to it
zval orig = value.detach(false);
result = Variant(&orig, true).detach(true);
}
ZVAL_COPY_VALUE(rv, &result);
return rv;
}
} // internal
AbstractClass::AbstractClass(const char *className, lang::ClassType type)
: m_implPtr(std::make_shared<AbstractClassPrivate>(className, type))
{
}
AbstractClass::AbstractClass(const AbstractClass &other)
: m_implPtr(other.m_implPtr)
{}
AbstractClass::AbstractClass(AbstractClass &&other) ZAPI_DECL_NOEXCEPT
: m_implPtr(std::move(other.m_implPtr))
{}
AbstractClass &AbstractClass::operator=(const AbstractClass &other)
{
if (this != &other) {
m_implPtr = other.m_implPtr;
}
return *this;
}
AbstractClass::~AbstractClass()
{}
std::string AbstractClass::getClassName() const
{
return m_implPtr->m_name;
}
AbstractClass &AbstractClass::operator=(AbstractClass &&other) ZAPI_DECL_NOEXCEPT
{
assert(this != &other);
m_implPtr = std::move(other.m_implPtr);
return *this;
}
void AbstractClass::registerInterface(const Interface &interface)
{
ZAPI_D(AbstractClass);
implPtr->m_interfaces.push_back(std::make_shared<Interface>(interface));
}
void AbstractClass::registerInterface(Interface &&interface)
{
ZAPI_D(AbstractClass);
implPtr->m_interfaces.push_back(std::make_shared<Interface>(std::move(interface)));
}
void AbstractClass::registerBaseClass(const AbstractClass &base)
{
ZAPI_D(AbstractClass);
implPtr->m_parent = std::make_shared<AbstractClass>(base);
}
void AbstractClass::registerBaseClass(AbstractClass &&base)
{
ZAPI_D(AbstractClass);
implPtr->m_parent = std::make_shared<AbstractClass>(std::move(base));
}
void AbstractClass::registerProperty(const char *name, std::nullptr_t, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<NullMember>(name, flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, int16_t value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<NumericMember>(name, value,
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, int32_t value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<NumericMember>(name, value,
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, int64_t value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<NumericMember>(name, value,
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, char value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<StringMember>(name, &value, 1,
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, const std::string &value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<StringMember>(name, value,
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, const char *value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<StringMember>(name, value, std::strlen(value),
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, bool value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<BoolMember>(name, value,
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, double value, Modifier flags)
{
ZAPI_D(AbstractClass);
implPtr->m_members.push_back(std::make_shared<FloatMember>(name, value,
flags & Modifier::PropertyModifiers));
}
void AbstractClass::registerProperty(const char *name, const zapi::GetterMethodCallable0 &getter)
{
ZAPI_D(AbstractClass);
implPtr->m_properties[name] = std::make_shared<Property>(getter);
}
void AbstractClass::registerProperty(const char *name, const zapi::GetterMethodCallable1 &getter)
{
ZAPI_D(AbstractClass);
implPtr->m_properties[name] = std::make_shared<Property>(getter);
}
void AbstractClass::registerProperty(const char *name, const zapi::GetterMethodCallable0 &getter,
const zapi::SetterMethodCallable0 &setter)
{
ZAPI_D(AbstractClass);
implPtr->m_properties[name] = std::make_shared<Property>(getter, setter);
}
void AbstractClass::registerProperty(const char *name, const zapi::GetterMethodCallable0 &getter,
const zapi::SetterMethodCallable1 &setter)
{
ZAPI_D(AbstractClass);
implPtr->m_properties[name] = std::make_shared<Property>(getter, setter);
}
void AbstractClass::registerProperty(const char *name, const zapi::GetterMethodCallable1 &getter,
const zapi::SetterMethodCallable0 &setter)
{
ZAPI_D(AbstractClass);
implPtr->m_properties[name] = std::make_shared<Property>(getter, setter);
}
void AbstractClass::registerProperty(const char *name, const zapi::GetterMethodCallable1 &getter,
const zapi::SetterMethodCallable1 &setter)
{
ZAPI_D(AbstractClass);
implPtr->m_properties[name] = std::make_shared<Property>(getter, setter);
}
void AbstractClass::registerConstant(const Constant &constant)
{
const zend_constant &zendConst = constant.getZendConstant();
const std::string &name = constant.getName();
switch (Z_TYPE(zendConst.value)) {
case IS_NULL:
registerProperty(name.c_str(), nullptr, Modifier::Const);
break;
case IS_LONG:
registerProperty(name.c_str(), static_cast<int64_t>(Z_LVAL(zendConst.value)), Modifier::Const);
break;
case IS_DOUBLE:
registerProperty(name.c_str(), Z_DVAL(zendConst.value), Modifier::Const);
break;
case IS_TRUE:
registerProperty(name.c_str(), true, Modifier::Const);
break;
case IS_FALSE:
registerProperty(name.c_str(), false, Modifier::Const);
break;
case IS_STRING:
registerProperty(name.c_str(), std::string(Z_STRVAL(zendConst.value), Z_STRLEN(zendConst.value)), Modifier::Const);
break;
default:
// this should not happend
// but we workaround this
// shadow copy
zval copy;
ZVAL_DUP(©, &zendConst.value);
convert_to_string(©);
registerProperty(name.c_str(), std::string(Z_STRVAL(copy), Z_STRLEN(copy)), Modifier::Const);
break;
}
}
void AbstractClass::registerMethod(const char *name, zapi::ZendCallable callable,
Modifier flags, const Arguments &args)
{
m_implPtr->m_methods.push_back(std::make_shared<Method>(name, callable, (flags & Modifier::MethodModifiers), args));
}
// abstract
void AbstractClass::registerMethod(const char *name, Modifier flags, const Arguments &args)
{
m_implPtr->m_methods.push_back(std::make_shared<Method>(name, (flags & Modifier::MethodModifiers) | Modifier::Abstract, args));
}
StdClass *AbstractClass::construct() const
{
return nullptr;
}
StdClass *AbstractClass::clone(StdClass *orig) const
{
return nullptr;
}
int AbstractClass::callCompare(StdClass *left, StdClass *right) const
{
return 1;
}
void AbstractClass::callClone(StdClass *nativeObject) const
{}
void AbstractClass::callDestruct(StdClass *nativeObject) const
{}
Variant AbstractClass::callMagicCall(StdClass *nativeObject, const char *name, Parameters ¶ms) const
{
return nullptr;
}
Variant AbstractClass::callMagicStaticCall(const char *name, Parameters ¶ms) const
{
return nullptr;
}
Variant AbstractClass::callMagicInvoke(StdClass *nativeObject, Parameters ¶ms) const
{
return nullptr;
}
ArrayVariant AbstractClass::callDebugInfo(StdClass *nativeObject) const
{
return nullptr;
}
Variant AbstractClass::callGet(StdClass *nativeObject, const std::string &name) const
{
return nullptr;
}
void AbstractClass::callSet(StdClass *nativeObject, const std::string &name,
const Variant &value) const
{}
bool AbstractClass::callIsset(StdClass *nativeObject, const std::string &name) const
{
return false;
}
void AbstractClass::callUnset(StdClass *nativeObject, const std::string &name) const
{}
Variant AbstractClass::castToString(StdClass *nativeObject) const
{
return StringVariant();
}
Variant AbstractClass::castToInteger(StdClass *nativeObject) const
{
return NumericVariant();
}
Variant AbstractClass::castToDouble(StdClass *nativeObject) const
{
return DoubleVariant();
}
Variant AbstractClass::castToBool(StdClass *nativeObject) const
{
return BoolVariant();
}
bool AbstractClass::clonable() const
{
return false;
}
bool AbstractClass::serializable() const
{
return false;
}
bool AbstractClass::traversable() const
{
return false;
}
zend_class_entry *AbstractClass::initialize(const std::string &prefix, int moduleNumber)
{
return getImplPtr()->initialize(this, prefix, moduleNumber);
}
zend_class_entry *AbstractClass::initialize(int moduleNumber)
{
return initialize("", moduleNumber);
}
void AbstractClass::notImplemented()
{
throw NotImplemented();
}
} // vm
} // zapi
|
Q:
CanDeactivate confirm message
I've implemented a CanDeactivate guard to avoid user leave the page during the upload and it works. The problem is that my message is always a default message (in dutch because of the browser language) and, even setting a message myself, still show the same default confirm window. I would like to write my own message (actually I have a modal that I want to show, but first I would like to see working just with my simple message)
Any ideas what could it be? Am I missing something?
Thanks in advance!
here's the code
Guard.
import { Injectable, ViewContainerRef } from '@angular/core';
import { CanDeactivate } from '@angular/router';
import { Observable } from 'rxjs/Observable';
import { DialogService } from '../services';
export interface PendingUpload {
canDeactivate: () => boolean | Observable<boolean>;
}
@Injectable()
export class PendingUploadGuard implements CanDeactivate<PendingUpload> {
constructor(private dialogService: DialogService, private viewContainerRef: ViewContainerRef) { }
canDeactivate(component: PendingUpload): boolean | Observable<boolean> {
return component.canDeactivate()
? true
: confirm("Test custom message");
//dialog I want to use later
//this.dialogService.confirm("modal title", "modal body", this.viewContainerRef);
}
}
Component
import { Component, OnInit, HostListener } from '@angular/core';
import { Observable } from 'rxjs/Observable';
import { PendingUpload } from '../../shared/validators/pending-upload.guard';
import './../../rxjs-operators';
@Component({
selector: 'component-selector',
templateUrl: './html',
styleUrls: ['./css']
})
export class ScannerUploadComponent implements OnInit, PendingUpload {
uploading: boolean = false;
constructor() { }
ngOnInit() {
this.uploading = false;
}
@HostListener('window:beforeunload')
canDeactivate(): Observable<boolean> | boolean {
return !this.uploading;
}
}
A:
Your custom message will only be shown when trying to navigate elsewhere within your Angular app (e.g., navigating from http://localhost:4200/#/test1 to http://localhost:4200/#/test2). This is because the CanDeactivate guard only activates for route changes made via the Angular router, within your Angular app.
When navigating away from your Angular app (e.g., navigating from http://localhost:4200/#/test1 to http://stackoverflow.com, refreshing the page, closing the browser window/tab, etc.), the window beforeunload event activates (due to the @HostListener('window:beforeunload') annotation) and handles the confirm dialog on its own, without the CanDeactivate guard. In this case, Chrome and Firefox display their own pending changes warning message.
You can read more about the beforeunload event and how it works here. You'll notice in the "Notes" section that it states the following:
In Firefox 4 and later the returned string is not displayed to the user. Instead, Firefox displays the string "This page is asking you to confirm that you want to leave - data you have entered may not be saved."
Chrome follows a similar pattern, explained here.
IE/Edge still seem to offer the ability to specify a custom beforeunload message. An example of this can be seen here.
|
SEGA is bringing their beloved Super Monkey Ball series to Sony's new PlayStation Vita, which, by the way, has been dated for February 22 of next year. Surely, everybody loves the little monkey rolling around in his super ball, collecting bananas, and trying his damnedest to avoid falling off the edge of any given level, right?
Heck, that monkey rules, and his offering on the Vita not only sounds promising, but it is promising, and in my opinion offers what all great portable titles should -- quick, pick-up-and-play gameplay.
At its core, Super Monkey Ball follows the quintessential "monkey see, monkey do" formula. You have a level, you have obstacles, you have bananas, and you have a goal. Play, rinse, and repeat for a ton of other levels, though each gets more difficult as you go along. Ramps get a bit steeper, corners get harder to take, and the floor has raised obstacles in the form of pyramids having you bump and trod your way across.
The Vita's analog sticks work well with Super Monkey Ball, which honestly shouldn't be a surprise. We've seen and played Monkey Ball before on systems that only offered analog gameplay, so those familiar with the series will feel at home here. The Vita's motion functionality, however, brings a whole new beast. Here, you are basically re-learning everything about Super Monkey Ball, with very calm hands being the key to reaching a level's finish line.
Hopping right in, Super Monkey Ball's control with the gyro-sensor and accelerometer felt fluid and intuitive after the first few losses. It doesn't feel too stiff nor too loose, and I honestly knew that losing a level was definitely due to my own fault, and not that of the controls.
But, motion controls aren't even the best part of Super Monkey Ball on the PlayStation Vita. That would have to go to the game's level creator, where taking a picture of your surroundings with the handheld's built-in camera will instantly make an in-game level based off the captured geometry. As an example, a SEGA representative and I assembled a "level" on a tabletop with a few television remotes and an iPhone. One of the remotes also had an incline to it, which made our impromptu assembly not just a flat surface. After taking a picture of the creation, it appeared on the Vita, and with a few shakes of the handheld, bam! A user-created level was born!
Now, the level wasn't an exact representation of what was on the tabletop, but it was nonetheless pretty impressive -- even the angled remote was shown in the course. It also followed the same outline of how the objects were placed.
Harking back to the shaking part I mentioned briefly before, yes, shaking the Vita "assembles" the level, and the harder you shake the harder the level will be. Interesting, yes, and when I tested it for myself it was ultimately true. I was told, though, that the team was worried about people carelessly shaking their Vita, and then ending up breaking them. I could totally see that turning into the next "Wii remote into the television" YouTube video.
Super Monkey Ball is planned to launch alongside the PlayStation Vita's release, so perhaps as early as next February will be your opportunity to get your hands on it. As I mentioned before, Super Monkey Ball offers that great quick bit of action that games of a portable platform should provide, and I can't wait to see what crazy level I'll be able to make next.
READER COMMENTS LOADING BELOW...
LET'S KEEP THE COMMUNITY GREAT
You're not expected to always agree, but do please keep cool and never make it personal. Report harassment, spam, and hate speech to our community team. Also, on the right side of a comment you can flag nasty comments anonymously (we ban users dishing bad karma). For everything else, contact us! |
Collection of A Frame Home Interiors | A Frame Interior A Frames Cabins Pinterest Interiors, Cgarchitect Professional 3d Architectural Visualization, 9 Pictures A Frame Interiors House Plans 76094, 22 Modern A Frame House Designs You Ll Love Furniture, 17 Best Images About Tiny Homes On Pinterest Micro House | Hnczcyw.com
A Frame Home Interiors is match and guidelines that suggested for you, for
creativity about you search. The exactly dimensions of A Frame Home Interiors was 1920x1080 pixels. You can even look for a few pictures that related to A Frame Home Interiors by scroll right down to collection on below
this picture. If you wish to find the other picture or article about A Frame Home Interiors just drive another button or prior
button; or if you are enthusiastic about similar pictures of A Frame Home Interiors, you are absolve to flick through search feature that situated on top this
site or arbitrary post section at below of the post. Really is
endless it can benefit that you
get information of the picture.
Please if you want the image or gallery that you what I'd like you to definitely do is to aid and help us expanding more experience by showing this design
or clicking some arbitrary posts below for much more pictures and additional information. Additionally you can help us increase by writing These Resources of A Frame Home Interiors on Facebook, Way, Twitter, Yahoo Plus and Pinterest. |
Cz Engagement Ring Sets Awesome Cz Wedding Ring Sets Wedding Corners
Cz Engagement Ring Sets Awesome Cz Wedding Ring Sets Wedding Corners is a part of
Best Of Cz Engagement Ring Sets pictures gallery.
To download this Cz Engagement Ring Sets Awesome Cz Wedding Ring Sets Wedding Corners in High Resolution, right click on the image and choose "Save Image As"
and then you will get this image about Cz Engagement Ring Sets Awesome Cz Wedding Ring Sets Wedding Corners.
This digital photography of Cz Engagement Ring Sets Awesome Cz Wedding Ring Sets Wedding Corners has dimension 300 × 300 pixels.
You can see another items of this gallery of Best Of Cz Engagement Ring Sets below.
Get interesting article about Best Of Cz Engagement Ring Sets that may help you.
Best Of Cz Engagement Ring Sets – Through the thousand pictures online about Cz Engagement Ring Sets, we picks the best collections along with best image resolution simply for you all, and now this photographs is considered one of photos selections inside our finest pictures gallery regarding Best Of Cz Engagement Ring Sets. I am hoping you may enjoy it. This particular impression (Cz Engagement Ring Sets Awesome Cz Wedding Ring Sets Wedding Corners) previously mentioned is actually branded having: posted by azab with 2017-11-05 02:09:54. To see almost all photographs with Best Of Cz Engagement Ring Sets images gallery make sure you stick to this particular hyperlink. The Stylish in addition to Lovely Cz Engagement Ring Sets pertaining to Really encourage The house Provide Property Comfy DesireHouse |
What is Inositol ?
Inositol, sometimes called vitamin B8, is one of the B complex vitamins that the body needs in small amounts daily to stay healthy. However it is not officially recognised as a vitamin as it can be synthesized in the body from glucose, by intestinal bacteria.
The most common natural form of it is myo-inositol.
Inositol is present in all body tissues, with the highest concentrations in the brain and heart, and lens of the eye.
How Inositol Benefits Health
Inositol functions closely with choline as one of the primary components of cell membranes. It is important for growth of cells in the bone marrow, eye membranes, and intestines.
Like choline it is a lipotropic agent or fat emulsifier, though milder. It helps metabolize fat and cholesterol by breaking down fats into smaller particles that are easier to remove, and reduces fatty build-up in the body organs, especially the liver.
Inositol has a calming effect as it is involved in the production and action of neurotransmitters (chemicals that transmit messages between nerve cells) like serotonin and acetylcholine.
People who are depressed have been found to have lower levels of inositol than normal. Inositol has been tested as a treatment for depression, and initial evidence is encouraging. In a small double-blind study those on the supplement who took 12 g of inositol daily for 4 weeks showed significant improvement compared to the placebo group.
Preliminary findings from double-blind studies also suggest that inositol may help alleviate polycystic ovary syndrome, including infertility.
This list summarizes how inositol benefits the body.
::
Inositol Benefits & Functions
1.
important in fat and cholesterol metabolism
2.
mild lipotropic agent that removes fats from the liver and lowers blood cholesterol
3.
has been found in studies to improve symptoms of polycystic ovary syndrome (PCOS) including infertility, with significant weight loss and increased HDL (“good”) cholesterol levels
4.
used to help prevent plaque build-up and arteriosclerosis (hardening of the arteries)
5.
needed for hair growth and strong healthy hair
6.
helps maintain healthy skin
7.
has been used to prevent and treat eczema
8.
considered a brain food as it works with choline in brain cell nutrition
9.
needed, together with choline, for formation of lecithin, a key building block of cell membranes that protects cells from oxidation and forms the protective sheath around the brain
10.
essential component of myelin that coats nerves and regulates nerve transmission, and may help treat nerve disorders
11.
has helped improve nerve function in diabetics who experience pain and numbness arising from nerve degeneration
12.
preliminary research indicates that inositol has a calming effect and may help treat depression, panic attacks and obsessive-compulsive disorder
Deficiency is rare as the body manufactures inositol, and it is present in a wide variety of foods.
However, long term use of antibiotics increases the need for inositol. So does regular consumption of more than 2 cups of coffee daily as coffee destroys this nutrient. Extremely high coffee intake can therefore produce a deficiency.
::
Inositol Deficiency Symptoms
1.
eye abnormalities
2.
hair loss or alopecia or patchy baldness
3.
memory loss
4.
eczema
5.
constipation
6.
higher cholesterol level
7.
liver excess fat
8.
hardening and narrowing of arteries (atheriosclerosis)
9.
lower levels of inositol have been found in the nerves of people with multiple sclerosis and diabetic nerve disorders; supplementation may help as inositol benefits nerve transmission
Inositol is found in cereals, legumes and seeds, in the form of phytic acid. Phytic acid binds with minerals like calcium, iron and zinc, which interferes with their absorption. Concerns about this tend to be overblown however, and can be addressed by cooking or sprouting such foods.
Taking vitamins and minerals in their correct balance is vital to the proper functioning of all vitamins. They work synergistically, which means that the effectiveness of any one nutrient requires or is enhanced, sometimes dramatically, by the presence of certain other nutrients.
For this reason, if you are looking to take supplements for maintenance of optimal health, the recommended approach is to take a multi-vitamin that has the proper balance of all the necessary nutrients your body needs.
For a list of reputable top ranked vitamin and mineral supplements chosen in an independent supplement review, see Best Multivitamin Supplements. Many of these are manufactured to pharmaceutical or nutraceutical GMP compliance, which is the highest multivitamin standard possible.
Keep in mind, however, that while vitamin supplements are useful to plug nutritional gaps that are almost inevitable in modern diets, and to ensure we get optimal doses of nutrients, they are no substitute for a good diet. Instead, use them to complement a healthy diet and lifestyle.
There is no official RDA for inositol, which is not recognized as a vitamin. It is also difficult to list recommended daily intakes, as it is made in the body. As a rough guide however, many nutritionists advise a daily consumption of 1,000 mg for adults. |
Q:
Generated sigma algebras and independence
I have the following question regarding independence of generated $\sigma$-algebras:
Let $(X_i)_{i\geq 1}$ an i.i.d sequence in $\mathcal{L}^1$, define $S_n=\sum_{i=1}^n X_i$ I am trying to prove that $E(X_1|\mathcal{G}
_n)=E(X_1|S_n)$ where $\mathcal{G}_n:=\sigma(\cup_{k=n}^\infty S_k)$
For that purpose, I am wondering if it is true that $\sigma(S_n)$ and $\sigma(\cup \sigma(X_1), \sigma(S_n))$ are independent of $\sigma(\cup_{i=n+1}^\infty S_{i})$.
A:
No: this would imply that $S_n$ is independent of $S_{n+1}$. If you assume integrability, this implies that $$\mathbb E\left[S_{n+1}\right]=\mathbb E\left[S_{n+1}\mid S_n\right]=S_n+\mathbb E\left[X_{n+1}\mid S_n\right]=S_n+\mathbb E\left[X_{n+1}\right]$$
hence $S_n$ is constant.
|
Bruns Herred
The planting strategy for Humlebæk South aims to fuse several methods from the danish tradition of building in harmony with the landscape. There are many good examples, but we would like to focus those where the building is experienced as another nature and meets the terrain on its own terms.
The new neighborhood in Humlebæk Syd can be characterized as an artificial topography. The city is developing in order to stay in direct dialog with the landscape’s historic geomorphology and maintains the existing qualities, while also adding many new ones. The extra soil from the building excavation will be a part of building topography to produce landscape and atmospheric value. At the same time we will respect and optimize the existing faunal and floral networks by not building across the open landscape.
Papirøen has a unique placement in at the inner part of Copenhagen harbour. There is a lot of potential on this prime location setting the bar high on the subject of Copenhagen future city- and nature developments.
THIRD NATURE won the climate and transformation competition for Enghaveparken! See how we have made space for 24.000 m³ cloudburst water in the park, that is in the process of becoming a preserved park.
Our winning proposal for the development of Almegård Barracks is based on a holistic, local concept where the main transformative force is found in the individual users and inherent qualities of the site.
The vision is a bank that can generously contribute to its surroundings with a new type of urban park. The team’s proposal for the ILB Potsdam’s new headquarters will fuse with urban life, terrain, and nature.
Papirøen has a unique placement in at the inner part of Copenhagen harbour. There is a lot of potential on this prime location setting the bar high on the subject of Copenhagen future city- and nature developments.
THIRD NATURE won the climate and transformation competition for Enghaveparken! See how we have made space for 24.000 m³ cloudburst water in the park, that is in the process of becoming a preserved park.
Our winning proposal for the development of Almegård Barracks is based on a holistic, local concept where the main transformative force is found in the individual users and inherent qualities of the site.
The vision is a bank that can generously contribute to its surroundings with a new type of urban park. The team’s proposal for the ILB Potsdam’s new headquarters will fuse with urban life, terrain, and nature.
St. Kjelds Neighborhood has a unique possibility to avoid the type of development where inspiration is drawn from the celebrated neighborhoods, rather than looking inward to its own qualities.
Testimonials
←
→
It is easier to prepare Denmark for tomorrow’s climate than to clean up after one cloudburst after another. This is why a project like the Climate District in Østerbro, where ambitions are high, […] is a big step in the right direction.
Former Environmental Minister Ida Auken
Well on it’s way towards a third nature. The winning proposal is like a meteor strike in the functionally divided city
Boris Brorman Jensen in The Architect
It is captivatingly futuristic and, alongside the other comparatively simple schemes, speculates just how advanced we could be if we hadn’t neglected our urban waterways for so long.
Financial Times on HOW
A jury member described it as ‘academic hippie platitudes – plenty of feel-good, but completely unnecessarily high readability index’.
The most original is in the solutions presented. Not least what a jury member call ‘the Big Rainwater Penis’. |
REPLACE INTO collection_regexes (id, group_regex, regex, status, description, ordinal)
VALUES (
588,
'^alt\\.binaries\\.sounds\\.flac$',
'/^("|#34;)(?P<match1>.+?)(\\.part\\d*|\\.rar)?(\\.vol.+ \\(\\d+\\/\\d+\\) "|\\.[A-Za-z0-9]{2,4}("|#34;))[-_ ]{0,3}\\[\\d+\\/(?P<match0>\\d+\\]).+www\\.EliteNZB\\.net.+[-_ ]{0,3}yEnc$/i',
1,
'"Jinsi_12187_v807.par2" [01/13] - The Elite Team Presents www.EliteNZB.net, Powered by 4UX.NL, Only The Best 4 You!!!! yEnc',
20
); |
James W. Tate
James William Tate (30 July 1875 – 5 February 1922) was a songwriter, accompanist, and composer and producer of revues and pantomimes in the early years of the 20th century. Tate was born in Wolverhampton, England and died in Stoke-on-Trent, suddenly at the age of 46, as a result of pneumonia caught while traveling the country with his touring revues.
Life and career
The son of a publican, Tate was the eldest brother of one of the foremost operatic sopranos of the early twentieth century, Maggie Teyte. Originally intending to pursue a career in the church, he received early music training from his father, composing his first piece at the age of ten.
Early career
In 1892, Tate went to the United States, returning in 1897 to accept a position as Musical Director at the Carl Rosa Opera Company. Later, Tate served as Musical Director at Wyndham's Theatre. In 1898 Tate went on tour as conductor with the dancer-singer Lottie Collins, who was famous for introducing the song "Ta-ra-ra Boom-de-ay" to Britain. He married Collins in 1902, becoming her second husband. She was the mother of musical comedy star Jose Collins. In 1902, he managed a production with a title similar to that of the Parisian hit play Coralie et Cie at the Islington Grand called The Court Dressmaker, or Coralie and Co. This led to legal action in the High Court by the producers of 'The Little French Milliner', an adaptation of the same French play at The Avenue theatre; the dispute was settled by an agreement to alter the title of Tate's play. In 1903 he toured as conductor with the musical All at Sea.
After Lottie Collins's death in 1910, Tate married singer Clarice Mayne in 1912, with whom he had been performing since 1906. Tate was her accompanist, and was the "That" in the variety theatre act known as "Clarice Mayne and That" ("This sings, That Plays!"). Tate was a composer of numerous catchy music hall songs during these years, many for his wife. He also had songs interpolated in shows, including Sergeant Brue (1904, "Instinct", "And so did Eve") and The Belle of the Orient (1904).
World War I years
The producer Julian Wylie saw Tate and Mayne's act and formed a partnership with Tate. They began to specialize in creating and producing pantomimes and revues just before the First World War, including I Should Worry at the Palace Theatre (1913), the Victoria Palace's A Year in an Hour (1914), Very Mixed Bathing (1915), Kiss Me, Sergeant (1915), The Passing Show (1915), and High Jinks (1916). Tate co-wrote the successful Samples (1916) with Herman Darewski and Irving Berlin, including the hit song, "A Broken Doll." The Vaudeville Theatre revue Some included his successful song, "Ev'ry little while" (1916). Tate also wrote song hits such as "The rain came pitter patter pown," "A tiny seed," "Come over the Garden Wall," and "I was a good little girl till I met you" (all in 1914), and "Give me a little cosy corner" (1918).
In 1916 Tate composed four songs, including three that became hits ("My life is love", "A bachelor gay am I", and "A paradise for two"), for inclusion in what became a record-breaking show, The Maid of the Mountains. This commission arose at the suggestion of the show's star, Tate's step daughter Jose Collins, after initial previews indicated that the original score needed strengthening. Lyrics to these songs where supplied by his regular lyricists Frank Clifford Harris and "Valentine" (Archibald Thomas Pechey), who were to write the lyrics of many of Tate's songs throughout his career. "A bachelor gay" became one of the most popular baritone songs in the British concert repertoire. Tate subsequently wrote the score for more revues and pantomimes, including the revusical The Lads of the Village (1917), and another revue-musical, The Beauty Spot (1917), created for Regine Flory and produced by Parisian revue specialist P-L Flers at the Gaiety Theatre, London.
Later years
Wylie and Tate concentrated on pantomime after World War I, introducing shows such as Any Lady (1918), The Follies of 1919 (which was repeated in each subsequent year) and Mr Manhattan (1919), The Whirl Of Today (1920), Aladdin (1920), and many shows at the London Hippodrome, including The Peep Show (1921), 1921 Swindells Stores, Round In Fifty (1922, with Herman Finck, based on Around the World in 80 Days), Brighter London (1923) and Better Days (1925).
In his last years, Tate continued to produce popular songs, such "Somewhere in France with you," "Give Me a Cosy Little Corner," but he never wrote for another "book" musical. Tate's sudden death in 1922 at the age of 46 cut short a very productive career. The Wylie-Tate company continued through the 1920s and into the 1930s despite Tate's death, and Wylie continued to use Tate's music in pantomimes during this period, including several productions of Cinderella, Leap Year (1924), Mr Tickle M.P (1924), Who's My Father (1924), Turned Up (1926), Flyaway Peter (1926, with Sophie Tucker), The Apache (1927 at The London Palladium), Dancing Mad (1927), The Yellow Mask (1928), Mr. Cinders (1929) at the Adelphi Theatre and The Good Companions at His Majesty’s Theatre (1931).
Tate is buried in Hampstead Cemetery.
Notes
References
Biography of James W. Tate
Profile of Tate, a selected list of the Wylie-Tate productions and extensive information about them
Profile of James W. Tate
Brainy History
External links
Midi files to three songs that Tate composed for Sergeant Brue (1904)
Information about Tate and The Maid of the Mountains
Information about The Peep Show
Information about Aladdin
Category:1875 births
Category:1922 deaths
Category:English musical theatre composers
Category:English male composers
Category:Music hall performers
Category:People from Wolverhampton
Category:Deaths from pneumonia
Category:Burials at Hampstead Cemetery |
Shaq-a-Claus brings Christmas cheer in Venice
Former Los Angeles Laker Shaquille O’Neal dropped by the Boys & Girls Club of Venice on Monday, bringing gifts of shoes and toys for hundreds of children from low-income families and footing the bill for a petting zoo and a slide made of real snow. O’Neal, who as a child attended a Boys & Girls Club in New Jersey, has been doing similar events around the country since 1992, said Monique Brandon, the Venice Club’s executive director. “Fifteen million children will wake up on Christmas without a toy. My goal is to chip away at that number and spread cheer,” O’Neal said. |
About Us
Shannon Herndon of Watauga High, who was a No.2 seedat the Western Regional last weekend in Charlotte and reached the State quarter-finals on Friday in Raleigh, has been named the Player of the Year in the Northwestern 3A/4A Conference.
In all, the Pioneers had four players on the NW3A/4A All-Conference team. Herndon, undefeated in conference play,was joined on the all-conference team by Hannah Petrersen, Katelin Fox and Meredith Smith.
Petersen and Fox played doubles at the Western Regional last weekend, but were eliminated on the first day of competition. Herndon made it to the championship match, but lost to three-time state champion Grace Baker of Myers Park. Smith, a No.4 seed at regionals, lost to Baker in the semifinals and was defeated by Jessica Perez of Myers Park in the third-place match.
The WHS tennis team also reached the second round of the state-dual team playoffs and was 15-2. The Pioneers dropped a 5-4 decision to South Mecklenburg last Tuesday in second-round play. |
Saudi Arabia has unveiled a 900km multi-layered fence along its border with Iraq, as part of efforts to secure the kingdom's vast desert frontiers against infiltrators and smugglers, state media SPA has said. King Abdullah announced the launch of the first stage of the border security programme late on Friday, which stretches from Hafar al-Batin, near the Iraq-Kuwait border to the northeast town of Turaif close to Jordan.
The project, which includes five layers of fencing equipped with watch towers, night-vision cameras and 50 radars is aimed at cutting the "number of infiltrators, drug, arms and cattle smugglers to zero", SPA said. The border programme, which was first discussed in 2006, came amid growing concern over neighbouring Iraq's deteriorating security situation. In 2009, Riyadh signed a deal with European aerospace and defence contractors EADS to secure the Iraq border, but with increasing fears over infiltration by anti-government groups and al-Qaeda, the interior ministry expanded the scope to cover all the country's borders. |
Diet-induced obesity, energy metabolism and gut microbiota in C57BL/6J mice fed Western diets based on lean seafood or lean meat mixtures.
High protein diets may protect against diet-induced obesity, but little is known regarding the effects of different protein sources consumed at standard levels. We investigated how a mixture of lean seafood or lean meat in a Western background diet modulated diet-induced obesity, energy metabolism and gut microbiota. Male C57BL/6J mice fed a Western diet (WD) containing a mixture of lean seafood (seafood WD) for 12weeks accumulated less fat mass than mice fed a WD containing a mixture of lean meat (meat WD). Meat WD-fed mice exhibited increased fasting blood glucose, impaired glucose clearance, elevated fasting plasma insulin and increased plasma and liver lipid levels. We observed no first choice preference for either of the WDs, but over time, mice fed the seafood WD consumed less energy than mice fed the meat WD. Mice fed the seafood WD exhibited higher spontaneous locomotor activity and a lower respiratory exchange ratio (RER) than mice fed the meat WD. Thus, higher activity together with the decreased energy intake contributed to the different phenotypes observed in mice fed the seafood WD compared to mice fed the meat WD. Comparison of the gut microbiomes of mice fed the two WDs revealed significant differences in the relative abundance of operational taxonomic units (OTUs) belonging to the orders Bacteroidales and Clostridiales, with genes involved in metabolism of aromatic amino acids exhibiting higher relative abundance in the microbiomes of mice fed the seafood WD. |
Synopsis
Act 1
Scene 1: A heath
Groups of witches gather in a wood beside a battlefield. The victorious generals Macbeth and Banquo enter. The witches hail Macbeth as Thane of Glamis, Thane of Cawdor, and king "hereafter." Banquo is greeted as the founder of a great line of future kings. The witches vanish, and messengers from the king appear naming Macbeth Thane of Cawdor.
Scene 2: Macbeth's castle
Lady Macbeth reads a letter from her husband telling of the encounter with the witches. She is determined to propel Macbeth to the throne.
[Revised version only: Vieni! t'affretta! - "Come! Hurry!"].
Lady Macbeth is advised that King Duncan will stay in the castle that night; she is determined to see him killed (Or tutti, sorgete - "Arise now, all you ministers of hell"). When Macbeth returns she urges him to take the opportunity to kill the King. The King and the nobles arrive and Macbeth is emboldened to carry out the murder (Mi si affaccia un pugnal? - "Is this a dagger which I see before me?"), but afterwards is filled with horror. Disgusted at his cowardice, Lady Macbeth completes the crime, incriminating the sleeping guards by smearing them with Duncan's blood and planting on them Macbeth's dagger. The murder is discovered by Macduff. A chorus calls on God to avenge the killing (Schiudi, inferno, . . - "Open wide thy gaping maw, O Hell").
Act 2
Scene 1: A room in the castle
Macbeth is now king, but disturbed by the prophecy that Banquo, not he, will found a great royal line. To prevent this he tells his wife that he will have both Banquo and his son murdered as they come to a banquet.
[Revised version only: In her aria, La luce langue - "The light fades", Lady Macbeth exults in the powers of darkness]
Scene 2: Outside the castle
A gang of murderers lie in wait. Banquo is apprehensive (Come dal ciel precipita - "O, how the darkness falls from heaven"). He is caught, but enables his son Fleanzio to escape.
Scene 3: A dining hall in the castle
Macbeth receives the guests and Lady Macbeth sings a brindisi (Si colmi il calice - "Fill up the cup"). The assassination is reported to Macbeth, but when he returns to the table the ghost of Banquo is sitting in his place. Macbeth raves at the ghost and the horrified guests believe he has gone mad. The banquet ends abruptly with their hurried, frightened departure.
Act 3
The witches' cave
The witches gather around a cauldron in a dark cave. Macbeth enters and they conjure up three apparitions for him. The first advises him to beware of Macduff. The second tells him that he cannot be harmed by a man 'born of woman'. The third that he cannot be conquered till Birnam Wood marches against him. (Macbeth: O lieto augurio - "O, happy augury! No wood has ever moved by magic power")
Macbeth is then shown the ghost of Banquo and his descendants, eight future Kings of Scotland, verifying the original prophecy. (Macbeth: Fuggi regal fantasima - "Begone, royal phantom that reminds me of Banquo"). He collapses, but regains consciousness in the castle.
[Original version: The act ends with Macbeth recovering and resolving to assert his authority: Vada in fiamme, e in polve cada - "Macduff's lofty stronghold shall / Be set fire....".]
A herald announces the arrival of the Queen. Macbeth tells his wife of his encounter with the witches and they resolve to track down and kill Banquo's son and Macduff's family (Duet: Ora di morte e di vendetta - "Hour of death and of vengeance").
Act 4
[Original version: While each version uses the same libretto, the music of this chorus is different. It begins with a less ominous, much shorter orchestral introduction and is sung straight though by the entire chorus compared to the later version's division of the music into sections for the male and female members, then uniting towards the end. The revised version is 2 minutes longer than the original.]
In the distance lies Birnam Wood. Macduff is determined to avenge the deaths of his wife and children at the hands of the tyrant (Ah, la paterna mano - "Ah, the paternal hand"). He is joined by Malcolm, the son of King Duncan, and the English army. Malcolm orders each soldier to cut a branch from a tree in Birnam Wood and carry it as they attack Macbeth's army. They are determined to liberate Scotland from tyranny (Chorus: La patria tradita - "Our country betrayed").
Scene 2: Macbeth's castle
A doctor and a servant observe the Queen as she walks in her sleep, wringing her hands and attempting to clean them of blood (Una macchia è qui tuttora! - "Yet here's a spot").
Scene 3: The battlefield
Macbeth has learned that an army is advancing against him but is reassured by remembering the words of the apparitions (Pietà, rispetto, amore - "Compassion, honour, love"). He receives the news of the Queen's death with indifference. Rallying his troops he learns that Birnam Wood has indeed come to his castle. Battle is joined.
[Ending of the original version:] Macduff pursues and fights Macbeth who falls. He tells Macbeth that he was not "born of woman" but "ripped" from his mother's womb. Fighting continues. Mortally wounded, Macbeth, in a final aria - Mal per me che m'affidai - "Trusting in the prophesies of Hell" - proclaims that trusting in the prophesies of hell caused his downfall. He dies on stage, while Macduff's men proclaim Macduff to be the new King.
Macduff pursues and fights Macbeth who falls wounded. He tells Macbeth that he was not "born of woman" but "ripped" from his mother's womb. Macbeth responds in anguish (Cielo! - "Heaven") and the two continue fighting, then disappear from view. Macduff returns indicating to his men that he has killed Macbeth. The scene ends with a hymn to victory sung by bards, soldiers, and Scottish women (Salva, o re! - "Hail, oh King!). |
Platelet thromboxane release after subarachnoid hemorrhage and surgery.
We studied adenosine diphosphate-induced platelet aggregation and the associated release of thromboxane B2 in platelet-rich plasma from 88 patients with subarachnoid hemorrhage and 26 healthy controls. During the first 3 days after subarachnoid hemorrhage, the patients showed significantly decreased (p less than 0.05) platelet aggregability and thromboxane release relative to the controls, but these effects disappeared in a few days. Platelet count increased for 3 weeks after subarachnoid hemorrhage. Surgery in 67 patients was followed by significant increases in platelet aggregability (p less than 0.05) and thromboxane release (p less than 0.001). Greatest thromboxane release was found in the eight patients showing delayed (postoperative) ischemic deterioration with a permanent neurologic deficit. Although platelet hyperaggregability and increased thromboxane release were particularly prominent in these eight patients, the role of these hematologic parameters in the pathogenesis of delayed ischemic deterioration remains unclear. |
1. The Field of the Invention
The present disclosure relates generally to display systems, and more particularly, but not necessarily entirely, to display systems that utilize pulsed laser illumination sources.
2. Description of Background Art
Advanced display devices are becoming more prevalent in modern society. Such display devices are used to display information in a wide variety of settings providing, inter alia, education and entertainment. There have been several recent promised enhancements to display technologies including: increased resolution, increased contrast and increased brightness levels as well as other characteristics that improve the overall quality of images produced with dynamic video display systems.
Technologies used to produce advanced video displays include: Texas Instruments' DLP® projector using a digital micromirror device (“DMD”), Sony's SXRD® system and JVC's D-ILA® apparatus both which incorporate liquid crystal on silicon (“LCOS”) technology, Kodak's grating electromechanical system (“GEMS”) as well as systems using grating light valve (“GLV”) technology. All of these particular technologies differ in the devices which are used to modulate the light which is projected, and such light modulation devices are at the core of each system and the component to which the rest of the system components surrounding them are designed.
Previously available display technologies have typically employed either a two-dimensional scan architecture or a column-scan architecture, sometimes referred to as a one-dimensional scan architecture, to form an image on a viewing surface. In a display device employing a two-dimensional scan architecture, the underlying light modulation device includes a two-dimensional array of pixel elements able to generate an entire frame of an image at one time. The two-dimensional array of pixel elements may include micro-electro-mechanical (“MEMS”) structures. Alternatively, the two-dimensional array of pixel elements may include liquid crystals, such as those incorporating LCOS technology. In a display device employing a column-scan architecture, the underlying light modulation device may include a one-dimensional array of MEMS pixel elements able to draw a single column of the image at a time. To generate an entire image on the viewing surface, the single columns of the image are scanned, one-by-one, across the viewing surface, by a scanning device, such as a rotating scanning mirror or oscillating scanning mirror. As used herein, a scanning device may refer to any device having a moving reflective surface operable to scan modulated beams of light onto a viewing surface.
In the past, the previously available display technologies incorporated a variety of different light sources. For example, some of the display technologies utilize an incandescent lamp for generating white light which is passed through a color wheel as the light travels to the surface of the light modulation device. The use of a incandescent lamp in a display system has drawbacks, including, the limited life of the lamp and the need for color filters or a mechanized color wheel to produce different colored light.
Other light sources for light modulation devices have, in the past, included continuous wave lasers. The benefits which accompany the use of the continuous wave lasers include the ability to eliminate the need for separating white light into primary colors and their high power output. However, continuous wave lasers are in some instances disadvantageous due to their high power consumption, complex technical design, and excessive heat output.
Recently, improvements in the operation of semiconductor pulsed lasers have made them more attractive for use as light sources in display devices that utilize light modulators. These improvements eliminate some of the problems associated with the use of lamps and continuous wave lasers. However, even with the benefits provided over the previously available light sources, the use of semiconductor lasers in a display device is still faced with significant challenges of its own.
For example, one drawback to the use of semiconductor lasers is that in order to achieve maximum light intensity, the semiconductor lasers suitable for use in a display device must operate at a relatively low duty cycle. Another drawback to the use of semiconductor lasers is that their power output is relatively low when compared with some of the continuous wave lasers that have been previously available.
Another previous drawback to the use of pulsed light sources, such as a semiconductor laser operating at less than 100% duty cycle, in display devices having a column-scan architecture has been that most such display devices have previously required a light source that produces continuous light, such as a continuous wave laser, in order to generate an acceptable image. That is, past attempts to use pulsed light sources in a display device having a column-scan architecture have been unsuccessful as the pulsed light sources caused noticeable irregularities in the displayed image.
In particular, as the columns of pixels are each scanned across a viewing surface from a display device using pulsed light sources, undesirable vertical stripes and interpixel gaps are visible in the image due to the pulsed nature of the light incident on the light modulator. A primary cause of these vertical stripes and interpixel gaps is believed to be the relatively short pulse time of the pulsed laser sources when compared to the time necessary to scan a column of pixels on a viewing surface. In some instances, the duty cycle of the pulsed lasers, the ratio of the duration of a laser pulse to the time necessary to scan a column or pixel, is less than 50%. This means that, in some cases, the pulsed lasers are only active for an interval which is less than one-half of the time it takes to scan one full column or pixel. The end result of the low duty cycle of the pulsed lasers is that an intensity drop occurs at the edges of the pixels in a column. This problem becomes even more apparent when two columns of pixels in adjacent columns are viewed side-by-side.
It would therefore be an improvement over the previously available technologies and devices to significantly reduce, or eliminate altogether, the irregularities caused by the use of pulsed light sources in a display device. It would be a further improvement over the previously available technologies and devices to significantly reduce, or eliminate altogether, the irregularities caused by the use of pulsed light sources in a display device having a column-scan architecture.
The features and advantages of the disclosure will be set forth in the description which follows, and in part will be apparent from the description, or may be learned by the practice of the disclosure without undue experimentation. The features and advantages of the disclosure may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. |
// Automatically generated by the Fast Binary Encoding compiler, do not modify!
// https://github.com/chronoxor/FastBinaryEncoding
// Source: test.fbe
// Version: 1.4.0.0
namespace test {
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, EnumSimple value)
{
if (value == EnumSimple::ENUM_VALUE_0) { stream << "ENUM_VALUE_0"; return stream; }
if (value == EnumSimple::ENUM_VALUE_1) { stream << "ENUM_VALUE_1"; return stream; }
if (value == EnumSimple::ENUM_VALUE_2) { stream << "ENUM_VALUE_2"; return stream; }
if (value == EnumSimple::ENUM_VALUE_3) { stream << "ENUM_VALUE_3"; return stream; }
if (value == EnumSimple::ENUM_VALUE_4) { stream << "ENUM_VALUE_4"; return stream; }
if (value == EnumSimple::ENUM_VALUE_5) { stream << "ENUM_VALUE_5"; return stream; }
stream << "<unknown>";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, EnumTyped value)
{
if (value == EnumTyped::ENUM_VALUE_0) { stream << "ENUM_VALUE_0"; return stream; }
if (value == EnumTyped::ENUM_VALUE_1) { stream << "ENUM_VALUE_1"; return stream; }
if (value == EnumTyped::ENUM_VALUE_2) { stream << "ENUM_VALUE_2"; return stream; }
if (value == EnumTyped::ENUM_VALUE_3) { stream << "ENUM_VALUE_3"; return stream; }
if (value == EnumTyped::ENUM_VALUE_4) { stream << "ENUM_VALUE_4"; return stream; }
if (value == EnumTyped::ENUM_VALUE_5) { stream << "ENUM_VALUE_5"; return stream; }
stream << "<unknown>";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, EnumEmpty value)
{
stream << "<unknown>";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, FlagsSimple value)
{
bool first = true;
if ((value & FlagsSimple::FLAG_VALUE_0) && ((value & FlagsSimple::FLAG_VALUE_0) == FlagsSimple::FLAG_VALUE_0))
{
stream << (first ? "" : "|") << "FLAG_VALUE_0";
first = false;
}
if ((value & FlagsSimple::FLAG_VALUE_1) && ((value & FlagsSimple::FLAG_VALUE_1) == FlagsSimple::FLAG_VALUE_1))
{
stream << (first ? "" : "|") << "FLAG_VALUE_1";
first = false;
}
if ((value & FlagsSimple::FLAG_VALUE_2) && ((value & FlagsSimple::FLAG_VALUE_2) == FlagsSimple::FLAG_VALUE_2))
{
stream << (first ? "" : "|") << "FLAG_VALUE_2";
first = false;
}
if ((value & FlagsSimple::FLAG_VALUE_3) && ((value & FlagsSimple::FLAG_VALUE_3) == FlagsSimple::FLAG_VALUE_3))
{
stream << (first ? "" : "|") << "FLAG_VALUE_3";
first = false;
}
if ((value & FlagsSimple::FLAG_VALUE_4) && ((value & FlagsSimple::FLAG_VALUE_4) == FlagsSimple::FLAG_VALUE_4))
{
stream << (first ? "" : "|") << "FLAG_VALUE_4";
first = false;
}
if ((value & FlagsSimple::FLAG_VALUE_5) && ((value & FlagsSimple::FLAG_VALUE_5) == FlagsSimple::FLAG_VALUE_5))
{
stream << (first ? "" : "|") << "FLAG_VALUE_5";
first = false;
}
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, FlagsTyped value)
{
bool first = true;
if ((value & FlagsTyped::FLAG_VALUE_0) && ((value & FlagsTyped::FLAG_VALUE_0) == FlagsTyped::FLAG_VALUE_0))
{
stream << (first ? "" : "|") << "FLAG_VALUE_0";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_1) && ((value & FlagsTyped::FLAG_VALUE_1) == FlagsTyped::FLAG_VALUE_1))
{
stream << (first ? "" : "|") << "FLAG_VALUE_1";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_2) && ((value & FlagsTyped::FLAG_VALUE_2) == FlagsTyped::FLAG_VALUE_2))
{
stream << (first ? "" : "|") << "FLAG_VALUE_2";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_3) && ((value & FlagsTyped::FLAG_VALUE_3) == FlagsTyped::FLAG_VALUE_3))
{
stream << (first ? "" : "|") << "FLAG_VALUE_3";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_4) && ((value & FlagsTyped::FLAG_VALUE_4) == FlagsTyped::FLAG_VALUE_4))
{
stream << (first ? "" : "|") << "FLAG_VALUE_4";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_5) && ((value & FlagsTyped::FLAG_VALUE_5) == FlagsTyped::FLAG_VALUE_5))
{
stream << (first ? "" : "|") << "FLAG_VALUE_5";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_6) && ((value & FlagsTyped::FLAG_VALUE_6) == FlagsTyped::FLAG_VALUE_6))
{
stream << (first ? "" : "|") << "FLAG_VALUE_6";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_7) && ((value & FlagsTyped::FLAG_VALUE_7) == FlagsTyped::FLAG_VALUE_7))
{
stream << (first ? "" : "|") << "FLAG_VALUE_7";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_8) && ((value & FlagsTyped::FLAG_VALUE_8) == FlagsTyped::FLAG_VALUE_8))
{
stream << (first ? "" : "|") << "FLAG_VALUE_8";
first = false;
}
if ((value & FlagsTyped::FLAG_VALUE_9) && ((value & FlagsTyped::FLAG_VALUE_9) == FlagsTyped::FLAG_VALUE_9))
{
stream << (first ? "" : "|") << "FLAG_VALUE_9";
first = false;
}
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, FlagsEmpty value)
{
bool first = true;
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructSimple& value)
{
stream << "StructSimple(";
stream << "id="; stream << value.id;
stream << ",f1="; stream << (value.f1 ? "true" : "false");
stream << ",f2="; stream << (value.f2 ? "true" : "false");
stream << ",f3="; stream << (int)value.f3;
stream << ",f4="; stream << (int)value.f4;
stream << ",f5="; stream << "'" << value.f5 << "'";
stream << ",f6="; stream << "'" << value.f6 << "'";
stream << ",f7="; stream << "'" << value.f7 << "'";
stream << ",f8="; stream << "'" << value.f8 << "'";
stream << ",f9="; stream << (int)value.f9;
stream << ",f10="; stream << (int)value.f10;
stream << ",f11="; stream << (int)value.f11;
stream << ",f12="; stream << (int)value.f12;
stream << ",f13="; stream << value.f13;
stream << ",f14="; stream << value.f14;
stream << ",f15="; stream << value.f15;
stream << ",f16="; stream << value.f16;
stream << ",f17="; stream << value.f17;
stream << ",f18="; stream << value.f18;
stream << ",f19="; stream << value.f19;
stream << ",f20="; stream << value.f20;
stream << ",f21="; stream << value.f21;
stream << ",f22="; stream << value.f22;
stream << ",f23="; stream << value.f23;
stream << ",f24="; stream << value.f24;
stream << ",f25="; stream << value.f25;
stream << ",f26="; stream << value.f26;
stream << ",f27="; stream << value.f27;
stream << ",f28="; stream << value.f28;
stream << ",f29="; stream << value.f29;
stream << ",f30="; stream << value.f30;
stream << ",f31="; stream << "\"" << value.f31 << "\"";
stream << ",f32="; stream << "\"" << value.f32 << "\"";
stream << ",f33="; stream << value.f33;
stream << ",f34="; stream << value.f34;
stream << ",f35="; stream << value.f35;
stream << ",f36="; stream << "\"" << value.f36 << "\"";
stream << ",f37="; stream << "\"" << value.f37 << "\"";
stream << ",f38="; stream << "\"" << value.f38 << "\"";
stream << ",f39="; stream << value.f39;
stream << ",f40="; stream << value.f40;
stream << ",f41="; stream << value.f41;
stream << ",f42="; stream << value.f42;
stream << ",f43="; stream << value.f43;
stream << ",f44="; stream << value.f44;
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructOptional& value)
{
stream << "StructOptional(";
stream << (const ::test::StructSimple&)value;
stream << ",f100="; if (value.f100) stream << (*value.f100 ? "true" : "false"); else stream << "null";
stream << ",f101="; if (value.f101) stream << (*value.f101 ? "true" : "false"); else stream << "null";
stream << ",f102="; if (value.f102) stream << (*value.f102 ? "true" : "false"); else stream << "null";
stream << ",f103="; if (value.f103) stream << (int)*value.f103; else stream << "null";
stream << ",f104="; if (value.f104) stream << (int)*value.f104; else stream << "null";
stream << ",f105="; if (value.f105) stream << (int)*value.f105; else stream << "null";
stream << ",f106="; if (value.f106) stream << "'" << *value.f106 << "'"; else stream << "null";
stream << ",f107="; if (value.f107) stream << "'" << *value.f107 << "'"; else stream << "null";
stream << ",f108="; if (value.f108) stream << "'" << *value.f108 << "'"; else stream << "null";
stream << ",f109="; if (value.f109) stream << "'" << *value.f109 << "'"; else stream << "null";
stream << ",f110="; if (value.f110) stream << "'" << *value.f110 << "'"; else stream << "null";
stream << ",f111="; if (value.f111) stream << "'" << *value.f111 << "'"; else stream << "null";
stream << ",f112="; if (value.f112) stream << (int)*value.f112; else stream << "null";
stream << ",f113="; if (value.f113) stream << (int)*value.f113; else stream << "null";
stream << ",f114="; if (value.f114) stream << (int)*value.f114; else stream << "null";
stream << ",f115="; if (value.f115) stream << (int)*value.f115; else stream << "null";
stream << ",f116="; if (value.f116) stream << (int)*value.f116; else stream << "null";
stream << ",f117="; if (value.f117) stream << (int)*value.f117; else stream << "null";
stream << ",f118="; if (value.f118) stream << *value.f118; else stream << "null";
stream << ",f119="; if (value.f119) stream << *value.f119; else stream << "null";
stream << ",f120="; if (value.f120) stream << *value.f120; else stream << "null";
stream << ",f121="; if (value.f121) stream << *value.f121; else stream << "null";
stream << ",f122="; if (value.f122) stream << *value.f122; else stream << "null";
stream << ",f123="; if (value.f123) stream << *value.f123; else stream << "null";
stream << ",f124="; if (value.f124) stream << *value.f124; else stream << "null";
stream << ",f125="; if (value.f125) stream << *value.f125; else stream << "null";
stream << ",f126="; if (value.f126) stream << *value.f126; else stream << "null";
stream << ",f127="; if (value.f127) stream << *value.f127; else stream << "null";
stream << ",f128="; if (value.f128) stream << *value.f128; else stream << "null";
stream << ",f129="; if (value.f129) stream << *value.f129; else stream << "null";
stream << ",f130="; if (value.f130) stream << *value.f130; else stream << "null";
stream << ",f131="; if (value.f131) stream << *value.f131; else stream << "null";
stream << ",f132="; if (value.f132) stream << *value.f132; else stream << "null";
stream << ",f133="; if (value.f133) stream << *value.f133; else stream << "null";
stream << ",f134="; if (value.f134) stream << *value.f134; else stream << "null";
stream << ",f135="; if (value.f135) stream << *value.f135; else stream << "null";
stream << ",f136="; if (value.f136) stream << *value.f136; else stream << "null";
stream << ",f137="; if (value.f137) stream << *value.f137; else stream << "null";
stream << ",f138="; if (value.f138) stream << *value.f138; else stream << "null";
stream << ",f139="; if (value.f139) stream << *value.f139; else stream << "null";
stream << ",f140="; if (value.f140) stream << *value.f140; else stream << "null";
stream << ",f141="; if (value.f141) stream << *value.f141; else stream << "null";
stream << ",f142="; if (value.f142) stream << *value.f142; else stream << "null";
stream << ",f143="; if (value.f143) stream << *value.f143; else stream << "null";
stream << ",f144="; if (value.f144) stream << *value.f144; else stream << "null";
stream << ",f145="; if (value.f145) stream << "\"" << *value.f145 << "\""; else stream << "null";
stream << ",f146="; if (value.f146) stream << "\"" << *value.f146 << "\""; else stream << "null";
stream << ",f147="; if (value.f147) stream << "\"" << *value.f147 << "\""; else stream << "null";
stream << ",f148="; if (value.f148) stream << *value.f148; else stream << "null";
stream << ",f149="; if (value.f149) stream << *value.f149; else stream << "null";
stream << ",f150="; if (value.f150) stream << *value.f150; else stream << "null";
stream << ",f151="; if (value.f151) stream << "\"" << *value.f151 << "\""; else stream << "null";
stream << ",f152="; if (value.f152) stream << "\"" << *value.f152 << "\""; else stream << "null";
stream << ",f153="; if (value.f153) stream << "\"" << *value.f153 << "\""; else stream << "null";
stream << ",f154="; if (value.f154) stream << *value.f154; else stream << "null";
stream << ",f155="; if (value.f155) stream << *value.f155; else stream << "null";
stream << ",f156="; if (value.f156) stream << *value.f156; else stream << "null";
stream << ",f157="; if (value.f157) stream << *value.f157; else stream << "null";
stream << ",f158="; if (value.f158) stream << *value.f158; else stream << "null";
stream << ",f159="; if (value.f159) stream << *value.f159; else stream << "null";
stream << ",f160="; if (value.f160) stream << *value.f160; else stream << "null";
stream << ",f161="; if (value.f161) stream << *value.f161; else stream << "null";
stream << ",f162="; if (value.f162) stream << *value.f162; else stream << "null";
stream << ",f163="; if (value.f163) stream << *value.f163; else stream << "null";
stream << ",f164="; if (value.f164) stream << *value.f164; else stream << "null";
stream << ",f165="; if (value.f165) stream << *value.f165; else stream << "null";
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructNested& value)
{
stream << "StructNested(";
stream << (const ::test::StructOptional&)value;
stream << ",f1000="; stream << value.f1000;
stream << ",f1001="; if (value.f1001) stream << *value.f1001; else stream << "null";
stream << ",f1002="; stream << value.f1002;
stream << ",f1003="; if (value.f1003) stream << *value.f1003; else stream << "null";
stream << ",f1004="; stream << value.f1004;
stream << ",f1005="; if (value.f1005) stream << *value.f1005; else stream << "null";
stream << ",f1006="; stream << value.f1006;
stream << ",f1007="; if (value.f1007) stream << *value.f1007; else stream << "null";
stream << ",f1008="; stream << value.f1008;
stream << ",f1009="; if (value.f1009) stream << *value.f1009; else stream << "null";
stream << ",f1010="; stream << value.f1010;
stream << ",f1011="; if (value.f1011) stream << *value.f1011; else stream << "null";
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructBytes& value)
{
stream << "StructBytes(";
stream << "f1="; stream << "bytes[" << value.f1.size() << "]";
stream << ",f2="; if (value.f2) stream << "bytes[" << value.f2->size() << "]"; else stream << "null";
stream << ",f3="; if (value.f3) stream << "bytes[" << value.f3->size() << "]"; else stream << "null";
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructArray& value)
{
stream << "StructArray(";
{
bool first = true;
stream << "f1=[2][";
for (size_t i = 0; i < 2; ++i)
{
stream << std::string(first ? "" : ",") << (int)value.f1[i];
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f2=[2][";
for (size_t i = 0; i < 2; ++i)
{
if (value.f2[i]) stream << std::string(first ? "" : ",") << (int)*value.f2[i]; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f3=[2][";
for (size_t i = 0; i < 2; ++i)
{
stream << std::string(first ? "" : ",") << "bytes[" << value.f3[i].size() << "]";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f4=[2][";
for (size_t i = 0; i < 2; ++i)
{
if (value.f4[i]) stream << std::string(first ? "" : ",") << "bytes[" << value.f4[i]->size() << "]"; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f5=[2][";
for (size_t i = 0; i < 2; ++i)
{
stream << std::string(first ? "" : ",") << value.f5[i];
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f6=[2][";
for (size_t i = 0; i < 2; ++i)
{
if (value.f6[i]) stream << std::string(first ? "" : ",") << *value.f6[i]; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f7=[2][";
for (size_t i = 0; i < 2; ++i)
{
stream << std::string(first ? "" : ",") << value.f7[i];
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f8=[2][";
for (size_t i = 0; i < 2; ++i)
{
if (value.f8[i]) stream << std::string(first ? "" : ",") << *value.f8[i]; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f9=[2][";
for (size_t i = 0; i < 2; ++i)
{
stream << std::string(first ? "" : ",") << value.f9[i];
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f10=[2][";
for (size_t i = 0; i < 2; ++i)
{
if (value.f10[i]) stream << std::string(first ? "" : ",") << *value.f10[i]; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructVector& value)
{
stream << "StructVector(";
{
bool first = true;
stream << "f1=[" << value.f1.size() << "][";
for (const auto& it : value.f1)
{
stream << std::string(first ? "" : ",") << (int)it;
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f2=[" << value.f2.size() << "][";
for (const auto& it : value.f2)
{
if (it) stream << std::string(first ? "" : ",") << (int)*it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f3=[" << value.f3.size() << "][";
for (const auto& it : value.f3)
{
stream << std::string(first ? "" : ",") << "bytes[" << it.size() << "]";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f4=[" << value.f4.size() << "][";
for (const auto& it : value.f4)
{
if (it) stream << std::string(first ? "" : ",") << "bytes[" << it->size() << "]"; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f5=[" << value.f5.size() << "][";
for (const auto& it : value.f5)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f6=[" << value.f6.size() << "][";
for (const auto& it : value.f6)
{
if (it) stream << std::string(first ? "" : ",") << *it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f7=[" << value.f7.size() << "][";
for (const auto& it : value.f7)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f8=[" << value.f8.size() << "][";
for (const auto& it : value.f8)
{
if (it) stream << std::string(first ? "" : ",") << *it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f9=[" << value.f9.size() << "][";
for (const auto& it : value.f9)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << "]";
}
{
bool first = true;
stream << ",f10=[" << value.f10.size() << "][";
for (const auto& it : value.f10)
{
if (it) stream << std::string(first ? "" : ",") << *it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << "]";
}
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructList& value)
{
stream << "StructList(";
{
bool first = true;
stream << "f1=[" << value.f1.size()<< "]<";
for (const auto& it : value.f1)
{
stream << std::string(first ? "" : ",") << (int)it;
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f2=[" << value.f2.size()<< "]<";
for (const auto& it : value.f2)
{
if (it) stream << std::string(first ? "" : ",") << (int)*it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f3=[" << value.f3.size()<< "]<";
for (const auto& it : value.f3)
{
stream << std::string(first ? "" : ",") << "bytes[" << it.size() << "]";
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f4=[" << value.f4.size()<< "]<";
for (const auto& it : value.f4)
{
if (it) stream << std::string(first ? "" : ",") << "bytes[" << it->size() << "]"; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f5=[" << value.f5.size()<< "]<";
for (const auto& it : value.f5)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f6=[" << value.f6.size()<< "]<";
for (const auto& it : value.f6)
{
if (it) stream << std::string(first ? "" : ",") << *it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f7=[" << value.f7.size()<< "]<";
for (const auto& it : value.f7)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f8=[" << value.f8.size()<< "]<";
for (const auto& it : value.f8)
{
if (it) stream << std::string(first ? "" : ",") << *it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f9=[" << value.f9.size()<< "]<";
for (const auto& it : value.f9)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << ">";
}
{
bool first = true;
stream << ",f10=[" << value.f10.size()<< "]<";
for (const auto& it : value.f10)
{
if (it) stream << std::string(first ? "" : ",") << *it; else stream << std::string(first ? "" : ",") << "null";
first = false;
}
stream << ">";
}
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructSet& value)
{
stream << "StructSet(";
{
bool first = true;
stream << "f1=[" << value.f1.size()<< "]{";
for (const auto& it : value.f1)
{
stream << std::string(first ? "" : ",") << (int)it;
first = false;
}
stream << "}";
}
{
bool first = true;
stream << ",f2=[" << value.f2.size()<< "]{";
for (const auto& it : value.f2)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << "}";
}
{
bool first = true;
stream << ",f3=[" << value.f3.size()<< "]{";
for (const auto& it : value.f3)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << "}";
}
{
bool first = true;
stream << ",f4=[" << value.f4.size()<< "]{";
for (const auto& it : value.f4)
{
stream << std::string(first ? "" : ",") << it;
first = false;
}
stream << "}";
}
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructMap& value)
{
stream << "StructMap(";
{
bool first = true;
stream << "f1=[" << value.f1.size()<< "]<{";
for (const auto& it : value.f1)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
stream << (int)it.second;
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f2=[" << value.f2.size()<< "]<{";
for (const auto& it : value.f2)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
if (it.second) stream << (int)*it.second; else stream << "null";
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f3=[" << value.f3.size()<< "]<{";
for (const auto& it : value.f3)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
stream << "bytes[" << it.second.size() << "]";
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f4=[" << value.f4.size()<< "]<{";
for (const auto& it : value.f4)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
if (it.second) stream << "bytes[" << it.second->size() << "]"; else stream << "null";
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f5=[" << value.f5.size()<< "]<{";
for (const auto& it : value.f5)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
stream << it.second;
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f6=[" << value.f6.size()<< "]<{";
for (const auto& it : value.f6)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
if (it.second) stream << *it.second; else stream << "null";
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f7=[" << value.f7.size()<< "]<{";
for (const auto& it : value.f7)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
stream << it.second;
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f8=[" << value.f8.size()<< "]<{";
for (const auto& it : value.f8)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
if (it.second) stream << *it.second; else stream << "null";
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f9=[" << value.f9.size()<< "]<{";
for (const auto& it : value.f9)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
stream << it.second;
first = false;
}
stream << "}>";
}
{
bool first = true;
stream << ",f10=[" << value.f10.size()<< "]<{";
for (const auto& it : value.f10)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
if (it.second) stream << *it.second; else stream << "null";
first = false;
}
stream << "}>";
}
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructHash& value)
{
stream << "StructHash(";
{
bool first = true;
stream << "f1=[" << value.f1.size()<< "][{";
for (const auto& it : value.f1)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
stream << (int)it.second;
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f2=[" << value.f2.size()<< "][{";
for (const auto& it : value.f2)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
if (it.second) stream << (int)*it.second; else stream << "null";
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f3=[" << value.f3.size()<< "][{";
for (const auto& it : value.f3)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
stream << "bytes[" << it.second.size() << "]";
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f4=[" << value.f4.size()<< "][{";
for (const auto& it : value.f4)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
if (it.second) stream << "bytes[" << it.second->size() << "]"; else stream << "null";
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f5=[" << value.f5.size()<< "][{";
for (const auto& it : value.f5)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
stream << it.second;
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f6=[" << value.f6.size()<< "][{";
for (const auto& it : value.f6)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
if (it.second) stream << *it.second; else stream << "null";
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f7=[" << value.f7.size()<< "][{";
for (const auto& it : value.f7)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
stream << it.second;
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f8=[" << value.f8.size()<< "][{";
for (const auto& it : value.f8)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
if (it.second) stream << *it.second; else stream << "null";
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f9=[" << value.f9.size()<< "][{";
for (const auto& it : value.f9)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
stream << it.second;
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f10=[" << value.f10.size()<< "][{";
for (const auto& it : value.f10)
{
stream << std::string(first ? "" : ",") << "\"" << it.first << "\"";
stream << "->";
if (it.second) stream << *it.second; else stream << "null";
first = false;
}
stream << "}]";
}
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructHashEx& value)
{
stream << "StructHashEx(";
{
bool first = true;
stream << "f1=[" << value.f1.size()<< "][{";
for (const auto& it : value.f1)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
stream << it.second;
first = false;
}
stream << "}]";
}
{
bool first = true;
stream << ",f2=[" << value.f2.size()<< "][{";
for (const auto& it : value.f2)
{
stream << std::string(first ? "" : ",") << it.first;
stream << "->";
if (it.second) stream << *it.second; else stream << "null";
first = false;
}
stream << "}]";
}
stream << ")";
return stream;
}
template <class TOutputStream>
inline TOutputStream& operator<<(TOutputStream& stream, const StructEmpty& value)
{
stream << "StructEmpty(";
stream << ")";
return stream;
}
} // namespace test
|
Q:
What ML algorithm(s) should I learn in order to predict based on multiple features the likelihood of a binary event occurring in the next week?
What ML algorithms should I learn in order to predict the likelihood of an event occurring in a specified time period from the present forward based on multiple features in historical data I've collected, including past occurrences of the event I'm trying to predict?
I'm trying to predict the likelihood of a binary event occurring in the next week based on ~10 features to begin with, though that number may grow in the future. If I would need to switch approaches in the future as my number of features grow, I'd appreciate knowing an approximate number of features at which point I should start thinking about switching.
Eventually this system will be a part of a website in which I'll need to be able to query this stat on multiple individuals, multiple times a day, based on each individual's changing behavior. The high-level purpose is to predict the likelihood of a user having a setback on a website designed to help people break bad habits.
A:
In addition to Marc Claesen's good advice (+1).
The logistic regression mentioned is the "most basic" binary classification algorithm. I would definitely recommend looking it up before anything else so you get an idea of what you are dealing with. You need to fit an generalized linear model - look at the glm function in R. You will be able to interpreter your results easily.
To that extent, using a linear kernel will get you very similar results with logistic regression. In fairness, generally, non-linear kernels seem to be better than linear kernels for classification tasks but this is not absolute and SVMs are more complex to interpreter than logistic regressions.
Having said all this I think that both approaches mentioned (SVM and LR) throw a tonne of information out of the window for your particular task. You have time-series. Not only that, you have a binary time-series. Not only that you have strong a auto-regressive component (I can't think of the times I identify a bad habit, broke it for a bit and then started it over again). And your data are extremely likely to have subject specific effects. In other words you have a GLMM with autoregressive random effects. You can fit these guys using R's MCMCglmm.
Honourable mentions:
"binary timeseries prediction"; ARMA models come into play there (that's why I asked). In your case, a GLMM with autoregressive error structure should give similar results with a ARMA but I do not know enough about binary ARMAs to send you to a particular implementation.
"Hidden Markov Models"; HMMs essentially model transition probabilities by identifying patterns. And really this is what you want to do. They are a lot reference on the matter; usually the relate to NLP (predict the next utterance) but you solve the same problem with them in the end of the day.
So to recap, try a simple GLM first to do a logistic regression. Afterwards, you might want to amp your game by using kernel generated features (so go with Marc's suggestion with the SVM) or by directly exploit the longitudinal and subject-specific nature of your data (so check the GLMM). These two should probably give you almost everything you can get out of your data with a first pass.
|
Q:
Is it 'not mathematical' to compare the L.H.S. and R.H.S in such type of equations?
$$x+\frac{1}{x}=25 + \frac{1}{25}$$
The solution is very simple. But the problem is whether my solution is correct or not. I did it by simply comparing the LHS and the RHS. Thus, I got $x=25$ or $\frac{1}{25}$. But my book does it in this way
$x-25=\frac{1}{25}-\frac{1}{x}=\frac{x-25}{25x}$. So, $x=25$ or $1=\frac {1}{25x}\implies x=\frac{1}{25}$.
I asked my teacher whether my method was correct or not. She told me that the method in the book is correct and that my method of comparing will not be accepted during the exam as it is 'not mathematical' and is 'some sort of hit and trial'.
Now, I am not worried about whether I'll be awarded marks for my method or not. But is it 'not mathematical' to compare the L.H.S. and R.H.S in such type of equations?
A:
By comparing the LHS and RHS, you found a few solutions.
The question is have you found all the solutions?
If you can justify that you have found all the solutions, then I don't see anything wrong with hit and trial.
Do not confuse schooling with educations, but there is no point going against the grading system in school.
|
3.11.14.13
♦Entity Perfection – General♦
3.11.14.13.2
(01-01-2015)♦Entity Perfection – Name Control♦
Valid characters are alpha, numeric, ampersand (&), hyphen (-), and blank. However, blanks are only valid in the last three
positions.
Disregard the word "THE"
in the Name Control, only when followed by more than one word.
Determine the Name Control from the "Name of Estate or Trust"
line at the top-center of Form 1041 or the "Name of Trust"
line on Form 1041-N and Form 1041-QFT. If no indication in the name line, use box A or if no box is checked use exemption amount .
Exception:
Name controls assigned by MODI-EIN program. See paragraph (4) below.
See Job Aid Document 7071A, Name Control Job Aid - For Use Outside of the Entity Area, to determine the Name Control.
Example:
John Wren Trust (Name control is WREN).Trust for Sparrow Lake (Name control is SPAR).Special Needs Trust FBO John Doe (Name control is DOE.
Name controls for EINs assigned by the MODI-EIN program are different. If the EIN prefix begins with 20, 26, 27, 45, 46, or
47 and it is a TRUST return ), then the name control will be the first four characters of the first name of the individual,
in the Primary Name Line. The name control for an estate will still be the first four characters of the person's last name.
Example:
John Wren Trust (Name control is JOHN) J R Wren Trust (Name control is JRWR)Trust for Sparrow Lake (Name control is SPAR)Estate of John Smith, Deceased (Name control is SMITSpecial Needs Trust FBO John Doe (Name control is JOHN.John Paul Estate Special Needs Trust (Name Control is JOHN, unless there are other indicators, a date of death or exemption for an estate, would be indications that it is an estate,
(then the Name Control if an estate would be PAUL.
Edit the Name Control as follows:
If ...
And ...
Then ...
Unable to determine the Name Control,
Unnumbered
Research IDRS.
If found, edit to the proper location.
If not found, route to Entity Control following local procedures.
Unable to determine the Name Control,
Numbered
Edit Action Code 352 (Name Research).
Leave return in batch.
A return indicates the taxpayer has filed bankruptcy (e.g., shows "RECEIVER"
, Bankruptcy "TRUSTEE"
, or "DEBTOR IN POSSESSION"
in the entity area or on an attachment,
Route to Entity Control following local procedures. Do not edit Name Control.
See IRM 3.11.14.8.2.
A Fiduciary or Fiduciary name change will be indicated by a mark in the "Change in fiduciary or Change in fiduciary name"
box in Section "F"
of Form 1041.
If ...
Then ...
The "Change in fiduciary"
or Change in Fiduciary Names box(es) is/are checked, or the Name and title of Fiduciary line has been altered (i.e., crossed
out and updated)
Notate "TC 016"
in the upper-left margin of Form 1041.
Input TC 016 to update the Fiduciary information, using local procedures.
Only the "Change in fiduciary address"
box is checked,
Do not edit "TC 016"
.
Note:
ISRP will input the new address.
See IRM 3.11.14.13.4, if an In-Care-Of Name is also present.
A Trust name change will be indicated by a mark in the "Change in trust's name"
box in Section F of Form 1041.
If ...
Then ...
The "Change in trust's name"
box is checked,
Route to Entity using local procedures.
3.11.14.13.3
(01-01-2015)♦Entity Perfection – "In-Care-of"
Name♦
An "in-care-of"
name can be identified by the words "in-care-of"
or the symbols "c/o"
or "%"
(percent). See Figure 3.11.14-27.
Ensure the "in-care-of"
name is located in the proper location (above the street address).
If …
Then …
The in-care-of name is located on the street address line preceding the street address,
No editing is required.
The "in-care-of"
name is located above the first name line or below the street address,
Arrow the "in-care-of"
name so it appears below the first name line and above the street address.
The "in-care-of"
name is shown on an attachment,
Edit the "in-care-of"
name above the street address beginning with the "%"
or "c/o"
in the first position.
The street address for the "in-care-of"
name is different from the street address of the Fiduciary,
Arrow the "in-care-of"
street address below the "in-care-of"
name or edit the "in-care-of"
street address below the "in-care-of"
name if located on an attachment.
The USPS established new address requirements for APO/DPO/FPO addresses. If the old address appears, convert to the new state
code abbreviation based on the Zip Code (e.g., APO New York, NY 091XX would be converted to APO AE 091XX). (Figure 3.11.14-30) APO/DPO/FPO addresses are considered domestic addresses. Refer to APO/DPO/FPO Conversion Chart below:
3.11.14.13.5
(01-01-2015)♦Entity Perfection – Foreign Address♦
A foreign (international) address is any address that is not in the 50 states or the District of Columbia.
Returns with APO/DPO/FPO addresses are considered domestic addresses. See IRM 3.11.14.13.4.
Route returns with a foreign address to Ogden Submission Processing Campus (OSPC) for processing. Prepare Letter 86C to inform
the taxpayer that the return has been sent to Ogden.
Exception:
All 1040-NR Fiduciary returns filed using an EIN instead of a SSN are processed in Cincinnati as Non-Master File (NMF). Fiduciary
Form 1041, that has a Form 1040-NR attached for an individual (SSN) will be forwarded to Austin SPC for processing.
Returns with addresses in the following U.S. Possessions/Territories are considered to be foreign for processing purposes
but are edited in the same way as domestic addresses.
A two-character alpha code must be edited for the Possession/Territory name:
U.S. Possession/Territory
Abbreviation
American Samoa
AS
Federated States of Micronesia
FM
Guam
GU
Marshall Islands
MH
Northern Mariana Islands
MP
Palau
PW
Puerto Rico
PR
Virgin Islands (U.S.)
VI
A ZIP code must be present for U.S. Possessions/Territories. Edit the appropriate ZIP code if one is not provided. See Exhibit 3.11.14-18.
All other foreign addresses are edited the same as a domestic address with the following exceptions:
The foreign country must be the last entry in the address.
Circle the foreign country and edit the country code preceded by a "/"
and followed by "/$"
(e.g., "/GM/$"
is edited for Germany). See Document 7475, State and Address Abbreviations, Major City codes (MCCs), ZIP Codes and Countries, for official foreign Country Codes.
A unique country code will be edited for returns filed with an address in Canada. See IRM 3.11.14.13.5.1, Country Code - Canada.
Section "F"
of Form 1041 provides the taxpayer with check boxes to indicate any of the following:
If ...
Then ...
Initial Return
See IRM 3.11.14.11.3
Final Return
See IRM 3.11.14.11.2
Amended Return
See IRM 3.11.14.8.1
Change in Fiduciary
See IRM 3.11.14.13.2
Change in Fiduciary's Name
See IRM 3.11.14.13.2
Change in Fiduciary's Address
See IRM 3.11.14.13.2
Change in Trust's Name
See IRM 3.11.14.13.2
3.11.14.16
(01-01-2015)Form 1041, Income Section (Lines 1–9)
This subsection provides instructions for editing Lines 1 through 9 of Form 1041. Edit Lines 1 through 9 in dollars only.
Do not bracket any entry, unless editing or computing a negative amount.
Perfect all illegible or misplaced entries (when possible).
Delete misplaced entries and edit to the appropriate lines.
If a Nontaxable Grantor Trust do not edit amounts from schedules or attachments to Lines 1 through 9, Form 1041. "X"
Schedules I and/or D if transcription entries are present.
3.11.14.16.1
(01-01-2015)Line 1 – Interest Income
Accept taxpayer's entry.
3.11.14.16.2
(01-01-2015)Line 2a – Total Ordinary Dividends
Accept taxpayer's entry.
3.11.14.16.3
(01-01-2015)Line 2b(2) – Qualified Dividends
Qualified Dividends Allocable to Estate or Trust are reported on Line 2b(2) of Form 1041.
If present, Line 2b(2) must be a positive amount. Never bracket a Line 2b(2) amount as a loss.
Though transcribed, Line 2b(2) is not used in the computation of Total Income (Line 9). Instead, Line 2b(2) is combined with
Line 2b(1) (Qualified Dividends Allocable to Beneficiaries) to equal the amount reported on Line 2a.
If Line 2b(2) is blank or illegible and the Qualified Dividends Allocable to Estate or Trust are reported on attachments to
the return, determine the correct amount and perfect Line 2b(2). If the correct amount cannot be determined, do not perfect
Line 2b(2) or correspond for Qualified Dividend information.
If an amount is present on Line 23 of Schedule D and Line 2b(2), page 1, of 1041 is blank, edit the amount from Line 23 to
Line 2b(2) of 1041.
Exception:
If the ESBT box is checked on Form 1041, do not edit the amount to Line 2b(2) of Form 1041.
3.11.14.16.4
(01-01-2015)Line 3 – Business Income (or Loss)
A Schedule C/C-EZ (Form 1040) or equivalent (computer printouts, written attachments, etc.) must be attached to Form 1041
if an amount ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ is present on Line 3 of Form 1041. (Figure 3.11.14-31)
Edit Line 3 as follows:
If ...
And ...
Then ...
Line 3 contains an entry ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡
Schedule C/C-EZ (Form 1040) or equivalent is blank or missing,
Correspond for the missing Schedule.
If Line 3 is blank or illegible,
Schedule C/C-EZ (Form 1040) or equivalent is present,
Edit amount from Line *31, Schedule C to Line 3 of Form 1041.
Bracket Line 3 if a loss.
*(Line 3, Schedule C-EZ)
Note:
Line 31 of Schedule C reflects the Business Income (or Loss) and Line 3 of Schedule C–EZ reflects Business Income only.
3.11.14.16.5
(01-01-2015)Line 4 – Capital Gain or Loss/Schedule D
The total gain or loss from the sale or exchange of capital assets is reported on Line 4 of Form 1041.
Line 4 cannot have an amount in excess of -$3,000. If the taxpayer enters more than -$3,000, X the entry and edit -$3,000
to Line 4.
Exception:
On a Final return, allow losses exceeding $3,000 but only if it is entered by the taxpayer on Line 4. Tax examiners should not enter a loss greater than $3,000 on Line 4, if blank.
Form 8824 must be attached if Schedule D (Form 1041) or Form 4797 (Sales of Business Property) is attached to Form 1041 and
the filer has notated "RELATED PARTY LIKE-KIND EXCHANGE"
on Schedule D or Form 4797.
Schedule D must be attached if an amount≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ is present on Line 4 of Form 1041.
If Schedule D is not attached and ...
Then ...
Line 4 of Form 1041 contains an entry≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡
Correspond.
Form 8824 is attached with an amount greater than zero on Line 22,
Correspond, regardless of the entry on Line 4 of Form 1041.
Reminder:
Edit CCC "1"
when Form 8824 is attached.
Form 4952 is attached and an amount is present on Line 4g (Form 4952), See IRM 3.11.14.35.
Correspond.
Do not edit Line 4 if corresponding.
Only a Schedule D (Form 1041) is acceptable. If the taxpayer substitutes a Schedule D from any other tax return )i.e., Form
1040, Form 1065, Form 1120, etc.), correspond.
Edit Schedule D in dollars only.
Only one Schedule D can be processed. If more than one is attached, take the following actions:
Note:
If Line 19(3)/20 is blank, compute by adding Lines 19(1) and 19(2), Use the comparison with Line 4, Form 1041. It is not necessary
to edit Line 19(3).
If ...
Then ...
Line 4 of Form 1041 equals Line 19(3)/20 of one of the Schedules D,
Process the Schedule D that matches Line 4 of Form 1041.
"X"
the remaining Schedules D.
Move deleted Schedules D out of sequence order.
Line 4 of Form 1041 equals the combined totals of the multiple Schedules D Line 19(3)/20,
Edit the combined totals of the Schedules D to the first Schedule D.
Bracket if negative.
"X"
the remaining Schedules D.
Move deleted Schedules D out of sequence order.
Line 4 of Form 1041 equals Line 19(3) or Line 20 on more than one of the attached Schedules D,
Line 4 of Form 1041 does not equal Line 19(3) or Line 20 on any of the attached Schedules D,
Correspond to determine the correct Schedule D amount.
Transcription of page 1, Schedule D will be for tax year 2013 and subsequent tax returns with a current revision of Schedule
D attached. At this time, we are only capturing the data entered on the Schedule D. If a 201311 or prior revision is used,
line through the line numbers on page 1, Schedule D and convert page 2 line numbers.
3.11.14.16.5.1
(01-01-2015)Schedule D, Part III, Page 2
When Schedule D (Form 1041) is attached the following lines will be transcribed from Schedule D, Part III Column 2, Page 2.
3.11.14.16.5.2
(01-01-2015)Schedule D, Part V, Page 2
Schedule D, Part V, page 2, Tax Computation Using Maximum Capital Gains Rates is completed by the taxpayer when both Lines 18a and 19 in column (2) are gains, or an amount is entered in Part I or Part
II and there is an entry on Form 1041, Line 2b(2) and Form 1041, line 22 is more than zero.
If Line 43 is blank, compute by adding Lines 37, 41, and 42.
If an amount is present on Line 23 of Schedule D and Form 1041, Page 1 Line 2b(2) is blank, edit the amount from Schedule
D, Line 23 to Line 2b(2) of Form 1041.
Exception:
If the ESBT box is checked on Form 1041, do not edit the amount to Line 2b(2) of Form 1041.
If an amount is present on Line 45 of Schedule D and Line 1a of Schedule G is blank, edit amount from Line 45 to Line 1a of
Schedule G.
3.11.14.16.5.3
(01-01-2015)Schedule D-1, Continuation
Schedule D-1 (Form 1041) Is used to report gains and losses from the sale or exchange of capital assets if there are more
transactions to report than spaces on Lines 1a or 6a of Schedule D
Note:
Schedule D-1 is not valid for returns after 201212.
Schedule D-1 should be attached to support Line 1b and/or Line 6b of Schedule D.
Note:
Do not correspond for missing Schedule D-1 unless you are corresponding for other items.
If an amount is present on Line 6b of Schedule D and Schedule D-1 or supporting attachment is missing:
All income or losses from rents, royalties, partnerships, other estates and trusts (except dividends, certain interest, and
capital or ordinary gains and losses and depreciation) are reported on Line 5 of Form 1041.
Note:
Effective TY 2007 and subsequent, farm rental is no longer reported on Form 4835, and should be reported on Schedule E, line
40.
A Schedule E (Form 1040) or equivalent (e.g., computer printouts, written attachments, etc.) must be attached to Form 1041
if an amount ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ is present on Line 5 of Form 1041.
Edit Line 5 as follows:
If ...
And ...
Then ...
Line 5 contains and entry ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡
Schedule E (Form 1040) or equivalent is blank or missing,
Correspond for the missing Schedule.
If Line 5 is blank or illegible,
Schedule E (Form 1040) or equivalent is present,
Edit amount from Line 41, Schedule E to Line 5 of Form 1041. Figure 3.11.14-34
Form 4797 is attached, compare Line 7, of Form 1041 with Line 17* of Form 4797, *(Line 18 for 2003 and prior)
If different, edit Form 4797 amount to Form 1041, Line 7.
Form 8824must be attached if Form 4797 (Sales of Business Property) or Schedule D is attached to Form 1041 and the filer has notated "RELATED
PARTY LIKE-KIND EXCHANGE"
on Form 4797 or Schedule D. Correspond for Form 8824 if missing.
Reminder:
Edit CCC "1"
if Form 8824 is attached.
3.11.14.16.9
(01-01-2015)Line 8 – Other Income (or Loss)
Other income or loss not shown on lines 1 through 7 is reported on Line 8 of Form 1041.
An amount on Line 8 may be supported by an attached statement:
If ...
Then ...
If an amount from Form 982 or Form 4972 is present on Line 8,
Treat as a misplaced entry. Decrease the Line 8 amount by the amounts from Form 982 or Form 4972.
Note:
Form 4972 amount will be edited to Line 1b on Schedule G.
Other Income items are included on Lines 1 - 7,
Add all the "Other Income"
items and include in Line 8. Bracket if negative.
A statement is not attached,
≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡
The attachment shows the type of income to be the same as that reported on any of Lines 1 through 7,
Decrease the Line 8 amount by that amount and increase the appropriate Income line (Lines 1 through 7). (Figure 3.11.14-36)
Line 8 is blank or illegible and "Other Income"
is reported on an attachment to Form 1041,
Determine if the amount has been reported elsewhere on the return. If unable to determine, edit the amount to Line 8 of Form
1041.
The amount on Line 8 does not match the amount on the attachment and there are entries leading to the correct amount,
Edit the correct amount on Line 8 of Form 1041.
Caution:
The Net Operating Loss (NOL) must be reported on Line 15b. If reported on any other line, "X"
the amount, edit to Line 15b as a positive amount only, and adjust the appropriate Total line(s).
If a negative amount is present on any of Lines 10 through 15c, determine from Lines 16 and 17 as instructed in the table below:
If ...
Then ...
Line 16 is positive,
"X"
(delete) the negative amounts on Lines 10 through 15c
Move the deleted amounts from Lines 10 through 15c to Line 8 as a positive amount.
If an amount was already present on Line 8, delete the existing Line 8 amount and recompute Line 8 to include the amounts
moved from Lines 10 through 15c.
Recompute the amounts on Lines 9, 16, 17, and 22. (Figure 3.11.14-38)
Line 16 is negative and Line 17 is less than Line 9,
Note:
Taxpayers (particularly on computer-generated tax returns) may enter negative amounts on Lines 10 through 15c which are actually
positive.
Do not bracket or move the entries in Lines 10 through 15c.
Line 16 is negative and Line 17 is greater than Line 9,
"X"
(delete) the negative amount(s) on Lines 10 through 15c.
Move the deleted amount(s) from Lines 10 through 15c to Line 8 as a positive amount.
If an amount was already present on Line 8, delete the existing Line 8 amount and recalculate to include the amounts moved
from Lines 10 through 15c.
Recompute the amounts on Lines 9, 16, 17, and 22.
If a negative amount is on Line 15b and the taxpayer indicates a NOL (net operating loss), ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ . Do not bracket or move the entry.
Exception:
If a negative entry is present on Line 15a, 15b, or 15c and the taxpayer indicates that all of a negative amount is for a
Tax Exempt Allocation, there is only one other deduction claimed within Lines 10 through 14, and Line 1 in the "Other Information"
Section (Page 2 of Form 1041) is marked "Yes"
or is blank and no computation is present, process as instructed in IRM 3.11.14.17.8.
3.11.14.17.2
(01-01-2015)Line 16 – Total of Lines 10 through 15c
Line 16 is the total of Lines 10 through 15c on Form 1041.
If Line 16 is blank, add the entries on Lines 10 through 15c and edit amount to Line 16.
Line 16 will normally be positive. However, taxpayers (particularly on computer-generated tax returns) may enter negative
amounts on Lines 10 through 15c which are actually positive, resulting in a negative amount on Line 16.
If ...
Then ...
Line 16 is negative and Line 17 is less than Line 9,
Do not bracket or move the entries in Lines 10 through 15c.
Line 16 is negative and Line 17 is greater than Line 9,
Delete the negative amount(s) on Lines 10 through 15c.
Move the deleted amount(s) from Lines 10 through 15c to Line 8 as a positive amount.
If an amount was already present on Line 8, delete the existing Line 8 amount and recalculate to include the amounts moved
from Lines 10 through 15c.
Recalculate the amounts on Line 9, Line 16, Line 17, and Line 22.
If an entry is present on Line 16 but all of Lines 10 through 15c are blank, determine if an attachment or schedule is present
which clarifies the deduction.
If documentation is present, edit the amount to the appropriate Line 10 through 15c.
If documentation is not present, correspond to determine the proper deduction amount, if any.
3.11.14.17.3
(01-01-2015)Line 17 – Adjusted Total Income
Line 17 is derived by subtracting Line 16 from Line 9.
This line is not transcribed and does not require perfection. However, any changes made in the Income or Deductions sections
may require recomputing Line 17. This may then impact the perfection of subsequent compute lines (i.e., Lines 21 and 22).
Note:
3.11.14.17.5
(01-01-2015)Line 19 - Estate tax deduction
Only positive entries are valid for Line 19. If negative, remove the brackets and continue editing the return.
3.11.14.17.6
(01-01-2015)Line 20 - Exemption
Accept taxpayer's entry.
Note:
For TY 2001, the taxpayer was required to notate "SECTION 642(b)(2)(C)"
in the dotted potion of Line 20. If "SECTION 642(b)(2)(C)"
is notated on Line 20 of a TY 2001 Form 1041, edit Fiduciary Code "8"
.
Allowable exemptions are:
$600 for a decedent estate.
$300 for a trust, which under its instrument, is required to distribute all of its income for the taxable year (This deduction
is allowed regardless of whether the trust is simple or complex.).
$100 for a trust which is not required to distribute all of its income for the taxable year (Generally, complex trusts are
entitled to this exemption.).
Same exemption as an individual under IRC 151 for a bankruptcy estate.
Note:
Grantor trusts are not entitled to an exemption, except for a partial grantor trust, which is entitled to the appropriate
exemption for its non-grantor trust portion.
A Qualified Disability Trust is entitled to the same personal exemption amount as an unmarried individual and is effective
for tax years ending after September 10, 2001. A Qualified Disability Trust is also subject to the same phaseout as the personal
exemption if the trust's modified AGI exceeds certain limits. Taxpayers must complete the Exemption Worksheet for Qualified
Disability Trusts to figure the amount of the trust's exemption when their modified AGI exceeds the limits shown in the chart
below.
Note:
This provision does not apply to any portion of a disability trust that is treated as a grantor trust.
3.11.14.17.7
(01-01-2015)Line 21 – Total Deductions
Line 21 of Form 1041 is the total of Lines 18 through 20.
Line 21 can be positive or negative.
If Line 21 is blank or illegible:
If entries are present on any of Lines 18 through 20, add these amounts and edit the total to Line 21.
Exception:
If a Line 18 entry has been deleted based on the instructions in IRM 3.11.14.17.4, do not recompute Lines 21 and 22.
If Lines 18 through 20 are blank, determine if entries are present on Lines 13, 14 or 15 of Schedule B (Page 2 of Form 1041):
If ...
Then ...
Line 15 of Schedule B is present or can be computed from the lesser of Lines 13 or 14 of Schedule B,
Edit this amount to Line 18 of Form 1041.
Reminder:
If Line 18 is blank and the amount entered on Line 21 is the total of Lines 18 through 20, do not perfect Line 18
Perfect Line 21 of Form 1041 accordingly.
Line 15 of Schedule B is blank and cannot be computed,
Compute Lines 1, 2a, 3, 4a, 5, 6, 7 and 8 of Schedule K-1.
Edit the amount to Line 18 of Form 1041.
Perfect Line 21 of Form 1041 accordingly.
If an entry should have been placed on Line 22 (Taxable Income) but was inadvertently placed on Line 21 and Line 22 is blank
or zero:
Delete Line 21 amount and edit that amount to Line 22.
3.11.14.17.8
(01-01-2015)Tax-Exempt Entries
Taxpayers cannot claim deduction against Tax Exempt Income on a Form 1041.
If deductions against Tax Exempt items are notated on Form 1041 or attachments, do not include those items in any entries on Lines 10–21. (Figure 3.11.14-42)
If the taxpayer indicates that all of a negative amount on Line 15a, 15b, and 15c is for a Tax Exempt Allocation, there is only one other deduction claimed
within Lines 10 through 14, and Line 1 in the "Other Information"
Section (Page 2 of Form 1041) is marked "Yes"
or is blank and no computation is present, process as follows:
Delete any negative amounts reported on Line 15a, 15b, or 15c.
Reduce the remaining Deduction line amount (positive) by the negative amount the taxpayer entered on Line 15a, 15b, or 15c.
Perfect Line 16, if necessary.
Example:
If $461.00 is entered on Line 14 (positive amount), Line 15a or 15c is a negative $120.00, and Lines 10 through 13 are blank,
delete the negative $120.00 from Line 15a or 15c and reduce the Line 14 amount from $461.00 to $341.00 ($461.00 – $120.00
= $341.00). Also perfect Line 16 (if necessary) as a positive ($341.00) amount. (Figure 3.11.14-43)
Note:
Although this example shows the one positive deduction amount on Line 14, the procedure applies to a positive entry on any
of the Lines 10 through 14.
If an entry should have been placed on Line 22 (Taxable Income) but was inadvertently placed on Line 21 and Line 22 is blank
or zero:
Delete the Line 21 amount and edit that amount to Line 22.
If unable to determine the correct deduction amount and there are negative entries on Lines 10 through 15c:
"X"
the negatives entries.
Add these entries to Line 8 of Form 1041.
Continue normal processing.
3.11.14.18
(01-01-2015)Line 22 – Taxable Income
If Line 22 is blank, subtract Line 21 from Line 17 and edit on Line 22.
If Line 22 is blank and it can be determined that an entry that should have been placed on Line 22 was inadvertently placed
on Line 23.
"X"
the Line 23 amount and edit the amount to Line 22.
3.11.14.19
(01-01-2015)Line 23 – Total Tax
Line 23 of Form 1041 is derived from Line 7 of Schedule G.
If Line 23 contains a negative amount (a loss), determine Line 23 from Line 7 of Schedule G (Page 2):
If ...
Then ...
Line 7 (Schedule G) is positive,
Edit the Line 7 amount to Line 23.
Line 7 (Schedule G) is negative,
"X"
the Line 23 amount.
If Line 23 is blank or illegible:
Compute by adding Lines 3 through 6 of Schedule G.
Edit the total to Line 23 of Form 1041.
If there are no entries on lines 3 through 6 of Schedule G and no entries are present on Lines 24 through 26, edit the amount
from Line 27 to Line 23.
Note:
For instructions for editing Form 1041 with an entry present on Line 7 of Schedule G, see IRM 3.11.14.31.
If it is determined that an entry was inadvertently placed on Line 23, determine if the entry should be edited to Line 22:
If ...
Then ...
The Line 23 entry should be on Line 22 and Line 22 is blank,
"X"
the Line 23 amount and edit the amount to Line 22.
The Line 23 entry should be on Line 22, but an entry is already present on Line 22,
"X"
the Line 23 amount.
Note:
Do not edit the amount to Line 22.
Continue editing the return.
If unable to determine where the Line 23 entry belongs,
"X"
the Line 23 amount.
Note:
Do not edit the amount to Line 22.
Continue editing the return.
Note:
For instructions for editing Schedule G, see IRM 3.11.14.26 through IRM 3.11.14.31.
Taxpayers may report a special tax for Electing Small Business Trusts (ESBT) on Line 7 of Schedule G. Effective for TY 2002,
the taxpayer should check the "ESBT"
box in Section "A"
(Type of Entity) of Form 1041 or they may notate one of the following on the dotted portion of Line 7, Schedule G:
ELECTING SMALL BUSINESS TRUST
ESBT
IRC Section 641(c)
If one of the above notations is written on the dotted portion of Lines 7, process as follows:
If ...
Then ...
The ESBT amount was included on Line 7 (Schedule G) and Line 23, Form 1041,
Continue editing the return.
The ESBT amount on Line 7 (Schedule G, was not included on Line 23) (Form 1041),
Increase Line 23 (Form 1041) by the ESBT amount written in on Line 7 of Schedule G.
The ESBT amount is written separate from the Line 7 (Schedule G) amount,
Increase Line 23 (Form 1041) by the ESBT amount written in separately from the Line 7 (Schedule G) amount (if the taxpayer
has not already done so).
Reminder:
Edit the ESBT indicator "1"
in the left margin next to Line 10, in "2 - 1"
format when the ESBT box in Section "A"
is checked or there is an indication of ESBT.
3.11.14.20.3
(01-01-2015)Line 24c – Balance of Estimated Tax Payments
Accept taxpayer's entry.
3.11.14.20.4
(01-01-2015)Line 24d – Tax Paid with Extension Form
If there is an illegible entry on Line 24d, examine the attached Form 7004, Application for Automatic Extension of Time To
File Certain Business Income Tax, Information, and Other Returns (or attachment in lieu of) or determine the amount from entries
on Lines 24a, 24e or 24h (24i for TY 2006).
If a legible amount is found, place an "X"
to the left of the illegible entry and edit the verified amount to the left of the "X"
.
3.11.14.20.5
(01-01-2015)Line 24e – Federal Income Tax Withheld
Form W–2, Form W2–G, Form 1099R, or a supporting statement (i.e., an earnings statement with year-to-date totals) must be
attached to Form 1041 if an entry ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ is present on Line 24e.
If an entry is present on Line 24e ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ but, supporting documentation is not attached, correspond for the missing form.
Line 24e or 25 can also be used to accommodate unusual credits such as "Claim of Rights"
for which there is no line on the return.
If no supporting documentation is attached for a credit ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ ≡ for which there is no specific line, correspond for support of this unusual credit.
When examining a return for a Form W–2, W2–G, etc. and the form is not found but a Form 7004 is found and there is no entry
on Line 24d, determine if the Line 24e amount equals the amount on Form 7004:
If the entries are ...
Then ...
The same,
Move the Line 24e amount to Line 24d.
Not the same and the amount claimed is ≡ ≡ ≡ ≡ ≡ ≡ ≡
Correspond.
3.11.14.20.6
(01-01-2015)Line 24f – Form 2439
Form 2439, "Notice to Shareholder of Undistributed Long-Term Capital Gains"
is reported on Line 24f.
Note:
Paper returns sent in by the filer that states their return was rejected through the E-file system require a signature. Form 8879-F is not an acceptable substitute for a paper return.
If the jurat is altered or stricken (crossed-out), see IRM 3.11.14.5.3.5 for frivolous return instructions.
Accept a "signature declaration"
(a signature with jurat obtained through IRS correspondence) if attached to the return.
If the "signature declaration"
is altered or stricken (crossed-out), see IRM 3.11.14.5.3.5, for frivolous returns instructions.
If the taxpayer responds with a self prepared "signature declaration"
it must contain the same language as the jurat on the tax return: e.g., "UNDER PENALTIES OF PERJURY, I DECLARE THAT I HAVE EXAMINED
THIS RETURN, INCLUDING ACCOMPANYING SCHEDULES AND STATEMENTS, AND TO THE BEST OF MY KNOWLEDGE AND BELIEF, IT IS TRUE, CORRECT
AND COMPLETE."
Form 8879-F is not an acceptable signature substitute for a paper return.
Since tax examiners are not expected to be handwriting experts, IRC §6064 and IRC §6064-1 of Regulations allows the Service
to presume that the signature on a return, statement, or other document is the true signature of the person who actually signed
the document.
Note:
A "✓"
or "X"
used to designate where the taxpayer should sign the return is not considered a valid signature.
Only one correspondence attempt is required for a signature.
Facsimile Signature – Rather than actually signing each return, a Fiduciary may use a "Facsimile"
or stamp of the signature. If a facsimile is used, the person filing the return must retain a letter signed by the Fiduciary
with a statement that the facsimile represents their signature; a statement that the signature was placed there by their direction;
and, a list of each return (Name and TIN) being covered by the letter.
3.11.14.23
(01-01-2015)Fiduciary's EIN (Trusts Only)
The Fiduciary's EIN box is located to the right of the Signature area and above the Tax Preparer's box on Form 1041.
A Fiduciary's EIN must be present when certain criteria is met. Edit a "Check mark"
to the right of the Fiduciary EIN when all of the following apply: (See Figure 3.11.14-51)
There is a positive entry on Line 22.
There is an entry on Line 24a (Estimated Tax Payments).
Fiduciary Code "2"
or "3"
is edited.
The Fiduciary's EIN is different than the Trust's EIN (Section C).
The return is not an amended return.
The fiduciary is a trust or financial institution (i.e., bank, credit union, savings and loan, N.A.). This information will be documented in the Entity section on either the
"Name of Estate or Trust"
line or on the "Name and Title of Fiduciary"
line and may follow in care of or %.
Exception:
Do not edit the EIN if the taxpayer has notated "TRUST COMPANY"
(if other than part of a financial institution name), e.g., bank, credit union, savings and loan, N.A., etc., in the Entity
area or Signature area. N.A. stands for National Association.
3.11.14.24
(01-01-2015)♦Paid Preparer Checkbox Indicator♦
The Paid Preparer Checkbox is located next to the taxpayer signature area. It indicates whether the taxpayer has elected to
allow the Paid Preparer to answer questions about the return as it is processed.
No action is required on amended returns.
Take the following actions when an entry is present in the Paid Preparer Checkbox:
If ...
Then ...
Only the "Yes"
box is checked,
Take no action.
The "No"
box is checked; neither box is checked; or both boxes are checked,
The Preparer's Social Security Number (SSN) (2009 and prior revisions) or Preparer's Tax Identification Number (PTIN) is located
to the right of the Preparer's Signature in the PTIN box (Preparer's SSN or PTIN box for 2009 and prior revisions) at the
bottom-right corner of Form 1041, Form 1041-QFT and Form 1041-N.
No action is required on amended returns.
A PTIN begins with the alpha "P"
followed by an eight digit number (e.g., PXXXXXXXX). Circle the PTIN if all zeroes or all nines. |
The news from Liberia, Sierra Leone, Guinea, Nigeria and now Senegal is not good. The World Health Organization now believes the worst outbreak of Ebola ever, which has already killed more than 1500, could eventually infect as many as 20,000 people. The crisis has sent governments worldwide scrambling for potential treatments. Earlier this month, B.C.-based […]
The renewal and expansion of an existing contract with an an unnamed Asia-Pacific based carrier is a positive sign that Guestlogix (TSX:GXI) can reach other, similar deals, says Cantor Fitzgerald Canada analyst Justin Kew. Yesterday, Guestlogix announced that a deal had been reached with said carrier to continue the use of Guestlogix’s onboard retailing technology. […]
One of Canada’s biggest financial services firms, Manulife, has opened up a new space called RED Lab at Waterloo’s Communitech Hub, a tech-focused innovation centre that is home to the country’s most cutting-edge technology entrepreneurs. RED stands for “research, exploration and development”. Sitting on the opposite end of the colour wheel from the company’s traditional […]
Steep rents and the highest cost of living in the country don’t seem like much of an impediment to Vancouver’s Hootsuite attracting talent from its own back yard. The company’s semi-annual job fair, HootHire, took place yesterday at the company’s recently opened second location and attracted about 1000 people looking to snag an estimated 100 […]
Montreal virtual phone and text message app-maker PPLConnect has closed a round of seed funding from Sherbrooke Street Capital, for an undisclosed amount, and released several updates to its service, bringing it closer to their stated goal of providing “one inbox for all your messaging apps”. PPLConnect describes its app as “the world’s first virtual […]
The continued reaction to soft Q1 results is overshadowing a very sensible kickoff to Avante Logixx’s (TSX:XX) M&A efforts, says Paradigm Capital analyst Spencer Churchill. In late July, Avante Logixx reported its Q1, 2015 results. The company earned $208,055 on revenue of $2,026,260, down 12.8% from the Q1, 2014′s topline. More recently, it closed the […]
Vancouver ebook app developer BitLit has appointed Cameron Drew, former Director of Global Content Strategy for Kobo, as Head of Content. Previous to Kobo’s acquisition by Japan’s Rakuten Inc., Drew spent five years working to expand Kobo’s global footprint. BitLit was founded in 2013 to solve the problem confronting book owners not being able to […]
It must be frustrating days for BlackBerry’s marketing team. The company’s new phones get hammered for features they don’t have (thousands of mostly pointless apps) and overlooked for those they do (flash enabled browser). But yesterday, a new article from a leading tech site, Engadget, probably has a few people scratching their heads in Waterloo. […]
Ahead of its second quarter numbers, Cantor Fitzgerald Canada analyst Justin Kew says he remains enthusiastic about Versapay’s (TSXV:VPY) prospects. On Friday, Versapay will report its Q2, 2014 results. The company is following on a Q1 in which it lost $824,050 on revenue of $4.3-million, up 5% from the $4.1-million topline the company posted in […] |
Animal Adoption/Resource Center- October 11, 2012
Animal Adoption/Resource Center- October 11, 2012
Pet Pics will take place at the Animal Adoption and Resource Center on Saturday, October 13 from 10:00 a.m.- 2:00 p.m. The cost is $20.
Pet Pics will take place at the Animal Adoption and Resource Center on Saturday, October 13 from 10:00 a.m.- 2:00 p.m. The cost is $20. For more details on their new spay/neuter clinic, call the shelter at (417) 623-3642 Wednesday through Sunday.To see more animals that need homes, www.joplinhumane.org. |
The Love Your River Telford project is a holistic, all inclusive, partnership approach, addressing urban pollution with the aim of improving water quality and habitat around the watercourses of Telford while at the same time improving protection of downstream potable drinking water supply abstractions.
The Love Your River Telford project is a holistic, all inclusive, partnership approach, addressing urban pollution with the aim of improving water quality and habitat around the watercourses of Telford while at the same time improving protection of downstream potable drinking water supply abstractions.
−
Initial funding was secured and the first year of the project ran from 1st April 2014 until 31 March 2015. There have been many achievements in the first year of the project detailed in this report.
Initial funding was secured and the first year of the project ran from 1st April 2014 until 31 March 2015. There have been many achievements in the first year of the project detailed in this report.
+
Through bringing together organisations with similar aspirations and working with, volunteers, schools, business, and the local community a large number of benefits for both the environment and the whole community were realised. Watercourses have already shown some signs of improvement earlier than expected.
Through bringing together organisations with similar aspirations and working with, volunteers, schools, business, and the local community a large number of benefits for both the environment and the whole community were realised. Watercourses have already shown some signs of improvement earlier than expected.
Line 27:
Line 28:
The Environment Agency through DEFRA Grant in Aid funding has been the main contributor to this project with some partner match funding. Further funds have been secured to continue the project to 31 March 2016. This source of this funding however is expected to significantly decrease beyond March 2016 so the partners are seeking other funding sources to continue to develop what appears to be a successful approach with many benefits and one that can be shared with other towns and cities with urban pollution issues.
The Environment Agency through DEFRA Grant in Aid funding has been the main contributor to this project with some partner match funding. Further funds have been secured to continue the project to 31 March 2016. This source of this funding however is expected to significantly decrease beyond March 2016 so the partners are seeking other funding sources to continue to develop what appears to be a successful approach with many benefits and one that can be shared with other towns and cities with urban pollution issues.
−
Introduction
Introduction
−
Love Your River Telford is a project aimed at working with and empowering the whole of the town’s community to improve water quality and the natural habitat, enhancing their own environment.
Love Your River Telford is a project aimed at working with and empowering the whole of the town’s community to improve water quality and the natural habitat, enhancing their own environment.
Line 45:
Line 44:
You only need to walk around Telford to see there are problems that need resolving to improve water quality.
You only need to walk around Telford to see there are problems that need resolving to improve water quality.
−
The Ketley Brook in Telford
The Ketley Brook in Telford
−
−
−
−
−
The Mad Brook in Telford
The Mad Brook in Telford
−
There are 8 waterbodies in Telford. All are failing to meet Water Framework Directive targets either partially of wholly due to urban diffuse pollution. See Appendix A for more information.
+
There are 8 water bodies in Telford. All are failing to meet Water Framework Directive targets either partially of wholly due to urban diffuse pollution.
−
−
An all inclusive project
An all inclusive project
How we have worked to include the whole community in enhancing their own environment can be seen in detail below:
How we have worked to include the whole community in enhancing their own environment can be seen in detail below:
−
+
−
−
Clean Stream Team
Clean Stream Team
The Clean Stream Team is at the hub of the project. The team consists of 2 people, one from the Environment Agency and one from Severn Trent Water. They are supported by Shropshire Wildlife Trust and Telford & Wrekin Council. They work together on a full time basis, to proactively seek and resolve as many urban pollution issues as possible for the life of the project.
The Clean Stream Team is at the hub of the project. The team consists of 2 people, one from the Environment Agency and one from Severn Trent Water. They are supported by Shropshire Wildlife Trust and Telford & Wrekin Council. They work together on a full time basis, to proactively seek and resolve as many urban pollution issues as possible for the life of the project.
+
They receive further support from the other 10 stakeholders on the project steering group and importantly the whole of the rest of Telford’s community. This is achieved by:
They receive further support from the other 10 stakeholders on the project steering group and importantly the whole of the rest of Telford’s community. This is achieved by:
Line 110:
Line 100:
Now everyone is working together with a common goal.
Now everyone is working together with a common goal.
−
−
−
−
−
−
−
2. Blue Business Award
2. Blue Business Award
Line 133:
Line 116:
The project aims to use these exemplars to encourage SUDS in Telford and to encourage Severn Trent Water to reduce fees for businesses who discharge to surface water via an implemented SUDS scheme.
The project aims to use these exemplars to encourage SUDS in Telford and to encourage Severn Trent Water to reduce fees for businesses who discharge to surface water via an implemented SUDS scheme.
−
4. School Education programmes
4. School Education programmes
Line 139:
Line 121:
The 6 week programme focuses on hands on learning. It uses a full water audit of the school and the construction of retro SUDS by the children in the school grounds as a unique way to help them learn about and understand the problems faced by urban watercourses.
The 6 week programme focuses on hands on learning. It uses a full water audit of the school and the construction of retro SUDS by the children in the school grounds as a unique way to help them learn about and understand the problems faced by urban watercourses.
−
}}
}}
{{Image gallery}}
{{Image gallery}}
Latest revision as of 12:27, 12 June 2018
5.00
(one vote)
To discuss or comment on this case study, please use the discussion page.
Project summary
Executive summary
The Love Your River Telford project is a holistic, all inclusive, partnership approach, addressing urban pollution with the aim of improving water quality and habitat around the watercourses of Telford while at the same time improving protection of downstream potable drinking water supply abstractions.
Initial funding was secured and the first year of the project ran from 1st April 2014 until 31 March 2015. There have been many achievements in the first year of the project detailed in this report.
Through bringing together organisations with similar aspirations and working with, volunteers, schools, business, and the local community a large number of benefits for both the environment and the whole community were realised. Watercourses have already shown some signs of improvement earlier than expected.
In addition to the benefits mentioned above large financial savings were also achieved for a number of participating organisations through the unique, efficient and proactive approach. This includes a potential saving well in excess of £1M for Severn Trent Water. Details of these figures and how they are calculated are found in this report.
There has been much interest in the project from the media and other organisations. A BBC radio miniseries was completed on the project, there is a blog on the .GOV.UK website and there has been a lot of interest on social media. The project will also be highlighted at an international conference in Ireland in November 2015 as an example of best practice. All of this attention has resulted in other towns and cities showing an interest in the model developed in Telford with Bromsgrove already implementing it in 2015.
The Environment Agency through DEFRA Grant in Aid funding has been the main contributor to this project with some partner match funding. Further funds have been secured to continue the project to 31 March 2016. This source of this funding however is expected to significantly decrease beyond March 2016 so the partners are seeking other funding sources to continue to develop what appears to be a successful approach with many benefits and one that can be shared with other towns and cities with urban pollution issues.
Introduction
Love Your River Telford is a project aimed at working with and empowering the whole of the town’s community to improve water quality and the natural habitat, enhancing their own environment.
There was 4 government organisations, 4 non-government organisations, 1 water company, 1 university, 16 community groups and an industry led environmental group with 140 members all working to try and improve water quality, biodiversity and flooding in Telford, a town with a population of around 150,000 people.
As in most towns these various bodies were working generally independently of each other resulting in inefficiencies while frequently treading on each other’s toes, occasionally resulting in strained relationships.
The Love Your River Telford project decided to take the initiative, build on the foundations laid by the successful preceding Catchment Restoration Fund project and implement a bold unique approach to attempt to get all organisations to work in partnership together while including and empowering the rest of Telford’s community to work alongside us on a scale not seen anywhere else before.
Telford now has an all inclusive joined up and innovative approach where all the different parts of the community feel involved and valued and know how they can help to improve the town’s water quality, biodiversity and flooding issues. This approach has already proved to be significantly more efficient and cost effective by proactively resolving issues before they become a greater problem and by empowering communities who are already out in the town everyday to identify pollution and report it.
As well as improving water quality and habitat in the town the work has also help safeguard the highly important downstream potable abstractions against pollution.
You only need to walk around Telford to see there are problems that need resolving to improve water quality.
The Ketley Brook in Telford
The Mad Brook in Telford
There are 8 water bodies in Telford. All are failing to meet Water Framework Directive targets either partially of wholly due to urban diffuse pollution.
An all inclusive project
How we have worked to include the whole community in enhancing their own environment can be seen in detail below:
Clean Stream Team
The Clean Stream Team is at the hub of the project. The team consists of 2 people, one from the Environment Agency and one from Severn Trent Water. They are supported by Shropshire Wildlife Trust and Telford & Wrekin Council. They work together on a full time basis, to proactively seek and resolve as many urban pollution issues as possible for the life of the project.
They receive further support from the other 10 stakeholders on the project steering group and importantly the whole of the rest of Telford’s community. This is achieved by:
1. Volunteer groups
A network of 16 “friends of ...” volunteer groups have received 6 full day training sessions and have been supplied with sampling equipment to allow them to monitor for and identify signs of pollution to Telford’s watercourses.
Any pollution identified by the volunteer groups is fed into the Clean Stream Team to resolve
2. Local Community
A project leaflet has been developed to help Telford’s residents to identify pollution, correct any of their own drainage mis-connections and informs them how to report any pollution they might identify.
Any pollution identified by the community is fed into the Clean Stream Team to resolve.
3. Business community
The Business Environmental Support Scheme for Telford (BESST) has been tasked by the project to develop an award scheme to recognise pollution prevention innovation. This has opened up a new line of communication with businesses in Telford. BESST’s 140 members have received information regarding pollution prevention and how to identify pollution and have teamed up with volunteer groups to help identify and address issues.
Any pollution identified by the business community is fed into the Clean Stream Team to resolve.
4. Stakeholder organisations
Many of the stakeholders involved with the project have pollution reporting systems. The project creates one system where any water pollution reported is passed to the Clean Stream Team to investigate.
Any pollution reported to or identified by other organisations is fed into the Clean Stream Team to resolve.
5. Schools
Shropshire Wildlife Trust worked in 10 schools in Telford either through a short session or a full 6 week River Ranger Programme to teach Telford’s children about habitat, water pollution and how to identify it and report it. Details on the innovative full 6 week programme can be found below.
Any pollution identified by the school children in Telford is fed into the Clean Stream Team to resolve.
An example of how a volunteer report triggers a Clean Stream Team response in practiice can be seen in Appendix B.
The innovative approach
During the development phase of the project all partners agreed that the project should aim towards an innovative approach. All of the partner’s ideas were subsequently gathered and the Love Your River Telford project was created.
So why is it innovative?
There are a number of elements to the project that have not been considered before, are ideas from previous projects taken a step further or have not been implemented on the scale of a town the size of Telford before (pop 100,000). These include:
1. Clean Stream Team
The idea to work in partnership to resolve urban pollution came from the Operation Streamclean project in Bristol. This project took that model much further. Rather than a standalone team involving the main organisations concerned with urban pollution, this project involves all 12 organisations working on water quality in the town. It also importantly includes the whole of the town’s community making them the “4th member” of the team.
By providing the volunteer groups with training and chemical, invertebrate and aquatic plant monitoring equipment they have become an extremely valued early warning to water pollution. In addition to the Environment Agency’s routine monitoring the volunteer’s data helps us to better understand the sources of the pollution with any issues identified immediately passed to the Clean Stream Team to investigate and resolve.
Now everyone is working together with a common goal.
2. Blue Business Award
Telford is lucky enough to have the Business Environmental Support Scheme for Telford (BESST), a very active industry led environmental advice group with over 140 member businesses. Telford also has 3 very large industrial estates with hundreds of business based in the town. It also subsequently has a history of significant pollution incidents from these areas due to poor pollution prevention practises.
As one of the members of the project steering group, BESST have accepted the challenge of creating a new unique annual award recognising innovation in pollution prevention and water efficiency. The award is open to all businesses in Telford and creates a new positive opportunity to reach many more businesses than would usually be possible through a routine pollution prevention campaign and opens up a new forum for sharing best practice and delivering advice.
The 1st award ceremony is planned for the end of 2015.
3. SUDS incentive scheme
Sustainable Urban Drainage Systems (SUDS) are widely thought to be the answer to addressing urban pollution, reducing flood risk and creating new habitat. They are also considered by business to rarely be cost beneficial and as such rarely adopted by businesses.
With support from Shropshire Wildlife trust through the previous Catchment Restoration Funding (CRF) Ricoh, one of the town’s largest businesses has completed feasibility studies to show that such a system can be cost beneficial by considering reduced business risk as well as reduced discharge fees.
That same CRF project secured funding for a community based rain garden SUDS located on the Mad Brook in the Stirchley area of Telford. The SUDS has already reduced flooding in that locality while removing sediment rich runoff from entering the local watercourse.
The project aims to use these exemplars to encourage SUDS in Telford and to encourage Severn Trent Water to reduce fees for businesses who discharge to surface water via an implemented SUDS scheme.
4. School Education programmes
The River Rangers programme developed by Shropshire Wildlife Trust takes water quality and urban pollution school education programmes a step further.
The 6 week programme focuses on hands on learning. It uses a full water audit of the school and the construction of retro SUDS by the children in the school grounds as a unique way to help them learn about and understand the problems faced by urban watercourses.
Monitoring surveys and results
This case study hasn’t got any Monitoring survey and results, you can add some by editing the project overview.
Lessons learnt
This case study hasn’t got any lessons learnt, you can add some by editing the project overview. |
You are here
Scholarships
Automatic Consideration - Freshmen
Students are immediately considered for a scholarship package upon admission to Morris.
Achievement Scholarships
Based on information provided in the Application for Admission, admitted freshmen will be considered for Achievement Scholarship Packages, which range from $6,000 to $18,000 over four years ($1,500 -$4,500 annually). Students will be notified of their award with their letter of acceptance.
National Scholar Award
Non-resident and international students will be considered for our National Scholar Award, ranging from $500 to $2,000 per year. Students will be notified at the time of admission to Morris.
National Merit Scholarships
National Merit Finalists who choose Morris as their first-choice college will receive a full tuition scholarship, renewable for up to four years. Semi-Finalists and Commended Scholars are eligible for up to $4,000 disbursed evenly over four years, renewable for up to four years. Students must provide the Office of Admissions with documentation of their National Merit status to receive the award. Learn more about the scholarship process.
Automatic Consideration - Transfer Students
Transfer Scholar Award
Students transferring to Morris from a college outside of the University of Minnesota system, with at least a 3.25 cumulative GPA (calculated based on transferable credits), qualify for a transfer scholarship package ranging from $2,000–$4,000 disbursed evenly for up to four consecutive semesters (does not include summer term). All transfer scholarships require students to maintain a 2.5 cumulative GPA and be enrolled for at least 12 credits at Morris.
National Scholar Award
Non-resident and international students will be considered for our National Scholar Award, ranging from $500 to $2,000 per year. Students will be notified at the time of admission to Morris.
Competitive Scholarships - Freshmen
Incoming freshman students are invited to compete for our top scholarship packages. To be eligible, students must submit their application for admission and required materials by December 15. Recipients will be selected during a competitive interview events held at Morris in December and February.
Prairie Scholars
Prairie Scholars receive a scholarship package equivalent to full tuition, renewable for up to four years.
Morris Scholars
Morris Scholars receive a $24,000 scholarship package, disbursed evenly over four years, plus a one-time $2,500 scholarship stipend. The stipend may be used during the second, third, or fourth year at Morris to engage in an eligible scholarship experience (e.g., to study abroad, to participate in a research or artistic project, or to travel to academic conferences).
Distinguished Scholars
Distinguished Scholars receive a one-time $1,500 scholarship stipend. The stipend may be used during the second, third, or fourth year at Morris to engage in an eligible scholarship experience (e.g., to study abroad, to participate in a research or artistic project, or to travel to academic conferences).
Music Scholarships - All Students
Clyde Johnson Music Scholarships honor Clyde Johnson, professor emeritus of music, who served Morris from 1961 until 1999. The scholarships are awarded to talented University of Minnesota, Morris students who are involved in music. It completely covers the fees for one year of weekly private, individual music lessons in the student’s performance area (instrumental or voice).
The University of Minnesota, Morris will host auditions for students planning to further their music interests in college. While on campus, students will audition with music faculty, and awards will be given based on the music faculty’s evaluation of a student's audition as well as a brief discussion of musical background and goals. This scholarship is awarded by the Music Discipline.
The Office of Admissions will be in contact about the opportunity to audition with admitted students who have listed themselves as having musical interests. If you are interested in applying for the scholarship but unable to audition on campus, please contact the Office of Admissions.
Other Scholarships
Various other funds exist at Morris through institutional programs and the generosity of our donors. These scholarships are awarded based on information provided in the Application for Admission and the Free Application for Federal Student Aid (FAFSA) and will be a part of the final scholarship package. Visit the Office of Financial Aid website for more information.
General Requirements
With the exception of the National Scholar Award, students must be a U.S. citizen or Permanent Resident to be eligible to receive any of these scholarships.
All renewable scholarships are awarded on a per-semester basis for fall or spring terms only and require students to maintain a 2.5 cumulative GPA and be enrolled for at least 12 credits. The Prairie Scholars Award, Morris Scholars Award, and National Merit Scholar Winner Awards will replace any previous scholarship package award offers. National Merit scholarships cannot be combined with the Prairie or Morris Scholars Award.
Final scholarship packages may consist of academic scholarships, U Promise scholarships and donor-funded scholarship awards. A student’s award may be adjusted if institutional and outside awards cause the award to go over the cost of attendance (COA). |
Don’t squash the nanotubes
Researchers at the University of Surrey in Guildford, England, have found that the electronic behaviour of double-walled carbon nanotubes can change drastically when they are squashed or twisted. Among other things, his will have serious implications for the use of nanotubes as interconnects in microchips.
Under normal circumstances double-walled nanotubes are metallic, and engineers are looking to use them as chip interconnects and in nano- and micro-electromechanical systems. But the research results obtained by Cristina Giusca and her Advanced Technology Institute (ATI) colleagues reveal that an electronic band gap can open when the tiny carbon cylinders are deformed, in which case they lose their conductivity.
“Our results reveal that a metallic double-walled carbon nanotube behaves as a semiconductor upon severe squashing and twisting,” says Giusca. “This study clearly highlights the role of structural defects at the atomic scale, and the importance of carbon nanotubes’ structural integrity for their use as essential components in the design of practical applications.”
Deformations that could lead to such conductivity changes can result from nanotube growth and processing, where control electrodes are placed on top of nanotubes, and when nanotubes are embedded in other structures. While in many situations this could be a serious problem, the effect of controlled deformations could actually be exploited to tune the material’s electronic characteristics for particular applications.
“These findings will be of relevance to those examining the future integration of carbon nanotubes with conventional existing electronic technologies,” says ATI director Ravi Silva. “And especially for their use as interconnects for the billion dollar semiconductor industry.”
Figure: Schematic of a collapsed and twisted double-walled carbon nanotube. Deformed in this way, double-walled nanotubes – which are normally metallic – could lose their ability to function as interconnects in microchips and other electronic devices (source: Cristina Giusca/University of Surrey). |
Creating A Successful Mindset For Change
Perhaps you think of the context of change? Are you currently experiencing political, social, cultural or religious changes? Or perhaps you are experiencing different directions within your professional and public life, personal lifestyle or relationships?
When you think of your past current or future situation to change, does it evoke excitement and curiosity within you? Or do you feel unsettled, doubtful and fearful? Perhaps you may even feel mixed emotions?
If we look around us, we know that change is inevitable and happens every second of every day. The leaves off the trees fall and are renewed each year, day turns to night and night into day, the weather can change within a matter of minutes, and before you know it we’ve reached the middle of the year! Of course these are all natural occurrences and things outside of our control.
Yet interestingly, when we do have the potential power to possibly control a situation, we choose to either embrace or resist change. Most of this comes down to the need to survive, to maintain control and power, and to stay in firm contact with safety and what we have always known.
Yet change evokes images of the unknown, the new and possibly the likelihood that with change comes a possibility that we may feel either in or out of control. However, whatever change evokes for you, there is one undeniable old-aged truth: change is inevitable and a constant.
10 Top Tips For Creating A Successful Mindset For Change
ACCEPT THAT CHANGE IS INEVITABLE
Whether you like it or not, change is inevitable and it’s happening every second of every day whether we’re aware of it or not.
The very essence of life stimulates death, change and rebirth. When you choose to accept change and the flow of life as inevitable you will begin to feel less fearful, less attacked and more open to learning how change can work for you!
Consider inviting more flow into your life by being mindful and starting to notice how things change each day. Perhaps start with noticing the weather and the changing colours of the seasons. For me, I always notice the same blossom tree and how it both sheds and grows its blossom every year.
BE PREPARED TO RIDE THE WAVES
I’m not going to lie to you change will either be experienced as a positive or negative experience (depending on your experiences, beliefs and needs)
However, if you begin to change your approach, mindset and tactic to ride the waves, you will begin to experience the rich ebb and flow and the possibilities of life rather than simply remaining safe, yet cut off on the shoreline.
CREATE A FLEXIBLE OPEN MINDSET NOT A FIXED MINDSET
Obviously everyone is entitled to choose whether they embrace change or not and you cannot force people to adopt a new direction if they are resistant to do so.
However, although you cannot control other people, you do have control over your own future. Ask yourself ‘what will I gain or risk by embracing change or not?’ Then ask yourself ‘is this my own view? Or someone else’s experiences and beliefs which have influenced me?’ Then be honest and ask yourself on a scale of 1-10 (1 being the least likely and 10 being highly likely) ‘how willing am I to begin to embrace change?’ and ‘will it support me to grow and develop?’
It’s also important to bear in mind that what you once believed in or wanted, may not be what’s best for you now. Therefore, it’s important to check-in with yourself, your changing circumstances and your needs every so often. A good tool is to create a changing photo timeline of yourself and your goals. This will help you to see what you once wanted may have evolved or may have changed.
IDENTIFY THE ROOT CAUSES OF YOUR RESISTANCE
In order to fully understand and successfully embrace sustainable change, you first need to acknowledge your root resistance to change. Be honest and ask yourself why are you resistant to change? What are your past and current experiences of change? Were you told to be fearful, wary or resistant to change? Were they positive or negative experiences? Are you fearful of the unknown?
Once you’ve understood and identified the root cause of your resistance you can cut the root clean and you can choose to live with more awareness, possibilities and freedom.
BE AN OPPORTUNIST!
Instead of feeling pessimistic, why not begin to ask how can this change work for you? How many people do you know in histories who have taken action steps to find and experience fulfillment and success even when the chips have been low?
Get in touch with your inner opportunist and ask how can you embrace change to make it work for you?’
REMAIN TRUE TO YOUR VALUES
Remember not everyone will support your views, choices and actions. However, it’s integral to remember that whilst these people may or may not be important to you, ultimately you are your own soul mate for the entirety of your life. Bearing this in mind, it’s important to ask if you’re going to be truly happy by not being open to change, sticking to the safe path and following what you’ve always known? Or will you feel more fulfilled, positively stretched, energized and alive by at least being open to change?
OPEN CONVERSATIONS CAN LEAD TO CHANGE
Start by engaging in conversations with other people without judgement and assumptions. Learn to understand, listen and acknowledge other people’s experiences. Whilst you may or may not choose to follow these people, the conversations and awareness will prepare the foundation for your responses and choices. A good tip is to try to talk to someone once a day who you do not know, or you haven’t engaged in conversation with.
“DO ONE THING A DAY WHICH SCARES YOU"
Change doesn’t need to be big and doesn’t have to happen all at once to make an impact. In fact, if you start to make smaller changes simply in your approach to daily routines you will begin to build the foundations for solid sustainable success and change, rather than short-lived bursts of energy.
Try doing one small or larger thing a day, which scares you. By stretching yourself beyond your comfort zones you will begin to feel more confident and begin to build a solid foundation for embracing change more easily.
SURROUND YOURSELF WITH LIKE-MINDED PEOPLE
When you are open to new directions and change, it’s no secret that anyone who is negative can naturally sap your energy, confidence and motivation. However, although it’s unlikely you will be able to drown out their voice, you do have the power to choose whether you listen to them or not.
Therefore, it’s really important to surround yourself with positive like-minded people who will support your way of life and vice - versa.
Consider where these people with similar values may hang out? Start by looking to join new hobbies, a new job or career opportunity, a new neighbourhood or a new social or professional group.
VALUE YOUR PERSONAL GROWTH
With change comes the possibility for growth and development. So if you’re not open to change and development perhaps it’s time to ask how much you value your own future and personal growth?
Keep a journal of all the smaller or larger experiences where you’ve successfully been open to or embraced change. Then ask yourself what worked or didn’t work? And how has it helped you to stretch beyond your comfort zones and to grow and develop? |
# Author: Austin Taylor and Justin Henderson
# Email: austin@hasecuritysolutions.com
# Last Update: 03/04/2018
# Version 0.3
# Description: Take in Openvas web scan reports from vulnWhisperer and pumps into logstash
input {
file {
path => "/opt/VulnWhisperer/data/openvas/*.json"
type => json
codec => json
start_position => "beginning"
tags => [ "openvas_scan", "openvas" ]
}
}
filter {
if "openvas_scan" in [tags] {
mutate {
replace => [ "message", "%{message}" ]
gsub => [
"message", "\|\|\|", " ",
"message", "\t\t", " ",
"message", " ", " ",
"message", " ", " ",
"message", " ", " ",
"message", "nan", " ",
"message",'\n',''
]
}
grok {
match => { "path" => "openvas_scan_%{DATA:scan_id}_%{INT:last_updated}.json$" }
tag_on_failure => []
}
mutate {
add_field => { "risk_score" => "%{cvss}" }
}
if [risk] == "1" {
mutate { add_field => { "risk_number" => 0 }}
mutate { replace => { "risk" => "info" }}
}
if [risk] == "2" {
mutate { add_field => { "risk_number" => 1 }}
mutate { replace => { "risk" => "low" }}
}
if [risk] == "3" {
mutate { add_field => { "risk_number" => 2 }}
mutate { replace => { "risk" => "medium" }}
}
if [risk] == "4" {
mutate { add_field => { "risk_number" => 3 }}
mutate { replace => { "risk" => "high" }}
}
if [risk] == "5" {
mutate { add_field => { "risk_number" => 4 }}
mutate { replace => { "risk" => "critical" }}
}
mutate {
remove_field => "message"
}
if [first_time_detected] {
date {
match => [ "first_time_detected", "dd MMM yyyy HH:mma 'GMT'ZZ", "dd MMM yyyy HH:mma 'GMT'" ]
target => "first_time_detected"
}
}
if [first_time_tested] {
date {
match => [ "first_time_tested", "dd MMM yyyy HH:mma 'GMT'ZZ", "dd MMM yyyy HH:mma 'GMT'" ]
target => "first_time_tested"
}
}
if [last_time_detected] {
date {
match => [ "last_time_detected", "dd MMM yyyy HH:mma 'GMT'ZZ", "dd MMM yyyy HH:mma 'GMT'" ]
target => "last_time_detected"
}
}
if [last_time_tested] {
date {
match => [ "last_time_tested", "dd MMM yyyy HH:mma 'GMT'ZZ", "dd MMM yyyy HH:mma 'GMT'" ]
target => "last_time_tested"
}
}
date {
match => [ "last_updated", "UNIX" ]
target => "@timestamp"
remove_field => "last_updated"
}
mutate {
convert => { "plugin_id" => "integer"}
convert => { "id" => "integer"}
convert => { "risk_number" => "integer"}
convert => { "risk_score" => "float"}
convert => { "total_times_detected" => "integer"}
convert => { "cvss_temporal" => "float"}
convert => { "cvss" => "float"}
}
if [risk_score] == 0 {
mutate {
add_field => { "risk_score_name" => "info" }
}
}
if [risk_score] > 0 and [risk_score] < 3 {
mutate {
add_field => { "risk_score_name" => "low" }
}
}
if [risk_score] >= 3 and [risk_score] < 6 {
mutate {
add_field => { "risk_score_name" => "medium" }
}
}
if [risk_score] >=6 and [risk_score] < 9 {
mutate {
add_field => { "risk_score_name" => "high" }
}
}
if [risk_score] >= 9 {
mutate {
add_field => { "risk_score_name" => "critical" }
}
}
# Add your critical assets by subnet or by hostname. Comment this field out if you don't want to tag any, but the asset panel will break.
if [asset] =~ "^10\.0\.100\." {
mutate {
add_tag => [ "critical_asset" ]
}
}
}
}
output {
if "openvas" in [tags] {
stdout { codec => rubydebug }
elasticsearch {
hosts => [ "vulnwhisp-es1.local:9200" ]
index => "logstash-vulnwhisperer-%{+YYYY.MM}"
}
}
}
|
qr when four letters picked without replacement from {b: 1, r: 3, i: 1, o: 3, q: 3}.
1/220
Two letters picked without replacement from {c: 5, m: 5, p: 3}. What is prob of sequence cc?
5/39
Four letters picked without replacement from edjdfedddddjjddd. What is prob of sequence eedf?
1/2184
What is prob of sequence ki when two letters picked without replacement from pikkpphkkh?
2/45
Three letters picked without replacement from tkttnnkttkkkk. Give prob of sequence nkk.
5/143
Four letters picked without replacement from {z: 4, c: 16}. Give prob of sequence zczz.
16/4845
Two letters picked without replacement from {o: 1, p: 1, g: 4, b: 3, e: 3, h: 3}. What is prob of sequence gg?
2/35
Two letters picked without replacement from {g: 3, a: 2, n: 1, h: 1, z: 4}. What is prob of sequence nz?
2/55
Two letters picked without replacement from {t: 1, i: 1, g: 1, w: 1, y: 1}. What is prob of sequence it?
1/20
What is prob of sequence dv when two letters picked without replacement from kkvvdkkvkvkvkkkkk?
5/272
Three letters picked without replacement from zzuyyuzyyyyy. Give prob of sequence uyu.
7/660
Three letters picked without replacement from {h: 2, d: 4}. What is prob of sequence hdh?
1/15
Calculate prob of sequence jxc when three letters picked without replacement from jtxxjttxttjjc.
1/143
Calculate prob of sequence gg when two letters picked without replacement from srsrgzergr.
1/45
Two letters picked without replacement from rrrrrrryrzrrr. What is prob of sequence zr?
11/156
Calculate prob of sequence wwu when three letters picked without replacement from wwwswuuawwwwuwuww.
11/102
Three letters picked without replacement from yvvvyvllv. Give prob of sequence ylv.
5/126
Calculate prob of sequence dcgi when four letters picked without replacement from {g: 4, z: 1, j: 3, i: 2, c: 1, d: 4}.
4/4095
Three letters picked without replacement from vmmvmmmmmmmvmmvmmmm. Give prob of sequence mmv.
140/969
Three letters picked without replacement from ihhtthhttthjjttthi. Give prob of sequence iii.
0
What is prob of sequence ff when two letters picked without replacement from pffpppppfpp?
3/55
Calculate prob of sequence iu when two letters picked without replacement from {u: 3, i: 2}.
3/10
Three letters picked without replacement from dddfdjdddzdd. What is prob of sequence jzd?
3/440
Three letters picked without replacement from {j: 3, t: 10, i: 2, n: 1}. What is prob of sequence jtn?
1/112
Four letters picked without replacement from ddvdddvvddddydd. What is prob of sequence yvvd?
11/5460
Calculate prob of sequence kvvu when four letters picked without replacement from {u: 9, v: 2, e: 6, k: 2}.
1/2584
Calculate prob of sequence pp when two letters picked without replacement from {w: 2, j: 1, t: 4, g: 3, p: 1}.
0
Four letters picked without replacement from pclllpwlltkpk. What is prob of sequence ctlk?
1/1716
Four letters picked without replacement from {d: 3, q: 4, c: 7}. Give prob of sequence ddcc.
3/286
What is prob of sequence nk when two letters picked without replacement from {k: 1, o: 4, g: 2, n: 1}?
1/56
Four letters picked without replacement from ssfbsbvvfsfvbf. Give prob of sequence vsvs.
3/1001
What is prob of sequence dx when two letters picked without replacement from {x: 1, h: 1, d: 1, a: 3, j: 1}?
1/42
What is prob of sequence etu when three letters picked without replacement from uttettttettettt?
11/910
What is prob of sequence md when two letters picked without replacement from {d: 12, m: 3}?
6/35
What is prob of sequence ddtk when four letters picked without replacement from akdkdlktdllkdld?
2/819
Two letters picked without replacement from miikklmkkulmu. What is prob of sequence km?
1/13
Three letters picked without replacement from pnsnb. Give prob of sequence pbn.
1/30
Three letters picked without replacement from bxbb. What is prob of sequence bxb?
1/4
Calculate prob of sequence xwx when three letters picked without replacement from xxdvvxvfvdw.
1/165
Two letters picked without replacement from ihiqhu. What is prob of sequence hh?
1/15
Calculate prob of sequence tmm when three letters picked without replacement from trammadmrmrrmdam.
1/112
What is prob of sequence io when two letters picked without replacement from oxvdioxvdxxxvvt?
1/105
Two letters picked without replacement from {i: 6, m: 6, u: 1, l: 7}. Give prob of sequence ui.
3/190
Two letters picked without replacement from {u: 4, m: 4, z: 2, r: 6, o: 1, a: 2}. What is prob of sequence rm?
4/57
Calculate prob of sequence ggg when three letters picked without replacement from ggggg.
1
Calculate prob of sequence qnee when four letters picked without replacement from {o: 6, n: 3, l: 1, q: 4, e: 2}.
1/1820
Calculate prob of sequence dtp when three letters picked without replacement from iddpphiipitipiipip.
1/408
Calculate prob of sequence fz when two letters picked without replacement from gzkggwffggwf.
1/44
What is prob of sequence ddk when three letters picked without replacement from {p: 1, d: 3, k: 12}?
3/140
Three letters picked without replacement from {t: 2, i: 10}. What is prob of sequence iii?
6/11
What is prob of sequence rl when two letters picked without replacement from gggzlkrg?
1/56
Calculate prob of sequence pe when two letters picked without replacement from pbpkpgkeddebddbdedp.
2/57
What is prob of sequence qb when two letters picked without replacement from {d: 4, x: 4, q: 6, b: 1}?
1/35
Four letters picked without replacement from {w: 2, n: 11, x: 2}. Give prob of sequence nxnx.
11/1638
What is prob of sequence nn when two letters picked without replacement from nrrusnrsnn?
2/15
Three letters picked without replacement from fvffffffnfvft. What is prob of sequence ntv?
1/858
What is prob of sequence ou when two letters picked without replacement from ulullool?
1/14
Four letters picked without replacement from mrcrllfmrfmcfff. Give prob of sequence rlmc.
1/910
Four letters picked without replacement from yzmpf. What is prob of sequence pfzy?
1/120
Two letters picked without replacement from wdwddcdwpwwd. What is prob of sequence dc?
5/132
Calculate prob of sequence arr when three letters picked without replacement from rrruauauuur.
4/165
What is prob of sequence wwr when three letters picked without replacement from {r: 4, w: 2}?
1/15
Calculate prob of sequence bij when three letters picked without replacement from jgpgbbiggbpobbbgj.
1/340
Two letters picked without replacement from jxxxhhhh. What is prob of sequence jh?
1/14
Three letters picked without replacement from {r: 3, c: 11}. What is prob of sequence crc?
55/364
What is prob of sequence exf when three letters picked without replacement from fexxfeefeexeexexxx?
7/204
Three letters picked without replacement from fvorrkhh. What is prob of sequence fkh?
1/168
Calculate prob of sequence syy when three letters picked without replacement from yyyysyyyysyyyyyyysyy.
34/285
Three letters picked without replacement from eekeeeekeeeeeek. Give prob of sequence eee.
44/91
Calculate prob of sequence je when two letters picked without replacement from {j: 5, e: 1, v: 7, f: 1}.
5/182
Four letters picked without replacement from {h: 4, d: 7}. What is prob of sequence ddhd?
7/66
What is prob of sequence mgp when three letters picked without replacement from ooopmogpmopopmpmom?
25/4896
Calculate prob of sequence unu when three letters picked without replacement from {o: 1, a: 1, b: 1, n: 1, u: 2, p: 1}.
1/105
Two letters picked without replacement from {y: 4, s: 4, x: 1, v: 6}. What is prob of sequence vx?
1/35
What is prob of sequence wr when two letters picked without replacement from {b: 1, i: 1, w: 1, h: 1, r: 1, t: 6}?
1/110
What is prob of sequence oe when two letters picked without replacement from oooeooooooooeeeooooe?
15/76
What is prob of sequence rg when two letters picked without replacement from {l: 9, g: 1, r: 4}?
2/91
Two letters picked without replacement from xtxttttxxx. Give prob of sequence xx.
2/9
Calculate prob of sequence so when two letters picked without replacement from {o: 1, s: 2}.
1/3
What is prob of sequence lbn when three letters picked without replacement from nqncqccqqqqqqcbln?
1/1360
Three letters picked without replacement from knny. Give prob of sequence nny.
1/12
Calculate prob of sequenc |
Q:
Exporting a MySQL table into a CSV file
I have a MySQL table which has to be taken out as a CSV file. The query I used is
SELECT "ID","NAME","SALARY","SAL1","SAL2","SAL3","SAL4","SAL5","SAL6","SAL7","SAL8","SAL9","SAL10","SAL11","SAL12","SAL13","SAL14","SAL15","SAL16","SAL17","SAL18","SAL19","SAL20","SAL21","SAL22","SAL23","SAL24","SAL25","SAL26"
UNION ALL
SELECT *
FROM addstock25
INTO OUTFILE "E:\\JOSE DATA\\addstock7.csv"
FIELDS TERMINATED BY ','
ENCLOSED BY '"'
LINES TERMINATED BY '\n';
This query works, but what if I have 200 column names?
Is there a way to do it without manually typing it?
A:
This command almost gives you what you want, and it even works with a remote server. The only caveat is that it generates a TSV file (fields are separated by a tab).
mysql mydb -e "select * from mytable" -B > mytable.tsv
But you could convert it to CSV using sed, as suggested in this answer:
mysql mydb -e "select * from mytable" -B | sed "s/'/\'/;s/\t/\",\"/g;s/^/\"/;s/$/\"/;s/\n//g" > mytable.csv
A:
DESCRIBE addstock25;
Strip the first column and the first three entries of that column (it depends on your usage). You will get the list of fields in addstock25.
This will bring only field names using virtual tables derived in core... called information schema.
SELECT `COLUMN_NAME`
FROM `INFORMATION_SCHEMA`.`COLUMNS`
WHERE `TABLE_NAME`='foo';
Let’s say the name of this query would be sq_fieldnamelist.
So, the above table has one column and it has the field names of the "foo" table.
If directly writing like
SELECT (sq_fieldnamelist)
UNION ALL
SELECT *
FROM addstock25
INTO OUTFILE "E:\\JOSE DATA\\addstock7.csv"
FIELDS TERMINATED BY ','
ENCLOSED BY '"'
LINES TERMINATED BY '\n
MySQL will give an error. "subquery returns multiple rows"
We must edit sq_fieldnamelist to concatenate all entries back to back, separated with commas.
Select GROUP_CONCAT(COLUMN_NAME)
FROM
(SELECT `COLUMN_NAME`
FROM `INFORMATION_SCHEMA`.`COLUMNS`
WHERE `TABLE_NAME`='ffd_companies'
LIMIT 3,100
) AS fafa
GROUP BY 'COLUMN_NAME' // This group by is just to make group concatenation work
Let's say this is sq_fieldnamelist2.
If we edit sq_fieldnamelist like this, it will return only one value which is all field names separated with commas. So now we can put this subquery in your select statement to acquire the needed fields.
SELECT (sq_fieldnamelist2)
UNION ALL
SELECT *
FROM addstock25
INTO OUTFILE "E:\\JOSE DATA\\addstock7.csv"
FIELDS TERMINATED BY ','
ENCLOSED BY '"'
LINES TERMINATED BY '\n
You need to edit LIMIT 3,100 in sq_fieldnamelist2 for you own purpose.
Let's say your table is like fil1, fil2...filN, sal1, sal2, sal3...., salI. To see the only salary fields, you should use LIMIT N, x > I+N. If you want to see all, use LIMIT 0, x > N+I.
A:
I'm not seeing why you can't do
SELECT *
FROM addstock25
INTO OUTFILE "E:\\JOSE DATA\\addstock7.csv"
FIELDS TERMINATED BY ','
ENCLOSED BY '"'
LINES TERMINATED BY '\n'
|
In certain types of distributed estimation, a large number of inexpensive sensors are scattered, measuring a desired quantity, θ, and transmitting the measurement back to a fusion center (FC), where these measurements are fused into a single estimate, {circumflex over (θ)}. An example of such a scenario is surveillance in an inaccessible area: sensors are airdropped into a region and there is a fusion center in the area. The sensors measure some physical quantity in the presence of noise. In this or other mobile low-power sensor network applications, power efficiency is a key design attribute influencing usability of the system.
There are a variety of ways to transmit the data from each sensor to the fusion center. Each individual sensor can transmit its data to the fusion center using an orthogonal signaling scheme, which makes each sensor's measurement independently discernible, but also requires a total system bandwidth that grows with the total number of sensors. This increasing bandwidth requirement limits the attainable sensor sampling rate. This may be acceptable if the number of sensors is small, but may not be applicable when the number of sensors is large. A different technique is to use an estimation algorithm which does not need to attain the values of individual sensor measurements orthogonally, but instead operates on an aggregate received value. One estimation algorithm that can operate using a shared bandwidth is Amplify-and-forward (AF).
An assumption made in AF systems is that the transmitter is either inherently linear or has been linearized by a predistorter. Though linearity is desirable for producing accurate estimates, it significantly reduces the power efficiency of the transmitting sensors. Many papers have been published on boosting the energy-efficiency of wireless sensor networks at the system-level by optimally allocating transmitted output power among the sensors, but none examines the battery power required to generate the output.
For simplicity and clarity of illustration, the drawing figures herein illustrate the general manner of construction, and descriptions and details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the invention. Additionally, elements in the drawing figures are not necessarily drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help improve understanding of embodiments of the present invention. The same reference numerals in different figures denote the same elements.
The terms “first,” “second,” “third,” “fourth,” and the like in the description and in the claims, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms “include,” and “have,” and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, device, or apparatus that comprises a list of elements is not necessarily limited to those elements, but may include other elements not expressly listed or inherent to such process, method, system, article, device, or apparatus.
The terms “left,” “right,” “front,” “back,” “top,” “bottom,” “over,” “under,” and the like in the description and in the claims, if any, are used for descriptive purposes and not necessarily for describing permanent relative positions. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in other orientations than those illustrated or otherwise described herein.
The terms “couple,” “coupled,” “couples,” “coupling,” and the like should be broadly understood and refer to connecting two or more elements or signals, electrically, mechanically or otherwise. Two or more electrical elements may be electrically coupled, but not mechanically or otherwise coupled; two or more mechanical elements may be mechanically coupled, but not electrically or otherwise coupled; two or more electrical elements may be mechanically coupled, but not electrically or otherwise coupled. Coupling (whether mechanical, electrical, or otherwise) may be for any length of time, e.g., permanent or semi permanent or only for an instant.
“Electrical coupling” and the like should be broadly understood and include coupling involving any electrical signal, whether a power signal, a data signal, and/or other types or combinations of electrical signals. “Mechanical coupling” and the like should be broadly understood and include mechanical coupling of all types. The absence of the word “removably,” “removable,” and the like near the word “coupled,” and the like does not mean that the coupling, etc. in question is or is not removable. |
Q:
How to extract data from .csv file and create a plot?
I have a .csv file with 24columns x 514rows of data. Each of these column represent different parameters and I wish to study the trends between different parameters.
I am using genfromtxt to import the data as a numpy array such that I can plot the values of two particular columns(e.g. column 9 against column 11). Here is what I have so far:
import matplotlib.pyplot as plt
import numpy as np
data = np.genfromtxt('output_burnin.csv', delimiter=',')
impactparameter=data[:,11]
planetradius=data[:,9]
plt.plot(planetradius,impactparameter,'bo')
plt.title('Impact Parameter vs. Planet Radius')
plt.xlabel('R$_P$/R$_Jup$')
plt.ylabel('b/R$_star$')
plt.show()
With this code I encounter an error at line 12:
impactparameter=data[:,11]
IndexError: too many indices
What could the problem be in here?
Also, I have been trying to figure out how to give each column a header in the .csv file. So instead of counting the column number, I can just call the name of that particular column when I do the plotting. Is there a way to do this?
I am a complete newbie in Python, any help would be much appreciated, Thanks!
A:
Also, I have been trying to figure out how to give each column a header in the .csv file. So instead of counting the column number, I can just call the name of that particular column when I do the plotting. Is there a way to do this?
To give columns in your array names, you need to make it a structured array.
Here's a simple example:
a = np.zeros(5, dtype='f4, f4, f4')
a.dtype.names = ('col1', 'col2', 'col3')
print a[0] # prints [0, 0, 0], the first row (record)
print a['col1'] # prints [0, 0, 0, 0, 0], the first column
If you have the column names at the beginning of your CSV file, and set names=True in np.genfromtxt, then Numpy will automatically create a structured array for you with the correct names.
|
Michael's flight to Taiwain, 1993
The article was published in Chinese in 1993 and gives some rare glimpses of the King of Pop days before the news of the 1st child abuse allegation broke. This was soon to overshadow the rest of his Dangerous tour. I’ve summarised the article in English below:
The background:
As people know Michael Jackson came to Taiwan in 93′ for the Dangerous Tour. What many people may not be aware of was that before he began the Asian leg of the Dangerous tour, he briefly flew into Taiwan before departing to Bangkok for his first concert. He flew China Airlines, a Taiwanese based company.
The China Airlines “Dynasty Magazine” featured Michael in their October issue, it was not only about his Taipei concert, but also revealed details of him as the the airline’s secret VIP passenger.
Possibly to confuse the press, instead of flying his own private jet to Bangkok, Michael set off for Bangkok a day earlier than planned, via San Francisco to Taipei for the connection flight to Bangkok. To avoid the unnecessary press attention, the schedule was kept confidential, it was only leaked to the Taiwanese press the next day by passengers who recognised Michael, and later confirmed by the Airlines.
Without anyone noticing, Michael Jackson was the last passenger at the last minute to board the China Airlines CI-003 from San Francisco wearing his hat and surgical mask. He sat at the front by the window in the first class cabin with his agent. He arrived at the Taiwan Taoyuan International Airport around 19.30pm on 21st August. Michael was greeted on board by the company head of the public relations Mr. Luo and other senior members before they briefly took a walk “sightseeing” the transfer area.
Luo recalled that Michael kept praising the display of the hallway, walking back and forth a few times, excited like a big kid, he seemed to be very happy to be on the island of Taiwan for the first time. Mr. Luo spent nearly an hour talking with Michael, he later spoke of his amazement at how child like, well mannered and easy going that he was. Michael’s long thick eyelashes and charming big brown eyes were most memorable.
At 20.30 before all other passengers, Michael boarded the next plane CI-065 heading to Bangkok, unknown to the cabin crew. As usual they were busy preparing for taking off, when they unexpectedly saw Michael, the whole crew were in complete disbelief! Michael who apparently owned 4 private jets, recognised the plane that he was traveling in as the brand new MD-11!
However, the first crew members on the CI-003 included chief cabin Mr. Zhang, air attendance Ms. Zhu and Ms. Liu who had flown in with the pop icon via San Francisco, they felt exceptionally honoured to meet Michael. All complimented on his charm and good manners after spending time with him on the long haul flight.
Zhang recalled that after Michael boarded the plane, he expressed his wish to catch up on some sleep, as he had not slept the previous night due to various things to do with his tour. After the plane took off, he soon fell asleep for 5-6 hours. Zhang was surprised that a super star such as Michael Jackson, appeared to be so kind, pure and innocent, which was beyond his expectation. After Michael woke up, he went into the kitchen to check things out and chatted to everyone, he even got himself some children’s toys and stickers. There was no doubt that he really adored children, when he was asked to sign a photo of an air attendant’s two year old daughter, Michael took as long as 5 seconds looking at the photo before putting the pen down.
Zhu said that the crew were excited to meet Michael, but only herself alongside with colleague Liu were privileged to look after him. Michael chatted to them a lot, and often showed his appreciation for their work. Michael was not a big eater, he preferred vegetarian food, so he didn’t eat much on the flight. He mainly accepted almonds and peanut type snacks. Zhu said Michael wasn’t fussy about wine glasses, he had white wine in a coffee cup, and only had an apple and yogurt for breakfast. The crew also noted his caring side, when he woke up in the dark just before breakfast, trying not to disturb other passengers while looking out of the window, he thoughtfully covered up his head and the window with a blanket to stop the light coming in.
Liu also recalled some memorable moments with Michael. She gave Michael orange juice after he asked for her recommendation, she also let Michael borrow her “Polo” fragrance to spray himself, and even gave Michael her China Airlines Eagle badge, pinning it on Michael’s shirt after he had shown his admiration for it. But for Liu, the most memorable moment with the King of Pop was when she was putting a blanket on him ready for sleep, and wished him a good dream, Michael was moved by the gesture, sincerely like a boy, and said to her “I love you”, which really warmed her heart….
Apart from a few hours sleep, the rest of the time Michael was actively chatting to the crew, looking through the window, playing poker with his agent and reading the airline magazine. He even bought a toy plane watch.
The plane journey went very smoothly, Michael didn’t forget to pay compliments to the chief pilot Mr. Cao. He cheered as soon as the plane landed, his child like spirit was contagious, all the other passengers were soon cheering along with him!
Before getting off the plane, lots of passengers and the crew couldn’t resist asking Michael for his autograph which he was happy to give. Senior air attendants later commented about their years of experience in dealing with international stars, Michael was the most sincere and approachable, something they would never forget!
It was a very rare occasion for Michael to be on board a commercial flight. He was especially grateful for the excellent service he received from the flight attendants, and expressed that he would fly China Airlines again if the opportunity arose. In fact, his agent did just that the next day, by cancelling his original booking with other airlines and again flying with China Airlines back to the US! |
H2H Picks Thursday Stats 13.12.2018
H2H Picks Thursday Stats
H2H Picks Thursday Stats, H2H Stats for 13.12.2018
Wins, Draw, Over, Under, BTTS Suggestions for Today
H2H Picks Thursday Stats is our section for soccer h2h stats analysis, all H2H Picks Thursday Stats, soccer matches are analyzed, only the best are selected and delivered to our visitors, Here are the Latest H2H Betting Tips, choose wisely, not always H2H Stats make winning predictions.
Our team is analyzing all Today, H2H Picks Thursday Stats, in order to bring you the best Football H2H, also to help you with your best H2H Tips, and to save your time in search of football tips, we are publishing what we think that is special or unusual. We are going with traditional 1×2 records, over 2.5, under 2.5, BTTS – Yes or No. When we notice something interesting in past performance and stats between two teams we are publishing. This is the H2H Picks Thursday Stats section BETSNTIPS.
WINS H2H Stats Friday DRAW BTTS Yes 14.12.2018
Friday Picks H2H Tips OVER UNDER BTTS No 14.12.2018
WINS
Harbour View vs Waterhouse 13.12.2018 01:00 Waterhouse to Win @ Waterhouse has Won Last 3 H2H Matches 4.20 3.40 1.72
JAMAICA: Premier League OUR SYSTEM PREDICTION Waterhouse Harbour View 4 : 0 Waterhouse Harbour View 2 : 1 Harbour View Waterhouse 0 : 1
Naft Al Junoob vs Al Zawraa 13.12.2018 14:15 Al Zawraa to Win @ OVER 2.5 @ BTTS-Yes @ Al Zawraa has Won Last 3 H2H Matches, last 3 H2H OVER2.5, last 4 BTTS-Yes
IRAQ: Super League OUR SYSTEM PREDICTION Naft Al Junoob Al Zawraa 1 : 4 Al Zawraa Naft Al Junoob 2 : 1 Al Zawraa Naft Al Junoob 4 : 1 Naft Al Junoob Al Zawraa 1 : 1
Bengaluru vs ATK 13.12.2018 15:00 Bengaluru to Win @ Bengaluru has Won Last 3 H2H Matches 1.55 4.20 4.75
INDIA: ISL OUR SYSTEM PREDICTION ATK Bengaluru 1 : 2 ATK Bengaluru 0 : 2 Bengaluru ATK 1 : 0
Al-Ettifaq vs Al Wehda 13.12.2018 15:30 Al Wehda to Win @ Al Wehda has Won Last 3 H2H Matches 3.00 3.30 2.10
SAUDI ARABIA: Saudi Professional League OUR SYSTEM PREDICTION Al Wehda Al-Ettifaq 2 : 1 Al-Ettifaq Al Wehda 1 : 3 Al-Ettifaq Al Wehda 0 : 1
DRAW
Primeiro de Agosto vs Progresso 13.12.2018 16:00 DRAW @ UNDER 2.5 @ Last 3 H2H Matches DRAW, and UNDER2.5
ANGOLA: Girabola OUR SYSTEM PREDICTION Progresso Primeiro de Agosto 1 : 1 Primeiro de Agosto Progresso 0 : 0 Progresso Primeiro de Agosto 0 : 0
OVER 2.5
Alianza Lima vs Sporting Cristal 13.12.2018 02:00 OVER 2.5 @ 1.75 Last 3 H2H Matches OVER2.5 2.50 3.10 2.55
PERU: Primera Division OUR SYSTEM PREDICTION Alianza Lima Sporting Cristal 2 : 2 Sporting Cristal Alianza Lima 1 : 2 Sporting Cristal Alianza Lima 3 : 0
Al Riffa vs Al-Hadd 13.12.2018 16:30 OVER 2.5 @ Last 3 H2H Matches OVER2.5
BAHRAIN: Premier League OUR SYSTEM PREDICTION Al-Hadd Al Riffa 3 : 3 Al Riffa Al-Hadd 3 : 0 Al-Hadd Al Riffa 0 : 5
UWI vs Arnett Gardens 13.12.2018 21:00 OVER 2.5 @ 2.60 Last 5 H2H Matches OVER2.5, 4 of last 5 H2H BTTS-Yes 3.00 3.00 2.25
JAMAICA: Premier League OUR SYSTEM PREDICTION UWI Arnett Gardens 3 : 0 Arnett Gardens UWI 2 : 2 Arnett Gardens UWI 2 : 1 UWI Arnett Gardens 1 : 4 Arnett Gardens UWI 1 : 2
UNDER
Tivoli vs Cavalier 13.12.2018 01:00 UNDER 2.5 @ 1.38 BTTS-No @ 1.55 Last 3 H2H Matches UNDER2.5, and BTTS-No 3.00 3.00 2.25
JAMAICA: Premier League OUR SYSTEM PREDICTION Tivoli Cavalier 0 : 2 Tivoli Cavalier 0 : 2 Cavalier Tivoli 0 : 0
Comunicaciones vs Guastatoya 13.12.2018 03:00 UNDER 2.5 @ 1.36 BTTS-No @ 1.44 Last 5 H2H Matches UNDER2.5, and BTTS-No 1.78 2.80 5.25
GUATEMALA: Liga Nacional OUR SYSTEM PREDICTION Comunicaciones Guastatoya 1 : 0 Guastatoya Comunicaciones 2 : 0 Comunicaciones Guastatoya 0 : 2 Guastatoya Comunicaciones 1 : 0 Guastatoya Comunicaciones 2 : 0
Al Karkh vs Naft Missan 13.12.2018 12:00 UNDER 2.5 @ Last 5 H2H Matches UNDER2.5
IRAQ: Super League OUR SYSTEM PREDICTION Al Karkh Naft Missan 1 : 1 Naft Missan Al Karkh 2 : 0 Naft Missan Al Karkh 1 : 0 Al Karkh Naft Missan 1 : 1 Naft Missan Al Karkh 2 : 0
Sagrada vs Petro Atletico 13.12.2018 16:00 UNDER 2.5 @ Last 3 H2H Matches UNDER2.5
ANGOLA: Girabola OUR SYSTEM PREDICTION Petro Atletico Sagrada 1 : 1 Sagrada Petro Atletico 0 : 1 Sagrada Petro Atletico 1 : 0
Al Sharjah vs Emirates Club 13.12.2018 16:30 UNDER 2.5 @ 3.45 BTTS-No @ 2.20 Last 3 H2H Matches UNDER2.5, and BTTS-No 1.25 5.50 7.50
UNITED ARAB EMIRATES: UAE League OUR SYSTEM PREDICTION Emirates Club Al Sharjah 0 : 0 Al Sharjah Emirates Club 1 : 0 Al Sharjah Emirates Club 0 : 2
Miscellaneous vs Security Systems 13.12.2018 18:00 UNDER 2.5 @ 1.63 Last 4 H2H Matches UNDER2.5 1.86 3.30 3.74
BOTSWANA: Premier League OUR SYSTEM PREDICTION Security Systems Miscellaneous 1 : 1 Miscellaneous Security Systems 0 : 0 Miscellaneous Security Systems 0 : 1 Security Systems Miscellaneous 1 : 0
Comunicaciones vs Tristan Suarez 13.12.2018 21:00 UNDER 2.5 @ 1.36 BTTS-No @ 1.53 Last 4 H2H Matches UNDER2.5, and BTTS-No 3.00 2.88 2.40
ARGENTINA: Primera B Metropolitana OUR SYSTEM PREDICTION Tristan Suarez Comunicaciones 2 : 0 Comunicaciones Tristan Suarez 0 : 1 Tristan Suarez Comunicaciones 0 : 2 Comunicaciones Tristan Suarez 0 : 1
Humble Lions vs Portmore 13.12.2018 21:00 UNDER 2.5 @ 1.50 BTTS-No @ 1.68 Last 3 H2H Matches UNDER2.5, last 4 H2H BTTS-No 3.10 3.10 2.15
JAMAICA: Premier League OUR SYSTEM PREDICTION Portmore Humble Lions 0 : 0 Humble Lions Portmore 0 : 1 Portmore Humble Lions 2 : 0 Portmore Humble Lions 3 : 0
BTTS Yes
Lahti vs Haka 13.12.2018 14:15 BTTS-Yes @ Last 3 H2H Matches BTTS-Yes 1.50 4.00 5.00
WORLD: Club Friendly OUR SYSTEM PREDICTION Haka Lahti 1 : 1 Lahti Haka 2 : 1 Lahti Haka 1 : 1
Laval vs Tours 13.12.2018 20:30 BTTS-Yes @ 2.38 Last 6 H2H Matches BTTS-Yes, 5 of last 6 H2H UNDER2.5, and DRAW 1.95 3.10 4.00
FRANCE: National OUR SYSTEM PREDICTION Laval Tours 1 : 1 Laval Tours 1 : 3 Tours Laval 1 : 1 Tours Laval 1 : 1 Laval Tours 1 : 1 Tours Laval 1 : 1
BTTS No
AS Kigali vs Bugesera FC 13.12.2018 14:30 BTTS-No @ 1.65 Last 5 H2H Matches BTTS-No 2.02 3.00 3.58
RWANDA: National Football league OUR SYSTEM PREDICTION AS Kigali Bugesera FC 4 : 0 Bugesera FC AS Kigali 0 : 0 Bugesera FC AS Kigali 0 : 1 AS Kigali Bugesera FC 0 : 0 AS Kigali Bugesera FC 4 : 0
Al-Fateh vs Al-Faisaly 13.12.2018 15:30 BTTS-No @ 2.00 Last 4 H2H Matches BTTS-No 2.20 3.40 2.75
SAUDI ARABIA: Saudi Professional League OUR SYSTEM PREDICTION Al-Faisaly Al-Fateh 0 : 2 Al-Fateh Al-Faisaly 0 : 5 Al-Fateh Al-Faisaly 1 : 0 Al-Faisaly Al-Fateh 0 : 0
Don Bosco vs Tempete 13.12.2018 23:00 BTTS-No @ Last 3 H2H Matches BTTS-No
HAITI: Championnat National OUR SYSTEM PREDICTION Tempete Don Bosco 0 : 0 Don Bosco Tempete 3 : 0 Tempete Don Bosco 0 : 1
H2H Picks Thursday Stats selection for today
Join our Telegram channel. Discuss soccer predictions, help each other, give suggestion about tips, and share your opinion, if you have some information, injured players, form or other info which may affect on final outcome share with us. In order to make Successful Betting Community, we are at your disposal.
Our Main Channel Channel Name: Betsntips, Link: t.me/betsntips
Backup Channel Channel Name: Soccer Betting Predictions, Link: t.me/soccerbettingpredictions
Backup Channel Channel Name: Football Tips H2H, Link: t.me/footballtipsh2h
Tips, ticket, fixed selling, and all similar things which may be a subject of SCAM or FRAUD are strictly forbidden. BETSNTIPS is completely free, No VIP, GOLDEN, SURE, EXPERT subscription.
Wednesday Picks H2H Stats 12.12.2018
Pinnacle | William Hill | 5Dimes | 10Bet |
Former CIA spy and Democratic congressional candidate Valerie Plame struggled to an explain anti-Semitic article posted to her Twitter page in 2017 during an appearance on CNN Monday.
Plame came under fire nearly two years ago when she tweeted out an article titled, “America’s Jews Are Driving America’s Wars,” but has since deleted the tweet and claimed that she was just expressing frustration with President Donald Trump’s decision to withdraw the U.S. from the Iran nuclear deal. (RELATED: Trump Warns Iran Of New Sanctions With Meme)
“The only thing I focused on in that article was: I thought it was a very bad idea to get out of the Iran nuclear deal,” she told CNN’s John Berman. “I stupidly did not read the rest of the article. When I did, I was really horrified. It’s anti-Semitic.”
Plame claimed at the time that “many neocon hawks ARE Jewish.”
When reminded by Berman that she had instructed her followers to “read the entire article,” Plame admitted that she did not read the entire article herself.
“I did. Really foolish, and I’m embarrassed by that whole … I should not have been anywhere near social media or a computer at that time in my life,” Plame said.
WATCH:
Plame launched a campaign for Congress earlier this month, running for the seat in New Mexico’s 3rd congressional district where she has lived for over a decade.
Plame is best known for having been outed as a spy during the President George W. Bush era. Former Vice President Dick Cheney’s chief of staff Scooter Libby — who is Jewish — was convicted of perjury, obstruction of justice and making false statements to federal agents in relation to information that was leaked about Plame in 2007.
Judith Miller, the main witness against Libby during his trial recanted and said she was pressed by prosecutors and now isn’t sure about her testimony.
Libby was pardoned by Trump in 2018, with the president saying that Libby had been “treated unfairly.”
“I don’t know Mr. Libby, but for years I have heard that he has been treated unfairly. Hopefully, this full pardon will help rectify a very sad portion of his life,” Trump said at the time.
Follow William Davis on Twitter |
Barnard’s spell at McLaren from 1980 was one of major success as he turned around the then-struggling team’s fortunes. His revolutionary carbon-monocoque MP4/1 design made McLaren a winner again in ‘81 after a four-year victory drought and his McLarens then won multiple drivers’ and constructors’ titles from ‘84 to ‘86.
McLaren currently is in another lengthy success slump. The team has not won a grand prix since 2012 and has not had a podium finish since the opening round of the 2014 season.
Speaking at a launch of his biography titled ‘The Perfect Car’, Barnard argued that McLaren’s ‘matrix’ management structure needs to be ditched in order to turn the team back into a winning outfit. But he added the size of that task could make the change impossible.
“They’ve had this matrix management system installed by probably [former boss] Martin Whitmarsh, and you’ve got to break that down, I don’t think that works. You have to change the thinking,” Barnard said.
“I don’t know how long that will take, [or] whether the team can survive that kind of a fundamental turnaround.
“Considering that when we joined McLaren in 1980 the problems I had then trying to change the way things were done, we’re talking about a fairly small operation [then].
“If you take those problems to today with the numbers of people there, I wouldn’t relish that job. It’s like turning an oil tanker.”
Barnard felt that McLaren’s diversification under former McLaren Group chairman and CEO Ron Dennis, particularly into road cars, also has been to the detriment of its Formula 1 effort.
“I was always very worried about diversifying,” Barnard added. “I know Ron’s idea was he wanted this big group of companies, this big mega operation and he would sit over the whole thing, and he achieved it. But I think he achieved it at the cost of the Formula 1 team.”
Barnard added that more recently, when Dennis was still at McLaren, he urged the chairman to focus on the F1 team rather than the wider business.
“I kept saying to Ron, ‘who is running the Formula 1 thing? You have to be back on the Formula 1 thing pulling it together; no one else can do it, just you’,” Barnard said.
“[Dennis would reply] ‘yeah, I’ve got these guys and they’re this and they’re that’.
“I’m looking at McLaren today and thinking maybe if he’d taken a bit of that on board things might be different.”
Graham Keilloh |
1. Field of the Invention
The present invention relates to a dry toner for a developer, which develops latent electrostatic images in, for example, electrophotography, electrostatic recording, and electrostatic printing. More specifically, it relates to a toner for electrophotography which is used, for example, for copiers, laser printers, facsimiles for plain paper using a direct or indirect electrophotographic developing system. Further, the present invention is directed to a toner for electrophotography which is used for full-color copiers, full-color laser printers, and full-color plain paper facsimile machines using a direct or indirect electrophotographic multicolor developing system.
2. Description of the Related Art
In electrophotography, electrostatic recording and electrostatic printing, a developer is, for example, applied to an latent electrostatic image bearing member such as a photoconductor, so as to dispose the developer onto a latent electrostatic image formed on the latent electrostatic image bearing member in a developing step, the developer disposed on the image is transferred to a recording medium such as a recording paper in a transferring step, thereafter the transferred developer is fixed on the recording medium in a fixing step. Such developers used for developing the latent electrostatic image formed on the latent electrostatic image bearing member generally include two-component developers containing a carrier and a toner, and one-component developers such as magnetic toner and non-magnetic toners, which do not require a carrier.
Conventional dry toners for use in electrophotography, electrostatic recording or electrostatic printing are formed by melting and kneading a toner binder such as a styrenic resin or a polyester, a colorant, and other components, then pulverizing the kneaded substance.
Charging Properties
The toner is generally charged by friction. For example, it is charged as a result of contact friction with a carrier in a two-component developer, and it is charged as a result of contact friction with a feed roller for feeding the toner to a developing sleeve or with a layer thickness controlling blade for uniformizing the toner layer on the developing sleeve. To reproduce latent electrostatic images on an image bearing member such as a photoconductor exactly, charging properties of the toner are important. To yield satisfactory charging properties, a variety of attempts have been made on the types and incorporation processes of a charge control agent into a toner.
Such charge control agents play their roles on the surface of toner particles, and most of them are expensive. Accordingly, attempts have been made to arrange a small amount of a charge control agent on the surface of toner particles. Japanese Patent Application Laid-Open (JP-A) Nos. 63-104064, 05-119513, 09-127720, and 11-327199 disclose techniques in which a charge control agent is applied to the surface of toner particles to impart charging ability to a toner. However, the charging ability of the resulting toner is insufficient, the charge control agent tends to flake off from the surface, and toners having target charging ability cannot be provided even according to the production process disclosed therein. In particular, these patent publications never take an initial charging rate of the toner into consideration.
JP-A No. 63-244056 discloses a method in which a charge control agent is adhered and fixed on the surface of mother toner particles utilizing an impulse force generated at a gap between a rotor (i.e., a blade rotated at a high speed) and a stator (i.e., projections fixed on the inside wall of a vessel). However, since the inside wall has projections, turbulent flows tend to be formed, and thereby the particles may be excessively pulverized or partially melted, the charge control agent may be embedded in the surface of the mother toner particles or adhered to the surface unevenly. This is probably caused by unevenness in energy imparted to the particles. Japanese Patent (JP-B) No. 2962907 describes the relation between the amount of a charge control agent on the surface and that inside of the toner. However, this technique is still insufficient to improve the image-fixing properties of the toner.
Image-Fixing Properties
These dry toners are, after used for developing and transferred on a recording medium such as a sheet of paper, fixed on the sheet by heating and melting the toner using a heat roller. If a temperature of the heat roller is excessively high, in this procedure, “hot offset” occurs. Hot offset is the problem that the toner is excessively melted and adhered onto the heat roller. If a temperature of the heat roller is excessively low, on the other hand, a degree of melting the toner is insufficient, resulted in insufficient image fixing. Accordingly, there are demands in a toner having a higher temperature at which hot offset occurs (excellent hot offset resistance) and a low fixing temperature (excellent image-fixing properties at low temperatures), in view of energy conservation and miniaturization of apparatuses such as copiers. Toners also require a heat-resistant storability that suppresses blocking of toner when the toner is stored, and at a temperature of atmosphere inside the apparatus where the toner is accommodated. Especially, low melting viscosity of toner is essential in full-color copiers and full-color printers in order to yield high gloss and excellent color mixture of an image. As a consequence, polyester toner binders which melts sharply has been used in such a toner. However, this toner tends to cause hot offset. To prevent hot offset, in full-color apparatuses, silicone oil has conventionally been applied on the heat roller. Yet, in the method of applying silicone oil to the heat roller, the apparatuses need to equip an oil tank and an oil applier, therefore the apparatuses become more complex in their structures and large in their size. It also leads a deterioration of the heat roller, so maintenance is required at every certain term. Further, it is unavoidable that the oil is attached to recording media such as copier paper and films for OHP (over head projector), and especially with the films for OHP, the attached oil cases deterioration in color tone.
To prevent a toner fusion without applying an oil to a heat roller, wax is generally added to a toner. In this method, however, releasing effect is largely affected by a condition of dispersed wax within a toner binder. Wax does not exhibit its releasing ability if the wax is compatible with a toner binder. Wax exhibits its releasing ability and improves releasing ability of toner when the wax stays within a toner binder as incompatible domain particles. If a diameter of domain particles is excessively large, the resulting toner may not yield images with good quality. This is because a ratio of wax occurring in a surface portion of a toner with respect to other components of the toner increases with an increasing diameter thereof. The toner particles aggregate to impair fluidity of the toner. Moreover, filming occurs where the wax migrates to a carrier or a photoconductor during long-term use. Color reproducibility and clearness of an image are impaired in the case of color toners. On the contrary, if a diameter of the domain particles is excessively small, the wax is excessively finely dispersed so that sufficient releasing ability cannot be obtained. Although it is necessary to control a diameter of wax as mentioned above, an appropriate method thereof has not been found yet. For example, in the case of toners manufactured by pulverization, control of wax diameter largely relies upon shear force of mixing during melting and kneading procedures. Polyester resins conventionally used for a toner binder have a low viscosity, and sufficient shear force cannot be added thereto. It is very difficult to control distribution of wax and to obtain a suitable diameter especially for these toners. Another problem of pulverization is that more wax is exposed from a surface of toner, since a toner material article tends to broken at portions where the wax occur as a result of pulverization, and such broken portions of the wax constitute surfaces of the toner particles.
Particle Diameter and Shape
Although improvement of toners has been attempted by miniaturize a diameter of toner particle or narrowing particle diameter distribution of toner in order to obtain high quality images, uniform particle shape cannot be obtained by ordinary manufacturing methods of kneading and pulverization. Moreover, the toner is still pulverized so that excessively fine toner particles are generated, in a course of mixing with carrier in a developing member of the apparatus, or, by a contact stress between a development roller, and a toner applying roller, a layer thickness controlling blade, or a friction charging blade. These lead to deterioration of image quality. In addition, a superplasticizer embedded in the surface of toner also leads to deterioration of image quality. Further, fluidity of the toner particles is insufficient because of their shapes, and thus a large amount of the superplasticizer is required or a packing fraction of the toner into a toner vessel becomes low. These factors inhibit miniaturization of apparatuses.
A process for transferring, in which an image formed by a multicolor toner is transferred to a recording medium or a sheet of paper, becomes more and more complicated in order to form full-color images. When toners having non-uniform particle shapes such as pulverized toners are used in such a complicated transferring process, missing portions can be found in the transferred image or an amount of the toner consumption becomes large to cover the missing portions in the transferred image. This is due to the impaired transferring ability caused by non-uniform shapes of the toner particles.
Accordingly, a strong demand has arisen to yield high quality images which do not have any missing part and to reduce running cost by further improving transfer efficiency leading to a reduction in toner consumption. If transfer efficiency is remarkably excellent, a cleaner, which removes remained toner on a photoconductor or a transfer after transferring, can be omitted from an apparatus. Therefore, the apparatus can be miniaturized and low cost thereof can be achieved together with having a merit of reducing a waste toner. Hence, various methods for manufacturing a spherical toner have been suggested in order to overcome the defects caused by a non-uniformly shaped toner.
Conventional Attempts to Solve the Problems
Various investigations have been done to improve properties of toner. For example, a releasing agent (wax) having a low melting point, such as a polyolefin, is added to a toner in order to improve image-fixing properties at low temperatures and offset resistance.
JP-A Nos. 06-295093, 07-84401, and 09-258471 disclose toners that contain a wax having a specific endothermic peak determined by DSC (differential scanning calorimetry). However, the toners disclosed in the above patent publications still need to improve image-fixing properties at low temperatures, offset resistance and also developing properties.
JP-A Nos. 05-341577, 06-123999, 06-230600, 06-295093, and 06-324514 disclose candelilla wax, higher fatty acid wax, higher alcohol wax, vegetable naturally occurring wax (carnauba wax and rice wax), and montan ester wax as a releasing agent of toner. However, the toners disclosed in the above patent publications still need to improve developing properties (charging ability) and durability. If the releasing agent having a low softening point is added to a toner, fluidity of the toner is decreased hence developing properties or transferring ability is also decreased. Moreover, charging ability, durability and storability of the toner may be deteriorated thereby.
JP-A Nos. 11-258934, 11-258935, 04-299357, 04-337737, 06-208244, and 07-281478 disclose toners which contain two or more releasing agents in order to enlarge a fixing region (non offset region). However, the releasing agents are not dispersed sufficiently uniformly in these toners.
JP-A No. 08-166686 discloses a toner which contains polyester resin and two types of offset inhibitors having different acid values and softening points. However, the toner is still insufficient in developing properties.
JP-A Nos. 8-328293, and 10-161335 each disclose a toner that specifies a dispersion diameter of wax within the toner particle. However, the resulting toner may not exhibit sufficient releasing ability during fixing since a condition or positioning of the dispersed wax is not defined in the toner particle.
JP-A No. 2001-305782 discloses a toner in which spherical wax particles are fixed onto the surface of toner. However, the wax particles positioned on the surface of toner decreases fluidity of the toner and thus developing properties or transferring ability of the toner is also decreased. In addition, charging ability, durability, and storability of the toner may also be adversely affected.
JP-A No. 2002-6541 discloses a toner in which wax is included in the toner particle and the wax is located in a surface portion of the toner particle. However, the toner may be insufficient in all of offset resistance, storability, and durability.
Generally, a toner is manufactured by methods of kneading pulverization in which a thermoplastic resin is melted and mixed together with a colorant, and a releasing agent or a charge control agent may be further added according to necessity to form a mixture, and the mixture is pulverized and classified. Further, inorganic or organic fine particles may be added onto the surface of toner particle in order to improve fluidity or cleaning ability. In conventional methods of kneading pulverization, a shape and surface structure of toner particle are not uniform. Although depending on crushability of materials and conditions of pulverizing step, it is not easy to control a shape and surface structure of toner particle arbitrarily. In addition, a particle diameter distribution of a toner cannot be significantly further narrowed, due to limited classifying performance and an increased cost thereby. Regarding a pulverized toner, it is a great task to control an average particle diameter of toner particle to a small particle diameter, especially 6 μm or less, from the viewpoint of yield, productivity and cost.
Objects and Advantages
Accordingly, an object of the present invention is to provide a dry toner, which has improved image-fixing properties at low temperatures and offset resistance with low electric power consumption, forms a high quality toner image, and has an excellent long-term storability.
Another object of the present invention is to provide a dry toner, which has stable charging ability and can always yield a high-quality image with high resolution.
The present inventors has accomplished the present invention based on intensive investigations to develop a dry toner which does not require an application of oil to a heat roller, has excellent image-fixing properties at low temperatures, hot offset resistance, and heat-resistant storability, exhibits stable charging ability and can always form a high-quality image with high resolution. Especially, the investigations have been made for improving a toner which has excellent particle fluidity and transfer ability in the case of a toner having a small particle diameter. |
1. Introduction {#sec1}
===============
Thiosemicarbazones and their metal complexes have received considerable attention in chemistry and biology, primarily because of their marked and various biological properties \[[@B1]--[@B3]\]. The pharmacological profiles of 2-formyl, 2-acetyl, and 2-benzoylpyridine thiosemicarbazones have been investigated \[[@B4]\]. Seena and Kurup \[[@B5]\] have synthesized and characterized dioxomolybdenum(IV) complexes with 2-hydroxyacetophenone-*N*(4)-cyclohexyl and *N*(4)-phenyl thiosemicarbazone which suggested that the Mo(IV) complex is pentacoordinated \[[@B5]\]. For the past few years, studies of the coordination chemistry of thiosemicarbazone involved complexes with transition metal ions \[[@B6]--[@B8]\]. Organotin(IV) complexes have been the subject of interest for some time because of their biomedical and commercial applications including *in vitro* and *in vivo* antitumor activity \[[@B9], [@B10]\]. Many organotin(IV) complexes have been found to be as effective as or even better than traditional anticancer drugs \[[@B11]--[@B14]\]. Organotin(IV) chelates with nitrogen, sulfur, and oxygen donor ligands have gained attention during the last few years \[[@B15]\]. The coordination chemistry of tin is extensive with various geometries and coordination numbers known for both inorganic and organometallic complexes \[[@B16], [@B17]\]. In our previous work, we have reported some new organotin(IV) complexes with heterocyclic-*N*(4)-cyclohexylthiosemicarbazone ligands \[[@B18], [@B19]\]. The results revealed that thiosemicarbazones derived from 2-benzoylpyridine and 2-acetylpyrazine and their tin(IV)/organotin(IV) complexes have been characterized by different spectroscopic techniques. From the literature survey, the studies on the organotin(IV) complexes derived from substituted thiosemicarbazone ligands containing ONS-donor atoms are still lacking. To the best of our knowledge, there was no report on the organotin(IV) complexes of the 2-hydroxyacetophenone-2-methylphenylthiosemicarbazone. In this view, we have synthesized a series of organotin(IV) complexes with 2-hydroxyacetophenone-2-methylphenylthiosemicarbazone. These complexes have been characterized by elemental analysis, ^1^H, ^13^C, and ^119^Sn NMR spectroscopy. X-ray crystal structure of 2-hydroxyacetophenone-2-methylphenylthiosemicarbazone (**1**) is also described. Their biological activity data has also been reported.
2. Experimental {#sec2}
===============
2.1. Materials and Methods {#sec2.1}
--------------------------
All reagents were purchased from Fluka, Aldrich, and JT Baker. All solvents were purified according to standard procedures \[[@B20]\]. UV-Vis spectra were recorded in CHCl~3~ solution with a Perkin Elmer Lambda 25 UV-Visible spectrometer. Infrared spectra were recorded on KBr discs using a Perkin Elmer Spectrum GX Fourier-Transform spectrometer in the range 4000--370 cm^−1^ at room temperature. ^1^H, ^13^C, and ^119^Sn NMR spectra were recorded on a JEOL 500 MHz-NMR spectrometer; chemical shifts were given in ppm relative to SiMe~4~ and SnMe~4~ in CDCl~3~ solvent. CHN analyses were obtained with a Flash EA 1112 series CHN elemental analyzer. Molar conductivity measurements were carried out with Jenway 4510 conductivity meter using DMF solvent mode.
2.2. Synthesis of 2-Hydroxyacetophenone-2-Methylphenylthiosemicarbazone (H~2~dampt) **(1)** {#sec2.2}
-------------------------------------------------------------------------------------------
The 2-methylphenylisothiocyanate (0.746 g, 5 mmol) and hydrazine hydrate (0.253 g, 5 mmol), each dissolved in 10 mL ethanol, were mixed with constant stirring. The stirring was continued for 30 min and the white product, 2-methylphenylthiosemicarbazide, formed was washed with ethanol and dried *in vacuo*. A solution of the isolated 2-methylphenylthiosemicarbazide (0.540 g, 3 mmol) in 10 mL methanol was then refluxed with a methanolic solution of 2-hydroxyacetophenone (0.408 g, 3 mmol) for 5 h after adding 1-2 drops of glacial acetic acid ([Scheme 1](#sch1){ref-type="fig"}). On cooling the solution to room temperature, light-yellow microcrystals were separated and washed with methanol. The microcrystals were recrystallized from methanol and dried *in vacuo* over silica gel. Yield: 0.74 g, 78%: M.p.: 178--180°C: UV-Visible (CHCl~3~) *λ* ~max/nm~: 226, 318, 359: FT-IR (KBr disc, cm^−1^) *ν* ~max~: 3175 (s, OH), 3000 (s, NH), 1583 (m, C=N), 1298 (m, C--O), 943 (m, N--N), 1371, 861 (w, C=S). ^1^H NMR (CDCl~3~) *δ*: 10.82 (s, 1H, OH), 9.02 (s, 1H, N--H), 7.31--7.25 (m, 8H, phenyl ring), 2.56 (s, 3H, N=C--CH~3~), 2.29 (s, 3H, CH~3~), 1.19 (s, 1H, SH). ^13^C NMR (CDCl~3~) *δ*: 185.20 (NH--C=S), 165.32 (C=N), 145.30--136.21 (aromatic ring), 10.45 (CH~3~). Anal. Calc. for C~16~H~17~N~3~OS: C, 64.21; H, 5.73; N, 14.04%. Found: C, 64.17; H, 5.67; N, 14.01%.
2.3. Synthesis of \[MeSnCl(dampt)\] **(2)** {#sec2.3}
-------------------------------------------
H~2~dampt (0.299 g, 1.0 mmol) was dissolved in absolute methanol (10 mL) in a Schlenk round bottom flask under a nitrogen atmosphere. Then, a methanolic solution of methyltin(IV) trichloride (0.24 g, 1.0 mmol) was added dropwise. The resulting reaction mixture was refluxed for 4 h ([Scheme 2](#sch2){ref-type="fig"}) and cooled to room temperature. The microcrystals were filtered off, washed with a small amount of cold methanol, and dried *in vacuo* over silica gel. Yield: 0.41 g, 76 %: Mp.: 222--224°C: Molar conductance (DMF) Ω^-1 ^cm^2^ mol^−1^: 7.1: UV-Visible (CHCl~3~) *λ* ~max/nm~: 262, 328, 367, 384: FT-IR (KBr, cm^−1^) *ν* ~max~: 3378 (s, NH), 1595 (m, C=N--N=C), 1268 (m, C--O), 1026 (w, N--N), 1306, 822 (m, C--S), 612 (w, Sn--C), 570 (w, Sn--O), 449 (w, Sn--N). ^1^H NMR (CDCl~3,~ ^2^J\[^119^Sn, ^1^H\]) *δ*: 9.08 (s, 1H, N--H), 7.26--6.94 (m, 8H, phenyl ring), 2.95 (s, 3H, N=C--CH~3~), 2.30 (s, 3H, CH~3~), 1.09 (s, 3H, Sn--CH~3~), \[74.4 Hz\]. ^13^C NMR (CDCl~3~) *δ*: 180.55 (N=C--S), 170.88 (C=N), 144.35--135.60 (aromatic ring), 18.70 (CH~3~), 12.80 (Sn--CH~3~). ^119^Sn NMR (CDCl~3~) *δ*: −168.5. Anal. Calc. for C~17~H~18~N~3~SOSnCl: C, 43.76; H, 3.88; N, 9.00%. Found: C, 43.71; H, 3.82; N, 8.95%.
The other complexes (**3--6**) were synthesized using a similar procedure to organotin(IV) complex (**2**) using appropriate organotin(IV) chloride(s) ([Scheme 2](#sch2){ref-type="fig"}).
2.4. Synthesis of \[BuSnCl(dampt)\] **(3)** {#sec2.4}
-------------------------------------------
Yield: 0.43 g, 74%: Mp.: 226--228°C: Molar conductance (DMF) Ω^-1 ^cm^2^ mol^−1^: 9.1: UV-Visible (CHCl~3~) *λ* ~max/nm~: 262, 328, 382, 397: FT-IR (KBr, cm^−1^) *ν* ~max~: 3374 (s, NH), 1599 (m, C=N--N=C), 1254 (m, C--O), 1014 (w, N--N), 1299, 835 (m, C--S), 605 (w, Sn--C), 568 (w, Sn--O), 443 (w, Sn--N). ^1^H NMR (CDCl~3~) *δ*: 9.07 (s, 1H, N--H), 7.25--7.97 (m, 8H, phenyl ring), 2.62 (s, 3H, N=C--CH~3~), 2.30 (s, 3H, CH~3~), 2.28--2.15 (t, 2H, Sn--CH~2~--CH~2~--CH~2~--CH~3~), 2.14--1.73 (m, 2H, Sn--CH~2~--CH~2~--CH~2~--CH~3~), 1.24--1.22 (m, 2H, Sn--CH~2~--CH~2~--CH~2~--CH~3~), 0.99--0.86 (t, 3H, Sn--CH~2~--CH~2~--CH~2~--CH~3~). ^13^C NMR (CDCl~3~) *δ*: 178.99 (N=C--S), 168.36 (C=N), 145.20--136.22 (aromatic ring), 32.78, 26.31, 24.18, 20.11 (Sn--CH~2~--CH~2~--CH~2~--CH~3~), 16.44 (CH~3~). ^119^Sn NMR (CDCl~3~) *δ*: −149.6. Anal. Calc. for C~20~H~24~N~3~SOSnCl: C, 45.10; H, 4.54; N, 7.88%. Found: C, 45.00; H, 4.51; N, 7.81%.
2.5. Synthesis of \[PhSnCl(dampt)\] **(4)** {#sec2.5}
-------------------------------------------
Yield: 0.48 g, 79%: Mp.: 218--220°C: Molar conductance (DMF) Ω^-1 ^cm^2^ mol^−1^: 3.11: UV-Visible (CHCl~3~) *λ* ~max/nm~: 263, 335, 381, 410: FT-IR (KBr, cm^−1^) *ν* ~max~: 3184 (s, NH), 1598 (m, C=N--N=C), 1240 (m, C--O), 1035 (w, N--N), 1300, 838 (m, C--S), 601 (w, Sn--C), 522 (w, Sn--O), 471 (w, Sn--N). ^1^H NMR (CDCl~3~) *δ*: 9.01 (s, 1H, N--H), 7.24-6.95 (m, 13H, phenyl ring), 2.76 (s, 3H, N=C--CH~3~), 2.29 (s, 3H, CH~3~). ^13^C NMR (CDCl~3~) *δ*: 180.12 (N=C--S), 173.97 (C=N), 144.84--136.60 (aromatic ring), 16.88 (CH~3~). ^119^Sn NMR (CDCl~3~) *δ*: −174.73. Anal. Calc. for C~22~H~20~N~3~SOSnCl: C, 49.98; H, 3.81; N, 7.94%. Found: C, 48.92; H, 3.77; N, 7.90%.
2.6. Synthesis of \[Me~2~Sn(dampt)\] **(5)** {#sec2.6}
--------------------------------------------
Yield: 0.41 g, 78%: Mp.: 210--212°C: Molar conductance (DMF) Ω^−1 ^cm^2^ mol^−1^: 5.2: UV-Visible (CHCl~3~) *λ* ~max/nm~: 266, 338, 378, 414: FT-IR (KBr, cm^−1^) *ν* ~max~: 3320 (s, NH), 1605 (m, C=N--N=C), 1252 (m, C--O), 1036 (w, N--N), 1300, 832 (m, C--S), 603 (w, Sn--C), 523 (w, Sn--O), 499 (w, Sn--N). ^1^H NMR (CDCl~3,~ ^2^J\[^119^Sn, ^1^H\]) *δ*: 9.08 (*s*, 1H, N--H), 7.26--6.94 (m, 8H, phenyl ring), 2.98 (s, 3H, N=C--CH~3~), 2.30 (s, 3H, CH~3~), 0.98 (s, 3H, Sn--CH~3~), \[77.5 Hz\]. ^13^C NMR (CDCl~3,~\[^1^J (^13^C--^119^Sn\]) *δ*: 181.10 (N=C--S), 178.45 (C=N), 145.68--137.20 (aromatic ring), 17.5 (CH~3~), 14.97 (Sn--CH~3~) \[557 Hz\]. ^119^Sn NMR (CDCl~3~) *δ*: −182.45. Anal. Calc. for C~18~H~21~N~3~SOSn: C, 48.54; H, 4.74; N, 9.41%. Found: C, 48.50; H, 4.71 N, 9.38%.
2.7. Synthesis of \[Ph~2~Sn(dampt)\] **(6)** {#sec2.7}
--------------------------------------------
Yield: 0.48 g, 75%: Mp.: 258--260°C: Molar conductance (DMF) Ω^−1 ^cm^2^ mol^−1^: 8.17: UV-Visible (CHCl~3~) *λ* ~max/nm~: 268, 327, 373, 402: FT-IR (KBr, cm^−1^) *ν* ~max~: 3383 (s, NH), 1592 (m, C=N--N=C), 1265 (m, C--O), 1039 (w, N--N), 1307, 821 (m, C--S), 601 (w, Sn--C), 570 (w, Sn--O), 448 (w, Sn--N). ^1^H NMR (CDCl~3~) *δ*: 9.02 (*s*, 1H, N--H), 7.30--6.97 (m, 13H, phenyl ring), 2.67 (s, 3H, N=C--CH~3~), 2.29 (s, 3H, CH~3~). ^13^C NMR (CDCl~3,~\[^1^J (^13^C--^119^Sn\]) *δ*: 179.98 (N=C--S), 171.75 (C=N), 142.20--138.21 (aromatic ring), 15.88 (CH~3~) \[546 Hz\].^119^Sn NMR (CDCl~3~) *δ*: −185.32. Anal. Calc. for C~28~H~25~N~3~SOSn: C, 58.97; H, 4.41; N, 7.36%. Found: C, 58.92; H, 4.38; N, 7.30%.
2.8. Antibacterial Test {#sec2.8}
-----------------------
The synthesized ligand (**1**) and its organotin(IV) complexes (**2--6**) were screened *in vitro* for their antibacterial activity against *Staphylococcus aureus*, *Enterobacter aerogenes, Escherichia coli,* and *Salmonella typhi* bacterial strains using agar-well diffusion method \[[@B21]\]. Wells (size of well 6 mm in diameter) were dug in the media with the help of a sterile metallic borer with centers at least 24 mm. Eight-hour old bacterial inoculums containing 10^4^--10^6^ colony-forming units (CFU)/mL were spread on the surface of the nutrient agar using a sterile cotton swab. Recommended concentration of the test sample (200 mg/mL in DMSO) was introduced in the respective wells. Other wells supplemented with DMSO and reference drug (doxycycline) served as negative and positive controls, respectively. The plates were incubated immediately at 37°C for 20 h. Activity was determined by measuring the diameter of zones showing complete inhibition (mm). Growth inhibition was calculated with reference to the positive control.
3. Results and Discussion {#sec3}
=========================
3.1. Synthesis {#sec3.1}
--------------
2-Hydroxyacetophenone-2-methylphenylthiosemicarbazone (H~2~dampt) was synthesized by the condensation reaction of 2-hydroxyacetophenone and 2-methylphenylthiosemicarbazide in absolute methanol in 1 : 1 mole ratio. It has two tautomers within the structure, existing as either thione or thiol tautomer ([Scheme 1](#sch1){ref-type="fig"}). The present organotin(IV) complexes (**2--6**) were obtained by direct reaction of organotin(IV) chloride(s) and H~2~dampt (**1**) in absolute methanol under N~2~ atmosphere ([Scheme 2](#sch2){ref-type="fig"}). The physical properties and analytical data of H~2~dampt (**1**) and its organotin(IV) complexes (**2--6**) are given in the experimental section. All complexes (**2--6**) were stable under N~2~ atmosphere and soluble in CHCl~3~, CH~2~Cl~2~, DMF, DMSO, and MeCN solvents except methanol, ethanol, hexane, pentane, THF, and ether. The molar conductances values of the complexes (**2--6**) are 9.1--3.1 Ω^−1 ^cm^2^ mol^−1^, respectively, indicate that the complexes behave as nonelectrolytes \[[@B22]\].
3.2. UV-Visible Spectra {#sec3.2}
-----------------------
The UV-Vis spectra of ligand (**1**) and its organotin(IV) complexes (**2--6**) were carried out in CHCl~3~ (1 × 10^−4^ mol L^−1^) at room temperature. The free ligand (**1**) exhibited three absorption bands at 262, 318, and 359 nm assigned to the HOMO/LUMO transition of phenolic group, azomethine, and thiolate function, respectively \[[@B23]\]. After complexation, the UV-Vis spectra of the complexes (**2--6**) exhibited four absorption bands in the region at 262--268, 327--338, 367--382, and 384--414 nm, respectively. In the electronic spectra of the complexes (**2--6**), the intraligand transition is shifted to higher wavelength as a result of coordination. In the spectra of organotin(IV) complexes (**2--6**), one new absorption band appeared at 384--414 nm which is assigned to the ligand→metal charge transfer (LMCT) \[[@B24]\]. The shift of the *λ* ~max~ band from the ligand to the complex is supported by the coordination of ligand (**1**) to the tin(IV) ion.
3.3. IR Spectra {#sec3.3}
---------------
The IR spectrum of free ligand (**1**) showed absorption bands at 3175 and 3000 cm^−1^, which are due to the stretching vibrations of the OH and NH groups, respectively. The absorption bands at 1583, 1298, 943, and 1371, 861 cm^−1^are due to *ν*(C=N), *ν*(C--O), *ν*(N--N), and *ν*(C=S), respectively. Several significant changes with respect to the free ligand (**1**) bands on complexation suggest coordination through phenolic group, azomethine, and sulfur of the thiolic form of the ligand. The strong stretching band at 3375 cm^−1^ that corresponds to the *ν*(OH) group in the spectrum of ligand (**1**) has disappeared in the spectra of complexes (**2--6**) due to the deprotonation, indicating coordination through the phenolic oxygen to tin(IV) atom. The free ligand (**1**) showed a band at 1298 cm^−1^ which is due to *ν*(C--O). This band is shifted to lower wave numbers at 1240--1268 cm^−1^ in the complexes (**2--6**), indicating the coordination of O^−^ to the tin(IV) atom \[[@B25]\]. The newly formed *ν*(C=N--N=C) bond showed medium-to-strong absorption peaks in the range at 1592--1605 cm^--1^ in the spectra of the complexes (**2--6**), indicating coordination of azomethine nitrogen to tin(IV) atom \[[@B26]\]. A sharp band at 943 cm^−1^ is due to *ν*(N--N) for ligand (**1**) is shifted to higher frequencies at 1014--1039 cm^−1^ in the spectra of organotin(IV) complexes ((**2--6).** The increase in the frequency of this band in the spectra of complexes (**2--6**) due to an increase in the bond length again confirms coordination *via* the azomethine nitrogen atom \[[@B27]\]. The bands at 1371 and 861 cm^−1^ in the free ligand (**1**) due to *ν*(C=S) stretching vibrations are shifted to lower frequencies at 1299--1307 cm^--1^ and 821--838 cm^−1^ in the spectra of the complexes (2--6), suggesting coordination through the thiolate sulfur with tin(IV) atom \[[@B28]\]. The IR bands observed in the range at 570--522 cm^--1^ in the spectra of the complexes (**2--6**) suggest the presence of Sn--O bonding in their structure. The *ν*(Sn--C) and *ν*(Sn--N) bands are tentatively assigned to absorptions in the regions 612--601 cm^--1^ and 443--499 cm^--1^, respectively. Based on the infrared spectra analyses of ligand (**1**) and its organotin(IV) complexes (**2--6**), it was suggested that ligand (**1**) was coordinated to the tin(IV) core through the phenoxide-O, azomethine-N, and thiolato-S atoms.
3.4. ^1^H NMR Spectra {#sec3.4}
---------------------
^1^H NMR spectrum of free ligand (**1**) showed resonance signals at 10.82, 9.02, 7.31--7.25, 2.56, 2.29, and 1.19 ppm are due to OH, NH, phenyl ring protons, N=C--CH~3~, CH~3~, and SH, respectively. After complexation, the resonance signal of OH proton was absent in the spectra of the complexes (**2--6**), indicating deprotonation of the phenolic proton and supported the phenolic oxygen atom was coordinated with tin(IV) atom. The resonance signal of SH is not found in the spectra of complexes (**2--6**) which suggested the deprotonation of the SH proton and confirming that the ligand coordinated to the tin(IV) in the thiolate form. The azomethine proton (N=C--CH~3~) signal appears at 2.56 ppm in the free ligand (**1**) which is shifted to high frequency at 2.98--2.62 ppm in the complexes (**2--6**), supporting the coordination of azomethine nitrogen to the central tin(IV) atom. The resonance signals for the protons of phenyl moiety of the ligand (**1**) were observed at 7.31--7.25 ppm, which is shifted to low frequency at 7.30--6.94 ppm in the complexes (**2--6**). This is due to the electron withdrawal tendency from the aromatic ring owing to coordination with tin(IV). The methyl group attached to the tin(IV) in complexes 2 and 5 gave a singlet at 1.09 and 0.98 ppm with ^2^J\[^119^Sn,^1^H\] coupling constant value equal to 74.4 and 77.5 Hz, respectively, supporting the five-coordinate environment around tin(IV) \[[@B29]\]. The three butyl groups attached to the tin(IV) moity in the organotin(IV) complex 3 gave four resonance signals, namely, 2.28--2.15 ppm (triplet, Sn--CH~2~--CH~2~--CH~2~--CH~3~), 2.14--1.73 ppm (multiplet, Sn--CH~2~--CH~2~--CH~2~--CH~3~), 1.24--1.22 ppm (multiplet, Sn--CH~2~--CH~2~--CH~2~--CH~3~), and 0.99--0.86 ppm (triplet, Sn--CH~2~--CH~2~--CH~2~--CH~3~). ^1^H NMR information also supported the IR data of the complexes (**2--6**).
3.5. ^13^C NMR Spectra {#sec3.5}
----------------------
The ^13^C-{^1^H} NMR spectrum of free ligand (**1**) showed the resonance signals at 185.20, 165.32, 145.30--136.21, and 10.45 ppm are due to the *δ*(NH--C=S), *δ*(C=N), *δ* (aromatic ring carbon) and *δ*(CH~3~), respectively. After complexation, the carbon signals of the N=C--S group shifted to low frequency at 179.99--181.10 ppm in all the complexes (**2--6**) compared to ligand (**1**), indicating participation of the N=C--S group in coordination to tin(IV) atom. The chemical shifts of carbon in C=N and CH~3~ in the free ligand (**1**) were observed at 165.32 and 10.45 ppm which were shifted to high frequency at 168.36--178.45 and 16.44--18.70 ppm, respectively, in the complexes (**2--6**). This results supported the azomethine-N is coordinated to the tin(IV) atom \[[@B30]\]. After complexation, the *δ* value of carbon atoms in the aromatic ring did not have much change in the complexes (**2--6**) as compared to the free ligand. Besides, the butyl group attached to the organotin(IV) moiety in complex 3 gave four resonance signals at 32.78, 26.31, 24.18, and 20.11 ppm. In the ^13^C-{^1^H} NMR spectra of the organotin(IV) complexes **2** and **5**, a sharp singlet resonance signal appeared at 12.80 ppm \[(Sn--CH~3~)\] and 14.97 \[Sn--(CH~3~)~2~\] ppm, respectively \[[@B31]\]. In organotin(IV) compounds, the ^1^J\[^119^Sn, ^13^C\] value is an important parameter to assess the coordination number of the Sn atom. The calculated coupling constants for dimethyltin(IV) (4) and diphenyltin(IV) (5) compounds were found to be 557 and 546 Hz, which described the penta-coordinate environment about the Sn atom in these compounds \[[@B32]\]. All these statements are also supported by the ^1^H NMR spectra analyses.
3.6. ^119^Sn NMR Spectra {#sec3.6}
------------------------
^119^Sn NMR spectra can be used as an indicator of the coordination number of the tin atom. ^119^Sn NMR of all the complexes (**2--6**) shows only one resonance signals in the range of −149.60 to −185.32 ppm. ^119^Sn NMR values are characteristic for the five-coordinated tin atom observed in the organotin(IV) complexes (**2--6**) \[[@B33]--[@B36]\].
3.7. X-Ray Crystallography Diffraction Analysis {#sec3.7}
-----------------------------------------------
The molecular structure of the ligand (**1**) with atom numbering scheme is depicted in [Figure 1](#fig1){ref-type="fig"}. The main crystal parameters are reported in [Table 1](#tab1){ref-type="table"}. Selected bond lengths and bond angles are given in [Table 2](#tab2){ref-type="table"}. The compound crystallizes into monoclinic crystal system with a space group of *P*2~1~/c. In the title substituted thiosemicarbazone, C~16~H~17~N~3~OS, the hydroxy- and methyl-substituted benzene rings form dihedral angles of 9.62 (12) and 55.69 (6)°, respectively, with the central CN3S chromophore (r.m.s. deviation = 0.0117 Å) in (C~16~H~17~N~3~OS) ([Figure 1](#fig1){ref-type="fig"}) and the OH-- and Me-benzene rings are twisted as seen in the respective dihedral angles of 9.62 (12) and 55.69 (6)°. The almost coplanarity of the central atoms is ascribed to the formation of an intramolecular hydroxyl-O--H···N-imine hydrogen bond ([Table 3](#tab3){ref-type="table"}). The N1--N2 bond length (1.375 Å) is closer to single bond length (1.45 Å) than to double bond length (1.25 Å) \[[@B37]\]. The C9--S1 bond distance (1.694 Å) is close to that expected of a C=S double bond (1.60 Å) \[[@B37]\] and the C7--N1 bond length (1.295 Å) is nearly the same as that of the C=N double bond (1.28 Å) \[[@B38]\]. These bond distances are in strong support of the existence of 2-hydroxyacetophenone-2-methylphenylthiosemicarbazo in the thione form in the solid state. The H atoms of the NH groups are *syn*, and the conformation about the N1=C7 double bond \[1.295 (4) Å\] is *E*. The *syn*arrangement in (C~16~H~17~N~3~OS)) contrast the *anti*arrangement often seen in such derivatives but is readily explained in terms of the intramolecular O--H···N-imine hydrogen bond in (C~16~H~17~N~3~OS)) by contrast to the normally observed intramolecular N--H···N-imine hydrogen bond \[[@B39], [@B40]\]. Helical supramolecular chains along the *b* axis dominate the crystal packing ([Figure 2](#fig2){ref-type="fig"} and [Table 3](#tab3){ref-type="table"}). These arise as a result of the thione-S interacting with both N--H atoms of a neighboring molecule thereby forming six-membered hydrogen-bond-mediated rings.
3.8. Antibacterial Activity {#sec3.8}
---------------------------
The synthesized ligand (**1**) and its organotin(IV) complexes (**2--6**) were tested against *Escherichia coli*, *Staphylococcus aureus*, *Enterobacter aerogenes,* and *Salmonella typhi* bacterial strains for their antibacterial activity using agar-well diffusion method and data are shown in [Table 4](#tab4){ref-type="table"} and [Figure 3](#fig3){ref-type="fig"}. The doxycycline was used as a reference drug. The results showed that the substituted thiosemicarbazone ligand (**1**) possessed moderate antibacterial activity. The antibacterial studies of the compounds (**2--6**) showed relatively better activity against the selected bacteria than the free ligand (**1**), but low activities as compared to the reference drug. Among all the organotin(IV) derivatives, the bactericidal activities of **5** and **6** are fairly good. Complex **2** is the least active among all the organotin(IV) complexes, while complex **4** was found to be active against all the studied strains except *Staphylococcus aureus.*The most probable reason for this difference might be due to chelation which reduces the polarity of the central Sn atom because of the partial sharing of its positive charge with donor groups and possible *π*-electron delocalization within the whole chelating ring. As a result, the lipophilic nature of the central Sn atom increases, which favours the permeation of the complexes through the lipid layer of the cell membrane \[[@B41]\]. In addition, among the organotin(IV) complexes (**2--6**), complex (**6**) is found to be more active and it can be attributed to the presence of bulky phenyl groups which facilate binding to biological molecules *π*-*π* interactions.
4. Conclusion {#sec4}
=============
The ligand (**1**) and its organotin(IV) complexes (**2--6**) have been synthesized and fully characterized by different spectroscopic techniques. The ligand (H~2~dampt) exists in thione form in a solid state but it takes on a thiol form when it is in solution. All organotin(IV) complexes (**2--6**) of H~2~dampt were proposed to be five coordinated and the ligand binds to the central tin(IV) atom in dinegative tridentate form. Single crystal X-ray analysis of newly synthesized ligand (**1**) has been reported. The *in vitro*antibacterial activities of the synthesized complexes against the selected bacterial strains have been established. All compounds have been found biologically active, while the studies have confirmed that compounds **5** and **6** are more active and have the potency to be used as antibacterial agents. Trials to obtain single crystals suitable for structure determination by X-ray crystallography were in vain due to the amorphous nature of the complexes.
This work was financially supported by the Ministry of Science Technology and Innovation (MOSTI) under a Research Grant (no. 06-01-09-SF0046). The authors would like to thank Universiti Malaysia Sarawak (UNIMAS) for the facilities to carry out the research work.
{#sch1}
{#sch2}
{#fig1}
{#fig2}
{#fig3}
######
Summary of crystal data and structure refinement parameters for ligand (1).
Compound H~2~dampt (**1**)
------------------------------------- -------------------------------------
Empirical formula C~16~H~17~N~3~OS
Formula weight 299.39
Temperature (K) 100 (2)
Wavelength (Å) 0.71073
Crystal system Monoclinic
Space group *P*2~1~/c
Unit cell dimensions
a (Å) 14.6966(8)
b (Å) 7.3586(4)
c (Å) 14.0926(8)
*α* (°) 90.00
*β* (°) 94.358(5)
*γ* (°) 90.00
Volume (Å^3^) 1519.66(15)
Z 4
Calculated density (mg/m3) 1.309
Radiation type *λ* (Å) Mo K∖a
F (000) 632
Crystal size (mm) 0.30 × 0.1 × 0.05
Crystal colour Light-yellow
Scan range *θ* (°) 2.8--29.3
Absorption coefficient (*μ*) (mm-1) 0.225
Max. and min. transm 1.00 and 0.419
Goodness of fit on F2 0.995
Data/restrains/ parameters 3375/3/201
Final R indices \[I \> 2*σ*(I)\] *R* ~1~ = 0.0599, *wR* ~2~ = 0.1324
R indices (all data) *R* ~1~ = 0.110, *wR* ~2~ = 0.1738
######
Selected bond lengths (Å) and bond angles (°) of ligand \[H~2~dampt\] (**1**).
Bond lengths (Å)
------------------ ----------- ------------ -----------
S1--C9 1.694 (3) O1--C1 1.357 (4)
N1--C7 1.295 (4) N1--N2 1.375 (3)
N2--C9 1.352 (4) N3--C9 1.344 (3)
C7--C8 1.500 (4) C6--C7 1.473 (4)
Bond angles (°)
C7--N1--N2 119.0 (2) C9--N2--N1 120.6 (2)
C9--N3--C10 127.7 (2) N3--C9--N2 113.2 (2)
N3--C9--S1 124.3 (2) N2--C9--S1 122.4 (2)
O1--C1--C2 116.8 (3) O1--C1--C6 123.2 (3)
######
Hydrogen-bond geometry (Å, °)
*D-*H···*A* *D-*H H···*A* *D*···*A* *D-*H···*A*
--------------------------------------------------- ---------- ---------- ----------- -------------
O1--H1o···N1 0.84 (1) 1.81 (2) 2.551 (3) 145 (3)
N2--H2n···S1^i^ 0.88 (1) 2.51 (2) 3.323 (2) 154 (3)
N3--H3n···S1^i^ 0.88 (1) 2.49 (2) 3.286 (3) 151 (2)
C8--H8b···Cg1^i^ 0.98 2.59 3.501 (3) 155
Symmetry codes: *--x* + 1, *y +* 1/2, −*z* + 1/2.
######
Antibacterial activity^a,b^ of the free ligand (**1**) and its organotin(IV) complexes 2--6 (inhibition zone in mm).
Bacterium Clinical implication Zone of Inhibition (mm)
-------------------------- --------------------------------------------------------------------- ------------------------- ----- ---- ----- ---- ---- ----
*Escherichia coli* Infection of wounds, urinary tract, and dysentery 24 12 20 21 28 29 34
*Staphylococcus aureus* Food poisoning, scaled skin syndrome, endocarditis 14 22 24 --- 29 30 36
*Enterobacter aerogenes* Lower respiratory tract infections, skin and soft-tissue infections --- --- 20 22 20 22 26
*Salmonella typhi* Typhoid fever, localized infection 21 --- 14 23 23 27 31
^a^ *In vitro*, agar-well diffusion method, conc. 200 mg/mL of DMSO. ^b^Reference drug (R), doxycycline, dash indicate inactivity.
[^1]: Academic Editor: Virtudes Moreno
|
Neuroimaging and ADHD: fMRI, PET, DTI findings, and methodological limitations.
Attention deficit hyperactivity disorder (ADHD) is a neurodevelopmental disorder characterized by pervasive and developmentally inappropriate levels of inattention, impulsivity, and hyperactivity. There is no conclusive cause of ADHD although a number of etiologic theories have been advanced. Research across neuroanatomical, neurochemical, and genetic disciplines collectively support a physiological basis for ADHD and, within the past decade, the number of neuroimaging studies concerning ADHD has increased exponentially. The current selective review summarizes research findings concerning ADHD using functional magnetic resonance imaging (fMRI), positron emission tomography (PET), and diffusion tensor imaging (DTI). Although these technologies and studies offer promise in helping to better understand the physiologic underpinnings of ADHD, they are not without methodological problems, including inadequate sensitivity and specificity for psychiatric disorders. Consequently, neuroimaging technology, in its current state of development, should not be used to inform clinical practice. |
Bergen County Prosecutor Gurbir S. Grewal announced that fugitive from justice, JAMES S. NORTON (DOB: 4/13/1971, single, and unemployed) of 10 Leoswamp Road, Hogansburg, New York was extradited from Canada by the United States Marshals Service to face sentencing on a marijuana distribution charge. This offense is the result of a 2010 investigation conducted by members of the Bergen County Prosecutor's Office.
In 2010, James NORTON distributed approximately eighty pounds of marijuana to a detective of the Bergen County Prosecutor’s Office who was acting in an undercover capacity.
James NORTON was charged and pled guilty to one count of Distribution of Marijuana in a Quantity Greater than twenty-five pounds, N.J.S.A. 2C:35-5b(1), a 1st degree crime. After his guilty plea, NORTON became a fugitive from justice. He was later arrested and incarcerated in Canada on an unrelated charge.
On Thursday, January 11, 2018, Norton was returned to the United States with the assistance of the United States Marshals Service and remanded to the Bergen County Jail. He faces up to eight years in New Jersey State prison.
Prosecutor Grewal would like to thank the United States Marshals Service, the Bergen County Sheriff’s Office, and the United States Department of Justice Office of International Affairs for their assistance in extraditing NORTON from Canada to the Bergen County Jail. |
This isn’t an enthusiastic “yes, we will still rent games!” but it also isn’t a quick “no.”
My guess is that game rentals may still be a good idea for Netflix, as many Netflix customers already own videogame consoles (and use them to stream Netflix movies). But it’s possible the game-rental business isn’t worth it, either. |
' TEST_MODE : COMPILE_ONLY_FAIL
declare sub f overload( byval as byte ptr )
declare sub f overload( byval as short ptr )
dim as any ptr p
f( p )
|
Posted on 31 January 2017
This is a summary of the talk „A Pragmatic View of Reactive“ on ScalaDays Amsterdam. If you prefer watching a video, there’s a recording on YouTube. Or if you prefer German, there’s an even longer German version of this on Jaxenter.
The term reactive (as in reactive systems, or reactive architecture) is defined in the Reactive Manifesto. It describes systems that are so elastic and resilient that they are always responsive, and they achieve this through asynchronous message passing. Now this is a fine definition, but as manifestos go, it’s not a pragmatic guide for developers. When you attempt to build reactive systems coming from the world of Java web and enterprise development, you’ll stumble across some fundamental differences and might wish someone had told you earlier. Unless you read this blog post, of course, because I’m going to let you in on four things you should know.
1. You’ll be using a different concurrency model.
On the JVM, our basic concurrency model is the Thread . Why? We run on multi-threaded environments, and the JVM threads map to native threads, and that, at the time people came up with this, seemed a pretty good idea. Before multi-threading, there was multiple processes. But starting a new process for anything you want to do concurrently is rather heavyweight, plus you need Inter-Process Communication to exchange data between those processes. Threads were introduced as “light-weight processes” that have access to the same memory space, for easy data exchange. There are some problems with this, though.
First of all they are not that light-weight after all. Each thread you start will take 1MB of memory (that’s the default thread stack size on a 64 bit JVM). The maximum number of threads is limited by the operating system and may be your scalability bottleneck, for example if you need to handle thousands of HTTP requests concurrently. And the cost of switching between threads, the context switch, has become relatively high in modern multi-core CPUs with non-uniform memory access, compared to just executing the code of a running thread.
If this wasn’t enough, the shared memory programming model is also not exactly ideal. Concurrent programs with shared mutual state are prone to race conditions, which are notoriously hard to debug. Avoiding this by locking and synchronization can lead to deadlocks, or at least to contention that will hurt performance.
(Slide from John Rose’s presentation JVM Challenges)
So, as JVM architect John Rose said on JFokus 2014 - Threads are passé. Not that they are going away, but as an API for us developers, we need something else, something that gives us sub-thread level concurrency.
Examples for this are the Play web framework, the vert.x framework, the Akka actor toolkit, Project Reactor, and Lagom. All of these have in common that they multiplex tasks (depending on the framework named actions, verticles, actors..) on just a few threads, and thus get by with much fewer context switches. Akka also eliminates shared mutual state, by encapsulating state in actors that only communicate with immutable messages.
In contrast to this, the Servlet API from JEE is based on the thread-per-request model, where each request will grab a thread exclusively while being processed.
The reactive, sub-thread-concurrency of course scales much, much better - see for example “Why is Play so fast” for more background on this.
But just be aware of a pitfall: Some things you might be used to actually rely on thread-per-request. Everything that uses a ThreadLocal to store its data. ThreadLocal in reactive applications is definitely an anti-pattern, as every thread is shared by many tasks (actors, verticles..). slf4j’s MappedDiagnosticContext is an example for ThreadLocal usage, as are Spring Security or Hibernate. All this may not behave as you expect, so you need to let go of it and embrace truly reactive tools, or build workarounds.
You are going to use sub-thread level concurrency. Understand and embrace this.
2. You’ll be using asynchronous I/O (or if you keep using synchronous I/O, it’ll need special treatment).
What’s worse than using too many threads? Blocking threads by using synchronous I/O. In the JavaScript world asynchronous I/O is the standard. node.js showed how you can build efficient server applications running on just a single thread with purely asynchronous I/O. It makes use of the capabilities of modern hardware and operating systems, where I/O is handled by the respective controllers and does not need to use CPU threads.
You’re probably used to doing blocking I/O, using java.io.File , or some synchronous HTTP client. What happens there? While waiting for the result of the operation, the thread will be blocked. As explained in the previous section, a thread is a valuable resource, though. It could continue and do something else, instead of making the CPU switch to another thread. This is particularly bad when you are using a reactive architecture, which relies on the tasks to yield control after a short period of time, in order to achieve the desired effect that few threads handle many, many tasks. You certainly don’t want to block one of those threads - you’ll exhaust your thread pool quickly. So just use asynchronous I/O for everything.
Everything? Well, there are certain cases where you might not be able to. JDBC is an example for that. Non-blocking JDBC is pretty far in the future, so for now, you’re stuck with blocking JDBC. The only way you can integrate this properly into a reactive system is to keep it away from the rest. You need to define a separate thread pool for synchronous I/O, so that your threads for CPU bound work, which process the tasks, are not affected. All reactive frameworks have some facility for this. In Play and Akka you can define separate dispatchers, in vert.x you have worker verticles, etc.
You don’t want to use blocking I/O. Use non-blocking I/O, and if you really can’t (e.g. if you need to use JDBC), then isolate blocking calls by using a separate thread pool.
3. There’s no Two-Phase-Commit
This is something that could easily fill multiple blog-posts alone, so we can only touch the surface of this.
What if we don’t only have a database access, a JDBC call where we do a select as in the previous example? Look at this little code snippet:
public class GreetingService { @Inject private JmsTemplate jmsTemplate; @PersistenceContext private EntityManager entityManager; @Transactional public void createGreeting(String name) { Greeting greeting = new Greeting(name); this.entityManager.persist(greeting); this.jmsTemplate.convertAndSend("greetings", greeting); // ... } }
Here, we have two transactional systems, a message queue and a database, within one transaction. In this case (this is some Spring Framework example code) that’s really easy: I have to define a transaction manager somewhere. If I have a transaction manager that’s capable of handling distributed transactions, this code is all I have write to get the “all-or-nothing” logic.
How could I achieve this in an asynchronous system, where I even want avoid blocking I/O? The answer is: You don’t want to.
(Slide from Pat Helland’s presentation Life Beyond Distributed Transactions)
If you can, avoid it. Think of the reactive traits - we want to be elastic and resilient. The whole concept of a synchronous 2-phase-commit is not made for that. In the Oracle Transaction Manager documentation it says: “the commit point should be a system with low latency and always available“. Because it will easily break if one of the involved parties isn’t. It doesn’t account for the ability of the systems to fail. And the unavoidable latency will hold you back as well. It’s a natural point of contention and failure. If you look at existing highly scalable systems, people don’t use distributed transactions.
I’ve seen things like the above snippet, a message queue and database access, in real world projects. It’s not the worst use case for a distributed transaction, but also an example for a two-phase commit that could be avoided. The goal of the transactional bracket is to provide “all-or-nothing” - you want either both things to complete successfully, or none of them. But here, you don’t have any control over the receiving end of the queue. The processing of the message at the receiving end might still fail. This example is really about system reconciliation - you want the system state at the other end of the queue to catch up with your database eventually. But this could be handled in a completely asynchronous fashion, without the need for any 2-phase-commit.
If you encounter a requirement for a distributed transaction, the first step should be to challenge it. Actually, the second and third step, too. Try to avoid it. Challenge the requirement: Is the “all-or-nothing” really necessary, or did someone just think it’s easy to do? The best solution is to define the business processes so that distributed transactions are not required. Often, this is not even about changing the business process, but about discovering that it’s not really a business requirement and only got in there because some assumptions were made, e.g. that a central, relational database would be used.
Still, I can’t rule out completely that you might encounter a situation where you genuinely need the “all-or-nothing” semantics. But you can still avoid a 2-phase-commit. The basic idea behind this is that you can achieve the same effect with asynchronous messaging. A principal explanation of this is given in the paper “Life Beyond Distributed Transactions” by Pat Helland. (A really good paper, by the way. Quote: “Grown-Ups Don’t Use Distributed Transactions”. And “Distributed transactions don’t scale, don’t even try to argue with that, just believe that.”).
It’s not trivial, though. You need “at-least-once delivery” for your messages (btw. that’s not the standard if you use plain Akka, which only gives you “at-most-once delivery”. But extensions to provide “at-least-once” are available). Also, as you can’t guarantee message order, you need idempotent messages, or some way to handle out-of-order messages and multiple deliveries. And lastly, you have to have some “compensation ability”. I.e. you have to have an idea of a tentative operation. Think of a hotel reservation which you either have to confirm (possibly by payment) within a certain time, or it’s cancelled. The reservation is the tentative operation, and it’s either committed or rolled back. So there’s no mechanical rewriting of 2-phase-commits into asynchronous messaging - it will affect your modeling. You’ll have to think about the messaging you do, and about your process. But it should be possible.
An application of this general approach is the Compensating Transaction Pattern, or Saga Pattern. In this pattern, you start a Saga, and each of the steps has a counterpart that will reverse the operation.
(Slide from Caitie McCaffrey’s presentation Applying The Saga Pattern)
So the transaction will be to book the hotel, and the compensating action would be to cancel the hotel. You book the car, you cancel the car, you book the flight, you cancel the flight.
Again, implementing this is not trivial. This is not “built-in” in for example Akka. You need to implement a Saga Coordinator which takes care of recording these actions, and makes sure that either the whole Saga is successfully completed, or the appropriate compensations are executed. It’s needs a durable log, the Saga Log. And again you need “at-least-once-delivery”. You must guarantee that the compensating message will be delivered at least once, otherwise you can’t guarantee the all-or-nothing rule.
There is much more to be said about this, but we’ll stop here. The bottom line is: Distributed transactions are a source of contention and of failure, you should definitely avoid them. Local transactions are fine, and the Compensating Transaction Pattern is a pragmatic solution for having an “all-or-nothing” approach in a distributed world.
Another article I recommend on this topic as a whole is “Distributed Transactions: The Icebergs of Microservices”.
Don’t use distributed transactions.
4. There’s no Application Server
Reactive applications don’t use application servers. Reactive applications are deployed as standalone applications. (I used to call this “containerless”, because of servlet containers. But now if I say containerless, people think I argue against Docker. It’s not about containerization and Docker (which are fine), it’s about servlet containers and application servers (which are not)).
So what’s the issue with application servers? From a technical point of view, if you use a Java EE application server (or servlet container - I use the terms interchangeably in this section, as the criticism applies equally to both), you’re going to use the Servlet API. This API is - barring some recent additions that haven’t really become popular so far - a synchronous API. The Servlet API is built for the thread-per-request model, which puts unnecessary limits on the scalability (see the first section above).
In case you missed the memo... App Servers / Service Containers are dead. OS Containers + Container-less Apps are the future. — James Ward (@_JamesWard) September 12, 2014
Another reason is the lack of benefit we get from an application server. It adds complexity and costs. I have to buy it, I have to install it, I have to operate it. What does it give me? Some APIs.
The original idea was to have a container where I can put in a number of services - I put in a couple of .war s or .ear s for different applications. Many people don’t use them that way. The value of isolation (of isolating your applications so that a crash of, or high load on one, will not affect others) is higher than the value of being able to deploy a couple of applications on one server.
What people do is, they run exactly one application per application server instance. You’d rather start a couple of Tomcats with one application in it, than one Tomcat with ten applications in it. If you only deploy one application per server - then, what the server really becomes is just a library that you add to your application! Different is only the packaging. Instead of delivering a .war , you could just bundle the “server” with your application and deliver a .jar . (This is what Spring Boot does. Spring Boot just gives you a standalone .jar that you can run, and it just puts the Tomcat (or the Jetty, or the Undertow) in there). Some good reading on this is “Java Application Servers Are Dead”: Part1, Part2, Presentation.
So, if it’s just a library, instead of bundling what used to be the server as a dependency, you could just as well use any other library that handles HTTP. That’s what Play does, it relies on the asynchronous netty library, skipping the Servlet API altogether.
Application servers have a lot of tooling built around them, and operations people tend to like that. But there are other tools nowadays that you can use to conveniently deploy small services and operate them, service orchestration tools such as Kubernetes, Docker Swarm, or ConductR.
tl;dr When you build a Reactive System
You’re going to use sub-thread level concurrency You want to use asynchronous I/O. If you can’t, at least isolate any synchronous I/O (JDBC) from the rest. You don’t want to use distributed transactions, they’re fragile, they’re points of contention. You don’t want to use an application server.
Please enable JavaScript to view the comments powered by Disqus. |
Pages
FPM Moot-Points:
Tweet Me Please!
Sunday, 21 August 2016
The Olympian Debt Write-Off - #Rio2016
(This Draft Of K.Siva's "Geopolitic Strategy" Report Is Dedicated to Prescient Work of David Scott, Indousez WI Carr Economic Strategist in 1997 - Year of Hong Kong Handover to China. Mr Scott elucidated the phenomenon of China exporting global deflation.)
Economies of the
world in slow transition is the likely cause of the stagnation in
economic activity, as reflected by traditional measures since the
financial crash of 2007-08.
The effectiveness of the continuance of
current #politiciansRcriminals monetary-stimulus policies have been considerably questioned for the sustained great inequality of wealth between people, the state and its "hidden hand".
Is current monetary economics merely blowing small capital-markets related trading bubbles and consequent corrections - at the
phenomenal cost to taxpayers via a monumental public debt-bomb?
Perhaps just round the corner with Italy or 'PIIGs' debt default being catalyst for contagion of national debt defaults. Remember, sub-prime mortgage default was trigger for wave of write-downs of housing market securities valuations. FPM's more modest view is the prospect of debt devaluation via concerted and manipulated inflation index increases.
Some have argued that Government
debt-financed stimulus spending since last orchestrated financial crash from 2007-08 caused a bubble in commodities and propped-up
the unrealistic real estate / property asset valuations, more than actually protect jobs and other reputed public-interest effects conveyed by by complicit peculators in corporate-media. Free-market companies and economies are no longer able to grow evolve and founder on their own idiosyncatic risk i.e. as Schumpter's "Creative-Destruction" model of capitalism; instead they take propping-up with public money. These systemic risk companies have come about through globalisation and related deregulation of anti-trust and anti-monopoly policies. These safeguard policies diluted means globalisation and deregulation are dirty words. Despite moron economists and media lies.
The big pharmaceuticals conglomerates corporations DO exactly the same with human lives - that is, help people live longer by being dependent on their medicines. Laissez-faire capitalism or branded widely as "Neoliberalism" policies since 1980's in all reality died a death in 2007-08. Yet the sovereign public debt in the major economies that have ballooned since that US-led housing and financial crisis is the result of policy failure to allow capital asset destruction. Financial and housing assets should have legitimately crashed, not just temporarily out of panic and ensuing fundamental bubble re-valuation, but without the State intervention with taxpayer money to uphold excessive notional valuation. The 1% of society's asset or wealth owners and the larger middle-class beneath them should have had their bubble-inflated assets wiped out - but for the benevolence of the "ragged-trousered philanthropists", the public!
For example, shareholders in Citigroup Inc suffered at the height of the financial crisis when the global retail and corporate banking 'big bank' reflected distressed and insolvent fundamentals with share price trading as low as between USD 1 and USD 5 (before stock split). However, the American taxpayer has been burdened, not just the present generation but future generations too, with Government policy supporting the 1% asset owners with multi-billion Dollar public money infusions and backing. US Treasury department's stated reason for the support was that Citigroup was a "systemically significant" bank and industry. The scale of the taxpayer support for a publicly held / listed company is shown from this excerpt:
...Treasury in November 2008 gave Citigroup a $20 billion emergency
infusion, on top of $25 billion received the prior month, from the $700
billion TARP fund. The government also backed about $300 billion of
Citigroup assets, helping to prop up the New York-based bank as its
share price plunged below $5 and some depositors withdrew funds. (Source Bloomberg, January 13, 2011 "Citigroup Bailout Based on ‘Fear of the Unknown’")
This one example highlighting Citigroup of why the creative-destruction cycle was not permitted in a supposed free-market deregulated economy is the rub, that should cause repugnant revolt from the public about the 21st century con-trick of "neoliberalism": "Private Profits Public Losses" or "socialising losses". The systemic thieving from the public purse is not a new one; Governments of the day or #politiciansRcriminals have enforced prudent austere policies, such as public services cuts, on the greater mass of the public in the name of reigning-in national debt levels; while at the same time systemically allowing the capitalist-wealth class to accumulate private profits in staggering amounts. Evident by the wealth inequality in societies.
To complete FPM's geopolitic vision using the Citigroup example, is the price chart. This shows a story of euphoric excess and deflating stagnation.
In a progressive outlook Citigroup is not a zombie economy constituent but a tell-tale of not allowing creative-destruction to run its course. As demonstrated the "big bank" model in all likelihood has lost its faithful followers and investor adherents; and subsequently exposed the folly and sheer criminality of Government policy failures of flooding these financial bastions with public capital / debt. The new alternative media exposed multi-trillion financial criminality - fraud is too lesser word - has been described as the corrupt crony capitalism of neoliberalism, which engulfs the major profession of politics, judiciary, mains stream media, public relations and of course the banking cartel, all and more pulling the "hidden-hand" strings.
Others suggest public
funds used after reckless and scandalous corporate recessions, in the name of economic stability policies have artificially kept
interest rates low, and prevented mass scale corporate insolvencies
and debt default.Of the numerous "jackanory" stories, really truly it theft by robber barons. As one property builder once pronounced memorably for this author at a builders' merchant store counter, while paying for his purchase: "You Ought To Wear Balaclava, That's Daylight Robbery!"
The systemic stealth transfer of wealth from public sector to private
sector has been happening since Second World War on a "Lion-Zion" scale.
Currently Dissembling As "Middle-East Regime Change" and "Privatization Of
Government and Functions".(Source: FPM and Naomi Klein)
In Great Britain
yet another round of so-called “Quantitative Easing” was instigated
by its Canadian-origin central bank governor Mark Carney. This monetary
re-assurance was allegedly to support the expected slump following
Britain's public national election to exit from the European Union globalisation project on June 23rd,
2016. In FPM geopolitical vision, this is simply the greatest transfer of public wealth to private concerns.
No Smoke Without Fire: Of Reputation (#NSWF:Reputation) know who these private concerns are by historical reputation. To name two direct at hand, @richardbranson of Virgin Group (and FPM's financial honing of reputation @stevencohen of #SAC Capital et al.)
FPM believes the
economic-policy course needs to be re-directed towards real fiscal or
Keynesian-driven expansion, and beyond only capital market support.
The real economy or at least the public sector spending has been
squeezed ie in recession and austerity; while financial markets and
real estate and other selected sectors of the economy (military
spending) have been taxpayer supported and still surviving. Once the directed will is there the way to a
“sustainable new paradigm of economics” is possible.
The drivers for
the new paradigm of sustainable economics; certainly a shift away
from the current #neoliberal agenda are numerous:
The
illustrious manager of Pimco’s bonds funds, Mr William Gross,
stated that on a long-term basis,
governments are likely to use financial repression,
where the rate of inflation is higher than bond yields, to erode the
value of sovereign debt over time. The late Barton Biggs, Morgan stanley strategist also
stated in Mid-2011 that debt devaluation is less painful than debt
destruction as a long-term course.(Source FPM; Bloomberg - 2011)
g) An Olympian
ideal of greatness which can only be locally inspired while thinking global. Brazil Rio 2016 Olympics about national pride for us in London #claphamCommonm #ProudBrit
via #Brexit. 'Brits' were and are worldly without subscribing to clubs
of nonsense to with pretext to unite nations (Once upon a time British Knights supported Teutonic German comrades to "crusade" Christianity! How did that turn out?). A little Britain just finished 2nd in the Olympic medal table. |
Q:
Cant Get Cookies to work
var app = angular.module('rjtApp',
['ngRoute','ngCookies']);
app.config(['$routeProvider',
function($routeProvider) {
$routeProvider.
when('/', {templateUrl: 'main.html'}).
when('/About', {templateUrl: 'about.html'}).
when('/Evo', {templateUrl: 'evo.html'}).
when('/Evo1', {templateUrl: 'evo1.html'}).
when('/ContactUs', {templateUrl: 'contactus.html', controller: 'projectCtrl'}).
when('/NewProject', {templateUrl: 'new.html', controller: 'storeProjectCtrl'}).
when('/Register', {templateUrl: 'register.html', controller: 'register'}).
when('/Login', {templateUrl: 'login.html', controller: 'loginCtrl'}).
when('/UpdateProject/:id', {templateUrl: 'views/edit.html', controller: 'editProjectCtrl'}).
otherwise({redirectTo: '/'});
I'm Using the loginCtrl, to check with SQL and return a True or False variable.
app.controller( ' loginCtrl ', [' $scope ', ' $http ', ' $location ', ' $cookie ',
function($scope, $http,$location,$cookieStore) {
$scope.getFormData = function(data) {
console.log(data.username);//getting data input by user
console.log(data.password);//getting data input by user
$http.post('php/login.php', data).success(function(data) {
console.log(data);
if (data) {//row inserted
$scope.insertMessage = "Data inserted";
$cookies.cookieStore = (data);
} else {
// if unsuccessful, bind success message to message
$scope.insertMessage = "Data incorrect";
}
//reset values in form to empty
console.log($window.sessionStorage.token);
})
Iit gives me this error:
Error: [$injector:unpr] http://errors.angularjs.org/1.2.12/$injector/unpr?p0=ookieProvider%20%3C-%20%24cookie
and as soon as i remove the $cookie the error disappears.
I did link the angular-cookie script aswell, any help?
A:
the problem was with the angular-cookies.js file. It was not compatible was running 5.2 version beta
switched to previous version and worked like a charm
|
China checks food, water for radiation in 14 areas
BEIJING
Chinese health authorities say they are monitoring food and drinking water for radiation contamination in 14 provinces and cities in northeastern and coastal areas, after low levels of radioactive material were detected in the northeast.
China has been on high alert for contamination since a nuclear power plant in neighboring Japan started leaking radiation after being damaged in a massive earthquake and tsunami on March 11.
Chinese authorities say low levels of radioactive iodine-131 were detected in the air above China's northeastern Heilongjiang province over the weekend.
The Health Ministry said on its website Monday that the radioactive material in Heilongjiang was "extremely weak" and did not pose a threat to public health. |
Eufloria
Eufloria (formerly Dyson) is a real-time strategy video game developed by British studio Omni Systems Limited, consisting of independent developers Alex May, Rudolf Kremers and Brian Grainger. It was named after the Dyson tree hypothesis by Freeman Dyson that a tree-like plant could grow on a comet.
The game was released for Microsoft Windows in 2009, the PlayStation Network in 2011 and the iPad in 2012. Mac, Linux and Android versions of this game was pre-released along with Humble Indie Bundle for Android 4 on 8 November 2012. According to the official FAQ for the game, the final release for Mac and Linux was to be provided in the late summer of 2013. Eufloria HD was released for Android on the Google Play Store on 15 December 2012. The BlackBerry PlayBook version released on 29 December 2012.
It is set in a futuristic space environment, where the player assumes the role of the commander of interstellar lifeforms called Euflorians, who live and gain their resources on asteroids. The player has to use basic units that are grown on Dyson trees and are called "seedlings", to colonize and conquer asteroids. On asteroids, Dyson trees may be planted and as the tree grows and gets stronger, it will produce more seedlings with certain attributes. There are also flowers, defensive trees, and other units later in the game. Players battle other empires and seek to discover the origin of a mysterious grey menace, to speed up the return of the mythical Growers.
Eufloria has been described as a simple but charming game with calming music, graphics, and gameplay.
Versions
There are two versions of Eufloria: the original was released for Windows PCs and subsequently rewritten for PlayStation Network. This is now referred to Eufloria Classic. Eufloria HD is the actively maintained build, and was first released on iOS and later on for BlackBerry. The Humble Bundle 4 for Android made it available on Android, and also in pre-release form on PC, Mac, and Linux. Owners of the original Eufloria could upgrade for free once Eufloria HD was released on PC, Mac and Linux. This version was released October 2014.
Gameplay
Graphically, Eufloria is simple, with minimalistic graphics, and a simple design. The colour of the Euflorian empire is customizable.
At the start of the game, the player has one tree, called a Dyson tree, on an asteroid. The tree has a number of branches and leaves that fall off and become seedlings, which can be used to either create trees or fight other seedlings. Each tree is unique, the growth of its branches based on a fractal algorithm.
To create trees, 10 seedlings are needed in orbit of an asteroid. These seedlings then plummet into the ground to grow grass and the trees' roots. A plant called a defense tree may also be grown that attacks invading enemy seedlings by releasing explosive fruit. Over time, the plant's health, damage, and spawn rate increases. The player can also customize their asteroids with add-ons called 'flowers'.
If a dyson tree has a flower added, dysons with a vastly enhanced firerate and range are produced. If a defense tree has a flower added, lasermines are produced. These are powerful seedlings which can take on multiple enemies with multiple lasers, and a suicidal explosion.
The seedlings can attack enemy asteroids, and take them over by burrowing through the roots to the core, and sapping the energy of the asteroid.
All levels are partially randomly generated, meaning each playthrough is slightly different. Also, each asteroid is unique in size and values, and produces seedlings with different stats. There are three stats: Speed enhances the rate of movement of seedlings, Strength enhances the damage of seedlings, and Energy increases the speed at which seedlings can convert enemy asteroids. The stats also affect the appearance of the seedlings.
Plot
The game begins in the far off future in space. The player controls a force of seedlings, and take more asteroids for the growers, mythical beings which spawned the seedlings. The mothertree hopes that by taking enough colonies for the growers, they can make them return. Early in the game, the player encounter an enemy, the greys, which has brutally attacked one of their colonies. Soon the mothertree learns that the greys have been driven mad by a disease, which forces them to attack. They also learn that another empire is attacking their empire and so the player is sent beyond the borders of the empire to find out why the greys are attacking, and deal with them. The player continues, gaining new technologies and rescuing allies along the way, to find that their enemies produced the greys, despite the danger that the greys would destroy them too. Eventually, the home asteroid of the greys was found. After conquering them, the mothertree analysed their remains, and found that all the enemy seedlings had the same DNA as the Euflorian's seedlings.
Development
Originally called Dyson, the game started as a simple single proof of concept level. Levels were originally designed with the XML markup language, and later the Lua programming language for increased flexibility.
The game was renamed Eufloria after a contest on IGN's Direct2Drive. Over 400 names were sorted through, with Vernon Sydnor giving the winning name.
The game has since been upgraded with a campaign, substantial AI and graphical improvements, and has been translated into English, French, German, Italian, Spanish, and Dutch.
Reception
References
External links
Official site
Game Pitch: Dyson - Guardian
Category:2009 video games
Category:Android (operating system) games
Category:BlackBerry games
Category:IOS games
Category:Linux games
Category:Lua-scripted video games
Category:PlayStation 3 games
Category:PlayStation Network games
Category:PlayStation Vita games
Category:Real-time strategy video games
Category:Windows games
Category:Video games developed in the United Kingdom
Category:Video games using procedural generation |
Polymorphism of linoleic acid (cis-9, cis-12-octadecadienoic acid) and alpha-linolenic acid (cis-9, cis-12, cis-15-octadecatrienoic acid).
Crystallization and polymorphic properties of linoleic acid (cis-9, cis-12-Octadecadienoic acid) (LA) and alpha-linolenic acid (cis-9, cis-12, cis-15-Octadecatrienoic acid) (alpha-LNA) have been studied by optical microscopy, differential scanning calorimetry (DSC) and X-ray diffraction (XRD). The DSC analyses presented three polymorphs in LA, and two polymorphs in alpha-LNA. The XRD patterns of the higher- and lower-temperature forms in LA and alpha-LNA showed orthorhombic O'(//)+O-like and O'(//) subcell, which were similar to those of alpha- and gamma-forms of mono-unsaturated fatty acids, respectively. From the solvent crystallization of LA and alpha-LNA in acetonitrile, single crystals of the higher temperature polymorphs have been obtained. The crystal habits of truncated rhombic shape were also similar to those of alpha-forms of the mono-unsaturated fatty acids. The enthalpy and entropy values of fusion and dissolution of the alpha-forms of LA, alpha-LNA and oleic acid showed that the two values decreased with increasing number of the cis-double bond. |
<!DOCTYPE html>
<html>
<head>
<title>HTML5 Sandbox: Allow sandboxed iframe content to navigate the sandboxed browsing context itself.</title>
<meta content="text/html; charset=UTF-8" http-equiv="Content-Type" />
<link rel="author" title="Microsoft" href="http://www.microsoft.com/" />
<link rel="help" href="http://dev.w3.org/html5/spec/Overview.html#sandboxed-navigation-browsing-context-flag" />
<meta name="assert" content="Allow sandboxed iframe content to navigate the sandboxed browsing context itself." />
<script src="support/sandbox_helper.js" type="text/javascript"></script>
</head>
<body>
<pre>Description: Allow sandboxed iframe content to navigate the sandboxed browsing context itself.</pre>
<table id='testtable' border='1'>
<tr>
<td>Test Result</td>
<td>Test Assertion</td>
</tr>
<tr>
<td id='test_0_result'>Manual</td>
<td id='test_0_assertion'>
<div>Steps:</div>
<div>1. Click link "Click here to perform self navigation".</div>
<br />
<div>Test passes if there is no red on the page and the word "PASS" appears in the below iframe after following the above steps.</div>
</td>
</tr>
</table>
<br />
<div id="testframe">
<pre>iframe with sandbox=""</pre>
<iframe id="iframe1" name="iframe1" src="support/iframe_sandbox_008.htm" sandbox="" style="height: 100px; width: 350px;"></iframe>
</div>
<script type="text/javascript">
DisableTestForNonSupportingBrowsers();
</script>
</body>
</html>
|
---
abstract: 'We present a study of [Fe[ii]{}]{} emission in the near-infrared region (NIR) for 25 active galactic nuclei (AGNs) to obtain information about the excitation mechanisms that power it and the location where it is formed. We employ a NIR [Fe[ii]{}]{} template derived in the literature and found that it successfully reproduces the observed [Fe[ii]{}]{} spectrum. The [Fe[ii]{}]{} bump at 9200Å detected in all objects studied confirms that [Ly$\alpha$]{} fluorescence is always present in AGNs. The correlation found between the flux of the 9200Å bump, the 1[$\mu$m]{} lines and the optical [Fe[ii]{}]{} imply that [Ly$\alpha$]{} fluorescence plays an important role in the [Fe[ii]{}]{} production. We determined that at least 18$\%$ of the optical [Fe[ii]{}]{} is due to this process while collisional excitation dominates the production of the observed [Fe[ii]{}]{}. The line profiles of [Fe[ii]{}]{}$\lambda$10502, [O[i]{}]{}$\lambda$11287, [Ca[ii]{}]{}$\lambda$8664 and [Pa$\beta$]{} were compared to gather information about the most likely location where they are emitted. We found that [Fe[ii]{}]{}, [O[i]{}]{} and [Ca[ii]{}]{} have similar widths and are, on average, 30$\%$ narrower than [Pa$\beta$]{}. Assuming that the clouds emitting the lines are virialized, we show that the [Fe[ii]{}]{} is emitted in a region twice as far from the central source than [Pa$\beta$]{}. The distance though strongly varies: from 8.5 light-days for NGC4051 to 198.2 light-days for Mrk509. Our results reinforce the importance of the [Fe[ii]{}]{} in the NIR to constrain critical parameters that drive its physics and the underlying AGN kinematics as well as more accurate models aimed at reproducing this complex emission.'
author:
- 'A. O. M. Marinello'
- 'A. Rodríguez-Ardila and A. Garcia-Rissmann'
- 'T. A. A. Sigut'
- 'A. K. Pradhan'
title: |
The [Fe[ii]{}]{} emission in active galactic nuclei:\
excitation mechanisms and location of the emitting region
---
Introduction
============
The broad line region (BLR) in active galactic nuclei (AGNs) has been extensively studied from X-rays to the near infrared region (NIR) during the last decades [see @gas09 for a review] but several aspects about its physical properties remain under debate. That is the case of the [Fe[ii]{}]{} emission, whose numerous multiplets form a pseudo-continuum that extends from the ultraviolet (UV) to the NIR due to the blending of over 344,000 transitions [@bru08] although it is not clear that even that number of lines could denote adequate coverage. This emission is significant for at least four reasons: (*i*) it represents one of the most conspicuous cooling agents of the BLR, emitting about 25% of the total energy of this region [@wil85]; (*ii*) it represents a strong contaminant because of the large number of emission lines. Without proper modeling and subtraction, it may lead to a wrong description of the BLR physical conditions; (*iii*) the gas responsible for the [Fe[ii]{}]{} emission can provide important clues on the structure and kinematics of the BLR and the central source. However, despite the extensive study of the [Fe[ii]{}]{} emission, [@kue08; @mat08; @pop07; @slu07; @hu08; @kov10] the strong blending of the lines prevents an accurate study of its properties and excitation mechanisms; (*iv*) The strength of [Fe[ii]{}]{} relative to the peak of \[O[iii]{}\], the so called eigenvector 1, which consists of the dominant variable in the principal component analysis presented by @bor92, is believed to be associated to important parameters of the accretion process [@sul00; @bor92].
Due to its complexity and uncertainties in transition probabilities and excitation mechanisms, the most successful approach to model the [Fe[ii]{}]{} emission in AGNs consists of deriving empirical templates from observations. Among the most successful templates for the optical region are the ones of [@bor92] and [@ver04], which were developed using the spectrum of IZw1, the prototype of NLS1 that is widely known for its strong iron emission in the optical and UV regions [@jol91; @law97; @rud00; @tsu06; @bru08]. Other works also successfully employ templates to quantify the optical [Fe[ii]{}]{} emission in larges samples of AGNs [@tsu06; @pop07; @kov10; @don10; @don11]. For the UV region, [@ves01] extended the [Fe[ii]{}]{} template using Hubble Space Telescope/FOS spectra of IZw1, presenting the first UV template for this emission.
Two decades after the seminal work by [@bor92] on the optical FeII emission template, the first semi-empirical NIR FeII template was derived by [@gar12] using a mid-resolution spectrum of IZw1 and theoretical models of [@sig04] and [@sig03]. They successfully modeled the [Fe[ii]{}]{} emission in that galaxy as well as Ark564, another NLS1 known for its conspicuous iron emission [@jol91; @rod02]. Similar to the optical, they found that the [Fe[ii]{}]{} spectrum in the NIR forms a subtle pseudo-continuum that extends from 8300Å up to 11800Å. However, unlike in the optical, the NIR [Fe[ii]{}]{} spectrum displays prominent lines that can be fully isolated, allowing the characterization of [Fe[ii]{}]{} emission line profiles and its comparison to other BLR emission features. That property confers an advantage to the NIR over the optical, making the [Fe[ii]{}]{} emission in that region a powerful tool to study and understand this complex emission. It can be used, for instance, to observationally constrain the most likely location of the region emitting this ion. Previous works in the NIR carried out on a few targets [@rod02] suggest that the [Fe[ii]{}]{} lines are preferentially formed in the outer part of the BLR. Studies on a larger number of sources are necessary to confirm this trend and compare it to results obtained in the optical [@kov10; @pop07; @bor92].
Despite the wide and successful use of templates to reproduce, measure and subtract the [Fe[ii]{}]{} emission in AGNs [@bor92; @ves01; @ver04; @gar12], attempts on determining the mechanisms that drive this emission continue to be an open issue. Current models [@bal04; @ver99; @bru08] include processes such as continuum fluorescence, collisional excitation and self-fluorescence among [Fe[ii]{}]{} transitions. They are successful at reproducing the emission lines strengths for the UV and optical lines but results for the NIR are not presented, very likely because the relevant transitions in that region are not included. [@pen87] proposed that [Ly$\alpha$]{} fluorescence could be a key process involved in the production of [Fe[ii]{}]{}. Indeed, models developed by [@sipr98; @sig03] and [@sig04] showed that this mechanism is of fundamental importance in determining the strength of [Fe[ii]{}]{} in the NIR. The key feature that would reveal the presence of such mechanism is the detection of the [Fe[ii]{}]{} blend at 9200Å, first identified by [@rod02] in AGNs. The bulk of this emission would be produced by primary cascades from the upper 5p levels to e$^4$D and e$^6$D levels after a capture of a [Ly$\alpha$]{} photon.
Additional NIR features resulting from secondary cascading after the [Ly$\alpha$]{} fluorescence process are the so-called 1[$\mu$m]{} [Fe[ii]{}]{} lines ($\lambda$9997, $\lambda$10502, $\lambda$10862 and $\lambda$11127), which are the most prominent [Fe[ii]{}]{} features in the whole 8000-24000 Å region [@sig03; @pana11]. The importance of the 1[$\mu$m]{} lines resides in the fact that they are produced by the decay of the e$^4$D and e$^6$D levels down to the z$^4$D$^0$ and z$^4$F$^0$ levels. Transitions downwards from the latter two populate the upper levels responsible for nearly 50% of all optical [Fe[ii]{}]{} emission [@ver04]. If [Ly$\alpha$]{} fluorescence plays a key role as excitation mechanism of [Fe[ii]{}]{} in AGNs, a direct correlation should be observed between the strength of 9200Å blend and the 1 $\mu$m [Fe[ii]{}]{} lines in the NIR. This issue should be investigated in detail because it can provide useful constrains to the [Fe[ii]{}]{} problem.
In this paper, we describe for the first time a detailed application of the semi-empirical NIR [Fe[ii]{}]{} template developed by [@gar12] to a sample of 25 AGNs. The aims are threefold: (i) Provide a reliable test for the NIR [Fe[ii]{}]{} template and verify its capability to reproduce the numerous [Fe[ii]{}]{} emission lines in a sample of Type 1 AGNs. (ii) Measure the NIR [Fe[ii]{}]{} flux and compare it to that of the optical region to confirm model predictions of the role of [Ly$\alpha$]{} fluorescence in the total [Fe[ii]{}]{} strength. (iii) Compare the [Fe[ii]{}]{} emission line profiles with other broad line features to probe the BLR structure and kinematics.
This paper is structured as follows: Section \[data\] describes the observations and data reduction. Section \[analysis\] presents the methodology adopted to convolve the NIR [Fe[ii]{}]{} template and its application to the galaxy sample and results. Section \[excitation\] discusses the excitation mechanisms of the NIR [Fe[ii]{}]{} emission. Section \[location\] discusses the kinematics of the BLR based on the [Fe[ii]{}]{} lines and other BLR emission as well the distance of the [Fe[ii]{}]{} emitting line region. Conclusions are given in Section \[conclusion\].
Observations and data reduction {#data}
===============================
The 25 AGNs that compose our sample were selected primarily from the list of [@jol91], who collected data for about 200 AGNs (Seyfert1 and quasars) to study the relationship between [Fe[ii]{}]{} and radio emission. Additional selection criteria were applied to that initial sample such as the targets have to be brighter than K=12 mag to obtain a good compromise between signal-to-noise (S/N) and exposure time for the NASA 3m Infrared Telescope Facility (IRTF) atop Mauna Kea. We also applied the restriction that the FWHM of the broad [H$\beta$]{} component of the galaxies be smaller than 3000kms$^{-1}$ in order to avoid severe blending of the [Fe[ii]{}]{} lines with adjacent permitted and forbidden features. Because of the last criterion, our final sample was naturally dominated by narrow-line Seyfert1 galaxies. Basic information for the galaxy sample is listed in Table \[tab:basicdata\].
The NIR observations and data reduction for the above sample will be described first. Non-contemporaneous optical and UV spectroscopy obtained mostly from archival data (as well as pointed observations) were also collected for most sources of the sample for the purpose of assessing the optical and UV [Fe[ii]{}]{} emission. Since the data reduction of these latter data were described elsewhere we will discuss here only their sources and any particular issue we found interesting to mention.
Near-Infrared data
------------------
NIR spectra were obtained at IRTF from April 2002 to June 2004. The SpeX spectrograph [@ray03], was used in the short cross-dispersed mode (SXD, 0.8-2.4[$\mu$m]{}). In all cases, the detector employed consisted of a 1024$\times$1024 ALADDIN 3 InSb array with a spatial scale of 0.15$\arcsec$/pixel. A 0.8$\times$15 slit was used giving a spectral resolution of 360kms$^{-1}$. This value was determined both from the arc lamp spectra and the sky line spectra and was found to be constant with wavelength within 3%. During the different nights, the seeing varied between 0.7-1$\arcsec$. Observations were done nodding in an ABBA source pattern along the slit with typical integration times from 120s to 180s per frame and total on-source integration times between 35 and 50min. Right before/after the science frames, an A0V star was observed near each target to provide a telluric standard at similar airmass. It was also used to flux calibrate the corresponding object.
The spectral reduction, extraction and wavelength calibration procedures were performed using SPEXTOOL, the in-house software developed and provided by the SpeX team for the IRTF community [@cus04]. 1-D spectra were extracted using an aperture window of 0.8$\arcsec$ in size, centered at the peak of the light distribution. Because all objects of the sample are characterized by a bright central nucleus compared with the galaxy disk, the light profile along the spatial direction was essentially point-like. Under this assumption, SPEXTOOL corrects for small shifts due to atmospheric diffraction in the position of the light peak along the different orders.
The extracted galaxy spectra were then corrected for telluric absorption and flux calibrated using Xtellcor [@vac03], another in-house software developed by the IRTF team. Finally, the different orders of each science spectrum were merged to form a single 1-D frame. It was later corrected for redshift, determined from the average $z$ measured from the positions of \[S[iii]{}\]9531Å, Pa$\delta$, He[i]{}10830Å, [Pa$\beta$]{} and Br$\gamma$. Galactic extinction corrections, as determined from the COBE/IRAS infrared maps of [@sch98], were applied for each target. The value of the Galactic E(B-V) used for each galaxy is listed in Col. 6 of Table \[tab:basicdata\].
Optical and Ultraviolet data
----------------------------
Optical spectroscopy for a sub-sample of objects were obtained from different telescopes, including archival data from SDSS and HST, as well as our own observations. Column 2 of Table \[tab:otherdata\] lists the source of the optical spectroscopy. The purpose of this spectra is to determine the integrated flux of the [Fe[ii]{}]{} blend centered at 4570 Å and [H$\beta$]{} as well as R$_{\rm 4570}$, the flux ratio [Fe[ii]{}]{}$\lambda$4570/[H$\beta$]{}.
In addition, UV spectroscopy for a sub-sample of sources taken with HST is also employed to compare the emission line profiles of [Fe[ii]{}]{} and other BLR features, including some high-ionization permitted lines.
As our interest is in the emission line spectrum, it is necessary to remove the strong continuum emission in the optical and NIR, assumed to be primarily from the central engine. To this purpose, we fit a polynomial function to the observed continuum using as anchor points regions free of emission lines and subtract it from the spectrum. Figure \[fig:contsub\] shows an example of this procedure applied to 1H1934-063A. This procedure proved to be successful to our purposes. The analysis of the individual continuum components (i.e., AGN, dust and stellar population) are beyond the scope of this paper, so no effort was made at interpreting the physical meaning of the fit.
In none of the cases the NIR and optical/UV spectroscopy were contemporaneous. Therefore, no effort was made to match the continuum emission in the overlapping regions of the spectra (i.e., NIR and optical and UV and optical) because of variability, seeing and aperture effects. However, since the optical data is used to provide quantities to be compared to the NIR, it is important to consider variability effects on the emission lines that are being analyzed. Few works in the literature, though, have found optical [Fe[ii]{}]{} variability, and the overall statistics are scarce.
[@gist96], for example, reported variations of the [Fe[ii]{}]{} bump at 5200Å of less than 15$\%$. [@die93] detected no significant variations in the [Fe[ii]{}]{} lines in NGC5548. [@biko99] found that optical [Fe[ii]{}]{} lines remained constant over a 10 year monitoring campaign, even when the Balmer lines and continuum were seen to vary over a range of 2 to 5. [@wan05] found that the [Fe[ii]{}]{} variations in NGC4051 correlate with variations in the continuum and the [H$\beta$]{} line. Similar results were found by [@sha12] for Ark564.
Few AGNs show strong [Fe[ii]{}]{} variations (larger than 50$\%$), particularly in very broad line objects [FWHM of H$\beta>4000$kms$^{-1}$; @kol81; @kofr85; @kol00]. For example, [@kue08] carried out a reverberation analysis of Ark120. They were unable to measure a clean reverberation lag for this object. [@bar13], though, detected [Fe[ii]{}]{} reverberation for two broad line AGNs, Mrk1511 and NGC4593, using data from the *LICK AGN Monitoring Project*. They found variability with an amplitude lower than 20$\%$ relative to the mean flux value. In addition, [@hu15] report the detection of significant [Fe[ii]{}]{} time lags for a sample of 9 NLS1 galaxies in order to study AGNs with high accretion rates. Difficulties in detect variations in the [Fe[ii]{}]{} bump at $\lambda$4570 are usually ascribed to residual variations of the He[ii]{}$\lambda$4686, which is blended with [Fe[ii]{}]{} in this wavelength interval [@kodi96].
The general scenario that emerges from these works is that the amplitude of the [Fe[ii]{}]{} variability (when it varies) in response to continuum variations is much smaller than that of [H$\beta$]{}. Indeed, this latter line is widely known to respond to continuum variability [@kas00; @pet04; @pet98; @kol00; @kol06]. [@kol06] analyzed this effect using a sample of 45 AGNs in order to study the BLR structure. Considering the mean values of all fractional variabilities presented in their work as representative of the variability effect in our sample, we estimate an uncertainty of $\sim$11$\%$ on the optical fluxes due to variability. This value is also in good agreement with the results of [@hu15], which found an average fractional variability of 10$\%$ for [Fe[ii]{}]{} when compared with [H$\beta$]{}. This value is within the error in the line fluxes measured in this work; therefore, we conclude that variability is unlike to impact our results.
Analysis Procedure {#analysis}
==================
NIR [Fe[ii]{}]{} Template Fitting {#tempfit}
---------------------------------
Modeling the [Fe[ii]{}]{} pseudo-continuum, formed by the blending of the thousands of [Fe[ii]{}]{} multiplets, remains a challenge for the analysis of this emission since it was first observed by [@waok67]. [@sar68] noted that IZw1, for instance, had the same kind of emission but with stronger and narrower lines. The strength of the [Fe[ii]{}]{} lines in that AGN mades it a prototype of the strong [Fe[ii]{}]{} emitters as well as of the NLS1 subclass of AGNs, leading to the development of empirical templates of this emission based on this source [@bor92; @ves01; @ver04; @gar12].
[@sig03] and [@sig04] presented the first [Fe[ii]{}]{} model from the UV to the NIR using an iron atom with 827 fine structure energy levels and including all known excitation mechanisms (continuum fluorescence via the UV resonance lines, self-fluorescence via overlapping [Fe[ii]{}]{} transitions, and collisional excitation) that were traditionally considered by [@wil85] and [@bal04] in addition to fluorescent excitation by [Ly$\alpha$]{} as suggested by [@pen87]. Their models incorporates photoionization cross sections [references in @sig04] that include a large number of autoionizing resonances, usually treated as lines but too numerous to count explicitly, which means that they include many more photo-excitation transitions than the 23,000 bound-bound lines and would form part of the pseudo-continuum. Moreover, in their work they show how the [Fe[ii]{}]{} intensity varies as a function of the ionization parameter ($U_{\rm ion}$)[^1], the particle density ($n_H$) and the microturbulence velociy ($\zeta_t$). Details of all the physics involved in the calculations are in [@sig03]. [@lan08] were the first to confront these models with observations, noting some discrepancies between the model and the observed emission lines. [@bru08] using an [Fe[ii]{}]{} model with 830 energy levels (up to 14.06eV) and 344,035 atomic transitions, found that the model parameters that best fit the observed UV spectrum of IZw1 were $log(\Phi_H)=20.5$, $log(n_H)=11.0$ cm$^{-3}$ and $\zeta_t$=20kms$^{-1}$. [@gar12] modeled the observed NIR spectrum of IZw1 using a grid of Sigut $\&$ Pradhan’s templates covering several values of ionization parameters and particle densities, keeping the microturbulence velocity constant at $\zeta_t$=10kms$^{-1}$. They found that the model with $U_{\rm ion}$=$-2.0$ (implying in $log(\Phi_H)=21.1$) and $log(n_H)$=$12.6$ cm$^{-3}$ best fit the observations. Note that these values are comparable to those found by [@bru08], suggesting that the physical conditions of the clouds emitting [Fe[ii]{}]{} are similar.
The template developed by [@gar12] is composed of 1529 [Fe[ii]{}]{} emission lines in the region between 8300Å and 11600Å. In order to apply it to other AGNs, it is first necessary to convolve it with a line profile that is representative of the [Fe[ii]{}]{} emission. At this point we are only interested in obtaining a mathematical representation of the empirical profiles. In order to determine the optimal line width, we measured the FWHM of individual iron lines detected in that spectral region. We assumed that each [Fe[ii]{}]{} line could be represented by a single or a sum of individual profiles and that the main source of line broadening was the Doppler effect.
The [Fe[ii]{}]{} emission lines $\lambda$10502 and $\lambda$11127 are usually isolated and allow an accurate characterization of their form and width. The LINER routine [@pog93], a $\chi^2$ minimization algorithm that fits up to eight individual profiles (Gaussians, Lorentzians, or a linear combination of them as a pseudo-Voigt profile) to a single or a blend of several line profiles, was used in this step. We found that a single Gaussian/Lorentzian profile was enough to fit the two lines above in all objects in the sample. However, the difference between the *rms* error for the Gaussian and Lorentzian fit was less than 5%, which lies within the uncertainties. As [Fe[ii]{}]{}$\lambda$11127 is located in a spectral region with telluric absorptions, residuals left after division by the telluric star may hamper the characterization of that line profile. For this reason, we considered [Fe[ii]{}]{}$\lambda$10502 as the best representation of the broad [Fe[ii]{}]{} emission. Note that [@gar12] argued that the [Fe[ii]{}]{} $\lambda$11127 is a better choice than [Fe[ii]{}]{}$\lambda$10502 because the latter can be slightly broadened due to a satellite [Fe[ii]{}]{} line at $\lambda$10490. However, [Fe[ii]{}]{}$\lambda$10490 is at least 5 times weaker relative to $\lambda$10502 [@gar12; @rod02]. Therefore, we adopted the $\lambda$10502 line as representative of the [Fe[ii]{}]{} profile because it can be easily isolated and displays a good S/N in the entire sample. The flux and FWHM measured for this line are shown in Columns 2 and 3 of Table \[tab:linefit\].
For each object, a synthetic [Fe[ii]{}]{} spectrum was created from the template using the FWHM listed in Table \[tab:linefit\] and then scaled to the integrated line flux measured for the $\lambda$10502 line.
In order to ensure that the line width used to convolve the template best represented the FWHM of the [Fe[ii]{}]{} emission region, we generated for each galaxy a grid of 100 synthetic spectra with small variations in the line width (up to 10% around the best value) for 3 different functions (Gaussian, Lorentzian and Voigt). In all cases, the value of the FWHM that minimized the *rms* error after subtraction of the template was very close (less than 1%) to the width found from the direct measurement of the $\lambda$10502 line. Also, the best profile function found in all cases was the same one that fitted initially. The final parameters of the convolution of the template for each source are shown in Table \[tab:temppar\].
Figures \[fig:nirtemp1\] to \[fig:nirtemp4\] show the observed spectra and the template convolved with the best parameters (upper panel). The ion-free spectra after subtraction of the modeled [Fe[ii]{}]{} emission are shown in the bottom panels. It can be seen that overall the template nicely reproduces the observed [Fe[ii]{}]{} in all AGNs. We measure the *rms* error of the subtraction of the template using as reference the regions around the 1 $\mu$m lines. The mean *rms* error of the template subtraction are shown in column 4 of Table \[tab:temppar\].
From the best matching template we estimated the flux of the 1[$\mu$m]{} lines. Columns 2-6 of Table \[tab:1mulines\] show the fluxes of each line. We define the quantity [R$_{1\mu m}$]{} as the ratio between the integrated flux of the 1[$\mu$m]{} lines and the flux of the broad component of [Pa$\beta$]{}. This value is presented in column 7 of Table \[tab:1mulines\]. We consider this ratio as an indicator of the NIR [Fe[ii]{}]{} strength in each object. Sources with weak [Fe[ii]{}]{} emission are characterized by low values of [R$_{1\mu m}$]{} (0.1 $-$ 0.9) while strong [Fe[ii]{}]{} emitters display values of R$_{1\mu m} >$1.0.
Two features in the residual spectra (after subtraction of the [Fe[ii]{}]{} emission) deserve comments. The first one is the apparent [Fe[ii]{}]{} excess centered at 11400Å that is detected in some sources. We identify this emission with an [Fe[ii]{}]{} line because it was first identified in IZw1 but it is absent in sources with small [R$_{4570}$]{}. Therefore, its detection may be taken as an indication of a IZw1-like source. The 11400Å feature is formed by a blend of 8 [Fe[ii]{}]{} lines, being those located at $\lambda$11381.0 and $\lambda$11402.0 the strongest ones. They both carry 95$\%$ of the predicted flux of this excess. [@gar12] had to modified it to properly reproduce the observed strength in that object because the best matching [Fe[ii]{}]{} model severely underestimated it. Nonetheless, when the template was applied to Ark564, the feature was overestimated. Our results show that the peak at 11400Å is present only in the following objects: Mrk478, PG1126-041, PG1448+273, Mrk493 and Ark564. In the remainder of the sample it is absent.
The second feature is the [Fe[ii]{}]{} bump centered at $\lambda$9200, which is actually a blend of aproximately 80 [Fe[ii]{}]{} lines plus Pa9. The most representative [Fe[ii]{}]{} transitions in this region are [Fe[ii]{}]{}$\lambda$9132.36, $\lambda$9155.77, $\lambda$9171.62, $\lambda$9175.87, $\lambda$9178.09, $\lambda$9179.47, $\lambda$9187.16, $\lambda$9196.90, $\lambda$9218.25 and $\lambda$9251.72. In order to assess the suitability of the template to reproduce this feature, we modeled the residual left in the 9200Å region after subtracting the template. The residual was constrained to have the same profile and FWHM as [Pa$\beta$]{}. The flux of Pa9 line should be, within the uncertainties, the flux of [Pa$\beta$]{} multiplied by the Paschen decrement factor ([Pa$\beta$]{}/Pa9$\sim$5.6) [@gar12]. The results obtained for each object are shown in column 3 of Table \[tab:9200fit\].
Column 4 of Table \[tab:9200fit\] shows the expected flux for that line. When we compare it to the measured flux, we find that the latter is systematically larger, which indicates that the template underestimates the value of the [Fe[ii]{}]{} emission in this region. Similar behavior was observed by [@mar15] for a a smaller spectral region (0.8-0.95$\mu$m). They subtracted the NIR [Fe[ii]{}]{} emission in 14 luminous AGNs using the template of [@gar12] for this region and found an excess of [Fe[ii]{}]{} in the 9200Å bump after the subtraction.
Nevertheless, we can estimate the total [Fe[ii]{}]{} emission contained in the 9200Å bump using the residual flux left after subtraction of the expected Pa9 flux to “top up” the flux found in the [Fe[ii]{}]{} template. Column 5 of Table \[tab:9200fit\] lists this total [Fe[ii]{}]{} flux in the bump. We define the quantity [R$_{9200}$]{} as the flux ratio between the [Fe[ii]{}]{} bump and the broad component of [Pa$\beta$]{}. The results are listed in column 6 of Table \[tab:9200fit\].
Except for the residuals in the $\lambda$9200 region, our results demonstrate the suitability of the semi-empirical NIR [Fe[ii]{}]{} template in reproducing this emission in a large sample of local AGNs. The only difference from source to source are scales factors in FWHM and flux, meaning that the relative intensity between the different [Fe[ii]{}]{} lines remains approximately constant, similar to what is observed in the UV and optical region [@bor92; @ves01; @ver04]. Figures \[fig:nirtemp1\]-\[fig:nirtemp4\] also confirm that the template developed for the [Fe[ii]{}]{} emission in the NIR can be applied to a broad range of Type 1 objects.
The results obtained after fitting the [Fe[ii]{}]{} template allow us to conclude that: ([*i*]{}) without a proper modeling and subtraction of that emission, the flux and profile characteristics of other adjacent BLR features can be overestimated; ([*ii*]{}) once a good match between the semi-empirical [Fe[ii]{}]{} template and the observed spectrum is found, individual [Fe[ii]{}]{} lines, as well as the NIR [Fe[ii]{}]{} fluxes, can be reliably measured; ([*iii*]{}) the fact that the template reproduces well the observed NIR [Fe[ii]{}]{} emission in a broad range of AGNs points to a common excitation mechanisms for the NIR [Fe[ii]{}]{} emission in Type1 sources.
Emission line fluxes of the BLR in the NIR {#profiles}
------------------------------------------
Modelling the pseudo-continuum formed by numerous permitted [Fe[ii]{}]{} lines in the optical and UV regions is one of the most challenging issues for a reliable study of the BLR. Broad optical emission lines of ions other than [Fe[ii]{}]{} are usually heavily blended with [Fe[ii]{}]{} multiplets and NLR lines. In order to measure their fluxes and characterize their line profiles, a careful removal of the [Fe[ii]{}]{} emission needs to be done first. In this context, the NIR looks more promising for the analysis of the BLR at least for three reasons. First, the same set of ions detected in the optical are also present in that region (H[i]{}, He[i]{}, [Fe[ii]{}]{}, He[ii]{} in addition to [O[i]{}]{} and [Ca[ii]{}]{}, not seen in the optical). Second, the lines are either isolated or moderately blended with other species. Third, the placement of the continuum is less prone to uncertainties relative to the optical because the pseudo-continuum produced by the [Fe[ii]{}]{} is weaker.
This section will describe the method employed to derive the flux of the most important BLR lines in the NIR after the removal of all the emission attributed to [Fe[ii]{}]{}.
To this purpose, the presence of any NLR emission should be evaluated first, and, if present, subtracted from the observed lines profiles. An inspection of the spectra reveals the presence of forbidden emission lines of \[S[iii]{}\]$\lambda$9068 and $\lambda$9531 in all sources analyzed here. Therefore, a narrow component is also expected for the Hydrogen lines that may contribute a non-negligible fraction to the observed flux. In order to measure this narrow component, we followed the approach of [@rod00], which consists of adopting the observed profile of an isolated NLR line as a template, scaling it in strength, and subtracting it from each permitted line.
Note that neither [O[i]{}]{}, [Ca[ii]{}]{}, nor [Fe[ii]{}]{} required the presence of a narrow component to model their observed profiles, even in the spectra with the best S/N. In all cases, after the inclusion and subtraction of a narrow profile, an absorption dip was visible in the residuals. [@rod02] had already pointed out that no contribution from the NLR to these lines is expected as high gas densities ($>$10$^{8}$ cm$^{-3}$) are necessary to drive this emission. This result contrasts to claims made by [@don10], who include a narrow component, with origin in the NLR, in the modelling of the optical [Fe[ii]{}]{} lines.
For consistency, [O[i]{}]{}$\lambda$8446 [^2] and [Ca[ii]{}]{}$\lambda$8498,$\lambda$8542 had their widths (in velocity space) constrained to that of [O[i]{}]{}$\lambda$11287 and [Ca[ii]{}]{}$\lambda$8662, respectively. These latter lines are usually isolated and display good S/N. Note however that for a part of our sample, it was not possible to obtain a good simultaneous fit to the three calcium lines using this approach. We attribute this mostly to the fact that some of the AGNs have the [Ca[ii]{}]{} lines in absorption [@pen87] and also to the lower S/N of [Ca[ii]{}]{}$\lambda$8498,$\lambda$8542 as they are located in regions with reduced atmospheric transmission.
Table \[tab:linefit\] lists the fluxes and FWHM measured for the most conspicuous emission lines of our sample. The errors presented are due to the small variations to stablish the continuum zero level for the fits. Figure \[fig:deblend\] shows an example of the deblending procedure applied to each of the lines analyzed.
[Fe[ii]{}]{} Excitation Mechanism: [Ly$\alpha$]{} fluorescence and Collisional Excitation {#excitation}
=========================================================================================
The primary excitation mechanism invoked to explain most of the NIR [Fe[ii]{}]{} lines is [Ly$\alpha$]{} fluorescence [@sipr98; @sig03; @rod02]. In this scenario the iron lines are produced by primary and/or secondary cascading after the absorption of a [Ly$\alpha$]{} photon between the levels a$^4$G $\rightarrow$ (t,u)$^4$G$^0$ and a$^4$D $\rightarrow$ u$^4$(P,D),v$^4$F. As can be seen in Figure \[fig:gothrian\], there are two main NIR [Fe[ii]{}]{} features in the range of 0.8-2.5$\mu$m that arise from this process: the 1[$\mu$m]{} lines and the bump centered in $\lambda$9200. The importance of this excitation channel is the fact that it populates the upper energy levels whose decay produces the optical [Fe[ii]{}]{} lines, traditionally used to measure the intensity of the iron emission in AGNs [@sig03]. Much of the challenge to the theory of the [Fe[ii]{}]{} emission is to determine if this excitation channel is indeed valid for all AGNs and the degree to which this process contributes to the observed [Fe[ii]{}]{} flux.
In order to answer these two questions, we will analyze first the 1$\mu$m lines. They result from secondary cascading after the capture of a [Ly$\alpha$]{} photon that excites the levels a$^4$G $\rightarrow$ (t,u)$^4$G$^0$ followed by downward UV transitions to the level b$^4$G via 1870/1873Å and 1841/1845Å emission and finally b$^4$G $\rightarrow$ z$^4$F$^0$ transitions, which produce the 1[$\mu$m]{} lines. These lines are important for at least two reasons: (*i*) they are the most intense NIR [Fe[ii]{}]{} lines that can be isolated; and (*ii*) after they are emitted, the z$^4$F and z$^4$D levels are populated. These levels are responsible for $\sim$50$\%$ of the total optical [Fe[ii]{}]{} emission. Therefore, the comparison between the optical and NIR [Fe[ii]{}]{} emission can provide important clues about the relevance of the [Ly$\alpha$]{} fluorescence process in the production of optical [Fe[ii]{}]{}.
We measured the optical [Fe[ii]{}]{} emission for 18 out of 25 AGNs in our sample by applying the @bor92 method to the optical spectra presented in Section \[data\]. [@bor92] found that a suitable [Fe[ii]{}]{} template can be generated by simply broadening the [Fe[ii]{}]{} spectrum derived from the observations of IZw1. The [Fe[ii]{}]{} template strength is free to vary, but it is broadened to be consistent with the width found for the NIR iron lines. The best [Fe[ii]{}]{} template is found by minimization of the $\chi^2$ values of the fit region, set to 4435$-$4750Å. Half of the lines that form this bump comes from downward cascades from the z$^4$F levels. Figure \[fig:opttemp\] shows an example of the optical [Fe[ii]{}]{} template fit to the observed spectrum. In addition, we measured the integrated flux of the [H$\beta$]{} line after subtraction of the underlying [Fe[ii]{}]{} emission.
Afterwards, the amount of [Fe[ii]{}]{} present in each source was quantified by means of [R$_{4570}$]{}, the flux ratio between the [Fe[ii]{}]{} blend centered at 4570 Å and [H$\beta$]{}. Currently, this quantity is employed as an estimator of the amount of optical iron emission in active galaxies. Although values of [R$_{4570}$]{} for some objects of our sample are found in the literature [@jol91; @bor92] we opted for estimating it from our own data. Differences between values of [R$_{4570}$]{} found for the same source by different authors, the lack of proper error estimates in some of them, and the use of different methods to determine [R$_{4570}$]{} [@per88; @jol91], encouraged us to this approach. The values found for [R$_{4570}$]{} in our sample are listed in Table \[tab:4570fit\].
Model results of [@bru08] show that both the BLR and the NLR contribute to the observed permitted Fe[ii]{} emission in the 4300-5400 Å interval. The contribution of the NLR is particularly strong in the 4300-4500Å region and would arise from the a($^6S,^4G$)$\rightarrow$a($^6D,^4F$) and b$^4F\rightarrow$a$^6D$ transitions, in regions of low density ($n_{\rm H} < 10^{4}$ cm$^{-3}$) gas. The iron BLR component, in contrast, dominates the wavelength interval 4500-4700Å. This hypothesis was tested by [@bru08] in the NLS1 galaxy IZw1. Our optical spectra includes the interval of 4200-4750Å, and recall that we followed the empirical method proposed by @bor92 to quantify this emission. In other words, no effort was made to separate the BLR and NLR components. Moreover, because the relevant optical quantity in our work is composed by the blends of [Fe[ii]{}]{} lines located in the interval 4435-4750 Å, were the NLR almost do not contribute, we conclude that this NLR component, if it exists, does not interfer in our results. It is possible, however, to test the presence of NLR [Fe[ii]{}]{} emission in the NIR. [@rif06], for instance, in their NIR atlas of 52 AGNs clearly identified the forbidden \[Fe[ii]{}\] lines at 12570Å and 16634Å in most objects of their sample, but did not find evidence of permitted [Fe[ii]{}]{} emission from the NLR. Here, we also confirm this result. For none of the NIR spectra studied here evidence of a narrow component was found, even in isolated [Fe[ii]{}]{} lines such as [Fe[ii]{}]{}$\lambda$10502. If this contribution exists, it should be at flux levels smaller than our S/N.
Table \[tab:1mulines\] lists the fluxes of the 1[$\mu$m]{} lines. As in the optical, we derive the quantity [R$_{1\mu m}$]{}. In order to determine if both ratios are correlated, we plot [R$_{1\mu m}$]{} vs [R$_{4570}$]{} in Figure \[fig:RonevsR4570\]. Since the energy levels involved in producing the optical lines in the [R$_{4570}$]{} bump are populated after the emission of the NIR [Fe[ii]{}]{} 1$\mu$m lines, a correlation between these quantities can be interpreted as evidence of a common excitation mechanism.
An inspection to Figure \[fig:RonevsR4570\] shows that [R$_{1\mu m}$]{} and [R$_{4570}$]{}are indeed strongly correlated, at least for the range of values covered by our sample.
In order to obtain a linear fit and determine the correlation coefficient, we perform a Monte Carlo simulation with the *bootstrap* method [similarly to @bee90]. First, we run 10000 Monte Carlo simulations in order to determine the effect of the [R$_{1\mu m}$]{} and [R$_{4570}$]{} uncertainties in the linear fit. For each realization, random values of these two quantities were generated (constrained to the error range of the measurements) and a new fit was made. The standard deviation of the fit coefficients, $\epsilon_i$, was determined and represents the uncertainty of the values over the linear fit coefficients. The next step was to run the bootstrap realizations in order to derive the completeness and its effects on the fit. For each run, we made a new fit for a new sample randomly constructed with replacement from the combination of the measured values of [R$_{1\mu m}$]{} and [R$_{4570}$]{}. The standard deviation of these coefficients, $\epsilon_e$, gives us the intrinsic scatter of the measured values. Finally, the error in the coefficients are given by the sum of the $\epsilon_i$ and $\epsilon_e$ in quadrature, i.e., $\sqrt{\epsilon_e ^2 + \epsilon_i ^2}$. The strength of the correlation can be measured by the Pearson Rank coefficient, which indicates how similar two sample populations are.
Following the method above, we found a Pearson rank coefficient of P = 0.78 for the correlation between [R$_{1\mu m}$]{} and [R$_{4570}$]{}. This suggests that the two emissions are very likely excited by the same mechanisms. However, it does not prove that [Ly$\alpha$]{} fluorescence is the dominant process. This is because collisional excitation is also an option. [@rod02], using HST/FOS spectra, found that the [Fe[ii]{}]{} UV lines at 1860Å were intrinsically weak, pointing out that [Ly$\alpha$]{} fluorescence could not produce all the observed intensity of the 1[$\mu$m]{} lines because the number of photons of the latter were significatively larger than those in the former (see Figure \[fig:gothrian\]). They concluded that collisional excitation was responsible for the bulk of the [Fe[ii]{}]{} emission.
We inspected the UV spectra available for our sample in the region around 1860Å. The evidence for the presence of these lines is marginal. For four objects in our sample, though, it was possible to indentify them: 1H1934-063, Mrk335, Mrk1044 and Ark564. The upper limit of such UV emission in these galaxies ranges from 0.6 to 13.2 (10$^{-14}$ergscm$^{-2}$s$^{-1}$) for Mrk1066 and 1H1934-063, respectively [@rod02]. This does not necessarily mean that the lines are not actually emitted in the remainder of the sample. Extinction, for instance, can selectively absorb photons in the UV relative to that of the NIR. Also, the region where these UV lines are located, at least for the spectra we have available, is noisy and makes any reliable detection of these lines very difficult.
Taking into account that the 1[$\mu$m]{} lines are strong in all objects while the primary cascade lines from which they originate are marginally detected, we conclude that [Ly$\alpha$]{} fluorescence does not dominate the excitation channel leading to the NIR [Fe[ii]{}]{} emission.
Here, we propose that collisional excitation is the main process behind the iron NIR lines. This mechanism is more efficient at temperatures above 7000K [@sig03]. Such values are easily found in photoinization equilibrium clouds [$\sim$10000K, @ost89], exciting the bound electrons from the ground levels to those where the 1[$\mu$m]{} lines are produced. The constancy of the flux ratios among [Fe[ii]{}]{} NIR lines found from object to object of our sample supports this result.
[Ly$\alpha$]{} fluorescence, though, should still contribute to the flux observed in the 1$\mu$m lines even if it is not the dominant mechanism. This can be observed in Figure \[fig:RonevsR9200\], where [R$_{1\mu m}$]{} vs [R$_{9200}$]{} is plot. It can be seen that both quantities are correlated, with a Pearson coefficient of P = 0.72. However, in order to make a crude estimate of the contribution of the fluorescence process, we should look at other relationships between the iron lines, such as the bumps at 9200Å and 4570Å.
Recall that the former is produced after the absorption of a [Ly$\alpha$]{} photon, exciting the levels a$^4$D $\rightarrow$ (u,v)$^4$(D,F) followed by downward transitions to the level e$^4$D via the emission of the $\lambda$9200 lines. This latter level decays to e$^4$D $\rightarrow$ z$^4$(Z,F), via UV transitions emitting the lines at $\sim$2800Å. A further cascade process contributes to produce the $\lambda$4570 bump. However, collisional excitation may also populate the upper levels leading to the $\lambda$4570 bump. As the $\lambda$9200 bump is clearly present in all objects of the sample, the presence of this excitation channel is demonstrated. In order to assess the relative contribution of the [Ly$\alpha$]{} fluorescence to the optical [Fe[ii]{}]{} emission, we plot [R$_{9200}$]{} and [R$_{4570}$]{} in Figure \[fig:R9200vsR4570\]. It can be seen that both quantities are indeed well correlated (P = 0.76), showing that part of the photons producing the 9200Å bump are converted into $\lambda$4570 photons.
It is then possible to make a rough estimate of the contribution of the [Ly$\alpha$]{} fluorescence to the optical [Fe[ii]{}]{} emission through the comparison of the number of photons observed in both transitions. Table \[tab:photon\] shows the number of photons in the $\lambda$4570 bump (column 2) and that in the $\lambda$9200 bump (column 3). The ratio between the two quantities is listed in column 4. From Table \[tab:photon\] we estimate that [Ly$\alpha$]{} fluorescence is responsible for $\sim$36$\%$ of the observed optical lines in the [Fe[ii]{}]{} bump centered at 4570Å. The optical [Fe[ii]{}]{} bump at $\lambda$4570 represents about $\sim$50$\%$ of the total optical [Fe[ii]{}]{} emission [@ver04]. This means that, on average, 18$\%$ of all optical [Fe[ii]{}]{} photons observed are produced via downward transitions excited by [Ly$\alpha$]{} fluorescence. This result is in agreement to that presented by [@gar12], which estimated a contribution of 20$\%$ of this excitation mechanism in IZw1.
Location of the [Fe[ii]{}]{} Emitting Line Region {#location}
==================================================
The fact that the BLR remains unresolved for all AGNs poses a challenge to models that try to predict the spatial structure and kinematics of this region. In the simplest approach, we assume that the proximity of this region to the central source (black hole plus accretion disk) implies that the movement of the gas clouds is dominated by the gravitational potential of the black hole. Under this assumption, the analysis of the line profiles (form and width) can provide us with clues about the physical structure of this region.
We address the above issue using the most prominent lines presented in Table \[tab:linefit\]. The line profiles of [Ca[ii]{}]{}$\lambda$8664, [Fe[ii]{}]{} $\lambda$10502, [O[i]{}]{}$\lambda$11287 and [Pa$\beta$]{} are relatively isolated or only moderately blended, making the study of their line profiles more robust than their counterparts in the optical. With the goal of obtaining clues on the structure and kinematics of the BLR, we carried out an analysis of these four line profiles detected in our galaxy sample.
Figure \[fig:feiivsoi\] shows the FWHM of [O[i]{}]{} vs that of [Fe[ii]{}]{}. It is clear from the plot that both lines have very similar widths, with the locus of points very close to the unitary line (red line in the Figure \[fig:feiivsoi\]). We run a Kolmogorov-Smirnov (KS) test to verify the similarity of these two populations. We found a statistical significance of p = 0.74, implying that it is highly likely that both lines belong to the same parent population. This result can also be observed in Figures \[fig:blrprofiles1\] to \[fig:blrprofiles4\], which show that both lines display similar velocity widths and shapes. [@rod02], analyzing a smaller sample, found that these two lines had similar profiles, suggesting that they arise from the same parcel of gas. Our results strongly support these hypothesis using a different and a more sizable sample of 25 AGNs.
A similar behavior is seen in Figure \[fig:feiivscaii\], which shows the FWHM of [Ca[ii]{}]{} vs [Fe[ii]{}]{}. The lower number of points is explained by the fact that for a sub-sample of objects it was not possible to obtain a reliable estimate of the FWHM of [Ca[ii]{}]{} either due to poor S/N or because in some objects [Ca[ii]{}]{} appears in absorption. As with [O[i]{}]{} and [Fe[ii]{}]{}, we found that the width of [Ca[ii]{}]{} is similar to that of [Fe[ii]{}]{}. The KS test reveals a statistical significance of p = 0.81. The combined results of Figures \[fig:feiivsoi\] and \[fig:feiivscaii\] support the physical picture where these three lines are formed in the same region. Since the analysis of the [Fe[ii]{}]{} emission is usually more challenging, the fact of [O[i]{}]{} and [Ca[ii]{}]{} are produced co-spatially with iron provides constrains on the use of these ions to study the same physical region of the BLR [@mat07; @mat08].
In contrast to [O[i]{}]{} and [Ca[ii]{}]{}, the Paschen lines display a different behavior. Figure \[fig:feiivspab\] shows the FWHM of [Pa$\beta$]{} vs [Fe[ii]{}]{}. It is clear that the latter appears systematically narrower than the former, suggesting that the H[i]{} lines are formed in a region closer to the central source than [Fe[ii]{}]{} and, by extension, [O[i]{}]{} and [Ca[ii]{}]{}. The KS test for these two populations resulted in an statistical significance p = 0.001. The average FWHM value for [Pa$\beta$]{} is $\sim$30$\%$ larger than that of [Fe[ii]{}]{}.
Assuming that the [Fe[ii]{}]{} emitting clouds are virialized, the distance between the nucleus and the clouds are given by $D\,\propto\,v^{-2}$. Using in this equation the average difference in width (or velocity) between [Fe[ii]{}]{} and H[i]{}, we found that the [Fe[ii]{}]{} emitting region is twice as far from the nucleus compared to the region where hydrogen emission is produced.
The stratification of the BLR can also be observed in Figures \[fig:blrprofiles1\] to \[fig:blrprofiles4\], which compare the line profiles of the above four lines discussed in this Section. We add to the different panels, when available, C[iv]{}$\lambda$1550, a higher-ionization emission line. The plots show that [Fe[ii]{}]{}, [O[i]{}]{} and [Ca[ii]{}]{} have similar FWHM and profile shapes. [Pa$\beta$]{} has a larger FWHM than [Fe[ii]{}]{}, and the C[iv]{} line is usually the broadest of the five lines. Moreover, the C[iv]{} line profile is highly asymmetric. This result indicates that C[iv]{} is probably emitted in an inner region of the BLR, closer to the central source than [Pa$\beta$]{} and is very likely affected by outflows driven by the central source, as well as electron or Rayleigh scattering [@gas09; @laba05]. An observational test of this scenario was provided by [@nor06] who detected P-Cygni profiles in this line in a sample of 7 AGNs.
The above findings are in good agreement to those reported in the literature for different samples of AGNs and spectral regions. [@hu08] analyzed a sample of more than 4000 spectra of quasars from SDSS and verified that the FWHM of the [Fe[ii]{}]{} lines was, on average, 3/4 that of [H$\beta$]{}. [@slu07], using spectroscopic microlensing studies for the AGN RXSJ1131-1231, found that [Fe[ii]{}]{} is emitted most probably in an outer region beyond [H$\beta$]{}. [@mat08], comparing the intensities of [Ca[ii]{}]{}/[O[i]{}]{}$\lambda$8446 and [O[i]{}]{}$\lambda$11287/[O[i]{}]{}$\lambda$8446 with that predicted by theoretical models, found for 11 AGNs that these lines are emitted in the same region of the BLR, with common location and gas densities. [@mar15] studied the emission of the [Ca[ii]{}]{}Triplet + [O[i]{}]{}8446Å in a sample of 14 luminous AGNs with intermediate redshifts and found intensities ratios and widths consistent with an outer part of a high density BLR, suggesting these two emission lines could be emitted in regions with similar dynamics.
Recent works based on variability studies indicates that [Fe[ii]{}]{} and hydrogen are emitted at different spatial locations, with the former being produced farther out than the latter [@kue08; @kas00; @bar13]. [@kue08], for instance, studied the reverberation behavior of the optical [Fe[ii]{}]{} lines in Akn120. They found that the optical [Fe[ii]{}]{} emission clearly does not originate in the same region as [H$\beta$]{}, and that there was evidence of a reverberation response time of 300 days, which implies an origin in a region several times further away from the central source than [H$\beta$]{}. [@bar13] report similar results in the Seyfert1 galaxies NGC4593 and Mrk1511 and demonstrate that the [Fe[ii]{}]{} emission in these objects originates in gas located predominantly in the outer portion of the broad-line region (see Table \[tab:distance\] for the values). [@hu15], however, analysing the reverberation mapping in a sample of 9 AGNS, identified as super-Eddington accreting massive black holes (SEAMBH), found no difference between the time lags of [Fe[ii]{}]{} and [H$\beta$]{}.
Despite the fact that [Fe[ii]{}]{} reverberation mapping results are quite rare in the literature, the reverberation of [H$\beta$]{} is indeed more common [@kas00; @pet98; @pet99]. [@pet98] present a reverberation mapping for 9 AGNs obtained during a 8 year monitoring campaign, where they derived the distance of the [H$\beta$]{} emitting line region. [@kas00] collected data from a 7.5 year monitoring campaign in order to determine several fundamental properties of AGNs such as BLR size and black hole masses. Four of their objects (Mrk335, Mrk509, NGC4051 and NGC7469) are common to our work, and they found the distance of the [H$\beta$]{} emitting region using reverberation mapping. From the [@hu15] reverberation mapped AGNs we identified 3 objects common to our sample (Mrk335, Mrk1044 and Mrk493). From their results, and assuming that the [Fe[ii]{}]{} emitting clouds are virialized, we may estimate the distance of these iron clouds to the central source using the relation between the measured FWHM of [Fe[ii]{}]{} and [H$\beta$]{} for these objects. The values that we find are presented in Table \[tab:distance\].
Column 2 and 3 of Table \[tab:distance\] show the distance of [H$\beta$]{} and [Fe[ii]{}]{} [@kas00; @hu15 determined by reverberation mapping], respectively. For Mrk335, we notice discrepant values for the distance of [H$\beta$]{} in the work of [@hu15] (8.7 light-days) and [@kas00] (16.8 light-days). Column 4 of Table \[tab:distance\] shows that our estimations to the distance of the [Fe[ii]{}]{} emitting line region. Except for Mrk493, our estimations are in good agreement with those measered from reverberation mapping, with a ratio between the distances of [Fe[ii]{}]{} and [H$\beta$]{} emitting line region $\sim$2, as we predict. [@hu15] point out that distance of the [Fe[ii]{}]{} emitting line region maybe related with the intensity the [Fe[ii]{}]{} emission. They noted that the time lags of [Fe[ii]{}]{} are roughly the same as [H$\beta$]{} in AGNs with [R$_{4570}$]{}$>$1 (including Mrk493 as well the other sources in their sample that are not common to ours), usually classified as strong [Fe[ii]{}]{} emitters, and longer for those with normal/weak [Fe[ii]{}]{} emission ([R$_{4570}$]{}$<$1), as seen in the sample of [@bar13] (and most of our sample). This indicates that the physical properties of strong [Fe[ii]{}]{} emitters may be different of the normal [Fe[ii]{}]{} emitters. Observations of this kind of objects are needed to confirm this hypothesis.
From the results of [@kas00], [@bar13] and [@hu15], we can also estimate a mean distance for the [H$\beta$]{} and [Fe[ii]{}]{} emitting line region: $\tau$([H$\beta$]{})=19.7 light-days and $\tau$([Fe[ii]{}]{})=40.5 light-days. If we include high luminosity quasars (such as Mrk509) the average values are significantly higher: $\tau$([H$\beta$]{})=80.3 light-days and $\tau$([Fe[ii]{}]{})=164.6 light-days.
Assuming a Keplerian velocity field where the BLR emitting clouds are gravitationally bound to the central source, the above results suggest that the low-ionization lines ([Fe[ii]{}]{}, [Ca[ii]{}]{} and [O[i]{}]{}) are formed in the same outer region of the BLR. Moreover the hydrogen lines would be formed in a region closer to the central source. This scenario is compatible with the physical conditions needed for the formation of [Fe[ii]{}]{} and [O[i]{}]{}: that is, neutral gas strongly protected from the incident ionizing radiation coming from the central source. These conditions can only be found in the outer regions of the central source. Our work confirms results obtained in previous works using different methods in different spectral regions [@rod02; @per88; @hu08; @bar13; @slu07], but on significantly smaller samples.
Final Remarks {#conclusion}
=============
We analyzed for the first time a NIR sample of 25 AGNs in order to verify the suitability of the NIR [Fe[ii]{}]{} template developed by [@gar12] in measuring the [Fe[ii]{}]{} strength in a broad range of objects. We also studied the excitation mechanisms that lead to this emission and derived the most likely region where it is produced. The analysis and results carried out in the previous sections can be summarized as follows:
- We identified, for the first time in a sizable sample of AGNs, the [Ly$\alpha$]{} excitation mechanism predicted by [@sipr98]. The key feature of this process is the [Fe[ii]{}]{} bump at 9200Å, which is clearly present in all objects of the sample.
- We demonstrated the suitability of the NIR [Fe[ii]{}]{} template developed by [@gar12] in reproducing most of the iron features present in the objects of the sample. The template models and subtracts the NIR [Fe[ii]{}]{} satisfactorily. We found that the relative intensity of the 1$\mu$m lines remains constant from object to object, suggesting a common excitation mechanism (or mechanisms), most likely collisional excitation. Qualitative analysis made with the NIR and UV spectra lead us to conclude that this process contributes to most of the [Fe[ii]{}]{} production, but [Ly$\alpha$]{} fluorescence must also contribute to this emission. However, the percentage of the contribution should vary from source to source, producing the small differences found between the predicted and observed $\lambda$9200 bump strengths. Despite this, it is still possible to determine the total [Fe[ii]{}]{} intensity of the bump.
- We found that the NIR [Fe[ii]{}]{} emission and the optical [Fe[ii]{}]{} emission are strongly correlated. The strong correlation between the indices [R$_{1\mu m}$]{}, [R$_{9200}$]{} and [R$_{4570}$]{} show that [Ly$\alpha$]{} fluorescence plays an important role in the production of the [Fe[ii]{}]{} observed in AGNs.
- Through the comparison between the number of [Fe[ii]{}]{} photons in the 9200Å bump and that in the 4570Å bump, we determine that [Ly$\alpha$]{} fluorescence should contribute with at least $\sim$18$\%$ to all optical [Fe[ii]{}]{} flux observed in AGNs. This is a lower limit, since UV spectroscopy at a spectral resolution higher than currently available is needed to estimate the total contribution of this process to the observed [Fe[ii]{}]{} emission. This result is key to the development of more accurate models that seek to better understand the [Fe[ii]{}]{} spectrum in AGNs.
- The comparison of BLR emission line profiles shows that [Fe[ii]{}]{}, [O[i]{}]{} and [Ca[ii]{}]{} display similar widths for a given object. This result implies that they all are produced in the same physical region of the BLR. In contrast, the [Pa$\beta$]{} profiles are systematically broader than those of iron (30% broader, on average). This indicates that the former are produced in an region closer to the central source than the latter (2$\times$ closer, on average). These results and data from reverberation mapping allowed us to estimate the distance of the [Fe[ii]{}]{} emitting clouds from the central source for six objects in our sample. The values found range from a few light-days ($\sim$9 in NGC4051) to nearly $\sim$200 (in Mrk509). Overall, our results agree with those found independently via reverberation mapping, giving additional support to our approach. These results should also guide us to understand why reverberation mapping has had little success in detecting cross-correlated variations between the AGN continuum and the [Fe[ii]{}]{}lines.
We are grateful to U.S. National Science Foundatation (NSF AST-1409207), the Canadean and Brazilean funding agencies (NSERC, FAPEMIG and CNPq) by their support to this paper. The research presented here use of the NASA/IPAC Extragalactic Database (NED), which is operated by the Jet Propulsion Laboratory, California Institute of Technology, under contract with the National Aeronautics and Space Administration.
Baldwin, J. A., Ferland, G. J., Korista, K. T., Hamann, F., $\&$ LaCluyzé, A. 2004, , 615,610 Barth, A. J., Pancoast, A., Bennert, V. N., et al., 2013, , 769, 128 Beers, T. C., Flynn, K. $\&$ Gebhardt, K. 1990, , 100,32 Bischoff, K.; Kollatschny, W. 1999, , 345, 49 Boroson T. A., $\&$ Green, R. F. 1992, , 80, 109 Bruhweiler, F., $\&$ Verner, E. 2008, , 675, 83 Cushing, M., Vacca, W. D., $\&$ Rayner, J. T. 2004, , 116, 362 Dietrich, M.; Kollatschny, W.; Peterson, B. M., et al. 1993, , 408, 416 Dong. X-B, Ho, L. C., Wang, J-G, Wang, T-G., Wang, H., Fan, X. $\&$ Zhou, H. 2010, , 721, 123 Dong. X-B, Wang, J-G, C. Ho, L. C., Wang, T-G., Fan, X., Wang, H., Zhou, H. $\&$ Yuan, W. 2011, , 736, 86 Garcia-Rissmann, A., Rodríguez-Ardila, A., Sigut, T. A. A., $\&$ Pradhan, A. K. 2012, , 751, 7 Gaskell, C. M. 2009, New A Rev., 53, 140 Giannuzzo, E. M. $\&$ Stirpe, G. M. 1996, Hu, C., Wang, J.-M, Ho, L C., Chen, Y.-M., Zhang, H.-T., Bian, W.-H., $\&$ Xue, S.-J. 2008, , 687, 78 Hu, C., Du, P., Li, Y-R, Wang, F., Qu, J., Bai, J-M., Kaspi, S., Ho., L. C., Netzer, H. $\&$ Wang, J-M. 2015, , 804, 138 Joly, M., 1991, , 242, 49 Joly, M., 1993, Ann. Phys. Fr., 18, 241 Kaspi, S., Smith, P.l S., Netzer, H., et al. 2000, , 533, 631 Kollatschny, W.; Fricke, K. J.; Schleicher, H.; Yorke, H. W. 1981, , 102, 23 Kollatschny, W.; Fricke, K. J. 1985, , 146, 11 Kollatschny, W.; Dietrich, M. 1996, , 314, 43 Kollatschny, W., Bischoff, K. $\&$ Dietrich, M. 2000, , 361, 901 Kollatschny, W., Zetzl, M. $\&$ Dietrich, M. 2006, , 454, 459 Kovačević, J., Popović, L. Č., $\&$ Dimitrijević, M. S. 2010, , 673, 69 Kuehn, C. A., Baldwin, J. A., Peteron, B.M., $\&$ Korista, K. T. 2008, , 673, 69 Landt, H., Bentz, M. C., Ward, M. J., Elvis, M., Peterson, B. M., Korista, K. T., $\&$ Karovska, M. 2008, , 174, 282 Baskin, A., Laor, A. 2005, , 356, 1029 Lawrence, A., Elvis, M., Wilkes, B. J., McHardy, I., $\&$ Brandt, N. 1997, , 285, 879 Martínez-Aldama, M. L., Dultzin, D., Marziani, P., Sulentic, J. W., Bressan, A., Chen, Y., $\&$ Stirpe, G. M. 2015, , 217, 3 Matsuoka, Y., Oyabu, S., Tsuzuki, Y., $\&$ Kawara, K. 2007, , 663, 781 Matsuoka, U., Oyabu, S., Tsuzuki, Y., $\&$ Kawara, K. 2008, , 673, 62 North, M., Knigge, C. $\&$ Goad, M. 2006, , 365, 1057 Osterbrock, D. E. 1989, University Science Books, v.422 Penston, M. V. 1987, , 229, IP Persson, S. E. 1988, , 330, 751 Peterson, B. M., Wanders, I., Bertram, R., et al. 1998, , 501, 82 Peterson, B. M., Ferrarese, L., Gilbert, K. M., et al. 2004, , 613, 682 Peterson, B., $\&$ Wandel, A. 1999, , 521, L95 Pogge, R. W., $\&$ Owen, J. M. 1993, Ohio State Univ. Int. Rep. 93-01 Popović, L. Č., Smirnova, A., Ilic, D., Moiseev, A., Kovačević, J., $\&$ Afanasiev, V. 2007, in The Central Engine of Active Galactic Nuclei, ed. L. C. Ho $\&$ J.-M. Wang (San Fracisco: ASP), 552 Pradhan A. K. $\&$ Nahar S. N., 2011, Atomic Astrophysics and Spectroscopy. Cambridge Univ. Press, Cambridge Rayner, J. T., Toomey, D. W., Onaka, P. M., et al. 2003, , 115, 362 Riffel, R., Rodrí́guez-Ardila, A., $\&$ Pastoriza, M. 2006, , 457, 61 Rodríguez-Ardila, A., Binette, L., Pastoriza, M. G., $\&$ Donzelli, C. J. 2000a, , 538, 581 Rodríguez-Ardila, A., Viegas, S. M., Pastoriza, M. G., $\&$ Prato, L. 2002, , 565, 140 Rudy, R. J., Mazuk, S., Puetter, R. C., $\&$ Hamann, F. 2000, , 539, 166 Sargent W. L. W. 1968, , 152, 31 Schlegel, D. J., Finkbeiner, D. P., $\&$ Davis, M. 1998, , 500, 525 Shapovalova, A. I., Popovic, L. C., Burenkov, A. N., et al. 2012, , 202, 22 Sigut, T. A. A., $\&$ Pradhan, A. K. 1998, , 499, L139 Sigut, T. A. A., $\&$ Pradhan, A. K. 2003, , 145, 15 Sigut, T. A. A., Nahar, S. N., $\&$ Pradhan, A. K. 2004, , 611, 81 Sluse, D., Claeskens, J.-F., Hutsemémers, D., $\&$ Surdej, J. 2007, , 468, 885. Sulentic, J. W., Zwitter, T., Marziani, P., $\&$ Dultzin-Hacyan, D. 2000, , 536, L5 Tsuzuki, Y., Kawara, K., Yoshii, Y., et al. 2006, , 650, 57 Vacca, W. D., Cushing, M. C., $\&$ Rayner, J. T. 2003, , 115, 389 Verner, E. M., Verner, D. A., Korista, K. T., Ferguson, J. W., Hamann, F. $\&$ Ferland, G. J. 1999, , 120, 101 Véron-Cetty, M.-P., Joly, M., $\&$ Véron, P. 2004, , 417, 515 Vestergaard, M., $\&$ Wilkes, B. J. 2001, , 134, 1 Wang, J., Wei, J. Y. $\&$ He, X. T. , 436, 416 Wills, B. J., Netzer, H., $\&$ Wills, D. 1985, , 288, 94 Wampler, E. J. $\&$ Oke J. B. 1967, , 148, 69
[lccccc]{} Mrk335 &NLS1 &0.02578 &2000 Oct. 21 &2400 &0.030\
IZw1 &NLS1 &0.06114 &2003 Oct. 23 &2400 &0.057\
TonS180 &NLS1 &0.06198 &2000 Oct. 11 &2400 &0.013\
Mrk1044 &NLS1 &0.01645 &2000 Oct. 11 &1800 &0.031\
Mrk1239 &NLS1 &0.01927 &2002 Apr. 21 &1920 &0.065\
& & &2002 Apr. 23 &1920 &\
Mrk734 &S1 &0.05020 &2002 Apr. 23 &2400 &0.029\
PG1126-041 &QSO &0.06000 &2002 Apr. 23 &1920 &0.055\
& & &2002 Apr. 24 &2160 &\
H1143-182 &S1 &0.03330 &2002 Apr. 21 &1920 &0.039\
NGC4051 &NLS1 &0.00234 &2002 Apr. 20 &1560 &0.013\
Mrk766 &NLS1 &0.01330 &2002 Apr. 21 &1680 &0.020\
& & &2002 Apr. 25 &1080 &\
NGC4748 &NLS1 &0.01417 &2002 Apr. 21 &1680 &0.052\
& & &2002 Apr. 25 &1440 &\
Ton156 &QSO &0.54900 &2002 Apr. 25 &3600 &0.015\
PG1415+451 &QSO &0.11400 &2002 Apr. 24 &3960 &0.009\
& & &2002 Apr. 25 &1440 &\
Mrk684 &S1 &0.04607 &2002 Apr. 21 &1440 &0.021\
Mrk478 &NLS1 &0.07760 &2002 Apr. 20 &3240 &0.014\
PG1448+273 &QSO &0.06522 &2002 Apr. 24 &2160 &0.029\
PG1519+226 &QSO &0.13700 &2002 Apr. 25 &4000 &0.043\
Mrk493 &NLS1 &0.03183 &2002 Apr. 20 &1800 &0.025\
& & &2002 Apr. 25 &900 &\
PG1612+262 &QSO &0.13096 &2002 Apr. 23 &2520 &0.054\
Mrk504 &NLS1 &0.03629 &2002 Apr. 21 &2100 &0.050\
1H1934-063 &NLS1 &0.01059 &2004 Jun. 02 &2160 &0.293\
Mrk509 &S1 &0.34397 &2003 Oct. 23 &1440 &0.057\
& & &2004 Jun. 01 &2160 &\
1H2107-097 &S1 &0.02652 &2003 Oct. 23 &1680 &0.233\
Ark564 &NLS1 &0.02468 &2002 Oct. 10 &1500 &0.060\
& & &2003 Jun. 23 &2160 &\
NGC7469 &S1 &0.01632 &2003 Oct. 23 &1920 &0.069
[lcc]{} Mrk335 & Casleo & -\
IZw1 & Casleo & HST FOS\
TonS180 & Casleo & HST STIS\
Mrk1044 & Casleo & HST COS\
Mrk1239 & Casleo &\
Mrk734 & KPNO & -\
H1143-182 & Casleo & -\
NGC4748 & Casleo & -\
Ton156 & SDSS & -\
PG1415+451 & SDSS & HST FOS\
Mrk478 & KPNO & HST FOS\
PG1448+273 & SDSS & -\
PG1519+226 & SDSS & -\
Mrk493 & SDSS & HST FOS\
PG1612+262 & SDSS & HST FOS\
1H1934-063 & Casleo & -\
Mrk509 & - & HST COS\
1H2107-097 & Casleo & -\
NGC7469 & Casleo & -
[lcccccccccccc]{} Mrk335 & 14.4 $\pm$ 0.9 & 1230 $\pm$ 74 & 26.0 $\pm$ 2.3 & 1140 $\pm$ 103 & 14.7 $\pm$ 1.2 & 1490 $\pm$ 119 & 87.1 $\pm$ 5.2 & 2010 $\pm$ 121\
IZw1 & 39.8 $\pm$ 1.6 & 890 $\pm$ 36 & 29.9 $\pm$ 2.1 & 820 $\pm$ 57 & 28.6 $\pm$ 2.0 & 1100 $\pm$ 77 & 86.7 $\pm$ 3.5$^a$ & 1650 $\pm$ 66$^a$\
TonS180 & 2.8 $\pm$ 0.1 & 1030 $\pm$ 52 & 5.5 $\pm$ 0.4 & 930 $\pm$ 74 & 5.2 $\pm$ 0.4 & 990 $\pm$ 69 & 24.0 $\pm$ 1.2$^a$ & 1660 $\pm$ 83$^a$\
Mrk1044 & 9.7 $\pm$ 0.6 & 1480 $\pm$ 79 & 11.7 $\pm$ 0.7 & 1010 $\pm$ 61 & 7.2 $\pm$ 0.4 & 1200 $\pm$ 72 & 24.2 $\pm$ 1.4 & 1800 $\pm$ 119\
Mrk1239 & 29.1 $\pm$ 1.7 & 1350 $\pm$ 81 & 50.1 $\pm$ 4.0 & 1220 $\pm$ 98 & 16,2 $\pm$ 1.0 & 1240 $\pm$ 74 & 135.5 $\pm$ 8.1 & 2220 $\pm$ 133\
Mrk734 & 17.8 $\pm$ 2.1 & 1600 $\pm$ 192 & 17.3 $\pm$ 0.9 & 1670 $\pm$ 84 & - - & - - & 71.9 $\pm$ 8.6$^a$ & 1830 $\pm$ 220$^a$\
PG,1126-041 & 25.0 $\pm$ 2.3 & 2000 $\pm$ 180 & 39.4 $\pm$ 2.4 & 1940 $\pm$ 116 & - - & - - & 128.6 $\pm$ 11.6$^a$& 2600 $\pm$ 234$^a$\
H1143-182 & 18.5 $\pm$ 1.7 & 2170 $\pm$ 195 & 34.5 $\pm$ 2.1 & 1720 $\pm$ 103 & - - & - - & 151.2 $\pm$ 13.6 & 2070 $\pm$ 186\
NGC4051 & 20.0 $\pm$ 2.4 & 1430 $\pm$ 172 & 51.6 $\pm$ 2.6 & 1035 $\pm$ 52 & - - & - - & 65.1 $\pm$ 7.8 & 1530 $\pm$ 184\
Mrk766 & 21.2 $\pm$ 2.5 & 1650 $\pm$ 198 & 50.9 $\pm$ 2.0 & 1380 $\pm$ 55 & 17.9 $\pm$ 1.6 & 1520 $\pm$ 137 & 115.4 $\pm$ 13.9 & 1780 $\pm$ 214\
NGC4748 & 21.2 $\pm$ 1.9 & 1800 $\pm$ 162 & 24.7 $\pm$ 2.0 & 1650 $\pm$ 132 & - - & - - & 62.9 $\pm$ 5.7 & 2130 $\pm$ 192\
Ton156 & 47.8 $\pm$ 5.7 & 2050 $\pm$ 246 & 38.1 $\pm$ 2.3 & 2070 $\pm$ 124 & - - & - - & 144.6 $\pm$ 17.4 & 3490 $\pm$ 419\
PG1415+451 & 4.4 $\pm$ 0.4 & 2140 $\pm$ 171 & 5.3 $\pm$ 0.3 & 1780 $\pm$ 107 & - - & - - & 17.2 $\pm$ 1.4$^a$ & 2530 $\pm$ 202$^a$\
Mrk684 & 43.5 $\pm$ 2.6 & 1430 $\pm$ 86 & 53.0 $\pm$ 2.7 & 1560 $\pm$ 78 & 64.2 $\pm$ 4.5 & 1520 $\pm$ 106 & 107.7 $\pm$ 6.5$^a$ & 2400 $\pm$ 144$^a$\
Mrk478 & 50.7 $\pm$ 3.0 & 1400 $\pm$ 84 & 48.1 $\pm$ 3.4 & 1300 $\pm$ 91 & 40.3 $\pm$ 2.4 & 1560 $\pm$ 94 & 122.6 $\pm$ 7.4$^a$ & 1940 $\pm$ 116$^a$\
PG1448+273 & 10.9 $\pm$ 0.5 & 950 $\pm$ 48 & 32.3 $\pm$ 1.3 & 880 $\pm$ 35 & 12.4 $\pm$ 0.6 & 885 $\pm$ 44 & 66.9 $\pm$ 3.3$^a$ & 2480 $\pm$ 124$^a$\
PG1519+226 & 4.4 $\pm$ 0.4 & 2280 $\pm$ 182 & 7.9 $\pm$ 0.9 & 1890 $\pm$ 227 & - - & - - & 20.1 $\pm$ 1.6 & 2800 $\pm$ 224\
Mrk493 & 16.2 $\pm$ 0.6 & 800 $\pm$ 32 & 26.1 $\pm$ 1.0 & 770 $\pm$ 31 & 29.4 $\pm$ 1.8 & 1065 $\pm$ 64 & 40.0 $\pm$ 1.6$^a$ & 1970 $\pm$ 79$^a$\
PG1612+262 & 3.7 $\pm$ 0.3 & 1770 $\pm$ 124 & 10.9 $\pm$ 1.2 & 2310 $\pm$ 254 & - - & - - & 63.8 $\pm$ 4.5$^a$ & 2770 $\pm$ 194$^a$\
Mrk504 & 6.0 $\pm$ 0.4 & 1630 $\pm$ 114 & 3.9 $\pm$ 0.3 & 1620 $\pm$ 130 & - - & - - & 20.5 $\pm$ 1.4$^a$ & 2390 $\pm$ 167$^a$\
1H1934-063 & 16.7 $\pm$ 1.5 & 1200 $\pm$ 108 & 35.7 $\pm$ 2.9 & 1000 $\pm$ 80 & 28.6 $\pm$ 2.0 & 1205 $\pm$ 84 & 62.8 $\pm$ 5.7 & 1520 $\pm$ 137\
Mrk509 & 287.1 $\pm$ 12.6 & 2220 $\pm$ 178 & 640.2 $\pm$ 16.8 & 2390 $\pm$ 239 & - - & - - & 2474.0 $\pm$ 250.4$^a$& 3720 $\pm$ 298$^a$\
1H,2107-097 & 29.9 $\pm$ 1.8 & 1800 $\pm$ 108 & 20.7 $\pm$ 1.7 & 1720 $\pm$ 138 & 10.8 $\pm$ 0.9 & 1700 $\pm$ 136 & 116.1 $\pm$ 7.0 & 2570 $\pm$ 154\
Ark564 & 17.9 $\pm$ 0.9 & 800 $\pm$ 40 & 27.8 $\pm$ 1.4 & 820 $\pm$ 41 & 28.7 $\pm$ 1.7 & 990 $\pm$ 59 & 56.9 $\pm$ 2.8 & 1800 $\pm$ 90\
NGC7469 & 24.3 $\pm$ 1.7 & 1860 $\pm$ 130 & 48.1 $\pm$ 2.9 & 1830 $\pm$ 110 & - - & - - & 174.9 $\pm$ 12.2 & 2800 $\pm$ 196\
.
[lccccc]{} Mrk335 & 14.1 $\pm$ 0.9 & 1220 $\pm$ 74 & Gaussian & 1.60 & 1.42\
IZw1 & 38.8 $\pm$ 1.6 & 870 $\pm$ 36 & Lorentzian & 2.60 & 2.40\
TonS180 & 2.4 $\pm$ 0.1 & 1020 $\pm$ 52 & Gaussian & 0.29 & 0.35\
Mrk1044 & 9.0 $\pm$ 0.6 & 1330 $\pm$ 79 & Gaussian & 0.55 & 0.65\
Mrk1239 & 29.9 $\pm$ 1.7 & 1360 $\pm$ 81 & Gaussian & 2.70 & 2.50\
Mrk734 & 16.8 $\pm$ 2.1 & 1620 $\pm$ 192 & Gaussian & 1.06 & 1.16\
PG,1126-041 & 23.9 $\pm$ 2.3 & 2040 $\pm$ 180 & Gaussian & 1.87 & 1.83\
H1143-182 & 17.9 $\pm$ 1.7 & 2150 $\pm$ 195 & Gaussian & 3.01 & 2.92\
NGC4051 & 20.8 $\pm$ 2.4 & 1420 $\pm$ 172 & Gaussian & 0.90 & 0.70\
Mrk766 & 20.8 $\pm$ 2.5 & 1620 $\pm$ 198 & Gaussian & 2.20 & 2.10\
NGC4748 & 20.2 $\pm$ 1.9 & 1780 $\pm$ 162 & Gaussian & 1.20 & 1.26\
Ton156 & 46.8 $\pm$ 5.7 & 2030 $\pm$ 246 & Gaussian & 2.20 & 2.03\
PG1415+451 & 4.1 $\pm$ 0.4 & 2110 $\pm$ 171 & Gaussian & 0.48 & 1.60\
Mrk684 & 43.1 $\pm$ 2.6 & 1420 $\pm$ 86 & Gaussian & 4.19 & 4.35\
Mrk478 & 50.3 $\pm$ 3.0 & 1400 $\pm$ 84 & Gaussian & 2.30 & 2.35\
PG1448+273 & 11.3 $\pm$ 0.5 & 920 $\pm$ 48 & Gaussian & 0.68 & 0.74\
PG1519+226 & 4.6 $\pm$ 0.4 & 2230 $\pm$ 182 & Gaussian & 6.40 & 5.90\
Mrk493 & 16.5 $\pm$ 0.6 & 800 $\pm$ 32 & Lorentzian & 2.80 & 2.71\
PG1612+262 & 3.3 $\pm$ 0.3 & 1760 $\pm$ 124 & Gaussian & 0.56 & 0.48\
Mrk504 & 6.2 $\pm$ 0.4 & 1620 $\pm$ 114 & Gaussian & 0.69 & 0.76\
1H1934-063 & 16.2 $\pm$ 1.5 & 1200 $\pm$ 108 & Gaussian & 1.70 & 1.65\
Mrk509 & 290.0 $\pm$ 13.4 & 2250 $\pm$ 178 & Gaussian & 1.80 & 1.70\
1H,2107-097 & 29.5 $\pm$ 1.8 & 1810 $\pm$ 108 & Gaussian & 0.89 & 0.84\
Ark564 & 17.1 $\pm$ 0.9 & 810 $\pm$ 40 & Lorentzian & 2.20 & 2.32\
NGC7469 & 24.9 $\pm$ 1.7 & 1840 $\pm$ 130 & Gaussian & 1.17 & 1.05\
[lcccccc]{} Mrk335 & 14.8 $\pm$ 0.6 & 13.9 $\pm$ 0.6 & 10.1 $\pm$ 0.4 & 6.8 $\pm$ 0.3 & 87.1 $\pm$ 5.2 & 0.52 $\pm$ 0.07\
IZw1 & 30.4 $\pm$ 1.2 & 29.4 $\pm$ 1.2 & 21.9 $\pm$ 0.9 & 14.2 $\pm$ 0.6 & 52.9 $\pm$ 2.1$^a$ & 1.81 $\pm$ 0.08\
TonS180 & 2.5 $\pm$ 0.1 & 2.4 $\pm$ 0.1 & 1.8 $\pm$ 0.1 & 1.2 $\pm$ 0.1 & 14.6 $\pm$ 0.7$^a$ & 0.54 $\pm$ 0.07\
Mrk1044 & 8.5 $\pm$ 0.3 & 8.0 $\pm$ 0.3 & 5.8 $\pm$ 0.2 & 4.0 $\pm$ 0.2 & 24.2 $\pm$ 1.4 & 1.08 $\pm$ 0.07\
Mrk1239 & 29.7 $\pm$ 1.2 & 28.1 $\pm$ 1.1 & 20.2 $\pm$ 0.8 & 13.7 $\pm$ 0.5 & 135.6 $\pm$ 8.1 & 0.68 $\pm$ 0.07\
Mrk734 & 15.1 $\pm$ 0.6 & 16.0 $\pm$ 0.6 & 10.7 $\pm$ 0.4 & 7.2 $\pm$ 0.3 & 43.9 $\pm$ 5.3$^a$ & 1.12 $\pm$ 0.09\
PG,1126-041 & 14.5 $\pm$ 0.6 & 14.0 $\pm$ 0.6 & 10.0 $\pm$ 0.4 & 7.0 $\pm$ 0.3 & 78.4 $\pm$ 7.1$^a$ & 0.58 $\pm$ 0.06\
H1143-182 & 12.0 $\pm$ 0.5 & 11.7 $\pm$ 0.5 & 8.3 $\pm$ 0.3 & 5.8 $\pm$ 0.2 & 151.2 $\pm$ 13.6 & 0.25 $\pm$ 0.02\
NGC4051 & 20.0 $\pm$ 0.8 & 18.8 $\pm$ 0.8 & 13.6 $\pm$ 0.5 & 9.4 $\pm$ 0.4 & 65.1 $\pm$ 7.8 & 0.95 $\pm$ 0.11\
Mrk766 & 18.3 $\pm$ 0.7 & 17.6 $\pm$ 0.7 & 13.1 $\pm$ 0.5 & 9.0 $\pm$ 0.4 & 115.4 $\pm$ 13.9 & 0.50 $\pm$ 0.06\
NGC4748 & 18.0 $\pm$ 0.7 & 17.6 $\pm$ 0.7 & 12.7 $\pm$ 0.5 & 8.8 $\pm$ 0.4 & 62.9 $\pm$ 5.7 & 0.91 $\pm$ 0.07\
Ton156 & 33.9 $\pm$ 1.4 & 30.1 $\pm$ 1.2 & 25.0 $\pm$ 1.0 & 17.3 $\pm$ 0.7 & 144.6 $\pm$ 17.4 & 0.74 $\pm$ 0.06\
PG1415+451 & 4.5 $\pm$ 0.2 & 4.7 $\pm$ 0.2 & 3.2 $\pm$ 0.1 & 2.2 $\pm$ 0.1 & 10.5 $\pm$ 0.8$^a$ & 1.39 $\pm$ 0.07\
Mrk684 & 44.6 $\pm$ 1.8 & 43.0 $\pm$ 1.7 & 30.9 $\pm$ 1.2 & 21.5 $\pm$ 0.9 & 65.7 $\pm$ 3.9$^a$ & 1.13 $\pm$ 0.13\
Mrk478 & 51.7 $\pm$ 2.1 & 51.6 $\pm$ 2.1 & 38.7 $\pm$ 1.5 & 26.6 $\pm$ 1.1 & 74.7 $\pm$ 4.5$^a$ & 1.26 $\pm$ 0.14\
PG1448+273 & 10.1 $\pm$ 0.4 & 9.9 $\pm$ 0.4 & 7.2 $\pm$ 0.3 & 4.9 $\pm$ 0.2 & 40.8 $\pm$ 2.0$^a$ & 0.79 $\pm$ 0.07\
PG1519+226 & 3.7 $\pm$ 0.1 & 3.5 $\pm$ 0.1 & 2.6 $\pm$ 0.1 & 1.8 $\pm$ 0.1 & 20.1 $\pm$ 1.6 & 0.58 $\pm$ 0.06\
Mrk493 & 11.6 $\pm$ 0.5 & 11.2 $\pm$ 0.4 & 8.2 $\pm$ 0.3 & 5.4 $\pm$ 0.2 & 24.4 $\pm$ 1.0$^a$ & 1.49 $\pm$ 0.09\
PG1612+262 & 2.2 $\pm$ 0.1 & 2.1 $\pm$ 0.1 & 1.5 $\pm$ 0.1 & 1.0 $\pm$ 0.1 & 38.9 $\pm$ 2.7$^a$ & 0.18 $\pm$ 0.04\
Mrk504 & 5.3 $\pm$ 0.2 & 5.4 $\pm$ 0.2 & 3.9 $\pm$ 0.2 & 2.6 $\pm$ 0.1 & 12.5 $\pm$ 0.9$^a$ & 0.49 $\pm$ 0.35\
1H1934-063 & 17.6 $\pm$ 0.7 & 16.9 $\pm$ 0.7 & 12.2 $\pm$ 0.5 & 8.4 $\pm$ 0.3 & 62.8 $\pm$ 5.7 & 0.88 $\pm$ 0.06\
Mrk509 & 306.1 $\pm$ 16.7 & 295.8 $\pm$ 10.0 & 211.0 $\pm$ 11.7 & 141.1 $\pm$ 7.5 & 2474.0 $\pm$ 250.4$^a$& 0.26 $\pm$ 0.10\
1H,2107-097 & 24.0 $\pm$ 1.0 & 23.6 $\pm$ 0.9 & 16.7 $\pm$ 0.7 & 11.7 $\pm$ 0.5 & 116.1 $\pm$ 7.0 & 0.65 $\pm$ 0.08\
Ark564 & 11.6 $\pm$ 0.5 & 11.3 $\pm$ 0.5 & 8.3 $\pm$ 0.3 & 5.6 $\pm$ 0.2 & 56.9 $\pm$ 2.8 & 0.65 $\pm$ 0.01\
NGC7469 & 17.1 $\pm$ 0.7 & 16.5 $\pm$ 0.7 & 11.9 $\pm$ 0.5 & 8.3 $\pm$ 0.3 & 174.9 $\pm$ 12.2 & 0.31 $\pm$ 0.04\
.
[lccccc]{} Mrk335 & 16.8 $\pm$ 0.7 & 45.8 $\pm$ 2.7 & 18.2 $\pm$ 1.1 & 44.4 $\pm$ 2.9 & 0.51 $\pm$ 0.03\
IZw1 & 30.5 $\pm$ 1.2 & 27.3 $\pm$ 2.3 & 11.1 $\pm$ 0.4 & 46.7 $\pm$ 3.4 & 0.88 $\pm$ 0.04\
TonS180 & 2.6 $\pm$ 0.1 & 6.0 $\pm$ 0.3 & 3.1 $\pm$ 0.2 & 5.5 $\pm$ 0.3 & 0.33 $\pm$ 0.05\
Mrk1044 & 9.4 $\pm$ 0.4 & 8.8 $\pm$ 0.5 & 5.0 $\pm$ 0.3 & 13.1 $\pm$ 0.9 & 0.54 $\pm$ 0.03\
Mrk1239 & 30.9 $\pm$ 1.2 & 31.7 $\pm$ 1.9 & 28.3 $\pm$ 1.7 & 34.3 $\pm$ 2.3 & 0.25 $\pm$ 0.02\
Mrk734 & 16.0 $\pm$ 0.6 & 18.6 $\pm$ 2.2 & 9.2 $\pm$ 1.1 & 25.4 $\pm$ 3.3 & 0.35 $\pm$ 0.04\
PG,1126-041 & 15.5 $\pm$ 0.6 & 43.9 $\pm$ 3.9 & 16.5 $\pm$ 1.5 & 42.8 $\pm$ 4.2 & 0.33 $\pm$ 0.03\
H1143-182 & 12.7 $\pm$ 0.5 & 51.1 $\pm$ 4.6 & 31.5 $\pm$ 2.8 & 32.4 $\pm$ 3.2 & 0.21 $\pm$ 0.02\
NGC4051 & 22.7 $\pm$ 0.9 & 35.3 $\pm$ 4.2 & 13.6 $\pm$ 1.6 & 44.5 $\pm$ 5.9 & 0.68 $\pm$ 0.08\
Mrk766 & 21.3 $\pm$ 0.9 & 53.7 $\pm$ 6.4 & 24.0 $\pm$ 2.9 & 51.0 $\pm$ 6.7 & 0.44 $\pm$ 0.05\
NGC4748 & 20.4 $\pm$ 0.8 & 30.1 $\pm$ 2.7 & 13.1 $\pm$ 1.2 & 37.3 $\pm$ 3.7 & 0.59 $\pm$ 0.05\
Ton156 & 38.1 $\pm$ 1.5 & 33.1 $\pm$ 4.0 & 30.1 $\pm$ 3.6 & 41.0 $\pm$ 5.4 & 0.28 $\pm$ 0.03\
PG1415+451 & 5.7 $\pm$ 0.2 & 7.5 $\pm$ 0.6 & 2.2 $\pm$ 0.2 & 11.1 $\pm$ 1.0 & 0.64 $\pm$ 0.05\
Mrk684 & 50.8 $\pm$ 2.0 & 44.2 $\pm$ 2.6 & 13.8 $\pm$ 0.8 & 81.1 $\pm$ 5.4 & 0.75 $\pm$ 0.05\
Mrk478 & 50.5 $\pm$ 2.0 & 36.4 $\pm$ 2.2 & 15.7 $\pm$ 0.9 & 71.2 $\pm$ 4.7 & 0.58 $\pm$ 0.03\
PG1448+273 & 11.4 $\pm$ 0.5 & 20.1 $\pm$ 1.0 & 8.6 $\pm$ 0.4 & 22.9 $\pm$ 1.3 & 0.34 $\pm$ 0.02\
PG1519+226 & 4.2 $\pm$ 0.2 & 7.9 $\pm$ 0.6 & 4.2 $\pm$ 0.3 & 7.8 $\pm$ 0.7 & 0.39 $\pm$ 0.03\
Mrk493 & 13.0 $\pm$ 0.5 & 29.0 $\pm$ 1.2 & 5.1 $\pm$ 0.2 & 36.8 $\pm$ 1.6 & 0.92 $\pm$ 0.04\
PG1612+262 & 2.5 $\pm$ 0.1 & 12.0 $\pm$ 0.8 & 8.2 $\pm$ 0.6 & 6.3 $\pm$ 0.5 & 0.10 $\pm$ 0.01\
Mrk504 & 6.7 $\pm$ 0.3 & 0.1 $\pm$ 0.0 & 2.6 $\pm$ 0.2 & 4.0 $\pm$ 0.3 & 0.20 $\pm$ 0.01\
1H1934-063 & 19.4 $\pm$ 0.8 & 31.4 $\pm$ 2.8 & 13.1 $\pm$ 1.2 & 37.7 $\pm$ 3.7 & 0.60 $\pm$ 0.05\
Mrk509 & 336.2 $\pm$ 14.8 & 501.3 $\pm$ 42.2 & 441.7 $\pm$ 60.2 & 395.8 $\pm$ 51.7 & 0.16 $\pm$ 0.01\
1H,2107-097 & 26.1 $\pm$ 1.0 & 30.1 $\pm$ 1.8 & 24.2 $\pm$ 1.5 & 32.0 $\pm$ 2.1 & 0.28 $\pm$ 0.02\
Ark564 & 13.0 $\pm$ 0.5 & 14.3 $\pm$ 0.7 & 11.8 $\pm$ 0.6 & 15.4 $\pm$ 0.8 & 0.27 $\pm$ 0.01\
NGC7469 & 18.1 $\pm$ 0.7 & 44.7 $\pm$ 3.1 & 36.4 $\pm$ 2.6 & 26.3 $\pm$ 2.0 & 0.15 $\pm$ 0.01 .
[lccc]{} Mrk335 & 87.5 $\pm$ 6.6 & 11.8 $\pm$ 0.9 & 0.74 $\pm$ 0.11\
IZw1 & 32.0 $\pm$ 1.6 & 1.4 $\pm$ 0.1 & 2.32 $\pm$ 0.11\
TonS180 & 19.7 $\pm$ 1.2 & 2.0 $\pm$ 0.1 & 1.01 $\pm$ 0.14\
Mrk1044 & 30.7 $\pm$ 2.3 & 2.6 $\pm$ 0.2 & 1.16 $\pm$ 0.11\
Mrk1239 & 33.5 $\pm$ 2.5 & 2.5 $\pm$ 0.2 & 1.33 $\pm$ 0.20\
Mrk734 & 14.3 $\pm$ 2.1 & 1.2 $\pm$ 0.2 & 1.19 $\pm$ 0.10\
H1143-182 & 6.3 $\pm$ 0.7 & 1.9 $\pm$ 0.2 & 0.34 $\pm$ 0.06\
NGC4748 & 15.0 $\pm$ 1.7 & 1.7 $\pm$ 0.2 & 0.90 $\pm$ 0.12\
Ton156 & 3.2 $\pm$ 0.5 & 0.4 $\pm$ 0.1 & 0.86 $\pm$ 0.18\
PG1415+451 & 8.2 $\pm$ 0.8 & 0.6 $\pm$ 0.1 & 1.47 $\pm$ 0.15\
Mrk478 & 16.1 $\pm$ 1.2 & 1.3 $\pm$ 0.1 & 1.24 $\pm$ 0.08\
PG1448+273 & 13.2 $\pm$ 0.8 & 1.1 $\pm$ 0.1 & 1.22 $\pm$ 0.12\
PG1519+226 & 8.5 $\pm$ 0.9 & 1.1 $\pm$ 0.1 & 0.76 $\pm$ 0.16\
Mrk493 & 19.1 $\pm$ 1.0 & 1.1 $\pm$ 0.1 & 1.85 $\pm$ 0.14\
PG1612+262 & 6.6 $\pm$ 0.6 & 1.5 $\pm$ 0.1 & 0.43 $\pm$ 0.06\
1H1934-063 & 37.9 $\pm$ 4.3 & 2.7 $\pm$ 0.3 & 1.38 $\pm$ 0.08\
1H,2107-097 & 15.7 $\pm$ 1.2 & 1.5 $\pm$ 0.1 & 1.07 $\pm$ 0.10\
NGC7469 & 4.0 $\pm$ 0.4 & 0.5 $\pm$ 0.0 & 0.74 $\pm$ 0.06
[lccc]{} Mrk335 & 20 $\pm$ 2 & 10 $\pm$ 10 & 0.51\
IZw1 & 74 $\pm$ 8 & 36 $\pm$ 4 & 0.48\
TonS180 & 46 $\pm$ 4 & 30 $\pm$ 3 & 0.65\
Mrk1044 & 71 $\pm$ 8 & 31 $\pm$ 3 & 0.43\
Mrk1239 & 77 $\pm$ 10 & 16 $\pm$ 2 & 0.20\
Mrk734 & 33 $\pm$ 4 & 12 $\pm$ 1 & 0.35\
H1143-182 & 14 $\pm$ 2 & 2 $\pm$ 1 & 0.10\
NGC4748 & 35 $\pm$ 3 & 17 $\pm$ 2 & 0.50\
Ton156 & 7 $\pm$ 1 & 2 $\pm$ 1 & 0.25\
PG1415+451 & 19 $\pm$ 2 & 5 $\pm$ 1 & 0.27\
Mrk478 & 37 $\pm$ 2 & 33 $\pm$ 1 & 0.89\
PG1448+273 & 30 $\pm$ 3 & 11 $\pm$ 1 & 0.35\
PG1519+226 & 20 $\pm$ 3 & 4 $\pm$ 1 & 0.18\
Mrk493 & 44 $\pm$ 5 & 17 $\pm$ 2 & 0.38\
PG1612+262 & 15 $\pm$ 2 & 3 $\pm$ 1 & 0.19\
1H1934-063 & 88 $\pm$ 11 & 18 $\pm$ 2 & 0.20\
1H,2107-097 & 36 $\pm$ 4 & 15 $\pm$ 2 & 0.41\
NGC7469 & 9 $\pm$ 1 & 2 $\pm$ 1 & 0.13 .
[lccc]{} Mrk335$^{(a)}$ & 8.7$^{+1.6}_{-1.9}$ & 26.8$^{+2.9}_{-2.5}$ & 23.2$^{+2.1}_{-2.1}$\
Mrk1044$^{(a)}$ & 10.5$^{+3.3}_{-2.5}$ & 13.9$^{+3.4}_{-4.7}$ & 15.6$^{+1.7}_{-1.7}$\
Mrk509$^{(b)}$ & 79.3$^{+6.3}_{-6.3}$ & - & 198.2$^{+34.5}_{-34.5}$\
NGC4051$^{(b)}$ & 6.5$^{+5.1}_{-5.1}$ & - & 8.5$^{+6.3}_{-6.3}$\
NGC7469$^{(b)}$ & 4.9$^{+0.8}_{-0.8}$ & - & 11.2$^{+1.8}_{-1.8}$\
Mrk493$^{(a)}$ & 11.6$^{+1.2}_{-2.6}$ & 11.9$^{+3.6}_{-6.5}$ & 49.3$^{+5.6}_{-5.6}$
[^1]: The ionization parameter $U_{\rm ion}$ is correlated with $\Phi_H$, the flux of hydrogen ionizing photons at the illuminated face of the cloud, by $U_{ion}=\Phi_H/n_Hc$.
[^2]: Note that this line is actually a closely spaced triplet of [O[i]{}]{}$\lambda$8446.25, $\lambda$8446.36 and $\lambda$8446.38)
|
464 F.Supp.2d 1027 (2006)
UNITED STATES of America, Plaintiff,
v.
SDI FUTURE HEALTH, INC., Todd Stuart Kaplan, and Jack Brunk, Defendants.
No. 2:05-CR-0078-PMP-GWF.
United States District Court, D. Nevada.
November 28, 2006.
*1028 *1029 *1030 Crane M. Pomerantz, Roger W. Wenthe, Steven W. Myhre, U.S. Attorney's Office, Las Vegas, NV, for Plaintiff.
C. Stanley Hunterton, Hunterton & Associates, Las Vegas, NV, Mark S. Hardiman, Law Office of David P. Baugh Hooper, Lundy & Bookman, Inc., Patric Hooper, Hooper, Lundy & Bookman, Inc., Thomas J. Nolan, Marcus Mumford, Lance A. Etcheverry, Skadden Arps Slate Meagher & Flom, Los Angeles, CA, for Defendants.
ORDER
PRO, Chief Judge.
Before the Court for consideration are the Findings and Recommendations (# 126) of Magistrate Judge George Foley, Jr., regarding Defendants' Motion Requesting an Evidentiary Hearing Regarding the Government's Intrusions Into Defendants' Privileged Information (# 39). Objections to Magistrate Judge Foley's Findings and Recommendations were filed by the Government (# 130) on October 26, 2006, and by Defendants (# 131) on October 31, 2006, in accord with Local Rule IB 3-2.
The Court has conducted a de novo review of the record in this case hi accordance with 28 U.S.C. § 636(b)(1)(B) and (C) and Local Rule IB 3-2 and determines that the Findings and Recommendations of the United States Magistrate Judge should be affirmed.
IT IS THEREFORE ORDERED that Magistrate Judge Foley's Findings and Recommendations (# 126) are affirmed, the Objections are overruled, and Defendants' Motion Requesting an Evidentiary Hearing Regarding the Government's Intrusions Into Defendants' Privileged Information (# 39) is denied. Counsel for the parties shall comply with Magistrate Judge Foley's recommendation that the parties forthwith brief their respective positions on the attorney-client privilege regarding the documents that Defendant SDI's counsel identified in his February 5, 8 and 21, 2002, letters to the Government, and that the Government set forth its position regarding application of the "crime fraud" exception as to any documents otherwise deemed to be privileged. In this regard, Defendant shall file their brief not later than December 20, and Plaintiff United States shall file its Response by January 5, 2007. Defendant shall file any Reply Memorandum not later than January 16, 2007.
FINDINGS AND RECOMMENDATION
FOLEY, United States Magistrate Judge.
This matter is before the Court on Defendants' Motion Requesting an Evidentiary Hearing Regarding the Government's Intrusion into Defendants' Privileged Information (# 39), filed on December 2, 2005; the Government's Opposition to Defendants' Motion Requesting an Evidentiary Hearing Regarding Supposed Privileged Information (# 55), filed on January 31, 2006; the *1031 Defendants' Reply Memorandum of Points and Authorities in Support of Motion Requesting an Evidentiary Hearing Regarding the Government's Intrusions Into Defendants' Privileged Information (# 67), filed on March 15, 2006; Notice of Supplemental Authority in Further Support of Motion Requesting an Evidentiary Hearing Regarding the Government's Intrusion into Defendants' Privileged Information (# 110), filed on July 20, 2006; and the United States' Response to Defendants' Supplemental Authority (# 111), filed on July 21, 2006.
FACTS
On January 31, 2002, the Government executed a search warrant on Defendant SDI's corporate headquarters as part of the Government's investigation into alleged health care fraud by SDI and its principal officer, Todd Kaplan. The search warrant authorized the seizure of a broad range of SDI's business records and SDI's and Todd Kaplan's and his spouse's state and federal income tax returns and information relating to the preparation of those returns. Among the categories of records to be seized, the warrant authorized the seizure of SDI sleep study patient records. Prior to issuing the search warrant, the Magistrate Judge requested that the affidavit be modified regarding the procedures that the Government would use in handling confidential patient records to protect their confidentiality. The Magistrate Judge added a handwritten notation to the search warrant, Attachment B, stating that patient confidential medical information would be handled in accordance with the procedures set forth in the affidavit. See Findings and Recommendations (# 101), filed June 26, 2006, page 10. Nothing in the affidavit or search warrant stated that the Government intended to seize documents containing SDI's attorney-client privileged communications. No express procedures were set forth in the affidavit or the search warrant for handling attorney-client privileged documents if they were encountered during the execution of the search warrant.
During the execution of the search warrant, SDI's president Todd Kaplan informed the Government agents that some of the documents called for by the search warrant may be covered by the attorney-client privilege. The search was thereupon halted and two IRS-CI agents, who were not otherwise involved in the investigation, were summoned to SDI's offices. These "taint agents" reviewed the documents in those rooms that SDI stated contained attorney-client privileged materials, identified documents containing attorney-client privileged communications, and placed those documents in boxes which were turned over to SDI during or at the conclusion of the search. See Findings and Recommendations (# 101), filed June 26, 2006, page 14; Defendants' Motion (# 39), Exhibit "3", page 2. The Government's agents proceeded with the search and seized substantial quantities of paper documents and SDI's computer based records. During the search, the Government was also informed that some of SDI records were stored at an off-sight storage facility. The Government obtained consent from Defendants to search that facility and seized additional SDI records. At the conclusion of the search, the Government provided SDI with two inventory documents listing the items seized from SDI's corporate offices and the storage facility. See Findings and Recommendations (# 101), filed June 26, 2006, pages 14-15.
Shortly after the execution of the search warrant on January 31, 2002, counsel for SDI, Fernando L. Aenile-Rocha, communicated with Assistant United States Attorney ("AUSA") Steven Myhre and the *1032 Government agents in charge of the search. Defendants' Motion (# 39), Exhibit "3". On February 5, 2002, SDI's attorney sent a letter to AUSA Myhre stating that SDI had reviewed the contents of sealed boxes of attorney-client materials turned over to SDI. SDI's counsel stated that SDI's Compliance Binder located in Mr. Kaplan's office was not included in the boxes, was missing, and was presumably seized by the Government. SDI's counsel stated that this binder contained "numerous attorney-client privileged documents" and requested that it be returned to SDI. Id., page 2."
On February 8, 2002, SDI's counsel sent a second letter to AUSA Myhre regarding additional attorney-client privileged documents that had been seized. Defendants' Motion (# 39), Exhibit "4". These documents included "at least two files which agents apparently seized from SDI employee Dennis Benton's office which were entitled `Medicare Billing' and `HSC Protocol.'" SDI's counsel also stated that "some documents inside Evidence Box 145, bearing Control Number 243 and Locator Code S-1, may also be privileged." Id. A list of these items was apparently attached to counsel's letter.[1] SDI's counsel also stated that because other privileged documents may have been seized, he proposed that SDI and its counsel be allowed to inspect all documents seized by the Government so that SDI could preserve its attorney-client privilege and the Government could minimize the possibility of any taint to its investigation as a result of an invasion of the attorney-client privilege. Id.
On February 21, 2002, SDI's attorney sent a third letter to AUSA Myhre. Defendants' Motion (# 39), Exhibit "5". In this letter, SDI's attorney stated that in addition to the attorney-client privileged documents referenced in his two previous letters, it was his understanding that SDI seized all of SDI's legal bills. The letter stated that these bills ordinarily contain detailed description of the legal work performed by the attorneys which are privileged and should not be reviewed by the Government's agents. SDI's counsel requested that these records be segregated, protected and returned to SDI as soon as possible. Id., page. 2. Counsel's letter further stated:
Although you have elected to rely upon a "dirty team" of federal agents to inspect SDI's privileged materials, instead of permitting me and an SDI representative to conduct this analysis, I urge you to reconsider or, at the very least to employ the services of an independent third-party "special master" to review all potentially privileged materials. Either approach would minimize any potential taint to the government's investigation and help preserve the integrity of SDI's privileged materials.
Defendants' Motion (# 39), Exhibit "5", page 2.
SDI counsel's February 21, 2002 letter also stated that in accordance with AUSA Myhre's request, he was attaching a list of some of the law firms and attorneys that had provided legal services to SDI in the past, although he stated that this list was probably incomplete since the Government had possession of all of SDI's legal bills. The letter also provided additional information to identify the "Compliance Binder" referenced in counsel's February 5, 2002 letter. Id., pages 2-3.
The Government's Opposition, page 3, correctly identifies four categories of documents or files that SDI's counsel claimed in his February 5, 8, and 21, 2002 letters *1033 contained privileged attorney-client information:
1. A Compliance Binder allegedly taken from Todd Kaplan's office which SDI's counsel stated contained "numerous attorney-client privileged documents".
2. "Medicare Billing" and "HSC Protocol" files reportedly taken from SDI employee Dennis Benton's Office.
3. Some documents inside Evidence Box 145, bearing Control Number 243 and Locator Code S-1, "may also be privileged."
4. SDI's attorneys' legal bills.
According to the Government, it did not return the foregoing items. Opposition (# 55), page 3.
The Government did not respond in writing to SDI counsel's letters in February 2002. Other than the statements in SDI counsel's letters, the Court has no information regarding the United States Attorney's oral responses to the attorney-client privilege issues raised in these letters. According to SDI counsel's February 21 letter, 2002, Defendants' Exhibit "5", AUSA Myhre rejected SDI's counsel's request that a "special master" be appointed to review all potentially privileged documents and AUSA Myhre stated that the Government would use a "dirty team," i.e. a "taint team," to review allegedly privileged documents. The Government apparently did not take any express position at that time that SDI's privilege assertions were invalid.
According to the Government:
During the months following the execution of the search warrant, case agents reviewed and catalogued the hundreds of boxes of records seized from SDI. As they did so, these agents segregated any items they encountered that appeared to contain attorney-client privileged material, whether or not SDI had expressly asserted any privilege for them.
Government's Opposition (# 55), page 4.
These segregated materials (the "taint documents") were reviewed by AUSA Camille Damm, the "taint attorney" who was not involved in the investigation of Defendants SDI, Kaplan or Brunk. Government's Opposition (# 55), pages 4-5; Exhibit "B", Declaration of Camille Damm. According to Ms. Damm, she was instructed to review certain documents which she understood had been seized from SDI to determine whether any of those documents appeared to be covered by the attorney-client privilege. Id., ¶ 2. Ms. Damm states that she reviewed several hundred pages of documents which she maintained in her office during the period of review. Id., ¶ 3. She states that she segregated the documents into two groups: (1) those which she considered potentially privileged and (2) those which she did not consider potentially privileged. She placed the potentially privileged documents in a sealed envelope. Ms. Damm states that she replaced the non-privileged documents in their original boxes and the documents were returned to the prosecution team. Id, ¶ 4. Neither the Government's Opposition nor Ms. Damm's Declaration states when she performed or completed her taint review. There is no evidence "that either Ms. Damm or the Government informed SDI's counsel prior to the filing of the indictment of the decisions made by taint counsel, Ms. Damm, regarding privilege.
On May 13, 2004, SDI's counsel, Mr. Aenile-Rocha, sent a letter to AUSA Crane M. Pomeranz regarding "several recent events . . . that appear to constitute a pattern of intrusions by the government into SDI's attorney-client privilege." Defendants' Motion (# 39), Exhibit "6", page 1. According to this letter, during an interview of former SDI employee Dennis Benton *1034 on March 10, 2004, Government agents produced and attempted to question Mr. Benton about "one or more memoranda" Mr. Benton wrote to [SDI attorney] Kelly Simenson, Esq. and about a presentation that Mr. Benton made to SDI's board of directors in July 2001 that included privileged information provided to SDI by its attorneys. These were apparently documents that the Government seized on January 31, 2002 and which SDI's counsel had arguably asserted were privileged in his February 2002 letters. According to SDI counsel's letter, during the interview, Mr. Benton's attorney informed the Government that the documents in question were privileged attorney-client communications.
SDI counsel's May 13, 2004 letter also proceeded to recount the information contained in his letters sent to AUSA Myhre in February 2002. In his May 13, 2004 letter, SDI's counsel noted that despite his previous requests, the privileged materials were never returned and that the recent interview of Mr. Benton led him to believe that the Government was using these and possibly other privileged materials in furtherance of its investigation. Id., page 2. The letter further stated:
Thus, it appears that despite my specific requests to the government on February 5, 2002, February 8, 2002, and again on February 21, 2002, the government has invaded SDI's attorney-client privilege. Indeed, after receiving specific notice to return these materials, the government instead decided to review the privileged materials and use them in its investigation.
Defendants' Motion (# 39), Exhibit "6", page 3.
SDI counsel's letter went on to discuss a telephone conference between Mr. Aenile-Rocha and AUSA Pomeranz on November 10, 2003 regarding an earlier Government interview with Mr. Benton and a letter that Mr. Benton wrote to SDI's accountants, which included an attached memorandum that Mr. Benton had written to SDI's counsel. In his May 13, 2004 letter, Mr. Aenile-Rocha indicated that AUSA Pomeranz had advised him that the Government had "apparently used a `dirty team' prosecutor to review the document" and that the Government "caused the privileged memorandum to be filed under seal with the district court." Id. page 3. Subsequent to this November 10, 2003 discussion, however, SDI questioned Mr. Benton about this memorandum and Mr. Benton reportedly showed the Government's attorneys the memorandum which was contained on his laptop computer. Mr. Aenile-Rocha further stated that during their conversation on November 10, 2004, AUSA Pomeranz took the position that the privilege had been waived through SDI's disclosure of the memorandum to a third party, SDI's accountants, and that AUSA. Pomeranz had given Mr. Aenile-Rocha additional time to consider the issue and provide a response by November 26, 2004. Mr. Aenile-Rocha referred to a letter from AUSA Pomeranz dated December 8, 2003.
According to AUSA Pomeranz's December 8, 2004 letter, which was attached to Defendants' Motion (# 39), AUSA Pomeranz confirmed that an agreement was reached between counsel on November 26, 2003 regarding a limited waiver of SDI's attorney-client privilege regarding the attorney memorandum attached to the letter to SDI's accountants. AUSA. Pomeranz's December 8, 2004 letter stated:
As I explained to you, an attorney in this office unconnected with the investigation reviewed the letter and filed it under seal. We now intend on moving to unseal the letter so that the attorneys and investigators working on this matter may review its contents.[2]
*1035 Defendants' Motion (# 39), Exhibit "6-D".
AUSA Pomeranz responded to SDI's counsel's May 13, 2004 letter on May 20, 2004. Government's Opposition, Exhibit "2". In his May 20, 2004 letter, AUSA Pomeranz stated that the Government had not improperly invaded or otherwise abused any privileges possessed by SDI or anyone else. AUSA Pomeranz stated that because of the ongoing nature of the investigation, the Government was not in a position to share with Mr. Aenile-Rocha or his clients what documents the Government has or does not have, what any witnesses have said or not said or what documents the Government has reviewed or not reviewed. Nor would the Government comment on what documents SDI believed or did not believe were seized or not seized or otherwise obtained by the Government. AUSA Pomeranz further noted that as of the date of his letter, SDI had not filed any process under the Federal Rules of Criminal Procedure for the return of any materials that SDI believes were improperly seized, including any supposedly privileged materials. In addition, AUSA Pomeranz commented that SDI "had more than ample opportunity to do so given the extraordinary access it was granted to review the materials seized both during and after the execution of the search warrant." Id.
Following SDI's counsel's May 13, 2004 letter and prior to the filing of the Indictment on March 2, 2005, it does not appear that Defendants' counsel communicated further with the Government or took any other action regarding Defendants' assertions of attorney-client privilege. Beginning in or about May 2005, Defendants' criminal defense counsel and Government's counsel began exchanging email communications and other correspondence regarding the parties respective discovery productions. On July 7, 2005, Defendants' counsel sent a letter to AUSA Myhre discussing a number of discovery issues. Included in this letter was the following statement:
We also need to address the outstanding issue of materials that the government has deemed "not pertinent" or "privileged." Your suggestion that the government is entitled to keep such materials, without so much as providing defendants with a copy, is unfounded. We therefore renew our request that the government promptly return all materials deemed "not pertinent" or "privileged" or, at minimum, provide defendants with electronic copies of such materials. Please let me know which option the government would prefer.
Defendants' Motion (# 39), Exhibit "9'; page 2.
On August 17, 2005, AUSA Myhre responded to Defendants' counsel's August 11, 2005 and July 7, 2005 letters addressing the various discovery issues. In regard to Defendants' claimed privileged documents, AUSA Myhre's letter stated:
Privileged Information. Please identify with specificity those documents you believe the government possesses that are subject to any privilege. The government is aware of one document that is potentially privileged and will be seeking a ruling from the Court shortly as to any potential privilege that may apply. *1036 I am given to understand from our taint team that the document pertains to billing records between SDI and outside counsel.
Defendants' Motion (# 39), Exhibit "10", page 2.
On September 3, 2005, AUSA Myhre sent a follow-up letter regarding the issue of privileged documents. In this letter, he stated that the Government was aware of potentially privileged materials and would shortly be seeking a ruling from the Court as to any potential privilege that may apply. The letter further stated that the Government had segregated the documents into two categories. One category consisted of two or three documents which the Government's taint attorney had identified as potentially privileged. In the second category were approximately two boxes of documents that the taint attorney, after review, has determined are not privileged. Mr. Myhre proposed that before joining the issue with the court, that Defendants have the opportunity to review the documents, assess whether they are privileged and assert any privilege on behalf of Defendants. Defendants' Motion (# 39), Exhibit "11". On September 7, 2005, Defendants' counsel agreed to this proposal, and requested that the documents be bate stamped. Defendants' Motion (# 39), Exhibit "12". The Government agreed to make the documents available to Defendants' counsel for inspection, but declined to bate stamp them. Defendants' Motion (# 39), Exhibit "13". The documents determined to be potentially privileged by the taint counsel were forwarded to Defendants' counsel on September 28, 2005. Defendants' Motion (# 39), Exhibit "14".
Defendants have submitted to the Court for in camera review approximately 518 pages of documents that were allegedly included in the Government's Rule 16 production. Because Defendants did not provide the Government with a copy of its in camera submission or a log or index of the documents, the Government has not confirmed whether these documents are, in fact, contained in its Rule 16 production. It is also not clear to the Court whether the Defendants' in camera submission also includes documents that the taint attorney has deemed potentially privileged (and which presumably have not been provided to the prosecution team.) The Court has reviewed these documents and they appear to consist substantially of SDI's attorney's billings, some correspondence, drafts of agreements or procedure documents and some handwritten notes.
DISCUSSION
Defendants request that the Court conduct an evidentiary hearing to explore whether the Government improperly intruded on Defendants' attorney-client privilege through the abuse of its "taint team" procedures, and, if so, to determine the extent to which sanctions should be imposed against the Government or its counsel. In response, the Government asserts a number of objections to conducting an evidentiary hearing, including that Defendants have waived their attorney-client privilege by failing to timely assert it or take timely court action to enforce it. To the extent Defendants have not waived the attorney-client privilege, the Government argues that the appropriate action and remedy is for Defendants to file a motion to suppress particular documents they claim as privileged so that they may not be introduced at trial.
Because the allegedly attorney-client privileged documents were seized prior to the indictment, the Government argues that Defendants' Sixth Amendment rights are not implicated. The Government also argues that the alleged intrusion by the Government into Defendants' attorney-client *1037 privilege does not rise to the level of a due process violation under the Fifth Amendment, or outrageous or flagrant misconduct that would warrant dismissal of the indictment or other sanction besides suppression of any privileged attorney-client communications. The Government also argues that Defendants have failed to make any showing of substantial prejudice to warrant an evidentiary hearing.
1. Government's Use of "Taint Attorney" to Review and Make Privilege Determinations Regarding Seized Documents.
Defendants' Motion takes issue with the Government's decision to employ a "taint attorney" or "taint agents" to review SDI's potentially attorney-client privileged documents and decide which documents were not privileged and would be provided to the prosecution team. Federal courts have taken a skeptical view of the Government's use of "taint teams" as an appropriate method for determining whether seized or subpoenaed records are protected by the attorney-client privilege. The reason for this is well stated in In re Grand Jury Subpoenas XX-XXX-XX and XX-XXX-XX, 454 F.3d 511, 523 (6th Cir.2006):
Furthermore, taint teams present inevitable, and reasonably foreseeable, risks to privilege, for they have been implicated in the past in leaks of confidential information to prosecutors. That is to say, the government taint team may also have an interest in preserving the privilege, but it also possesses a conflicting interest in pursuing the investigation, and, human nature being what it is, occasionally some taint team attorneys will make mistakes or violate their ethical obligations. It is thus logical to suppose that taint teams pose a serious risk to holders of the privilege, and this supposition is supported by past experience.
The Sixth Circuit also stated that it is reasonable to presume that the government's taint team might have a more restrictive view of privilege than the defendant's attorneys. Id. The court also noted that government taint teams seem to be used primarily in limited, exigent circumstances in which government officials have already obtained the physical control of potentially-privileged documents through the exercise of a search warrant. In such cases, the potentially-privileged documents are already in the government's possession, and so the use of the taint team to sift the wheat from the chaff constitutes an action respectful of, rather injurious to, the protection of the privilege. Id., 454 F.3d at 522, citing United States v. Abbell, 914 F.Supp. 519 (S.D.Fla.1995). In reversing the district court's approval of a government taint team to review the records, the Sixth Circuit held that exigent circumstances warranting use of a taint team were not present because the records had not yet been obtained by the government. The court therefore directed that a special master be appointed to expeditiously conduct a computer word search for key words that would identify attorney related documents and to segregate those records from non-attorney related documents that could be promptly forwarded to the grand jury. The movant would be provided an opportunity to review the documents, identify those to which he claimed privilege and the court would then decide the privilege claims.
Other courts have also criticized and, in some instances, disapproved of the use of government taint teams to resolve attorney-client privilege or work-product privilege issues. See United States v. Neill, 952 F.Supp. 834 (D.D.C.1997) (criticizing use of government "taint teams" to review allegedly privileged documents, but finding no violation of defendants' constitutional rights where the government demonstrated at an evidentiary hearing that the taint team properly performed its functions and *1038 no privileged information was turned over to the prosecution team.) Some of these cases involved warrants for the searches of law offices. See, e.g. United States v. Neill, supra; United States v. Kaplan, 2003 WL 22880914 (S.D.N.Y.2003); In re Search Warrant for Law Offices Executed on March 19, 1992, 153 F.R.D. 55 (S.D.N.Y.1994). In such cases there is a heightened concern for the protection of privileged attorney-client information that is either not the subject of the search or does not fall within the "crime-fraud" exception to the privilege. In such cases, the government has provided procedures for use of a government taint team in conducting the search. See Neill, supra.
Other courts have approved use of the taint teams to conduct initial reviews of potentially privileged documents as opposed to requiring that the documents be submitted to the court for an in camera review or that a special master be appointed. See In the Matter of the Search of 5444 Westheimer Road, 2006 WL 1881370 (S.D.Tex.2006); United States v. Grant, 2004 WL 1171258 (S.D.N.Y.2004). In In the Matter of the Search of 544 Westheimer Road, the court denied movant's request to have the seized documents reviewed by a special master before allowing the government to proceed with its investigation. The court, instead, approved the government's proposed taint team procedure. In so holding, the court stated:
[T]he court recognizes that other courts have questioned and/or rejected the use of the taint team procedure. See In Re Search of the Scranton Hous. Auth., 436 F.Supp.2d 714, 721 (M.D.Pa.2006) (citing various cases questioning or rejecting taint team procedures); see also In Re Search Warrant of Law Offices Executed on March 17, 1992, 153 F.R.D. 55 (S.D.N.Y.1994). The Court nevertheless determines that such procedures will allow expeditious review of all seized documents, will allow the Government to continue with its investigations, and will nevertheless allow the Court, at ERHC's request, to resolve ultimate privilege disputes before any potentially privileged materials are disclosed to the prosecution team. Although the Court determines the Government's proposed taint team procedure will sufficiently protect any potentially privileged documents, it echoes the sentiments voiced in Grant and reinforces that its decision is "based upon the expectation and presumption that the Government's privilege team and the trial prosecutors will conduct themselves with integrity." Grant, 2004 WL 1171258, at *3.
The court further stated that its approval of the taint team procedure did not foreclose the movant from filing a motion to suppress at a later time. In United States v. Grant, 2004 WL 1171258 (S.D.N.Y.2004), the court also stated that review of documents by the government's taint team would not constitute a waiver of defendant's attorney-client privilege.
Defendants have raised a number of issues regarding the adequacy of the Government's taint procedures, some of which appear to have merit and some which do not. Defendants criticize the Government's failure to include in the search warrant application any procedures for dealing with potentially attorney-client privileged documents. Regardless of whether this criticism is justified, it is undisputed that when SDI informed the Government that attorney-client privileged records were located in the office, a "taint team" was summoned to identify and segregate attorney-client privileged documents. The taint agents reportedly identified and segregated documents which were not seized during the search. The Government's use of a "taint team" under these circumstances was not improper. See In re Grand Jury Subpoenas XX-XXX-XX and *1039 XX-XXX-XX, supra. Whether the "taint team" correctly identified all records that were subject to a legitimate claim of attorney-client privilege, however, is another matter.
Following the search, the Government rejected SDI's proposal that a special master be appointed to review the documents and advised SDI's counsel that it intended to use a taint team to review allegedly privileged documents. Because the Government did not provide or implement any procedure for notifying SDI of the taint attorney's privilege decisions or afford SDI an opportunity to challenge those determinations in court before the documents were provided to the prosecution team, it is doubtful that the court would have approved the Government's taint procedures if SDI had challenged them. See, e.g. In re Grand Jury Subpoenas XX-XXX-XX and XX-XXX-XX and In the Matter of the Search of 544 Westheimer Road, supra. Defendants, however, did not pursue timely judicial action to challenge the Government's taint review procedures or to seek to have their allegedly privileged documents returned.
Defendants also argue that the Government's taint procedures were wholly inadequate because the case agents reviewed the seized documents and segregated items that appeared to contain attorney-client privileged material which were only then turned over to the taint attorney. Defendants appear to suggest that all of the seized records should have been first reviewed by taint agents before the investigating agents had any opportunity to see them. In cases involving the search of a law office, the manner in which the search is conducted is subject to a heightened degree of scrutiny and special care to avoid unnecessary intrusion on attorney-client communications. DeMassa v. Nunez, 770 F.2d 1505, 1506 (9th Cir.1985); In re Grand Jury Subpoenas Dated Dec. 10, 1987, 926 F.2d 847, 856 (9th Cir.1991). In regard to such searches, therefore, it may be incumbent on the Government to have a taint team review of all records before they are reviewed by the investigating agents or the prosecuting team.
The search warrant in this case, however, was directed at seizing non-privileged business records and tax returns and tax preparation documents. As stated, during the search, taint agents reviewed documents in offices identified by SDI as containing privileged documents. Given the scope of the seizure, it is not surprising that the taint agents may have allowed seizure of certain records that were potentially privileged, or that potentially privileged records were located in other offices not inspected by the taint agents or possibly on SDI's computers. Defendants have cited no authority, however, which holds that where the Government seizes voluminous business records, it must first employ a taint team to review all of the records to identify potentially privileged documents. On the other hand, SDI's counsel did timely notify the Government of certain seized files or documents that allegedly contained attorney-client privileged documents. SDI's counsel also informed the Government of the identities of law firms and attorneys who represented SDI so that the Government could identify potentially privileged documents and protect them from review by the case agents or prosecuting attorneys until a privilege determination was made. Other than the very general statements in the Government's Opposition and Ms. Damm's Declaration, the Government provides little or no information as to what steps were taken to segregate such allegedly privileged documents before they were reviewed the case agents.
In sum, SDI had some arguably valid objections to the Government's taint *1040 procedures. The problem is that SDI waited more than three years after the search to raise those objections with the Court. That stated, the Court generally agrees with the statement by the court in United States v. Neill, supra, 952 F.Supp. at 841 that:
Where the government chooses to take matters into its own hands rather than using more traditional alternatives of submitting disputed documents under seal for in camera review by a neutral and detached magistrate or by court-appointed special masters, (citations omitted), it bears the burden to rebut the presumption that tainted material was provided to the prosecution team. Briggs, 698 F.2d at 495, n. 29 ("the government is, of course, free to rebut this presumption by showing for example, procedures in place to prevent such intragovernmental communications.").
2. Defendants' Alleged Waiver of Attorney-Client Privilege.
The Government argues that Defendants' Motion should be denied because they waived their attorney-client privileges. In part, the Government asserts that Defendants explicitly waived their attorney-client privilege as to certain documents. Primarily, the Government argues that Defendants implicitly waived their alleged attorney-client privilege by failing to assert it in a timely manner and in failing to take timely and diligent court action to protect the privilege.
A. Government's Assertion of Explicit Waiver.
The Government argues that Defendants explicitly waived the attorney-client privilege regarding the memoranda from SDI's attorneys that were attached to the letter that SDI employee Dennis Benton sent to SDI's accountants. There is no confidential accountant-client privilege under federal law. Couch v. United States, 409 U.S. 322, 335, 93 S.Ct. 611, 34 L.Ed.2d 548 (1973). Accordingly, the attorney-client privilege was waived when Mr. Benton sent the memoranda to SDI's accountants. United States v. Stewart, 287 F.Supp.2d 461, 464-65 (S.D.N.Y.2003).
In any event, AUSA Pomeranz's December 8, 2003 letter to SDI's counsel confirmed an agreement between the parties for a "limited waiver" of SDI's privilege to these documents. SDI counsel's May 13, 2004 letter to Mr. Pomeranz appears to confirm this agreement, and Defendants have not produced any evidence or argument that SDI's counsel objected to Mr. Pomeranz's letter dated December 8, 2003. Accordingly, as to the memoranda attached to Mr. Benton's letter to SDI's accountants, the Court finds that the attorney-client privilege was waived by SDI.
B. Government's Argument that Defendants Implicitly Waived Their Attorney-Client Privileges Regarding the Seized Documents.
The Government argues that Defendants implicitly waived their attorney-client privilege regarding the other documents seized by the Government during the January 31, 2002 search by failing to take timely court action to protect their privilege. In support of this assertion, the Government argues that because the attorney-client privilege impedes the full and free discovery of the truth, it is narrowly construed. United States v. Martin, 278 F.3d 988, 999 (9th Cir.2002); United States v. Plache, 913 F.2d 1375, 1379 (9th Cir. 1990); Weil v. Investment/Indicators, Research and Magna., Inc., 647 F.2d 18, 25 (9th Cir.1981); United States v. White, 970 F.2d 328, 334 (7th Cir.1992). The party asserting the privilege has the burden of proving its applicability, including that the party has not waived it. Weil, supra, 647 F.2d at 25.
*1041 The Government's waiver argument divides into two categories. First, the Government argues that Defendants waived their attorney-client privilege as to the allegedly privileged documents identified in SDI counsel's February 5, 8 and 21, 2002 letters because Defendants failed to timely pursue judicial action to enforce their privilege. Second, the Government argues that Defendants waived their attorney-client privilege as to other seized documents because they made no specific claim of privilege and also failed to pursue timely judicial action to enforce the privilege. In support of its arguments, the Government relies on United States v. de la Jara, 973 F.2d 746 (9th Cir.1992); In re Grand Jury (Impounded), 138 F.3d 978 (3rd Cir.1998); Bowles v. National Ass'n of Home Builders, 224 F.R.D. 246 (D.D.C. 2004); and Burlington Northern & Santa Fe Railway Co. v. District Court, 408 F.3d 1142 (9th Cir.2005).
In United States v. de la Jam, the government seized a letter that defendant's attorney had written to him. At trial, the letter was admitted, over objection, based on the "crime-fraud" exception to the attorney-client privilege. The court affirmed defendant's conviction on the grounds that defendant waived the attorney-client privilege by failing to take any action prior to trial to preserve it. The court stated that a party does not waive the attorney-client privilege for documents which he is compelled to produce. Id., at 749, citing Transamerica Computer v. International Business Machines, 573 F.2d 646, 651 (9th Cir.1978). The privilege may be waived by implication, however, even when the disclosure was involuntary, if the privilege holder fails to pursue all reasonable means of preserving the confidentiality of the privileged matter. Id., citing Transamerica Computer, supra, 573 F.2d at 650. In holding that the defendant implicitly waived the privilege, the court stated:
De la Jara did nothing to recover the letter or protect its confidentiality during the six month interlude between its seizure and introduction into evidence. By immediately attempting to recover the letter, appellant could have minimized the damage caused by the breach of confidentiality. As a result of his failure to act, however, he allowed "the mantle of confidentiality which once protected the document []" to be "irretrievably breached," thereby waiving his privilege. Permian Corp. v. United States, 665 F.2d 1214, 1220 (D.C.Cir. 1981) (quoting In re Grand Jury Investigation of Ocean Transportation, 604 F.2d 672, 675 (D.C.Cir.), cert. denied, 444 U.S. 915, 100 S.Ct. 229, 62 L.Ed.2d 169 (1979)). The district court thus committed no reversible error in permitting the letter to be introduced into evidence.
United States v. de la Jara, supra, 973 F.2d at 750.
In In re Grand Jury (Impounded), supra, 138 F.3d at 981-82, the movant, Capano, was the target of a federal grand jury investigation into the suspected kidnaping of a woman. The government subpoenaed a file from Capano's law firm which contained a "time line" and memorandum regarding Capano's contacts with the woman. The government provided these documents to a taint attorney who determined that they were not privileged and provided the documents to the prosecutor conducting the investigation. Capano's counsel promptly notified the government that the file contained work-product privilege information. The United States attorney advised Capano's counsel that the documents were not privileged and the government would not return them. Capano thereafter waited three months before filing a motion to compel the government to return the file. In affirming the district court's decision that Capano *1042 waived the privilege, the court held that although Capano timely asserted the privilege after he learned that the government had obtained the file, he failed to timely move for its return once he was on notice that the government disagreed with his assertion of the privilege and would not relinquish the file voluntarily. In so holding, the court stated:
The United States was a direct adversary of Capano, and its continued use of the documents directly undermined the purpose of the attorney work product privilege of protecting confidential documents prepared in anticipation of litigation from a party's adversary. Capano's repeated admonitions to his adversary to return the protected documents did not prevent the continuing harm resulting from the disclosure. Judicial enforcement of the privilege was the only remedy that Capano could have obtained which would have foreclosed the United States from further use of the seized file. Without such judicial vindication, the United States was free to continue to utilize the documents, thereby negating their confidential character.
In the case of such an involuntary disclosure, a reasonable person would not only inform his or her adversary of the breach of the privilege, but also would seek a judicial determination of the controversy if his or her adversary took an opposing stance. Merely asserting the privilege to an adversary is not sufficient to protect the privilege in these circumstances inasmuch as the adversary has possession of the materials claimed to be privileged and thus can make use of them. Moreover, if the district court countenanced Capano's delay in judicially asserting his privilege and then upheld his claim of privilege, the grand jury's use of the seized file potentially could have tainted its investigation.[3]
In re Grand Jury (Impounded), supra, 138 F.3d at 982.
In Bowles v. National Ass'n of Home Builders, 224 F.R.D. 246 (D.D.C.2004), the plaintiff acquired possession of defendant's privileged documents while employed as its president. Upon being terminated, plaintiff took the privileged documents with her and refused to return them upon being requested to do so by defendant. Defendant thereafter waited approximately one year into the litigation before filing a motion for return of the documents. Citing de la Jara and In re Grand Jury (Impounded), the court held that defendant failed to take timely action to enforce its privilege. In so holding, the court stated:
. . . NAHB knew that an existing adversary already had possession of the documents. Indeed, NAHB was on notice that plaintiff was using the documents against her in these very proceedings. The harm to NAHB from this possession was immediate. Taking steps to prevent the "further disclosure" of the documents would do not good here; the disclosure had already breached the confidentiality in the documents in every way that mattered insofar as an opposing party had possession of the documents and was using them in litigation. At this point, NAHB had a clear obligation to "move expeditiously for relief" by taking "legal measures" to preserve its privilege in the documents. (citation omitted).
*1043 Bowles v. National Ass'n of Home Builders, 224 F.R.D. at 255.
In Burlington Northern & Santa Fe Railway Co. v. District Court, 408 F.3d 1142 (9th Cir.2005), the court affirmed the district court's decision that defendant waived its attorney-client privilege by failing to provide an adequate privilege log of the allegedly privileged documents for five months. The court rejected a per se rule that a privilege log must be provided within the 30-day time limit for responding to a discovery request, instead holding that the court should consider all the relevant circumstances in determining whether failure to provide a log waives the privilege.
The Government also argues that United States v. Neill, 952 F.Supp. 834 (D.D.C. 1997), cited by Defendants, supports its implicit waiver argument. In Neill, the government executed search warrants on an attorney's office and home. The government implemented taint procedures in executing the warrants to minimize the potential intrusion upon the attorney-client privilege. Taint agents reviewed all potentially privileged documents prior to seizure and segregated and sealed any items that might be subject to the attorney-client privilege. The government designated taint attorneys to review the potentially privileged documents which had been seized during the search. Although defendant's counsel objected to the government's taint procedures, defendants never filed a motion to compel the government to return the seized documents under Fed. R.Crim. Pro. 41(e) or a motion for protective order. As to the documents that defendants had asserted were privileged and which were reviewed by the taint team, Neill did not find that there had been any waiver of the privilege. Instead, the court found that the taint agents had properly performed their review and had not disclosed privileged materials to the prosecutors. During the execution of the search warrants, the agents also seized defendants' computer files. As to the computer files, defendants' never asserted an attorney-client privilege. The court, therefore, held that defendants waived any privilege as to these documents because they failed to timely assert the attorney-client privilege for each specific communication or document. Neill, supra, 952 F.Supp. at 842.
In addition to the foregoing cases, the Court also notes the decision in United States v. Ary, 2005 WL 2267541 (D.Kan. 2005), in which the defendant initially notified the government that se' zed computers and other files may contain attorney-client privileged materials. A government taint agent reviewed certain files and returned privileged materials to the defendant's counsel. Over a year later, the defendant's counsel reviewed the government's Rule 16 production of records, but did not raise any privilege claims to specific documents at that time. Two months later, defendant filed a motion to suppress privileged documents. Under these circumstances, the court held that the privilege was waived.
In this case, SDI notified the Government within a few days and weeks after the execution of the search warrant that certain allegedly attorney-client privileged documents or files had been seized. In his February 5, 8, and 21, 2002 letters to the Government, SDI's counsel identified the following categories of documents that Defendants claimed were privileged and should be returned to SDI:
1. A Compliance Binder allegedly taken from Todd Kaplan's office which SDI's counsel stated contained "numerous attorney-client privileged documents."
2. "Medicare Billing" and "HSC Protocol" files reportedly taken from SDI employee Dennis Benton's Office.
*1044 3. Some documents inside Evidence Box 145, bearing Control Number 243 and Locator Code S-4, may also be privileged.
4. SDI's attorneys' legal bills.
As to these documents or files, SDI timely placed the Government on notice of its claim that the seized materials were protected by the attorney-client privilege.[4] SDI's counsel also notified the Government that other seized files or computer records might contain attorney-client privileged documents. Unlike de la Jara, therefore, Defendants cannot be charged with failing to timely assert any attorney-client privilege respecting these documents. Furthermore, where, as here, the Government elects to appoint a taint attorney to review and make privilege determinations, the Defendants cannot be deemed to have waived their privileges, at least pending notification of the taint attorney's determination of privilege. See, e.g. In the Matter of the Search of 5444 Westheimer Road, 2006 WL 1881370 (S.D.Tex.2006); United States v. Grant, 2004 WL 1171258 (S.D.N.Y.2004).
In re Grand Jury (Impounded) and Bowles v. National Ass'n of Home Builders, supra, do not require a finding that Defendants waived the attorney-client privilege as to the specific documents or files set forth in SDI counsel's February 5, 8 and 21, 2002 letters. As the court in In re Grand Jury (Impounded) stated: "a reasonable person would not only inform his or her adversary of the breach of the privilege, but also would seek a judicial determination of the controversy if his or her adversary took an opposing stance." 138 F.3d at 982. (Emphasis added.) Unlike In re Grand Jury (Impounded), however, the Government did not respond to SDI's counsel's February 2002 letters by asserting the documents were not entitled to attorney-client privilege protection and that the Government intended to use the documents in its investigation of SDI. Nor did the Government subsequently notify Defendants of the taint attorney's privilege determinations until late 2005, in response to which the Defendants filed their instant Motion.
Unlike Bowles v. National Ass'n of Home Builders, supra, the evidence also does not clearly show the Defendants knew that the Government was, in fact, using SDI's allegedly privileged documents in its investigation. Defendants' position in this regard, however, is undercut to some extent by the following statement in SDI counsel's May 13, 2004 letter to AUSA Pomeranz:
Thus, it appears that despite my specific requests to the government on February 5, 2002, February 8, 2002, and again on February 21, 2002, the government has invaded SDI's attorney-client privilege. Indeed, after receiving specific notice to return these materials, the government instead decided to review the privileged materials and use them in its investigation.
Defendants' Motion (# 39), Exhibit "6", page 3.
In its May 20, 2004 response letter, the Government generally denied SDI counsel's assertions that it had engaged in "a pattern of intrusion" into SDI's privileged attorney-client materials or that the Government had failed to return privileged documents to SDI. The Government further noted that Defendants had not pursued process under the Federal Rule of Criminal Procedure "for the return of any *1045 materials that SDI believes were improperly seized, including any supposedly privileged materials." Government's Opposition (# 55), Exhibit "2". Although a reasonably prudent attorney would have questioned whether the Government intended to respect Defendants' assertions of privilege, the Government did not take the position, as it could have done, that the documents described in SDI's previous letters were not privileged and that the Government intended to use them in its investigation.
The Government's August 17, 2005, September, 2005 and September 9, 2005 letters, Defendants' Exhibits "10", "11" and "13", also indicate that at that late date, the Government still recognized that some of SDI's records were potentially protected by the attorney-client privilege. AUSA Myhre's August 17, 2005 letter stated that "[t]he government is aware of one document that is potentially privileged and will be seeking a ruling from the Court shortly as to any potential privilege that may apply. I am given to understand from our taint team that the document pertains to billing records between SDI and outside counsel." Exhibit "10", page 2. In his September 3, 2005 letter, AUSA Myhre again stated that the Government was "aware of potentially privileged materials." He indicated that the Government had segregated these documents into two categories. In one category were two or three documents the taint attorney has identified as potentially privileged. In the second category were approximately two boxes of documents that the taint attorney, after review, determined were not privileged. Exhibit "11". The Government's taint attorney, Ms. Datum, also corresponded with Defendants' counsel regarding the documents which she reviewed and which she had determined were potentially privileged and were kept under seal, versus those that were determined not to be privileged and which she had made available to the prosecution team. The Government and taint counsel, in addition, proposed that the parties meet and confer in an attempt to resolve their differences regarding allegedly privileged documents.
In cases involving the "inadvertent" disclosure of privileged attorney-client information, courts in the Ninth Circuit apply the totality of the circumstances approach. United States ex rel Bagley v. TRW, Inc., 204 F.R.D. 170, 177 (C.D.Cal. 2001). Under that approach, the courts consider the following factors: (1) the reasonableness of the precautions to prevent inadvertent disclosure; (2) the time taken to rectify the error; (3) the scope of the discovery; (4) extent of the disclosure; and (5) the "overriding issue of fairness." In this case, the disclosure was involuntary, rather than inadvertent. The key factors, as indicated by de la Jara and In re Grand Jury (Impounded), supra, therefore relate to Defendants' efforts following the seizure to protect their privilege and the overriding issue of fairness.
The Court agrees with the approach taken in United States v. Neill, supra, which involved similar circumstances. As to documents which Defendants identified and asserted claims of privilege in SDI counsel's letters dated February 5, 8 and 21, 2002, the Court finds that Defendants have not waived their attorney-client privilege. In so finding, the Court weighs and balances Defendants' failure to take earlier judicial action to enforce their privilege against the failure of the Government to timely notify Defendants of the privilege determinations made by the taint attorney, combined with the fact that in August-September 2005, the Government still recognized that some of the documents were potentially privileged.
In regard to other documents, including computer based records, as to which SDI never asserted specific attorney-client *1046 privileges, the record supports the conclusion that SDI waived its attorney-client privilege by failing to assert it or to take timely action to protect it. In their Reply (# 67), Defendants attempt to distinguish de la Jara and In re Grand Jury (Impounded) on the ground that those cases involved a single document and that Bowles v. National Ass'n of Home Builders involved a finite number of ascertainable documents. In contrast, Defendants argue that the Government seized hundreds of thousands of documents which it maintained in its sole control. This is not a sufficient basis for distinguishing those cases.
There is no evidence, nor is there any basis for believing that the hundreds of thousands of paper documents and computer records seized by the Government constituted potentially privileged attorney-client communications. Within days and weeks after the seizure of its documents, SDI was able to identify potentially privileged documents and files that had been seized by the Government. SDI's counsel also advised the Government that there might be other privileged documents contained in the seized records which could only be determined after SDI having an opportunity to review the seized records. At that point, the Court would agree that SDI had not waived its privileges because it had, as yet, no opportunity to inspect its files and identify additional privileged records. See In re Grand Jury Subpoenas XX-XXX-XX and XX-XXX-XX, 454 F.3d at 515 (stating that movant could not be criticized for failing to provide a privilege log before he had an opportunity to review the records.) See also Burlington Northern & Santa Fe Railway Co. v. District Court., 408 F.3d 1142 (9th Cir.2005) (timeliness of privilege log is determined by the relevant circumstances including the ability of the party to review the documents and identify privileged materials.) On the other hand, the Court does not agree that a mere generalized assertion that seized records may contain attorney-client privileged materials is, in and of itself, sufficient to preserve the defendant's privilege indefinitely. See United States v. Ary, 2005 WL 2367541 (D.Kan.2005).
SDI counsel's February 21, 2002 letter to AUSA Myhre stated that the Government agreed to make certain SDI records available for copying on February 22, 2002, and "to allow SDI's representatives to use a scanner and laptop to copy all needed records, ZIP disks and CD ROMS." Defendants' Motion (# 39), Exhibit "5", pages 1-2. According to this letter, the Government also agreed to return other documents to SDI. No evidence has been presented that the Government subsequently refused to return records it agreed to return, o-2 that the Government refused to permit SDI to copy the documents and computer records. AUSA. Pomeranz's May 20, 2004 letter to SDI's counsel noted the "extraordinary access" that SDI was granted "to review the materials seized both during and after the execution of the search warrant." Government's Opposition (# 55), Exhibit "A-2." No evidence has been submitted by Defendants showing that they disputed the Government's assertion in this regard.
It appears that SDI was granted access to the seized records which it could have reviewed to identify additional privileged attorney-client communications. Therefore, it was unreasonable for SDI to fail to take steps to identify and assert its privilege regarding other documents within a reasonable time after it was granted access to the seized records. Assuming, for sake of argument, that the Government had refused to permit SDI to inspect and copy the seized records after February 21, 2002, it would have been incumbent on Defendants to timely pursue judicial action to obtain the records so that additional *1047 privileged documents could be identified and objections made to the Government's use of those records. The Court therefore finds that Defendants waived any attorney-client privilege regarding documents seized during the search of SDI's corporate headquarters and offsite storage facility on January 31, 2002 that the Defendants did not identify in SDI counsel's letters dated February 5, 8 and 21, 2002. Defendants therefore are not entitled to an evidentiary hearing regarding the Government's alleged improper intrusion into the Defendants' attorney-client privilege regarding those records as to which Defendants made no timely assertion of privilege.
C. Whether the Government's Intrusion Into Defendant's Attorney-Client Privilege Warrants An Evidentiary Hearing.
Having found that Defendants have not waived their attorney-client privilege objections to the documents identified in SDI counsel's letters dated February 5, 8 and 21, 2002, the issue is whether Defendants have raised sufficient grounds to require an evidentiary hearing to determine whether the indictment should be dismissed, or whether other sanctions should be imposed on the Government or its counsel based on the Government's use of Defendants' attorney-client communications. Defendants have not requested any specific form of sanction in their Motion, but rather state that the appropriate level of sanction should be determined based on the evidence adduced at the hearing. Defendants state that such appropriate sanctions may include suppression of all evidence improperly obtained and reviewed by the Government and its taint team, disqualification of the Government attorneys who had access to privileged information, dismissal of the indictment or other sanctions against the prosecutors who reviewed the privileged information. Defendants' Motion (# 39), page 15.
The general remedy for violation of the attorney-client privilege is to suppress introduction of the privileged information at trial. The Government argues that there are only three potential constitutional or legal grounds upon which the Court could consider a motion to dismiss the indictment or the imposition of other severe sanctions, apart from suppression of privileged information. These grounds are (1) a violation of Defendants' right to counsel under the Sixth Amendment, (2) a violation of Defendants' right to substantive due process under the Fifth Amendment, or (3) the court's inherent power to punish flagrant prosecutorial misconduct which causes defendant to suffer substantial prejudice.
1. Alleged Violation of Defendants' Sixth Amendment Rights.
The first issue is whether Defendants have a viable claim for violation of their Sixth Amendment right to counsel resulting from the Government's alleged intrusion upon the attorney-client relationship. The Ninth Circuit adheres to the bright line rule that the Sixth Amendment right to counsel attaches only upon the initiation of formal criminal charges. United States vs. Hayes, 231 F.3d 663, 675 (9th Cir.2000); United States v. Percy, 250 F.3d 720, 725 (9th Cir.2001); United States v. Kingston, 971 F.2d 481 (9th Cir. 1992). In United States v. Rogers, 751 F.2d 1074, 1077-78 (9th Cir.1985), the court stated that defendant's Sixth Amendment right to counsel was not involved where, during a pre-indictment criminal investigation, defendant's former attorney made statements to the IRS regarding legal advice he had given to defendant regarding tax shelters that were the subject of the investigation. In United *1048 States v. White, 970 F.2d 328, 333-334 (7th Cir.1992), the court held that the government's interview of defendants' former bankruptcy attorney regarding whether defendants committed bankruptcy fraud did not raise a Sixth Amendment issue because the attorney was not representing defendants in any criminal matter at the time the government approached him. In United States v. Kennedy, 225 F.3d 1187, 1193-93 (10th Cir.2000), the court held that defendant was not entitled to an evidentiary hearing regarding alleged violations of his Sixth Amendment rights where the alleged intrusion into the attorney-client relationship occurred a year before the indictment. In United States v. Lin Lyn Trading, Ltd., 149 F.3d 1112, (10th Cir.1998), the court held that defendant's Sixth Amendment rights were not implicated where prior to indictment, government agents seized a notebook containing confidential attorney-client communications. The court also held that the seizure of attorney-client communications prior to indictment did not become a Sixth Amendment violation once the indictment was filed. In the face of this authority, the Court agrees with the Government that the suggestion in United States v. Neill, 952 F.Supp. 834 (D.D.C.1997), that the Sixth Amendment applies to pre-indictment seizures of attorney-client communications is incorrect.
Even in the cases where the Government intrudes upon the defendant's attorney-client relationship after the Sixth Amendment right to counsel has attached, the intrusion is not, in and of itself, a violation of the Sixth Amendment. United States v. Irwin, 612 F.2d 1182, 1187 (9th Cir.1980). Such a violation occurs only if the defendant suffers substantial prejudice, such as where privileged information is introduced at trial, the prosecution obtains the defense plans and strategy, or the governmental intrusion destroys the defendant's confidence in his attorney. Id. A violation of a defendant's Sixth Amendment rights does not require dismissal of the indictment and dismissal is not appropriate if less drastic remedies would preserve defendant's ability to receive a fair trial. United States v. Rogers, supra, 1078-79, citing United States v. Morrison, 449 U.S. 361, 364, 101 S.Ct. 665, 667, 66 L.Ed.2d 564 (1981); Black v. United States, 385 U.S. 26, 87 S.Ct. 190, 17 L.Ed.2d 26 (1966); and O'Brien v. United States, 386 U.S. 345, 87 S.Ct. 1158, 18 L.Ed.2d 94 (1967).
The Court need not reach these issues under the Sixth Amendment, however, because the seizure of Defendants' allegedly privileged attorney-client communications substantially predates the filing of the indictment or other formal criminal proceedings. The allegedly privileged documents were seized by the Government on January 31, 2002. Following the seizure, the Government continued with its investigation. SDI, Todd Kaplan and Jack Brunk were subsequently indicted on March 2, 2005, more than three years after the seizure. The alleged attorney-client privileged records at issue do not involve confidential communications regarding defense plans or strategies in defending against pending criminal charges. Accordingly, Defendants have not demonstrated a violation of their Sixth Amendment rights.
2. Violation of Defendants' Rights to Due Process Under the Fifth Amendment/Court's Inherent Supervisory Powers to Dismiss Indictment or Impose Other Sanctions For Prosecutorial Misconduct.
A defendant may assert a claim that his or her rights under the Due Process Clause of the Fifth Amendment have been violated by prosecutorial misconduct occurring prior to or after indictment. *1049 United States v. Kennedy, 225 F.3d 1187, 1194-95 (10th Cir.2000). The governmental misconduct required to establish a due process violation, however, must be so outrageous as to shock the conscience of the court. Id., see also United States v. Voigt, 89 F.3d 1050, 1064-65 (3rd Cir.), cert. denied 519 U.S. 1047, 117 S.Ct. 623, 136 L.Ed.2d 546 (1996), quoting Rochin v. California, 342 U.S. 165, 72 S.Ct. 205, 96 L.Ed 183 (1952) and United States v. Russell, 411 U.S. 423, 93 S.Ct. 1637, 36 L.Ed.2d 366 (1973). Cases in which courts have found a due process violation justifying dismissal of an indictment or barring further prosecution are extremely limited. See Rochin, supra, (police conduct in pumping defendant's stomach to obtain incriminating evidence of illegal drug use.) The Third Circuit in Voigt, citing its earlier decision in United States v. Jannotti, 673 F.2d 578 (3rd Cir.) (in banc) cert. denied 457 U.S. 1106, 102 S.Ct. 2906, 73 L.Ed.2d 1315 (1982), noted that the judiciary is extremely hesitant to find law enforcement conduct so offensive that it violates the Due Process Clause. The court noted that this constitutional defense is reserved for "only the most intolerable government conduct." Voigt, supra, at 1065, citing Jannotti, at 608. As a result, the doctrine of outrageous government misconduct, although often invoked by defendants, is rarely applied by the courts. United States v. Santana, 6 F.3d 1, 4 (1st Cir.1993).
In regard to an alleged Fifth Amendment due process violation resulting from governmental intrusion into the attorney-client relationship, Voigt adopted the following test:
[I]n order to raise a colorable claim of outrageousness pertaining to alleged governmental intrusion into the attorney-client relationship, the defendant's submissions must demonstrate an issue of fact as to each of the three following elements: (1) the government's objective awareness of an ongoing, personal attorney-client relationship between its informant and the defendant; (2) deliberate intrusion into that relationship; and (3) actual and substantial prejudice.
Voigt, supra, 89 F.3d at 1067.
The Voigt test was also adopted by the Tenth Circuit in Kennedy, supra. Both Voigt and Kennedy involved circumstances in which the government allegedly obtained privileged information voluntarily disclosed by an attorney. In the context of the Government's seizure of allegedly attorney-client privileged documents, United States v. Segal, 313 F.Supp.2d 774, 780 n. 8 (N.D.Ill.2004) reformulates the test as follows: (1) governmental knowledge of the attorney-client relationship; (2) deliberate intrusion into that relationship; and (3) actual and substantial prejudice.
As the cases cited in Kennedy and Voigt demonstrate, the governmental misconduct in deliberately intruding into the attorney-client relationship and prejudice suffered by a defendant must be very severe for the court to conclude that the government's misconduct violates "`fundamental fairness, shocking to the universal sense of justice' mandated by the Due Process Clause of the Fifth Amendment." Voigt, supra, at 1065, quoting United States v. Russell, 411 U.S. at 431-32, 93 S.Ct. 1637. See also United States v. Fernandez, 388 F.3d 1199, 1238 (9th Cir.2004). In this regard, Kennedy cited United States v. Schell, 775 F.2d 559, 562-566 (4th Cir.1985), which held that defendants' due process rights were violated when their attorney represented them during grand jury proceedings, and then participated in their prosecution after indictments were issued in the same matter. In United States v. Marshank, 777 F.Supp. 1507, 1521-23 (N.D.Cal.1991), the court concluded that the government's pre-indictment *1050 intrusion into defendant-attorney client relationship was so pervasive as to require dismissal where the defendant's attorney participated in the criminal investigation of his client and the government knowingly assisted the attorney in violating the attorney-client privilege and hid the violation from the court.
In contrast, Voigt cited United States v. Ofshe, 817 F2d 1508, (11th Cir.), cert. denied, 484 U.S. 963, 108 S.Ct. 451, 98 L.Ed.2d 391 (1987), in which the government used a defense attorney as an informant against the defendant in a matter unrelated to the subject of the attorney's representation. Although the attorney provided the government with confidential information regarding the defense strategy, the court concluded that the government's conduct was not so outrageous as to violate the Fifth Amendment because the attorney's cooperation involved a different crime than the one for which he represented the defendant, and defendant's co-counsel zealously represented him at trial and there was no demonstrable evidence that his defense was prejudiced. Voigt also cited another case, United States v. Levy, 577 F.2d 200 (3rd Cir.1978), in which a prosecution was dismissed because the government employed a co-defendant to obtain the defendant's confidential defense strategy and prejudiced his defense at trial.
In Kennedy, the petitioner argued that his conviction should be overturned and the indictment dismissed based on the government's misconduct in obtaining incriminating evidence from his former counsel which it used to obtain his indictment. The district court denied petitioner's request for an evidentiary hearing and denied his petition on the grounds that the former attorney did not testify against him at trial and his defense was, therefore, not prejudiced. The Tenth Circuit held that the district court should have considered not only the evidence admitted in the case, but also any information that the government received from the former attorney during its investigation. Nevertheless, the court concluded that under the Voigt test, defendant had not shown how the allegedly privileged information "infected the trial to such an extent that it resulted in a fundamentally unfair trial." Nor had defendant demonstrated that the government's conduct in interviewing petitioner's former attorney during its investigation was sufficiently outrageous to support granting a new trial or dismissing the indictment. Consequently, the court held that the district court did not abuse its discretion in refusing to grant an evidentiary hearing. 225 F.3d at 1196.
In Voigt, the government obtained information from an employee of a trust to build its case against the defendant-trust operator. The informant was an attorney, but it was greatly disputed whether she served or acted in the role of attorney for the trust or defendant during the periods that she provided information to the government regarding defendant's fraudulent activities. The district court denied defendant's request for a pre-trial evidentiary hearing as to whether the government violated his Fifth Amendment rights by intrusion into the attorney-client relationship. The Third Circuit held that although the issue was a close one, the district court should have conducted an evidentiary hearing to determine the admissibility of the evidence prior to trial and establish a clear record for appellate review. The court held, however, the failure to grant an evidentiary hearing was harmless based on its review of the trial record. The court noted that at trial, defendant's counsel vigorously cross-examined the government agent as to whether he knew or believed that the informant acted in the capacity of attorney for the defendant and the trust. The record failed to show that the government *1051 outrageously violated defendant's due process rights in its use of the informant. See also United States v. Rogers, 751 F.2d 1074, 1077-78 (9th Cir.1985) and United States v. White, 970 F.2d 328, 333-334 (7th Cir.1992), in which the government obtained incriminating evidence through voluntary disclosures made to the government by defendants' former attorneys in alleged violation of their ethical obligations. In neither of those cases did the courts find sufficient grounds to support a claim that the prosecution's conduct was sufficiently outrageous or that the government's use of allegedly privileged information infected the trial to such an extent that it constituted an unfair trial.
Defendants have cited United States v. Horn, 811 F.Supp. 739 (D.N.H.1992), in support of their request for an evidentiary hearing. Horn involved a violation of the defendants' Sixth Amendment rights. In that case, the defense counsel made arrangements to obtain copies of a small and select number of voluminous documents that the government had subpoenaed for the grand jury in order to prepare cross-examination of key government witnesses and as part of the defense trial strategy. At the prosecutor's request, the copy service provided her with duplicate copies of everything requested by the defendants' counsel. Once the defense counsel discovered this, they requested that the prosecution seal the records and not make any use of them until the court could rule on their privileged nature. The prosecutor refused and not only reviewed the documents herself, but used them in preparing government witnesses for trial. The prosecutor also violated a court order regarding nonuse of the documents and lied to the court regarding the extent of the violation. Despite finding that the documents selected by defense counsel constituted protected opinion work product and that the prosecutor engaged in serious misconduct in violation of defendant's Sixth Amendment rights, the court held that the prosecutor's misconduct did not warrant dismissal of the indictment. Instead, the court imposed tailored remedies, including requiring the government to provide summaries of expected witness testimony, permitting defendants to depose certain witnesses before trial, prohibiting the government from introducing the documents or eliciting testimony about them during direct or cross examination, and disqualifying the lead prosecutor based on her severe misconduct and the likely inability to correct the taint if she remained on the case.
Horn is, of course, distinguishable from this case because it involved a Sixth Amendment violation and a deliberate intrusion into the defendant's trial preparation and strategy for cross-examining the government's witnesses. The allegedly privileged documents seized by the Government in this case may relate to legal advice or confidential communications that SDI received from its counsel prior to the execution of the search warrant. Such information may be relevant to whether SDI was conducting its business in a lawful manner or was engaging in health care fraud. The allegedly privileged information is, therefore, more akin to that obtained by the government in cases such as United States v. Rogers, United States v. Kennedy or United States v. White, supra.[5] In United States v. Rogers, supra, 751 F.2d at 1078, the court, citing United States v. Morrison, 449 U.S. 361, 364, 101 S.Ct. 665, 667, 66 L.Ed.2d 564 (1981), stated that where evidence is seized or obtained in violation of defendant's constitutional *1052 rights, the suppression of the evidence, and not dismissal of the indictment is the appropriate remedy. Rogers held that the fact that allegedly privileged attorney-client information may have been used by the government in pursuing its investigation and seeking an indictment did not justify dismissing the indictment. In so holding, the court stated:
There is a fundamental distinction between the use of privileged information at trial, and its use during the investigative period. See United States v. Calandra, 414 U.S. 338, 349, 94 S.Ct. 613, 620 38 L.Ed.2d 561 (1974) ("Because the grand jury does not finally adjudicate guilt or innocence, it has traditionally been allowed to pursue its investigative and accusatorial functions unimpeded by the evidentiary and procedural restrictions applicable to a criminal trial.").
Rogers cited United States v. Mackey, 405 F.Supp. 854 (E.D.N.Y.1975), in which the court held that admission before a grand jury of evidence that violates the attorney-client privilege, but which does not stand on constitutional footing, does not imply any right to a dismissal of the indictment. Rogers thus held that the alleged use of the attorney's statement before the grand jury in that case did not warrant dismissal of the indictment.
In United States v. Kingston, 971 F.2d 481 (10th Cir.1992), the court also held that defendant was not entitled to dismissal of the indictment because defendant's attorney was subpoenaed and testified before the grand jury in alleged violation of defendant's attorney-client privilege. The court again noted that unless the defendant shows that he was prejudiced, the alleged violation of his attorney-client privilege in the grand jury proceedings does not bar the prosecution from proceeding, but instead requires the suppression of illegally seized evidence at trial.
The Court may also exercise its supervisory powers to dismiss an indictment in response to outrageous government conduct that falls short of a due process violation. United States v. Fernandez, 388 F.3d 1199, 1239 (9th Cir.2004), citing United States v. Ross, 372 F.3d 1097, 1109 (9th Cir.2004). To justify the exercise of the court's supervisory powers, the prosecutorial conduct must (1) be flagrant and (2) cause substantial prejudice to defendant. In United States v. Barrera-Moreno, 951 F.2d 1089, 1092 (9th Cir. 1991), the court states that dismissal is appropriate when the investigative or prosecutorial process has violated a federal constitutional or statutory right and no lesser remedial action is available. The dividing line between what constitutes outrageous governmental misconduct constituting a violation of due process and outrageous or flagrant misconduct short of a due process violation is not otherwise clear.
Defendants' motion, with some distinctions discussed herein, is similar to the motion before the court in United States v. Segal, 313 F.Supp.2d 774 (N.D.Ill.2004). In Segal, the government conducted a criminal investigation of defendant and his brokerage firm for fraudulent activities. Pursuant to a search warrant, the government seized over two hundred boxes of documents and a significant amount of electronic information including several personal computers and back-up tapes. Approximately 11 months after the seizure, defendants filed a motion for return of all seized attorney-client privileged information and an order barring the government from using these communications for any purpose. The court noted that the defendants had repeatedly requested the government to identify which seized electronic communications it had reviewed and also alleged that the government had failed to follow Department of Justice *1053 Guidelines for searching potentially privileged electronic materials. In response to defendant's motion, the government submitted affidavits regarding the conduct of its agents in reviewing the seized records for privileged materials and segregating those materials. In regard to the paper documents, the government stated that it had segregated and had not reviewed potentially privileged documents seized during the search.[6]
The court in Segal denied defendants' request that the Government not review or use defendants' attorney-client privilege communications for any purpose. The court stated:
We decline to issue such a broad order because the attorney-client privilege is a narrowly construed evidentiary rule designed to "encourage full disclosure and to facilitate open communications between attorneys and their clients." United States v. BDO Seidman, 337 F.3d 802, 810-11 (7th Cir.2003). We will issue a narrower order to protect Defendants' attorney-client privileged communications. We order the Government not to review the documents on Defendants' privilege log[7] and not to use these documents as evidence at trial unless and until the Court determines that Defendants' claim of privilege is unfounded.
The court in Segal also denied defendants' motion that the government be barred from introducing at trial any evidence derived from its violation of defendants' attorney-client privilege. The court noted that under the fruit of the poisonous tree doctrine, a defendant is entitled to the suppression of derivative evidence obtained from a constitutional violation. Segal, at 780, citing Wong Sun v. United States, 371 U.S. 471, 83 S.Ct. 407, 9 L.Ed.2d 441 (1963). The court stated, however, that the attorney-client privilege is an evidentiary privilege, not a constitutional right. The violation of the attorney-client privilege does not require suppression of derivative evidence. Id., citing United States v. Marashi, 913 F.2d 724, 731 n. 11 (9th Cir.1990). The court further stated that violation of a defendant's attorney-client privilege will only violate defendant's due process rights if the violation was caused by serious governmental misconduct that is outrageous enough to shock the judicial conscience. Id., citing United States v. White, United States v. Kennedy and United States v. Voigt, supra. The court held that the government's ill-advised failure to pro-actively use the screening procedures identified by defendants did not violate defendants' due process rights because there was no evidence that the government deliberately read communications that it affirmatively knew were privileged and defendants had not identified any derivative evidence that they believe the government intended to use at trial.
In regard to defendants' related claim that the government had elicited protected attorney-client privileged communications from the executives of the brokerage firm, Segal noted that the defendants were placing the cart before the horse because they had not affirmatively established that any of the elicited communications were, in fact, privileged. The court found on the record before it that the government had not knowingly violated the attorney-client *1054 privilege and therefore defendants had not made a sufficient showing of outrageous misconduct to support a finding of a violation of their due process rights. The court concluded that defendants were entitled to suppression of all disclosed privileged information which they could prove were attorney-client privileged communications. The court found, however, that defendants had not made the necessary showing to support the suppression of derivative evidence. Segal, supra, 313 F.Supp.2d at 781-82.
The Government's taint attorney, Ms. Damm, reviewed several hundred pages of documents and has determined that some, if not many, of those documents are not privileged and has turned them over to the prosecution team. Reportedly, the taint attorney has identified some documents that are potentially privileged and has not provided them to the prosecution team. Apparently, the documents which Ms. Damm determined are not privileged and which have been disclosed to the prosecution team, are included in the 500 plus pages of documents that Defendants have submitted under seal for in camera review by the Court. The Court cannot determine, however, whether the Defendants' in camera submission also includes the documents that Ms. Damm has identified as potentially privileged, but has not yet provided to the prosecution team.
In order for the Court to have any basis to consider whether there has been any outrageous and prejudicial violation of Defendants' due process rights, the issue of privilege should first be determined. Neither the Defendants nor the Government have specifically addressed whether the documents in issue are attorney-client privileged documents or fall within the "crime-fraud" exception to the attorney-client privilege. It is Defendants' burden to establish all elements of the attorney-client privilege. United States v. Martin, 278 F.3d 988, 999-1000 (9th Cir.2002). Conversely, if the Government contends that the attorney-client privilege does not apply based on the crime-fraud exception to the privilege, it is the Government's burden to prove the application of that exception. Id., at 1001. Based on a preliminary review of the documents submitted by Defendants for in camera review, the documents would appear to be of the type potentially protected by the attorney-client privilege. Absent full briefing and hearing on the applicability of the privilege and any exception to it, however, the Court is not prepared to decide this predicate issue. Assuming, for sake of argument, that the Court were to find that the attorney-client privilege does not apply to documents that have been provided to the prosecution team, then Defendants' request for an evidentiary hearing regarding prosecutorial misconduct obviously fails.
As to the documents that the Government's taint attorney has identified as potentially privileged, but which have not been turned over to the Government's prosecution team, the Defendants should file a motion under seal and serve it on the Government's taint counsel supporting their claim of privilege and that the documents should be returned to Defendants. As to the documents that Defendants claim are privileged and which have already been provided to the Government's prosecution team, the Defendants should file an appropriate motion making an affirmative specific showing that the documents are protected by the attorney-client privilege. If the Government alleges the "crime-fraud" exception, then it must establish that the exception applies. The Court will then determine whether the documents should be suppressed for use at trial.
Only then would a basis even exist for the Court to address whether the Government's alleged violation of the attorney-client *1055 privilege warrants an evidentiary hearing to consider possible imposition of sanctions. The instances of alleged prejudice cited by Defendants at page 14 of their Reply (# 67) do not constitute a colorable showing outrageous governmental misconduct or substantial prejudice. Defendants state that the Government attempted to question former SDI employee Dennis Benton regarding several privileged documents. From Defendant's briefs and exhibits, however, it does not appear that Mr. Benton answered the Government's questions. Nor is there any indication that he or other witnesses were examined about privileged information before the grand jury, which had it occurred would not, in and of itself, warrant dismissal. United States v. Rogers, supra. The fact that Mr. Benton was interviewed about a document as to which the Defendants subsequently waived the privilege also does not demonstrate substantial prejudice. To the extent that the Government should not have used this document prior to Defendants' limited waiver of the privilege, the subsequent waiver made such use harmless. Furthermore, it appears that Defendants waived the privilege because it probably did not apply due to the fact that SDI/Mr. Benton disclosed the document to a third party. Defendants' reliance on United States v. Horn, 811 F.Supp. 739 (D.N.H.1992), in this regard is also misplaced because, in that case, the government used defendant's work product and trial preparation and strategy to prepare the government's witnesses for cross-examination by defendant's counsel.
Defendants' other claim of prejudice resulting from the Government's review of thousands of Defendants' documents without first determining whether they contained privileged information lacks merit based on the Court's conclusion that Defendants have waived any privilege to those documents. In the same regard, Defendants' arguments regarding the deficiencies in the Government's taint procedures lack merit, given Defendants' failure to seek timely judicial action regarding those procedures. Certainly, at this point, the Government's alleged abuse of the taint procedures does not warrant an evidentiary hearing before a determination is made as to whether the prosecution team has, in fact, had access to privileged documents.
CONCLUSION
Accordingly, the Court finds that Defendants have explicitly waived their attorney-client privilege to the memoranda attached to SDI employee Benton's letter to SDI's accountants. The Court further finds that Defendants have waived their attorney-client privilege as to documents that were not listed in SDI counsel's February 2002 letters to the Government. As to the remaining documents to which Defendants' privilege has not been waived, a decision to grant an evidentiary hearing would be premature prior to a determination that attorney-client privileged materials have been turned over to the prosecution team and used by it. The Court also finds, however, that Defendants have not made a showing that there has been any outrageous conduct by the Government in using their allegedly privileged materials, or that Defendants have suffered substantial prejudice that would justify dismissal of the indictment or imposition of severe sanctions.
RECOMMENDATION
IT IS RECOMMENDED that Defendants' Motion Requesting an Evidentiary Hearing Regarding the Government's Intrusion into Defendant's Privileged Information (# 39) be denied. It is further recommended that Defendants and the Government be directed to brief their respective positions on the attorney-client *1056 privilege regarding the documents that Defendant SDI's counsel identified in his February 5, 8 and 21, 2002 letters to the Government and that the Government set forth its position regarding application of the "crime fraud" exception as to any documents otherwise deemed to be privileged. Pending the Court's decision on these privilege issues, the Court may further consider whether an evidentiary hearing regarding the Government's alleged misconduct in intruding upon the attorney-client privilege is warranted.
NOTICE
Pursuant to Local Rule IB 3-2, any objection to this Finding and Recommendation must be in writing and filed with the Clerk of the Court within ten (10) days. The Supreme Court has held that the courts of appeal may determine that an appeal has been waived due to the failure to Me objections within the specified time. Thomas v. Arn, 474 U.S. 140, 142, 106 S.Ct. 466, 88 L.Ed.2d 435 (1985). This circuit has also held that (1) failure to file objections within the specified time and (2) failure to properly address and brief the objectionable issues waives the right to appeal the District Court's order and/or appeal factual issues from the order of the District Court. Martinez v. Ylst, 951 F.2d 1153, 1157 (9th Cir.1991); Britt v. Simi Valley Unified Sch. Dist., 708 F.2d 452, 454 (9th Cir.1983).
October 16, 2006.
NOTES
[1] Although not attached to Defendants' Exhibit "4", this list is attached to the copy of the same letter in Exhibit "A-1" of the Government's Opposition (# 55).
[2] SDI's counsel apparently understood this statement as indicating that the Government had filed the letter under seal with the district court and that the Government would file a motion with the court to unseal the letter. It appears, however, that ASUA Pomeranz only indicated that the taint team attorney had sealed the letter from use by the investigating prosecutors and agents, and that they would now "unseal" it for purposes of using it in their investigation. No evidence has been provided that the documents were, in fact, filed under seal with the court.
[3] The concurring judge, however, rejected the majority's concern that the government's use of the privileged file might have tainted the grand jury investigation. The concurring judge stated that the government assumed that risk when it seized and made use of privileged information in its investigation. Because the defendant had intentionally delayed filing his motion for his own advantage, however, the concurring judge agreed that his work-product privilege should be deemed: waived.
[4] Assuming that Defendants or their counsel were granted access by the Government to review these records, they arguably should have supplemented their privilege claims by more specifically describing the documents that they allege were protected by the attorney-client privilege.
[5] Again, in those cases the government obtained allegedly incriminating information through interviews with defendants' former attorneys. Here, of course, the government allegedly seized confidential attorney-client communications.
[6] Segal does not indicate whether the government raised the eleven month delay between the seizure of the evidence and defendants' motion for return of the privileged documents as constituting a waiver of the attorney-client privilege.
[7] In response to a prior motion by defendants, the court ordered them to submit a privilege log of allegedly privileged documents.
|
######################
# UseRealSense.cmake #
######################
OPTION(WITH_REALSENSE "Build with Intel RealSense support?" OFF)
IF(WITH_REALSENSE)
FIND_PACKAGE(RealSense REQUIRED)
INCLUDE_DIRECTORIES(${RealSense_INCLUDE_DIR})
ADD_DEFINITIONS(-DCOMPILE_WITH_RealSense)
ENDIF()
|
Aurora-A kinase inhibition enhances the cytosine arabinoside-induced cell death in leukemia cells through apoptosis and mitotic catastrophe.
Aurora-A (Aur-A) is a centrosome-associated serine/threonine kinase that is overexpressed in various cancers and potentially correlated with chemoresistance. In the Ara-C-sensitive leukemia cell lines, silencing of Aur-A by small interfering RNA transfection led to a significant increase in the Ara-C-induced cell death rate through induction of mitochondria-mediated, caspase-dependent apoptosis. In contrast, combined treatment of the Ara-C-resistant leukemia cell lines with Aur-A siRNA and Ara-C remarkably enhanced the cell death rate via non-caspase-dependent mitotic catastrophe. Taken together, Aur-A inhibition was an effective treatment for both the Ara-C-sensitive and resistant leukemia cells by increasing apoptosis and mitotic catastrophe, respectively. |
How to Get Floor Plans Of A House Special Offers
How to Get Floor Plans Of A House
Special Offers » Wonderful Guideline In Terms Of Interior Design, How To Get Floor Plans Of A House Decor is simply as complex as you may let it get. If you are willing to find out and take time to enable new ideas kitchen sink in, you may very easily see your good results. The guidelines from the write-up over were all well tested by a lot of prior to, and will easily function in your prefer way too.
How to Get Floor Plan My House New Draw My House Floor Plan Floor from How To Get Floor Plans Of A House , Take it together with you when searching for curtains or some other beautifying supplies looks sourced from: guiablog.net.
Planning to Buy A House Best Draw Floor Plans Houses Floor Plans from How To Get Floor Plans Of A House , Take it with you when looking for curtains or other designing resources impression sourced from: seoscope.net.
You must decide How To Get Floor Plans Of A House what type of frame of mind you want the space to have before you begin any design work. Emotions may be daring and crazy or relaxed and comforting. When you know what sensing you need How To Get Floor Plans Of A House your living area to offer you, you will notice that it’s much easier to prepare jobs to perform your room How To Get Floor Plans Of A House
layout.
How to Get Floor Plans Of A House
Special Offers » Try to use flexible household furniture anytime designing a reduced sized room. An ottoman is a superb choice. You can use it for seating or possibly a desk, and you could even retail store goods on the inside, when it starts up. Items which have numerous functions are effective area savers for a smaller sized place.
Draw House Plans for Free Luxury Free Floor Plan House Plan Free from How To Get Floor Plans Of A House , Take it together with you when shopping for drapes or some other designing supplies image via from: globalgamersesports.com.
40×40 House Floor Plans Cool Floor Plans Globalchinasummerschool from How To Get Floor Plans Of A House , Take it along when shopping for curtains or another beautifying components got from: blueroots.info.
Get A Home Plan Unique Get Floor Plans New Simple Floor Plans from How To Get Floor Plans Of A House , Bring it along with you when buying window curtains or any other redecorating resources looks sourced from: podtyazhki.net.
Floor Plan Planning House Floor Plans for Sale or Frank Benz New from How To Get Floor Plans Of A House , Take it with you when looking for curtains or other designing materials image downloaded from: thoughtyouknew.us.
43 Unique Image Small House Open Floor Plan from How To Get Floor Plans Of A House , Bring it together with you when buying curtains or some other beautifying components picture received from: entropic-synergies.com.
How to Get Floor Plans Of A House
Special Offers » Acquire your settee pillow store shopping with you. It could truly feel goofy, but getting along part of your sofa will save you time and effort any cash. Bring it with you when shopping for window curtains or some other decorating components. By doing this, it is possible to make sure that How To Get Floor Plans Of A House every thing matches.
How to Get Floor Plans Of A House
Special Offers » Lights are a fantastic addition to any residence because these may be in the family room or right with you inside the room. In addition these units offer you additional lighting to learn and publish, nonetheless they may give your house a conventional appearance and match numerous designs.
Draw House Plans for Free Luxury Free Floor Plan House Plan Free from How To Get Floor Plans Of A House , Take it together with you when shopping for drapes or some other designing supplies image via from: globalgamersesports.com.
How to Get Floor Plan My House New Draw My House Floor Plan Floor from How To Get Floor Plans Of A House , Take it together with you when searching for curtains or some other beautifying supplies looks sourced from: guiablog.net.
Get A Home Plan Unique Get Floor Plans New Simple Floor Plans from How To Get Floor Plans Of A House , Bring it along with you when buying window curtains or any other redecorating resources looks sourced from: podtyazhki.net.
Floor Plan Planning House Floor Plans for Sale or Frank Benz New from How To Get Floor Plans Of A House , Take it with you when looking for curtains or other designing materials image downloaded from: thoughtyouknew.us.
Planning to Buy A House Best Draw Floor Plans Houses Floor Plans from How To Get Floor Plans Of A House , Take it with you when looking for curtains or other designing resources impression sourced from: seoscope.net.
Lowes Home Plans Affordable House Plans Lovely New House Plan Hdc 0d from How To Get Floor Plans Of A House , Take it with you when looking for curtains or any other decorating supplies received from: gebrichmond.com.
43 Unique Image Small House Open Floor Plan from How To Get Floor Plans Of A House , Bring it together with you when buying curtains or some other beautifying components picture received from: entropic-synergies.com.
40×40 House Floor Plans Cool Floor Plans Globalchinasummerschool from How To Get Floor Plans Of A House , Take it along when shopping for curtains or another beautifying components got from: blueroots.info.
{% endfor % Let you to Opt for bathroom lighting cautiously. Within a toilet, an individual overhead light-weight will cast an unwelcome shadow, How To Get Floor Plans Of A House so that it is difficult to utilize make-up or shave. A How To Get Floor Plans Of A House sconce on either side of your treatments case will offer you a much level of lighting, excellent for grooming. Incandescent lighting is better than phosphorescent lamps, which can create a bluish color of How To Get Floor Plans Of A House.
About Author
You may also like
2 Story House Plans with Master On Second Floor as Your Reference » Wonderful Information In Relation To Decor, 2 Story House Plans With Master On Second Floor Decor is only as complicated when you allow it get. If you are happy to find ...
Family Compound House Plans Correctly » Excellent Guide In Terms Of Decor, Family Compound House Plans Interior design is merely as complicated when you let it get. Should you be ready to discover and take the time to allow fresh suggestions sink in, you ... |
DAMTP-2006-72\
27th Oct. 2006\
[G. W. Gibbons[^1] and C. M. Warnick[^2]]{}
> Hyperbolic monopole motion is studied for well separated monopoles. It is shown that the motion of a hyperbolic monopole in the presence of one or more fixed monopoles is equivalent to geodesic motion on a particular submanifold of the full moduli space. The metric on this submanifold is found to be a generalisation of the multi-centre Taub-NUT metric introduced by LeBrun. The one centre case is analysed in detail as a special case of a class of systems admitting a conserved Runge-Lenz vector. The two centre problem is also considered. An integrable classical string motion is exhibited.
Introduction
============
One of the crowning achievements of classical mechanics was the demonstration by Newton that Kepler’s laws of planetary motion followed from an inverse square law for gravity. The publication of Newton’s [*Philosophiae Naturalis Principia Mathematica*]{} is considered by some to mark the beginning of modern physics. Mathematically, as well as historically, this problem is of particular interest. Bertrand’s theorem [@Bertrand:1873] shows that the only central forces that result in closed orbits for all bound particles are the inverse-square law and Hooke’s law. The reason for these closed orbits in both cases is the existence of ‘hidden’ or ‘dynamical’ symmetries. These are symmetries which only appear when one considers the full phase space of the problem. In both cases the dynamical symmetry group is larger than the naïve $SO(3)$ arising from the geometrical rotational symmetry of the central force problem. For the inverse-square force, on whose generalisations we shall focus, the dynamical symmetry group is $SO(4)$ in the case of bound states and $SO(3,1)$ in the case of scattering states. The group is enlarged due to the existence of an extra conserved quantity, known as the Runge-Lenz vector although it pre-dates both Runge and Lenz. Certainly Laplace and Hamilton both knew of this conserved quantity but the identity of the first person to construct it is unclear. It is claimed in [@Goldstein:1976] that the credit for this belongs to Jakob Hermann and Johann I. Bernoulli in 1710, 89 years before Laplace and 135 years before Hamilton. Following common usage however, we shall refer to the ‘Runge-Lenz’ vector. Systems which admit such a conserved vector are of great interest, and have been the subject of much research over the years.
The ‘hidden’ symmetries also appear in the quantum mechanical problem. The system may be quantised by the usual process of replacing Poisson brackets with commutators and in this way the energy levels and degeneracies of the hydrogen atom may be found. The degeneracy is greater than expected since the states of a given energy level fit into an irreducible representation of $SO(4)$ rather than of $SO(3)$. This explains why the energy depends only on the principle quantum number and not on the total angular momentum as one might expect.
The conservation of the Runge-Lenz vector also implies that the orbits of a particle moving in a Newtonian potential are conic sections. Thus the mechanics of Newton is elegantly related to the geometry of Euclid. In the early 19th century Lobachevsky and Bolyai independently discovered that other geometries are possible which violate Euclid’s parallel postulate: the spherical and hyperbolic geometries. An interesting question is to what extent the special properties of the Kepler problem in flat space carry over to these new geometries. The generalization of the Kepler problem on spaces of constant curvature was studied by Lipschitz [@Lipschitz] and Killing [@Killing] and later rediscovered and extended to the quantum case by Schrödinger [@Schrodinger:1940xj] and Higgs [@Higgs:1978yy][^3]. It was found that a Runge-Lenz vector may be constructed which is again conserved. Unlike in Euclidean space, the dynamical symmetry algebra is not a Lie algebra. The problem on hyperbolic 3-space ${\mathbb{H}^3}$ is closely related to that on $S^3$ and most results are valid for both when expressed in terms of the curvature. The problem in hyperbolic space is simpler in a sense, since global topological restrictions prevent, for example, a single point charge from existing on the sphere.
The proof of Bertrand assumes that the force on the particle depends only on its distance from the origin. A particle moving in a magnetic field will experience velocity dependent forces and so violates the assumptions of the theorem. The simplest magnetic field that one may consider is that due to a magnetic monopole at the origin. It was discovered by Zwanziger [@Zwanziger:1969by] and independently by McIntosh and Cisneros [@Mcintosh:1970gg] that a charged particle moving in the field of a monopole at the origin has closed orbits if the potential takes the form of a Coulomb potential together with an inverse square term. This problem, known as the MIC-Kepler or MICZ-Kepler problem can also be generalised to the sphere and the hyperbolic space [@Nersessian:2000nv; @Gritsev:1979; @Kurochkin:2005]. There is once again a hidden symmetry responsible for the closed orbits, which is a generalisation of the Runge-Lenz vector. For a review of these systems, see [@Borisov:2005].
A final system which exhibits a conserved Runge-Lenz vector is that of two well separated BPS monopoles in $\mathbb{E}^3$. These are solitonic solutions to $SU(2)$-Yang-Mills which behave like particles at large separations. For slow motions, it is possible to describe the time evolution of the field in terms of a geodesic motion on the space of static configurations, the moduli space [@Manton:1981mp]. In the case of two monopoles scattering, the full moduli space metric was determined by Atiyah and Hitchin [@Atiyah:1985fd]. In the limit when the monopoles are well separated, this metric approaches the Taub-NUT metric with a negative mass parameter. The problem of geodesic motion in Taub-NUT is in many ways similar to the motion of a particle in a Newtonian potential. In particular, there is once again a conserved vector of Runge-Lenz type which extends the symmetries beyond the manifest geometric symmetries [@Gibbons:1986df; @Feher:1986ib]. The orbits as a consequence are conic sections and the energy levels of the associated quantum system have a greater degeneracy than might be expected.
The question which we consider in this paper is to what extent the results concerning well separated monopoles in flat space can be extended to hyperbolic space. In section \[hypmon\] we show that for $SU(2)$ monopoles in ${\mathbb{H}^3}$ one can make progress by assuming that some of the monopoles are fixed at given positions. The motion is then described by a geodesic motion on a space whose metric is a generalisation of the Taub-NUT metric where one considers a circle bundle over ${\mathbb{H}^3}$ rather than $\mathbb{E}^3$. Such metrics were first introduced by LeBrun [@LeBrun:1991]. In section \[lebrun\] we discuss some of the geometric properties of these metrics. In section \[class\] we consider the classical mechanics of a quite general Lagrangian admitting a Runge-Lenz vector which includes as special cases all of the systems mentioned above, in particular the LeBrun metrics. Also included in this section is a discussion of a particular classical string motion in the LeBrun metrics which admits a Runge-Lenz vector. In section \[quant\] we consider the quantum mechanics and derive the energy levels and scattering amplitude in the context of the general Lagrangian. In section \[twocent\] we consider the problem with two fixed centres and show that this is integrable both in classical and quantum mechanics, generalising a known result about the integrability of the ionised hydrogen molecule. Finally we collect for reference in the appendix some useful information about hyperbolic space.
Hyperbolic Monopoles \[hypmon\]
===============================
We are interested in $SU(2)$ monopoles on hyperbolic space. These are defined as follows [@Austin:1990]. Let ${\mathbb{H}^3}$ be hyperbolic $3$-space of constant curvature $-1$, with metric $h$. For a principle $SU(2)$ bundle $P\to {\mathbb{H}^3}$, let $(A, \Phi)$ be a pair consisting of a connection $A$ on $P$ and a Higgs field $\Phi \in
\Gamma({\mathbb{H}^3}, g_P)$, where $g_P$ denotes the associated bundle of Lie-algebras $P \times_{SU(2)}su(2)$. The pair $(A, \Phi)$ is a magnetic monopole of mass $M \in \mathbb{R}_{>0}$ and charge $k \in
\mathbb{Z}_{\geq 0}$ if it satisfies the Bogomol’nyi equation $$d_{A} \Phi = - \star_h F^{A} \label{bogom}$$ and the Prasad-Sommerfeld boundary conditions $$\begin{aligned}
M &=& \lim_{r\to\infty} {\left| \Phi(r) \right|}, \nonumber \\
k &=& \lim_{r\to\infty} \frac{1}{4\pi} \int_{S_r^2} \mathrm{tr}\left(
\Phi F^{A}\right). \label{ps}\end{aligned}$$ Here $S_r^2$ is a sphere of geodesic radius $r$ about a fixed point in ${\mathbb{H}^3}$ and $F^{A}$ is the curvature of the connection $A$. Hyperbolic monopoles were introduced by Atiyah [@Atiyah:1987], who constructed them from $S^1$-invariant instantons on $S^4$. We define the moduli space to be the space of solutions of (\[bogom\], \[ps\]) modulo gauge transformations, i.e. the space of physically distinct solutions. Atiyah also showed that the moduli space of hyperbolic monopoles of charge $k$ can be naturally identified with the space of rational functions of the form $$f(z) = \frac{a_1 z^{k-1}+a_2 z^{k-2}+\ldots + a_k}{z^k +
b_1z^{k-1}+\ldots + b_k}$$ where the numerator and the denominator have no common factor. Thus the moduli space is a manifold of dimension $(4k-1)$, provided $k
\geq 1$. In fact this was only shown for the case when $2M$ is an integer. Following [@Austin:1990] we shall assume that the moduli space is a manifold of this dimension for all values of $M$. The moduli space is often taken to be enlarged by a circle factor. This can be defined by fixing a direction in ${\mathbb{H}^3}$, say $x_1$, choosing the gauge so that $A_1 = 0$ and then only considering gauge transformations which tend to the identity as the hyperbolic distance along $x_1$ tends to infinity. From now on we shall consider this enlarged moduli space, which has dimension $4k$.
For BPS monopoles in flat space, it is possible to find a metric on the moduli space for well separated monopoles by treating them as point particles carrying scalar, electric and magnetic charges [@Manton:1985hs]. We denote by $\mathcal{M}_k$ the moduli space of $k$-monopoles. The $k$-fold covering of $\mathcal{M}_k$, $\widetilde{\mathcal{M}}_k$ splits as a metric product [@Atiyah:1988jp]. $$\widetilde{\mathcal{M}}_k = \widetilde{\mathcal{M}}^0_k\times S^1
\times \mathbb{E}^3. \label{metsplit}$$ The $\mathbb{E}^3$ component physically represents the centre of motion of the system, which separates from the relative motions governed by the metric on $\widetilde{\mathcal{M}}^0_k$. The $S^1$ factor is an overall phase, which may be thought of as a total electric charge which is conserved. The fact that the centre of mass motion can be split off in this fashion is due to the Galilean invariance of the theory, which appears as a low velocity limit of the full Poincaré invariance of the $SU(2)$-Yang-Mills-Higgs theory. In the case of two well separated monopoles $\widetilde{\mathcal{M}}^0_2$ is Euclidean Taub-NUT with a negative mass parameter.
For monopoles in ${\mathbb{H}^3}$, the dimension of the moduli space is known to be the same as that for flat space. We call the moduli space of $k$-monopoles on hyperbolic space $\mathcal{N}_k$ and its $k$-fold covering $\widetilde{\mathcal{N}}_k$. Little is currently known about the geometry of this moduli space, although it is known that the $L^2$ metric one defines in the flat case is infinite. What this means for monopole scattering is unclear. It is certainly plausible that the slow motions are still described by a moduli space geodesic motion. We give support to this idea below by showing that this is the case in the unphysical situation where $k-1$ monopoles are at prescribed locations. We shall assume that the metric on the space of such configurations arises as the restriction of a metric describing the interaction of $k$ free monopoles, however our results do not rest on this being the case.
We may separate off an $S^1$ factor, corresponding to the phase at infinity, so we might expect a metric on $\widetilde{\mathcal{N}}_k$ to have a metric product decomposition analogous to (\[metsplit\]) of the form $$\widetilde{\mathcal{N}}_k = \widetilde{\mathcal{N}}^0_k\times S^1
\times \mathbb{H}^3,$$ however there is no analogue of the Galilei group for hyperbolic space. Translational invariance guarantees a conserved total momentum, but since there are no boost symmetries, this cannot be split off as a separate centre of mass motion. In general if one considers two particles in ${\mathbb{H}^3}$ interacting by a force which depends only on their separation, one finds that the relative motion depends on the total momentum of the system [@Shchepetilov:1997], [@Maciejewski]. Thus, it is not unreasonable to expect that the moduli space metric will [*not*]{} split up in this fashion. This means that if we wish to study the scattering of two hyperbolic monopoles, we will be studying geodesic motion with respect to a 7-dimensional moduli space metric.
In order to make this problem more tractable, we shall consider a simplified situation where one or more monopoles are fixed at given locations. This is unphysical in the sense of $SU(2)$ monopoles since for well separated monopoles, the mass of each is not a free parameter, it is determined by the other charges and so we cannot consider an infinitely heavy monopole in order to fix it in one place. Although this situation does not represent a genuine motion of hyperbolic monopoles, it is nevertheless of interest as it gives an insight into the interaction of two hyperbolic monopoles. We find that the equations of motion may be put into the form of geodesic motion on a generalisation of the multi-centre metrics, first written down by LeBrun [@LeBrun:1991].
A similar situation is considered by Nash [@Nash:2006qe], who has investigated singular monopoles on ${\mathbb{H}^3}$. Here one allows the solution of the Bogomol’nyi equations to be singular at some points $p_i$, but the nature of the singularity is fixed. Nash shows using twistor theoretic methods that the natural metric for a charge $1$ singular monopole is indeed a LeBrun metric. Unlike the metrics we find below which generalize the singular negative mass Taub-NUT metrics, Nash finds metrics which generalize the everywhere regular positive mass Taub-NUT metrics.
The LeBrun metrics share a lot of the properties of the multi-centre metrics, including integrable geodesic equations for the one and two centre cases. This allows progress to be made analytically and indeed makes the metrics worthy of study in their own right. It is also worth noting that the multi-centre metrics may be found as hyper-Kähler quotients of the asymptotic $k$ monopole moduli space metrics [@Gibbons:1995yw]. We may conjecture that these LeBrun metrics may arise from the full hyperbolic monopole moduli space metric by some analogous construction.
Motion of a test monopole \[testpart\]
--------------------------------------
In order to simplify the problem of hyperbolic monopole scattering, let us consider $n$ monopoles fixed in ${\mathbb{H}^3}$ at points $P_I$, $I=1 \ldots n$. Following Manton [@Manton:1985hs], we treat these monopoles as point particles carrying an electric, magnetic and scalar charge. This is possible since outside the core, the $SU(2)$ fields abelianise as in flat space. If the radius of the hyperbolic space is large compared to the core of each monopole, the mass and scalar charge will be given in terms of the other charges by the Euclidean expressions. We wish to consider a test particle moving in the field of $n$ identical monopoles, so we take the electric and magnetic charges to be $q$ and $g$[^4] respectively for all of the monopoles. The scalar charge of a monopole with magnetic charge $g$ and electric charge $q$ is $(g^2+q^2)^{\frac{1}{2}}$. We wish to interpret the electric charge as a momentum, and since in the moduli space approximation all momenta must be small, we assume that $q$ is small.
As in the case of flat space, the electric and magnetic fields $\bm{E}, \bm{B}$ are one-form fields on ${\mathbb{H}^3}$, defined in terms of the field strength 2-form by: $$F = dt \wedge \bm{E} + \star_h \bm{B}. \label{elecmag}$$ The field-strength 2-form, away from $P_I$, satisfies the vacuum Maxwell equations: $$dF=0, \qquad d \star F = 0. \label{max}$$ In the above equations, $\star$ is the Hodge duality operator for the metric $$ds^2 = -dt^2 + h, \label{sptmmet}$$ where $h$ is the metric on ${\mathbb{H}^3}$, with Hodge duality operator $\star_h$. Clearly, from (\[max\]) there is a symmetry under $F \to
\star F$. This is the usual duality, well known in flat space, that for a vacuum solution one can replace $(\bm{E}, \bm{B})$ with $(\bm{B},
-\bm{E})$ and Maxwell’s equations continue to hold. Because of this duality it is possible to locally find two gauge potentials, $A$ and ${\widetilde{A}}$, which are related to $F$ by $$F = dA, \qquad F = \star d {\widetilde{A}}. \label{pots}$$ We will require both these potentials, since a monopole moving in this electromagnetic field will couple to both of them. The potential and dual potential at a point $P$ due to a monopole at rest at a point $P_I$ is given by: $$\begin{aligned}
A &=& -\frac{q}{4\pi}V dt + \frac{g}{4\pi} \omega \nonumber \\
{\widetilde{A}}&=& - \frac{g}{4\pi}V dt - \frac{q}{4\pi} \omega, \label{potI}\end{aligned}$$ where $V$ is a function on ${\mathbb{H}^3}$ and $\omega$ is a one-form on ${\mathbb{H}^3}$, which are defined by: $$V = \coth D(P, P_I) - 1, \qquad \star_h d \omega=dV, \label{vom}$$ with $D(P, P_I)$ the hyperbolic distance between $P$ and $P_I$. Since $V$ satisfies Laplace’s equation on ${\mathbb{H}^3}$, $d \star_h d V=0$, $\omega$ may be determined up to a choice of gauge (which we will return to later). Using these equations, it is possible to check that $dA = \star d {\widetilde{A}}$, which implies Maxwell’s equations (\[max\]) for the 2-form $F$. Since Maxwell’s equations are linear, it is straightforward to write down the potential and dual potential at a point $P$ due to all $n$ of the monopoles at points $P_I$. This is still given by (\[potI\]), but with $V$ and $\omega$ defined by $$\begin{aligned}
V &=& \sum_{I=1}^n \coth D(P, P_I) - n \nonumber \\
dV &=& \star_h d \omega. \label{vomall}\end{aligned}$$ There is also a scalar field in this theory, the Higgs field, $\Phi$. The value of $\Phi$ at the point $P$ due to the monopoles at $P_I$ is given by $$\Phi = \frac{(g^2+q^2)^{\frac{1}{2}}}{4\pi}V, \label{higgs}$$ with $V$ as in equation (\[vomall\]). We now consider another monopole at the point $P$, with velocity vector $\bm{v} \in
T_P{\mathbb{H}^3}$. This monopole has magnetic charge $g$, electric charge $q'$ and mass $m$. The Lagrangian for the motion of this monopole in a field with potential $A$ and dual potential ${\widetilde{A}}$ and with Higgs field $\Phi$ is: $$L = [-m+(q^2+q'^2)^{\frac{1}{2}}\Phi](-g(v,v))^{\frac{1}{2}} + q'
\langle A, v \rangle + g \langle {\widetilde{A}}, v \rangle, \label{lagpart}$$ Where $g$ is the metric given by (\[sptmmet\]), $v=(1,\bm{v})$ is the 4-velocity of the particle and $\langle \cdot, \cdot \rangle$ is the usual contraction between vectors and one-forms. This is the form of the Lagrangian argued by Manton in [@Manton:1985hs], generalised to hyperbolic space.
As mentioned above, we are interested in slow motions of the monopoles, such as might be described by a moduli space metric approach. Thus, we will assume that $\bm{v}$, $q$ and $q'$ are all small and expand to quadratic order in these quantities. We define $\tilde{q}=q'-q$ and take the coordinates of $P$ to be $r^i$, $i=1,2,3$, so that $v^i=\dot{r}^i$. We also add a constant term $m-m\tilde{q}^2/2g^2$ to the Lagrangian, which will not affect the equations of motion. The new Lagrangian after the expansion is: $$L = \left( \frac{1}{2}m-\frac{g^2}{8\pi}V\right
)\dot{r}^ih_{ij}\dot{r}^j + \frac{g\tilde{q}}{4\pi}
\omega_i\dot{r}^i - \frac{1}{g^2} \left( \frac{1}{2}m-\frac{g^2}{8\pi}V\right
) \tilde{q}^2. \label{modlag}$$ We note that if we can interpret $\tilde{q}$ as a conserved momentum, this Lagrangian will be quadratic in time derivatives and so may be interpreted as a geodesic Lagrangian. In order to do this, let us consider a circle bundle, $E$, over ${\mathbb{H}^3}\setminus \{
P_I\}$, which is the configuration space of our problem. We assume a metric form: $$ds^2 = A h + B (d \tau + W)^2$$ with $h$ the metric on ${\mathbb{H}^3}$ and $W$ a connection on the bundle. This gives a geodesic Lagrangian of the form: $$L = \frac{1}{2}A \dot{r}^ih_{ij}\dot{r}^j + \frac{1}{2}B
\left(\dot{\tau}+\dot{r}^iW_i \right)^2. \label{efflag}$$ Since $\tau$ is a cyclic coordinate, there is a conserved quantity which we will identify as a multiple of $\tilde{q}$: $$\tilde{q}=\kappa B(\dot{\tau}+\dot{r}^iW_i). \label{qtdef}$$ As (\[efflag\]) is a Lagrangian, we cannot simply use (\[qtdef\]) to eliminate $\dot{\tau}$, but must instead use Routh’s procedure (see for example [@Goldstein]) which gives a new effective Lagrangian with the same equations of motion as (\[efflag\]). This new Lagrangian is given by: $$L' = \frac{1}{2}A\dot{r}^ih_{ij}\dot{r}^j + \frac{\tilde{q}}{\kappa}
\dot{r}^i W_i - \frac{1}{2}\frac{\tilde{q}^2}{\kappa^2B}.$$ Comparing this with (\[modlag\]), we see that they are the same if we identify $$A = m-\frac{g^2}{4\pi}V, \qquad W_i=\frac{g \kappa}{4\pi}\omega_i,
\qquad \frac{1}{B}=\frac{\kappa^2}{g^2}A.$$ We fix the value of $\kappa$ to remove the Misner string singularities due to $\omega$, and this gives $\kappa = 4\pi /
g$. In order to clean up the form of the Lagrangian, we take units where $m=4\pi$ and $g=4\pi p$ and remove an overall factor of $4\pi$. We thus have that the slow motion of the monopole is equivalent to a geodesic motion on a space with metric at $P$ given by: $$ds^2 = V h + V^{-1} \left ( d \tau + \omega \right)^2 \label{multcent}$$ Where $h$ is the metric on ${\mathbb{H}^3}$ and we redefine $V$ so that $$V = 1 +p\left(n- \sum_{I=1}^n \coth D(P, P_I)\right). \label{Vfinal}$$ Finally, we still have that $\omega$ is defined in terms of $V$ by the relation $$\star_h d \omega = d V. \label{homega}$$ This only defines $\omega$ up to an exact form on ${\mathbb{H}^3}$, however we can see from (\[multcent\]) that a change of gauge for $\omega$ simply corresponds to a coordinate transformation on $E$.
Thus we find that the motion of a monopole in ${\mathbb{H}^3}$ in the presence of $n$ fixed monopoles may be described by geodesic motion on a hyperbolic multi-centre metric given by (\[Vfinal\]), (\[homega\]). Geometrically we may think of this as the asymptotic metric on a submanifold within the full moduli space metric. This however will not be a geodesic submanifold since there is no mechanism to fix $n$ of the monopoles while allowing one to move.
The LeBrun metrics \[lebrun\]
=============================
The metric (\[multcent\]) was considered by LeBrun with $p=-1/2$ in [@LeBrun:1991]. For this choice of $p$, the metric is everywhere regular, the apparent singularities at $P_I$ are nuts, i.e. smooth fixed points of the $U(1)$ action generated by the Killing vector ${\frac{\partial}{\partial\tau}}$. This can be seen by considering an expansion in a small neighbourhood of one of the $P_I$ where the curvature of the hyperbolic space can be neglected. The metric then looks like that of Taub-NUT. In the case we consider above with positive $p$, the metric will become singular near the fixed monopoles where $V$ becomes negative. Since we wish to consider an approximation where all the monopoles are well separated, we can ignore this singularity and we expect that it is smoothed out in the full moduli space metric. This is precisely what happens in the case of monopoles in flat space, where the full Atiyah-Hitchin metric is regular, while the negative mass Taub-NUT is not.
LeBrun was interested in finding a metric on $\mathbb{CP}_2 \# \cdots \# \mathbb{CP}_2$ which was Kähler and scalar flat. He showed that in the conformal class of metrics of which (\[multcent\]) is a representative, there is a whole 2-sphere’s worth of different metrics which are scalar flat and Kähler, one corresponding to each point at infinity of ${\mathbb{H}^3}$. More explicitly, he showed that if $V$ and $\omega$ are as in (\[Vfinal\]), (\[homega\]) and $q$ is any horospherical height function, then the metric $$g = q^2(Vh+V^{-1}(d\tau+\omega)^2)$$ is Kähler with scalar curvature zero. Here a horospherical height function is a function on ${\mathbb{H}^3}$ whose restriction to some geodesic is the exponential of the affine parameter and which is constant on the forward directed horospheres orthogonal to this geodesic. The horospheres are discussed in section (\[horo\]). Since this construction picks out a point on the boundary of ${\mathbb{H}^3}$ arbitrarily, there is a two-sphere’s worth of conformal factors which make the metric (\[multcent\]) Kähler. These metrics have self-dual Weyl tensor and so are sometimes referred to as half-conformally-flat.
LeBrun in addition showed that the metric $g$ represents a zero-scalar-curvature, axisymmetric, asymptotically flat Kähler metric on $\mathbb{C}^2$ which has been blown up at $n$ points situated along a straight complex line, i.e.$n$ points have been replaced with $\mathbb{CP}_1$. This aspect of the metrics was considered in [@Hartnoll:2004rv] where $\mathbb{C}^2$ with an arbitrary number of points blown up was considered as a spacetime foam for conformal supergravity.
Since the LeBrun metrics are all conformally scalar flat, an interesting question is whether there is a conformal factor such that the metric is locally Einstein. This was studied by Pedersen and Tod [@Pedersen:1991] and they found that a metric of the form (\[multcent\]) is locally conformally Einstein if and only if $(V,
\omega)$ is a spherically symmetric monopole. In other words only the one-centre metrics are conformally Einstein.
A Kähler form $K$ is both closed and covariantly constant $$dK = 0, \qquad \nabla K = 0.$$ Thus it necessarily satisfies Yano’s equation: $$dK = 3 \nabla K$$ Returning to the conformal representative given by (\[multcent\]) then, we find that this metric admits a 2-sphere’s worth of [*conformal*]{} Yano tensors which satisfy the conformal Yano equation: $$K_{\lambda \kappa; \sigma}+K_{\sigma \kappa; \lambda} = \frac{2}{3}
\left(g_{\sigma \lambda}K^\nu{}_{\kappa;\nu}+g_{\kappa ( \lambda}K_{\sigma)}{}^\mu{}_{;\mu} \right).$$ The existence of such conformal Yano tensors permits the construction of symmetry operators for the massless Dirac equation on this space [@Benn:1996ia].
We show below that in the case of the one- and two-centre metrics there are additional higher rank symmetries which echo those of the multi-Taub-NUT metrics. The one-centre metric has Killing vectors which generate the $SU(2)\times U(1)$ isometry group which can be made manifest by writing the metric in a Bianchi-IX standard form. In addition, there are 3 rank two Killing tensors which transform as a vector under the $SU(2)$ action and as a singlet under the $U(1)$ action. These we interpret as a generalisation of the Runge-Lenz vector. The two-centre metric has the reduced isometry group of $U(1)\times U(1)$ and in addition admits a rank 2 Killing tensor. This generalises the extra conserved quantity associated with the motion of a particle in the gravitational field of two fixed centres.
We see then that the LeBrun metrics have many attractive geometric properties which are closely related to those of the multi-Taub-NUT metrics and they are worthy of closer study.
Classical mechanics of the one-centre problem \[class\]
=======================================================
Geodesics on Self-Dual Taub-NUT
-------------------------------
We begin by recalling some results about the geodesics of Self-Dual Taub-NUT [@Gibbons:1986df; @Gibbons:1986hz; @Gibbons:1987sp]. Taub-NUT is a four dimensional Hyper-Kähler manifold, with metric: $$ds^2 = \left (1+\frac{p}{r}\right
)(dr^2+r^2(\sigma_1^2+\sigma_2^2))+p^2\left (1+\frac{p}{r}\right
)^{-1}\sigma_3^2, \label{taubnut}$$ where $\sigma_i$ are the usual left invariant forms on $SU(2)$. The geodesic Lagrangian for negative mass Taub-NUT (we take $p=-2$, since changing $p$ only changes the overall scale of $L$) is $$L = \frac{1}{2} \left [ \left( 1- \frac{2}{r} \right ) {\mathbf{\dot{r}}} \cdot
{\mathbf{\dot{r}}} + 4 \left( 1- \frac{2}{r} \right )^{-1}(\dot{\psi} +
\cos \theta \dot{\phi})^2 \right ] \label{taubnutlag}$$ There is a conserved quantity $q$ associated to the ignorable coordinate $\psi$ and also a conserved energy $E$. These are given by $$q = 4 \left( 1- \frac{2}{r} \right )^{-1}(\dot{\psi} +
\cos \theta \dot{\phi}), \qquad E = \frac{1}{2} \left( 1- \frac{2}{r} \right ) \left ({\mathbf{\dot{r}}}^2 +
\left ( \frac{q}{2} \right )^2 \right). \label{taubnutcons}$$ The conserved angular momenta are given by: $${\mathbf{J}} = \left( 1- \frac{2}{r} \right ){\mathbf{r}} \times
{\mathbf{\dot{r}}} + q {\mathbf{\hat{r}}}, \label{taubnutang}$$ where ${\mathbf{\hat{r}}}$ is a unit vector in the ${\mathbf{r}}$ direction. In addition to these conserved quantities, there is a extra conserved vector, $${\mathbf{K}} = \left ( 1-\frac{2}{r} \right) {\mathbf{\dot{r}}} \times
{\mathbf{J}} + \left (2 E - \frac{1}{2}q^2 \right){\mathbf{\hat{r}}}. \label{taubnutrl}$$ These conserved quantities allow all of the geodesics to be found.
As one would expect, the conserved quantities are related to geometric symmetries of Taub-NUT. Taub-NUT has biaxial Bianchi-IX symmetry, so the group of isometries is $SU(2) \times U(1)$. The $SU(2)$ factor gives rise to the conserved vector ${\mathbf{J}}$ which transforms as a triplet under the $SU(2)$ action. The $U(1)$ factor gives rise to the conserved $SU(2)$ singlet $q$. The origins of the vector ${\mathbf{K}}$ are less obvious. Since ${\mathbf{K}}$ is quadratic in the momenta, it arises from a triplet of rank 2 Killing tensors on Taub-NUT, each satisfying Killing’s equation: $$K^i_{(\mu \nu ; \sigma)} = 0. \label{killing}$$ These Killing tensors are best understood in terms of the Kähler structures of Taub-NUT. Since Taub-NUT is Hyper-Kähler, there are three independent complex structures $F^i_{\mu\nu}$. In addition, Taub-NUT admits a further rank 2 Yano tensor, i.e. an anti-symmetric tensor obeying Yano’s equation: $$Y_{\mu (\nu ; \sigma)}=0. \label{yano}$$ The Kähler structures, being covariantly constant, also satisfy Yano’s equation trivially. It was shown in [@Gibbons:1987sp] that the Killing tensors arise as the product of the complex structures with the extra Yano tensor: $$K^i_{\mu\nu} = Y_{\sigma(\mu}F^{i\sigma}{}_{\nu )}.$$
A class of systems admitting a Runge-Lenz vector
------------------------------------------------
We wish now to consider the generalisation of (\[taubnut\]) which describes the motion of a hyperbolic monopole about a fixed monopole, as we derived in section \[testpart\]. This corresponds to geodesic motion on a manifold with metric (\[multcent\]). We will find that many of the integrability properties of geodesic motion in Taub-NUT persist. Rather than start with the Lagrangian for geodesic motion, we instead consider a more general Lagrangian and impose conservation of a Runge-Lenz vector. We find that within the class of Lagrangians of this form admitting a Runge-Lenz vector is the Lagrangian describing geodesic motion on (\[multcent\]). We shall consider the Lagrangian: $$L = \frac{1}{2}\left [ V({\left| {\mathbf{r}} \right|}) \left (
\frac{\dot{{\mathbf{r}}}^2}{1-{\left| {\mathbf{r}} \right|}^2}+\frac{({\mathbf{r}}\cdot\dot{{\mathbf{r}}})^2}{\left
(1-{\left| {\mathbf{r}} \right|}^2 \right)^2} \right) +
V({\left| {\mathbf{r}} \right|})^{-1}(\dot{\tau}+\bm{\omega} \cdot\dot{{\mathbf{r}}})^2 \right ] - W({\left| {\mathbf{r}} \right|}). \label{lagr}$$ We note that the kinetic part is given by a metric of the form (\[multcent\]), with $h$ the metric on ${\mathbb{H}^3}$ in Beltrami coordinates (see section \[beltrcoords\]). We write this in spherical coordinates, and assume a form for $\bm{\omega}$ such that the Lagrangian (\[lagr\]) admits a rotational $SU(2)$ symmetry. Then: $$L = \frac{1}{2} \left [ V(r) \left(
\frac{\dot{r}^2}{(1-r^2)^2}+\frac{r^2}{1-r^2}(\dot{\theta}^2 + \sin^2\theta
\dot{\phi}^2) \right) +V^{-1}(\dot{\tau}+p \cos \theta \dot{\phi})^2
\right ] - W(r). \label{lagrsp}$$ Since $\tau$ is cyclic, the conjugate momentum $p_\tau=e$ is conserved. This is given by: $$e=V^{-1}(\dot{\tau}+p \cos \theta \dot{\phi}). \label{taumom}$$ There is also a conserved energy, $E$: $$E = \frac{V(r)}{2} \left (
\frac{\dot{r}^2}{1-r^2}+\frac{r^2}{(1-r^2)^2}(\dot{\theta}^2 + \sin^2\theta
\dot{\phi}^2) + e^2\right) + W(r). \label{energy}$$ If we define a new variable $\psi$ by $\tau = p\psi$, then the Lagrangian (\[lagrsp\]) is manifestly $SU(2)$ invariant. Thus there is a conserved angular momentum vector, which we can write as: $$\begin{aligned}
{\mathbf{J}} &=& \frac{V(r)}{1-r^2}{\mathbf{r}} \times {\mathbf{\dot{r}}}+ e p
{\mathbf{\hat{r}}} \nonumber \\
&=& {\mathbf{r}} \times {\mathbf{N}} + e p {\mathbf{\hat{r}}}, \label{angmom}\end{aligned}$$ where we have defined for convenience a new vector $${\mathbf{N}} = V(r) \frac{\dot{{\mathbf{r}}}}{1-r^2}. \label{Nmom}$$
We would like to find the condition that the Lagrangian (\[lagr\]) admits a Runge-Lenz vector in addition to the constants of the motion above. By analogy with the Taub-NUT case, we posit a further conserved quantity of the form: $${\mathbf{K}} = {\mathbf{N}}\times{{\mathbf{J}}}+g \hat{{\mathbf{r}}} \label{runge}.$$ Using the Hamiltonian formalism it is a matter of straightforward, if tedious, calculation to check that ${\mathbf{K}}$ is a constant of the motion if and only if the functions $V(r)$, $W(r)$ and the constant $g$ satisfy the equation $$\frac{1}{2}e^2V(r)^2 + (W(r)-E)V(r) = \frac{g}{r} +
\frac{e^2p^2}{2r^2}+C, \label{rlcond}$$ where $C$ is an arbitrary constant. Now $V(r)$ and $W(r)$ cannot depend on $E$, as they are given functions in the Lagrangian (\[lagr\]). However $g$ and $C$ are free to depend on $E$ (see for example (\[taubnutrl\])). To find the most general functions satisfying (\[rlcond\]) for some $g(E)$, $C(E)$ we differentiate twice with respect to $E$ and find: $$\begin{aligned}
-V(r) &=& \frac{g'(E)}{r}+C'(E), \label{diffE} \nonumber \\
0 &=& \frac{g''(E)}{r} + C''(E). \label{diffEE}\end{aligned}$$ From (\[diffEE\]) we can write $$g = -\alpha E + \beta, \qquad C = -kE + \gamma. \label{gdef}$$ Substituting these back into (\[diffE\]) and (\[rlcond\]) we prove the following proposition:
The most general functions $W(r)$, $V(r)$ such that the Lagrangian (\[lagr\]) admits a Runge-Lenz vector of the form (\[runge\]) are given by: $$V(r) = k + \frac{\alpha}{r}, \qquad W(r) = \left (
\frac{\beta}{r}+\frac{e^2 p^2}{2 r^2} + \gamma \right )
\left(k+\frac{\alpha}{r}\right)^{-1}-\frac{1}{2}e^2
\left(k+\frac{\alpha}{r}\right). \label{VW}$$
From now on, we assume that $V(r)$ and $W(r)$ take this form.
### Some Special Cases
We can find some special cases of the Lagrangian (\[lagr\]) by choosing particular values for the constants:
- If we take $k=1$, $\alpha=0$ and $e=0$, we have the Lagrangian for the Kepler problem on hyperbolic space, ${\mathbb{H}^3}$.
- If we take $k=1$, $\alpha=0$, but allow $e$ to be non-zero, we get the Lagrangian for the MICZ-Kepler problem in hyperbolic space [@Kurochkin:2005]. It will be useful for later to note that (formally at least) we can also obtain this system by setting $\alpha=p$ and letting $p\to 0$ while requiring that $e p = \mu$ remains constant.
- If we take $\alpha=\mp p$, $\beta = -k\alpha e^2$, $\gamma =
e^2k^2/2$ and $k=1\pm p$, we have the Lagrangian for pure geodesic motion on the manifold with metric (\[multcent\]).
In specifying the metric on ${\mathbb{H}^3}$, we have everywhere assumed that the space has radius $1$. Rather than carry an extra parameter through the calculations, it is easier to replace the hyperbolic radius $R_0$ by dimensional analysis in any equations. Doing this, we can consider allowing $R_0$ to tend to infinity. The metric on ${\mathbb{H}^3}$ approaches that on $\mathbb{E}^3$, so we might expect to recover known results for flat space. In particular, with the special parameter choices above, we may expect to recover results for the Kepler problem, MICZ-Kepler problem and the problem of geodesic motion on Taub-NUT.
### Poisson Algebra of Conserved Quantities
We have 8 conserved quantities, $E$, $e$, ${\mathbf{J}}$, ${\mathbf{K}}$, which fall into two singlet and two triplet representations of $SU(2)$ respectively. We can calculate the non-vanishing Poisson brackets and after some algebra we find $$\begin{aligned}
{ \left \{ {J_i}, {J_j} \right \} } &=& \epsilon_{ijk}J_k, \nonumber \\
{ \left \{ {J_i}, {K_j} \right \} } &=& \epsilon_{ijk}K_k, \nonumber \\
{ \left \{ {K_i}, {K_j} \right \} } &=& -2\epsilon_{ijk} J_k \left( Ek + J^2 - e^2 p^2
-\gamma \right). \label{poisson}\end{aligned}$$ Thus the Poisson algebra of the conserved quantities is not a Lie algebra, since the bracket of two components of ${\mathbf{K}}$ is a cubic polynomial in the conserved quantities. Algebras of this kind are known as finite $W$-algebras. They have been extensively studied in [@deBoer:1995nu]. This particular algebra is some deformation of the $so(4)$ or $so(3,1)$ algebra, depending on the sign of $Ek-e^2p^2 - \gamma$, which leaves the $so(3)$ subalgebra undeformed. These algebras are considered in [@Quesne:1995; @Rocek:1991].
### The shape of the orbits
The existence of extra constants of the motion for the system defined by (\[lagr\]) and (\[VW\]) means that it is possible to determine the shapes of the orbits entirely from the conserved quantities. In the Beltrami ball model (see \[beltrcoords\]) we find that the orbits are given by conic sections.
From the definition of ${\mathbf{J}}$, (\[angmom\]), we can immediately see that $${\mathbf{J}} \cdot {\mathbf{r}} = e p r. \label{cone}$$ This is true for any functions $V(r)$ and $W(r)$ and it means that the motion lies on a cone centred at the origin, with axis parallel to ${\mathbf{J}}$ and half angle $\theta$ satisfying $\cos \theta = e p /{\left| {\mathbf{J}} \right|}$. In the case where $ep=0$, we find that the motion is in a plane orthogonal to ${\mathbf{J}}$. The $SU(2)$ symmetry therefore allows us to reduce the three dimensional problem to motion on a two dimensional surface. In general however, the orbits will not be closed and the motion may be chaotic.
When we have a conserved Runge-Lenz vector however, any bound orbits must be closed. To see this, we consider ${\mathbf{K}} \cdot {\mathbf{r}}$. $$\begin{aligned}
{\mathbf{K}}\cdot{\mathbf{r}} &=& {\mathbf{r}}\cdot {\mathbf{N}}\times {\mathbf{J}} + gr,
\nonumber \\
&=& {\mathbf{J}} \cdot {\mathbf{r}} \times {\mathbf{N}} + g r, \nonumber \\
&=& {\mathbf{J}} \cdot \left({\mathbf{J}} - e p \hat{{\mathbf{r}}} \right)+\frac{g}{ep}
{\mathbf{J}}\cdot{\mathbf{r}}. \label{kdotr}\end{aligned}$$ Where we have used the definitions (\[angmom\]), (\[runge\]) and the equation (\[cone\]). Collecting these terms, we find that for $ep \neq 0$ $${\mathbf{r}} \cdot \left({\mathbf{K}}- \frac{g}{ep} {\mathbf{J}} \right) = J^2 -
e^2p^2. \label{plane}$$ This is the equation of a plane orthogonal to ${\mathbf{K}}- \frac{g}{ep}
{\mathbf{J}}$ which in general does not pass through the origin. Thus the orbits lie on the intersection of a cone and a plane and are hence conic sections.
If we take $ep=0$, then ${\mathbf{r}}\cdot{\mathbf{J}}=0$ and ${\mathbf{K}}\cdot{\mathbf{J}}=0$. The motion is then in a plane perpendicular to ${\mathbf{J}}$ and we may take the coordinates on this plane to be $r$ and $\theta$, the angle that ${\mathbf{r}}$ makes with the vector ${\mathbf{K}}$. Taking ${\mathbf{r}}\cdot{\mathbf{K}}$ then yields the equation $$r \left( 1- \frac{{\left| {\mathbf{K}} \right|}}{g} \cos \theta \right) =
-\frac{J^2}{g} \label{consec}.$$ This is the general form for a conic section in the plane. Thus, we have shown that for the Lagrangian defined by (\[lagr\]) and (\[VW\]) the general orbit is a conic section in Beltrami coordinates.
It should be noted that for $ep \neq 0$, the plane in which the motion lies does not include the origin. Let us consider an incoming particle, scattered by some infinitely heavy particle at the origin, such that the motion is described by our Lagrangian. The two body system defines a plane which includes the locations of both the particles and the velocity vector of the moving particle. In the Kepler problem in flat space, the motion of the particles is fixed in this plane, however here the plane of motion receives a twist as the incoming particle is scattered. This phenomenon is noted in [@Gibbons:1986df] and is typical of monopole scattering.
It is possible to consider all of the special cases mentioned above and we find agreement with the results in the literature, as reviewed in the introduction. We can also include the hyperbolic radius $R_0$, and in the limit $R_0 \to \infty$ we recover the flat space results for the Kepler and MICZ-Kepler problems, and also the results for geodesic motion on self-dual Taub-NUT.
In conclusion, we have found that for the general Lagrangian admitting a Rung-Lenz vector given above, the orbits are always conic sections in an appropriate set of coordinates.
### The Hodograph
In a paper of 1847 [@Hamilton:1847] Hamilton introduced the hodograph, defined to be the curve traced out by the velocity vector, thought of as a position vector from some fixed origin, as a particle moves along its orbit. He showed that the Newtonian law of attraction gave rise to a hodograph which is a circle, displaced from the origin, and conversely that this was the only central force law to give a circular hodograph.
We shall define the hodograph in ${\mathbb{H}^3}$ to be the curve swept out by the vector ${\mathbf{N}}$, thought of as a position vector originating at $O$. By differentiating the condition (\[plane\]) with respect to time, and using the definition of ${\mathbf{N}}$, (\[Nmom\]), it can be seen that the hodograph lies in the plane $${\mathbf{N}} \cdot \left ( g {\mathbf{J}}-ep{\mathbf{K}} \right )=0. \label{Nplane}$$ We may construct coordinates such that ${\mathbf{N}}$ lies in the $x_1-x_2$ plane, then by squaring the definition of ${\mathbf{K}}$ it is possible to show that the hodograph is an ellipse, with centre at $$\frac{J^2K^2-e^2p^2g}{J^2{\left| {\mathbf{J}}\times{\mathbf{K}} \right|}^2}{\mathbf{J}}\times{\mathbf{K}} \label{centre}$$ and eccentricity given by $$\epsilon^2 = ep\left(g - \frac{J^2(g^2-K^2)}{g(J^2-e^2p^2)}\right) \left(
\frac{e^2p^2}{g^2}\left(\frac{g^2-K^2}{J^2-e^2p^2}\right)^2 -2e^2p^2 \frac{g^2-K^2}{J^2-e^2p^2} +K^2\right)^{-\frac{1}{2}}.
\label{eccentricity}$$ We see that in the case where $e$ or $p$ vanishes, the hodograph is circular. In the case where $\alpha$ also vanishes, we find that the Kepler problem does indeed give a circular hodograph. For $\alpha \neq
0$ we find a more general Lagrangian with a circular hodograph, however this corresponds to modifying the kinetic term, so there is no contradiction with Hamilton’s result in flat space that the unique central force law with a circular hodograph is the Newtonian interaction.
The Hamilton-Jacobi Method \[actwav\]
-------------------------------------
An extremely powerful method for finding solutions to a problem in Hamiltonian mechanics is the Hamilton-Jacobi method. For a Hamiltonian $H(q^i, p_j)$, we seek solutions $S(q^i)$ to the Hamilton-Jacobi equation: $$H(q^i, {\frac{\partialS}{\partialq^j}})=E. \label{hamjac}$$ If a general solution to the Hamilton-Jacobi equation can be found then it is possible to solve the system completely, i.e. give the positions and momenta at a time $t$, as a function of $t$ and the initial positions and momenta at some time $t_0$. On the other hand, a particular solution of (\[hamjac\]) defines a coherent family of orbits whose momenta at each point are given by: $$p_i = \frac{\partial S}{\partial q^i} \label{momact}$$ Both these approaches to solutions of the Hamilton-Jacobi equation are discussed by Synge [@Synge]. We will show that the Hamilton-Jacobi equation separates, and then consider a particular solution corresponding to Rutherford scattering in hyperbolic space.
The Hamiltonian for the Lagrangian (\[lagr\]), after replacing $p_\tau$ with $e$, may be written $$H = \frac{1}{2} \left ( V^{-1} \left(p_i - e \omega_i
\right)h^{ij}\left(p_j - e \omega_j \right) + Ve^2 \right ) + W. \label{Hamiltonian}$$
Since we have already solved the problem of motion governed by this Lagrangian in Beltrami coordinates, we shall instead consider the solution in pseudoparabolic coordinates (see section \[ppara\]). This will allow us to construct surfaces of constant action for particles scattered by the origin. This was done in the case of a Coulomb potential in flat space by Rowe [@Rowe:1985; @Rowe:1987].
We will require some results from section \[ppara\]. Taking cylindrical polars $\rho, z,\phi$ on the Beltrami ball, we can define the pseudoparabolic coordinates $\mu, \nu$ to be given by: $$z =\frac{\mu^2-\nu^2}{2+\mu^2-\nu^2}, \qquad \rho = \frac{\mu\nu}{2+\mu^2-\nu^2}. \label{munudef}$$ Where $$\label{munuran}
0 \leq \mu < \infty, \qquad 0 \leq \nu < 1.$$ In these coordinates the metric on ${\mathbb{H}^3}$ takes the form: $$\label{munumetric}
ds^2 = \frac{\mu^2+\nu^2}{(1-\nu^2)(1+\mu^2)} \left [ \frac{d\mu^2}{1+\mu^2}+\frac{d\nu^2}{1-\nu^2}+\frac{d\phi^2}{\mu^{-2}+\nu^{-2}} \right ].$$
We again assume that $\omega = p \cos \theta d \phi$. From the equations (\[munudef\]) and the standard relations between spherical and cylindrical polar coordinates, it is a straightforward matter to express $r$ and $\cos \theta$ in terms of $\mu$ and $\nu$. We then have all of the necessary information to form the Hamilton-Jacobi equation (\[hamjac\]). We find that the equation separates if $W$ and $V$ are given by (\[VW\]), with the additional condition that $\alpha = p$, i.e. we require that equation (\[homega\]) holds. Explicitly, we can write: $$S = M(\mu)+N(\nu)+m \phi + e \tau, \label{addsep}$$ then $M(\mu)$ and $N(\nu)$ satisfy the ordinary differential equations: $$\begin{aligned}
(1+\mu^2)\left(\frac{dM}{d\mu}\right)^2 + \frac{(m+ep)^2}{\mu^2} +
\frac{2E(k-p)+2\beta-2\gamma-e^2p^2}{1+\mu^2} &=& K, \nonumber \\
(1-\nu^2)\left(\frac{dN}{d\nu}\right)^2 + \frac{(m-ep)^2}{\mu^2} -
\frac{2E(k+p)+2\beta+2\gamma+e^2p^2}{1-\nu^2} &=& -K. \label{munuhamjac}\end{aligned}$$ $K$ is an arbitrary constant which arises from the separation of variables. It gives an extra constant of the motion related to the Runge-Lenz vector. In the case of pure geodesic motion, we find that $K$ is quadratic in the momenta, and so corresponds to a second rank Killing tensor of the metric (\[multcent\]). We have picked out a particular direction in constructing our coordinates, so it is clear that there is a rank 2 Killing tensor associated to each point on the sphere at infinity.
The differential equations (\[munuhamjac\]) can be solved analytically, but for illustration we shall consider a simpler case. As was previously noted, if we take the limit $p \to 0$, with $e=0$ and $k=1$, we recover the Kepler (or Coulomb) problem on hyperbolic space. We may set $\gamma=0$ without loss of generality, since this simply corresponds to shifting the zero point of the energy. We do not seek to find the general solution of (\[hamjac\]). Following Rowe, we would like to find a solution which describes a family of orbits, initially parallel to the positive $z$-axis[^5] and which are scattered by the Coulomb centre.
Since the particles move initially parallel to the $z$-axis, they have no angular momentum about the $z$-axis, so we set $m=0$. We define $$\kappa=\sqrt{2(E+\beta)} \qquad \mathrm{and} \qquad \lambda=\sqrt{2(E-\beta)}. \label{kaplam}$$ The equations for $M$ and $N$ then simplify considerably, and we find $$(1+\mu^2)\left(\frac{dM}{d\mu}\right)^2 = K - \frac{\kappa^2}{1+\mu^2},
\qquad (1-\nu^2)\left(\frac{dN}{d\nu}\right)^2 = \frac{\lambda^2}{1-\nu^2}-K.$$ We shall consider the case of an attractive Coulomb centre, i.e.$\beta \leq 0$.[^6] We take $K=\lambda^2$ in order to simplify the second equation. This is necessary in order to have the correct $\nu$ dependence as $\mu \to \infty$, i.e. far from the origin along the positive $z$-axis. Integrating then gives: $$\begin{aligned}
N &=& \frac{ \lambda}{2}\log (1-\nu^2) \nonumber\\
M &=& \frac{\mp \kappa}{2} \log
\left(\frac{\sqrt{\lambda^2(1+\mu^2)-\kappa^2}+\kappa\mu}{\sqrt{
\lambda^2(1+\mu^2)- \kappa^2}-\kappa\mu}\right ) + \lambda \log \left(
\pm \lambda \mu + \sqrt{\lambda^2(1+\mu^2)-\kappa^2} \right)
\label{actionsol}\end{aligned}$$ There are in principle two choices of sign to be made, one for $\kappa$ and one for $\lambda$, however it can be seen that $\kappa
\to -\kappa$ does not change the equations (\[actionsol\]). If we consider the solution with the upper signs, as $\beta \to 0$ we find that $$S(\mu, \nu) \sim \frac{\sqrt{2E}}{2}\log(1+\mu^2)(1-\nu^2) + f(\kappa,
\lambda) \label{freeact}$$ The function $f$ is singular in the limit $\kappa \to \lambda$, however $S$ is only defined up to an additive constant, so it can be removed. The level sets of the function $(1+\mu^2)(1-\nu^2)$ are known as horospheres and play a special rôle in scattering in hyperbolic space. They are the hyperbolic equivalent of the plane wave-fronts in flat space, see section \[horo\].
The solution (\[freeact\]) represents a family of free particles which move parallel to the $z$-axis. If we allow $\beta$ to be non-zero, (\[actionsol\]) represents a family of particles initially moving parallel to the $z$-axis but which are scattered by a Coulomb centre at the origin. We need to consider the choice of sign however. In fact, we need both branches of (\[actionsol\]) to describe the scattering process. Since ${\mathbb{H}^3}\setminus \{0\}$ is not topologically trivial, we may allow multiple valued solutions to (\[hamjac\]). Alternatively, since both branches are equal on $\mu=0$, we can follow Rowe and define $S$ as a single valued function on two copies of hyperbolic space, communicating through the negative $z$-axis. A particle which starts initially parallel to the positive $z$-axis and is bent through the negative $z$-axis will pass from one copy of ${\mathbb{H}^3}$ to the other.
Taking $\mu \to \infty$, we see that the Coulomb action approaches the free action, but with some distortion of the plane wave. This is typical of the Coulomb potential, even in flat space.
In order to see physically what these solutions mean, it is convenient to plot the surfaces of constant action. For the Hamiltonian above, with the parameters as defined, Hamilton’s equations give $$\dot{r}^j = h^{ij}p_j \label{hameq}$$ thus the orbits are everywhere normal to the surfaces of constant action. If we plot these surfaces in the Poincaré model of ${\mathbb{H}^3}$ (see \[confflat\]), then the orbits will cross the surfaces of constant $S$ at right angles in the Euclidean sense. Figures \[confcirc\] and \[confloc\] show plots in Poincaré coordinates of the curves $S=\mathrm{const.}$ in a plane containing the $z$-axis. Both branches of $S$ have been plotted on the same graph, and we see that they match along the branch cut. We also see that one branch represents incoming waves and the other gives scattered wavefronts.
A classical string motion
-------------------------
In [@Gibbons:1988xf] classical Nambu strings were studied on a multi-monopole background of the form $$g_{AB}dx^A dx^B = -dt^2+V^{-1}(dx^4+\omega_i dx^i)^2 + V h_{i
j}dx^idx^j \label{5met}$$ with $A,B=0,\ldots,4,$ $i,j=1, 2, 3$. Here $h_{ij}=\delta_{ij}$ is the metric on $\mathbb{E}^3$, $x^4$ is a compact direction such that $0\leq x^4 \leq
2\pi R_K$, and $V$ and $\omega$ take the usual form: $$V = 1 + \frac{R_K}{2}\sum_{i=1}^k \frac{1}{{\left| {\mathbf{x}}-{\mathbf{x}}_i \right|}},
\qquad d\omega= \star_h dV.$$ It was found that a classical string winding the $x^4$ direction $m$ times behaved like a relativistic particle moving geodesically in an effective 4-metric. Furthermore, this motion may also be described by a classical motion where the strings are attracted to the monopoles by a Newtonian inverse square force. Thus the relativistic string motion in the one or two monopole case has all of the symmetry of the classical Kepler and two gravitating centre problems.
Classical superstrings wound on the $x^4$ direction of (\[5met\]) were considered in [@Gregory:1997te] in the context of Type II string theory compactified on $T^6$. It was shown that since the surfaces of constant $r$ correspond to squashed 3-spheres which are simply connected, it was possible to unwind a string whilst keeping it arbitrarily far from a central monopole. Since the winding number of a string is a conserved charge, the H-electric charge, it was argued that the monopole should be able to carry this charge and the zero mode which carries it was identified.
An interesting question is whether there is an analogous behaviour for winding strings in the LeBrun metrics. Since the LeBrun metrics are not Ricci flat, it is not straightforward to exhibit a superstring solution whose string metric is LeBrun. We shall therefore consider the case of classical Nambu strings moving in a LeBrun background. We shall see that the string motion may be thought of as particle motion in ${\mathbb{H}^3}$, with each monopole attracting the string with a force given by the hyperbolic generalisation of the Newtonian attraction.
We assume that we have a classical string moving in a background with metric (\[5met\]), where now $h_{ij}$ is the metric on ${\mathbb{H}^3}$ and $V$ takes instead the form $$V = 1 + \frac{R_K}{2}\sum_{i=1}^k \left( \coth{D(P, P_i)}-1 \right),
\qquad d\omega= \star_h dV. \label{newtpot}$$ The equations of motion are derived from the Nambu-Goto action, which may be written $$S=-\frac{1}{2\pi\alpha'}\int\left(\det-g_{AB}{\frac{\partialx^A}{\partialu^a}}{\frac{\partialx^B}{\partialu^b}} \right)^\frac{1}{2}du^1du^2.$$ The motion of the string is specified by giving $x^A$ as a function of the world-sheet coordinates $u^a=(\sigma, \tau)$. We shall consider a closed string, so that the embedding functions must satisfy the periodicity conditions $$x^A(\sigma, \tau) = x^A(\sigma+2\pi, \tau).$$ The simplest way to satisfy these equations is to consider a string which winds $m$ times around the compact ‘internal’ direction, $x^4$. The ansatz we shall make is that the functions $x^A(\sigma, \tau)$ take the form: $$x^4 = m \sigma R_K, \qquad x^\alpha = x^\alpha(\tau), \label{ans}$$ where $\alpha = 0, \ldots, 3$. By finding the equations of motion for $x^A(\sigma, \tau)$ and imposing the conditions (\[ans\]) it is possible to show that the equations of motion for $x^\alpha(\tau)$ take the form of geodesic equations for a relativistic particle of mass $\mu = mR_k/\alpha'$ in an effective metric: $$\tilde{g}_{\alpha \beta}dx^\alpha dx^\beta = -V^{-1}dt^2+h_{ij}dx^idx^j.$$ Thus we may study the string motion by studying the Lagrangian $$L = h_{ij}\dot{x}^i\dot{x}^j - V^{-1}\dot{t}^2
, \qquad \dot{} \equiv {\frac{\partial}{\partial\tau}}.$$ We take $\tau$ to be an affine parameter so that $L=-\epsilon \mu^2$, with $\epsilon = -1, 0, +1$ corresponding to spacelike, null and timelike geodesics respectively. $t$ is clearly cyclic, so may be eliminated in favour of its conjugate momentum $E$ and we arrive at the energy conservation equation: $$\frac{\mu^2}{2} h_{ij}{\frac{d x^i}{d \tau}}{\frac{d x^j}{d \tau}} + \frac{1}{2}(\epsilon - V)E^2 = \frac{\epsilon}{2}(E^2-\mu^2).$$ Thus the string coordinates $x^\alpha$ behave like a particle of mass $m$ moving in ${\mathbb{H}^3}$ in a potential $(\epsilon - V)E^2/2$. From (\[newtpot\]) it is clear that this potential is that due to $k$ attractive particles, whose force on the string is given by the hyperbolic Coulomb interaction.
We have studied the case of one or two fixed Coulomb centres in ${\mathbb{H}^3}$ as special cases of the systems considered elsewhere. In particular, for the one centre case, there is a conserved angular momentum and also a conserved Runge-Lenz vector. In Beltrami coordinates, the path of the string will be a conic section. Thus, if the string initially has some angular momentum about the monopole, they can never collide. If the string however starts with no angular momentum, it will eventually reach the point where the $x^4$ dimension, and hence the string, has zero proper length. It seems plausible then that these monopoles catalyse the annihilation of these winding strings, as was conjectured in the case of Kaluza-Klein monopoles over flat space.
Quantum Mechanics of the one-centre problem \[quant\]
=====================================================
It was argued in [@Gibbons:1986df] that in a low energy regime the quantum behaviour of two BPS monopoles may be approximated by considering a wavefunction which obeys the Schrödinger equation on the two-monopole moduli space, whose metric is the Atiyah-Hitchin metric. Since in this case the motion is geodesic, the Hamiltonian is proportional to the covariant Laplacian constructed from the Atiyah-Hitchin metric. If we are interested in quantum states where the amplitude for the particles to be close together is small, we can find approximate results by considering the self-dual Taub-NUT metric as an approximation to the Atiyah-Hitchin metric for well separated monopoles.
We are interested in the behaviour of well separated monopoles in hyperbolic space. As was noted in section \[hypmon\], the absence of boost symmetries means that the case of two particles interacting via a Coulomb interaction does not reduce to a centre of mass motion together with a fixed centre Coulomb problem [@Maciejewski]. Thus, we expect that the problem of two monopoles in hyperbolic space will require the solution of Schrödinger’s equation on a $7$-dimensional manifold. In order to make analytic progress, we instead consider the problem of the motion of a test monopole in the field of one or more fixed monopoles. In the classical case, we found that this can be interpreted as geodesic motion on a manifold whose metric is the hyperbolic generalisation of the multi-centre metrics. We found that the Lagrangian for geodesic motion in the one-centre case admits an extra conserved vector of Runge-Lenz type, and we found the most general potential which could be added such that this persists. We shall solve the Schrödinger equation for motion in the one-centre metric with the potential found above. We shall find the bound state energies and also the scattering amplitudes for a particle scattered by the fixed centre. As special cases, we have the case of two monopoles, and also the MIC-Kepler and Kepler problems in hyperbolic space. We shall also show that the Schrödinger equation for the two centre case separates for pure geodesic motion and with a potential generalising that of the one-centre case.
Bound states for the one-centre problem
---------------------------------------
We wish to consider the quantum mechanics of a particle moving in a space whose metric is given by: $$ds^2 = V h + V^{-1} \left ( d \tau + \omega \right)^2. \label{metr1}$$ With $h$ the metric on ${\mathbb{H}^3}$. The Laplace operator of this metric may be written in the form [@Page:1979ga]: $$\nabla^2 = \frac{1}{V} \widetilde{\Delta}_h + V
\frac{\partial^2}{\partial \tau^2}, \label{twistlap}$$ where $\widetilde{\Delta}_h$ is the ‘twisted’ Laplacian on ${\mathbb{H}^3}$ given by $$\begin{aligned}
\widetilde{\Delta}_h &=& h^{ij}\left(\nabla_i-\omega_i
{\frac{\partial}{\partial\tau}}\right)\left(\nabla_j-\omega_j {\frac{\partial}{\partial\tau}}\right) \nonumber
\\
&=& \frac{(1-r^2)^2}{r^2}\left({\frac{\partial}{\partialr}} r^2 {\frac{\partial}{\partialr}}\right) +
\frac{1-r^2}{r^2} \widetilde{\Delta}_{S^2},\end{aligned}$$ where for the second equality we take Beltrami coordinates on ${\mathbb{H}^3}$ and use the fact that $\omega_r=0$ to split the twisted Laplacian on ${\mathbb{H}^3}$ into a radial part and a twisted Laplacian on $S^2$. The time independent Schrödinger equation for motion on the manifold with metric (\[metr1\]) in a potential $W$ is: $$\left(-\frac{1}{2} \nabla^2 + W \right)\Psi = E\Psi.$$ Using (\[twistlap\]) this becomes: $$\left(\widetilde{\Delta}_h + V^2 {\frac{\partial^2 }{\partial \tau ^2}} - 2 WV + 2EV \right)\Psi
= 0.$$
We wish to consider a Hamiltonian which classically admits a Runge-Lenz vector, so we take $$V(r) = k + \frac{\alpha}{r}, \qquad W(r) = \left (
\frac{\beta}{r}+\frac{e^2 p^2}{2 r^2} + \gamma \right )
\left(k+\frac{\alpha}{r}\right)^{-1}-\frac{1}{2}e^2
\left(k+\frac{\alpha}{r}\right).$$ We will also impose the relation between $V$ and $\omega$ given by (\[homega\]), which implies that $\alpha=p$. In order to separate variables for the Schrödinger equation, we set $\tau = p\psi$ and we make the following ansatz for a solution: $$\Psi_{KM}^J(r, \theta, \phi, \psi) = R_{KM}^J(r) D_{KM}^J(\theta,
\phi, \psi),$$ where there is no sum implied over repeated indices. The functions $D_{KM}^J$ are the Wigner functions. We replace the angular derivatives by angular momentum operators according to $$\widetilde{\Delta}_{S^2} = -(L_1^2 +L_2^2), \qquad {\frac{\partial^2 }{\partial \psi ^2}}=-L_3^2.$$ Acting on the Wigner functions we have that $$L_1^2+L_2^2+L_3^2 = J(J+1), \qquad L_3^2=K^2=e^2p^2.$$ Since $K$ is an integer or half-integer, we have a generalisation of the well known result of Dirac that the existence of a magnetic monopole implies charge quantisation once quantum mechanics is taken into account. We also have the usual relation that $-J\leq K\leq J$. The Schrödinger equation now reduces to an ordinary differential equation for the radial function: $$\left[ \frac{\left(1-r^2 \right)^2}{r^2}{\frac{d }{d r}}\left( r^2 {\frac{d }{d r}} \right) -
\frac{A}{r^2}+\frac{B}{r} + C \right] R_{KM}^J(r) = 0\label{radeq}),$$ where we have introduced some new constants $$\begin{aligned}
A &=& J(J+1)\nonumber \\
B &=& 2Ep - 2\beta \nonumber \\
C &=& 2Ek - 2\gamma-p^2e^2+J(J+1).\end{aligned}$$ Equation (\[radeq\]) can be solved in terms of a hypergeometric function. The solution regular at $r=0$ is: $$R_{KM}^J(r) = \left(\frac{2r}{1+r}\right)^J
\left(\frac{1-r}{1+r}\right)^{\frac{1}{2}(1 + \sqrt{1+A-B-C})} F(a, b;
2J+2;\frac{2r}{1+r} ),$$ where $$\begin{aligned}
a &=&\frac{1}{2}(1+\sqrt{1+4A}+\sqrt{1+A-B-C}-\sqrt{1+A+B-C} \nonumber
\\b &=&\frac{1}{2}(1+\sqrt{1+4A}+\sqrt{1+A-B-C}+\sqrt{1+A+B-C}.\end{aligned}$$ In order that the solution is also regular at $r=1$, we require that $a$ is a non-positive integer. It is convenient to write $a=-N+J+1$. This condition allows us to solve for $E$. Doing so, and replacing the radius of the hyperbolic space $R_0$ by dimensional analysis we find that $$E_N = \frac{p \beta -kN^2\pm N \sqrt{k^2N^2-2kp\beta +
\frac{p^2}{R_0^2}(1-N^2+e^2p^2)+2\gamma p^2}}{p^2} \label{eng}$$ is a bound state energy level, provided that $N$ takes one of the values ${\left| ep \right|}+1,
{\left| ep \right|}+2, \ldots$ and also that $$-\beta + pE_N-N^2 \geq 0 \label{cond}$$ is satisfied. We note a larger degeneracy than one might expect for the spectrum of this problem. The energy depends only on the quantum number $N$, not on the total angular momentum. This degeneracy is exactly analogous to the degeneracy in the spectrum of the hydrogen atom and is also due to the hidden symmetry whose classical manifestation is the Runge-Lenz vector.
We may consider some of the special cases mentioned earlier. In the limit of pure geodesic motion, which describes the interaction of a hyperbolic monopole with a fixed monopole at the origin, we find that the bound states have energy given by: $$E_N = \frac{k}{p^2}\left(e^2p^2-N^2\pm
N\sqrt{N^2-e^2p^2+\frac{p^2}{k^2 R_0^2}(1-N^2+e^2p^2)} \right) \label{monlev}$$ with $k=1+p/R_0$. Taking the limit $R_0 \to \infty$, we recover the results for the energy levels of bound states of two Euclidean monopoles as derived in [@Gibbons:1986df]. As in the Euclidean case, we discard the states corresponding to the negative square root in (\[monlev\]) as these are tightly bound states which are not described by our well separated monopole assumptions.
We can also recover the MICZ-Kepler problem on ${\mathbb{H}^3}$ as a limit of of our system. This problem was studied by Kurochkin and Otchik [@Kurochkin:2005] and by Meng in other dimensions [@Meng:2005]. The limit we require is the limit $p\to 0$, while keeping $ep=\mu$ fixed. This only makes sense in our expression for $E_N$ (\[eng\]) if we take the positive sign for the square root. Taking this limit, we find the spectrum for the MIC-Kepler problem in hyperbolic space after setting $\gamma = -\mu^2/2$ to remove an additive constant from the energy: $$E_N = -\frac{\beta^2}{2N^2} - \frac{N^2-1}{2R_0^2}, \qquad N =
{\left| \mu \right|}+1, {\left| \mu \right|}+2, \ldots, \lfloor \sqrt{-\beta R_0} \rfloor,$$ where $\lfloor x \rfloor$ is the largest integer not greater than $x$. We may take the limit $R_0 \to \infty$ and we get the spectrum for the MIC-Kepler problem in Euclidean space. Finally if we take $R_0\to \infty$ and $\mu =0$ we have the spectrum of the hydrogen atom, for some appropriate choice of units.
One interesting result of the above calculations is that the hydrogen atom in hyperbolic space only has a finite number of bound state energy levels, the number of levels being bounded above by $\sqrt{-\beta R_0}$. A curious fact of the hydrogen atom in flat space is that the partition function for a canonical ensemble of electrons at temperature $T$ populating hydrogen atom energy levels does not converge: $$Z \stackrel{\text{\tiny !}}{=} \sum_{N=1}^\infty e^{\beta^2/TN^2}.$$ If the hydrogen atom is in hyperbolic space however, the partition function converges since the sum is cut off at some finite value of $N$. This is reminiscent of large black holes in AdS, which may be thought of as having been put in a ‘box’ in order to stabilise them against losing their energy through Hawking radiation.
Schrödinger’s equation in pseudoparabolic coordinates
-----------------------------------------------------
When considering Rutherford scattering in Euclidean space, i.e. the problem of an alpha particle scattered by a much heavier nucleus, it is convenient to work with parabolic coordinates, $\xi, \eta$. These are defined in terms of the usual radial coordinate $r$ and the $z$ coordinate by $$\xi = r+z, \qquad \eta = r-z.$$ In these coordinates the Schrödinger equation separates and it is possible to solve the resulting ODEs to find the Rutherford scattering formula [@Landau:1959].
In hyperbolic space, the appropriate choice of coordinates for this scattering problem are the pseudoparabolic coordinates defined in section \[ppara\]. As in the previous section, we have that Schrödinger’s equation takes the form: $$\left(\widetilde{\Delta}_h + V^2 {\frac{\partial^2 }{\partial \tau ^2}} - 2 WV + 2EV \right)\Psi
= 0 \label{sch}$$ with $$\widetilde{\Delta}_h = h^{ij}\left(\nabla_i-\omega_i
{\frac{\partial}{\partial\tau}}\right)\left(\nabla_j-\omega_j {\frac{\partial}{\partial\tau}}\right).$$ Now the coordinates on hyperbolic space are $\mu, \nu$ as defined in section \[ppara\]. A very similar calculation to that performed in section \[actwav\] to separate variables for the Hamilton-Jacobi equation leads to separation of variables for the Schrödinger equation. More precisely, we can write $$\Psi(\mu, \nu, \phi, \tau) = e^{i m \phi}e^{ie\tau}M(\mu)N(\nu)$$ and the Schrödinger equation (\[sch\]) implies the two second order ordinary differential equations $$\begin{aligned}
\frac{1+\mu^2}{\mu}{\frac{d }{d \mu}}\left(\mu{\frac{d M}{d \mu}} \right) -
\frac{(m+ep)^2}{\mu^2}M -
\frac{2E(k-p)+2\beta-2\gamma-e^2p^2}{1+\mu^2}M &=& KM \nonumber \\
\frac{1-\nu^2}{\nu}{\frac{d }{d \nu}}\left(\nu {\frac{d N}{d \nu}} \right) -
\frac{(m-ep)^2}{\nu^2}N +
\frac{2E(k+p)-2\beta-2\gamma-e^2p^2}{1-\nu^2} N&=&-KM,\end{aligned}$$ $K$ is here a separation constant.
These equations may be put into the form of the hypergeometric equation and solved. The solution for $M(\mu)$, regular at $\mu=0$, is given in terms of the hypergeometric function by $$M(\mu) = \mu^{{\left| m+ep \right|}}(1+\mu^2)^{-\frac{1}{2}{\left| m+ep \right|} -
\frac{1}{2}\sqrt{K}}F\left( a_1, b_1; c_1; \frac{\mu^2}{1+\mu^2}
\right). \label{solM}$$ New constants have been defined: $$\begin{aligned}
a_1 &=&
\frac{1}{2}{\left| m+ep \right|}+\frac{1}{2}\sqrt{K}
+\frac{1}{2}+\frac{1}{2}\sqrt{1-A}
\nonumber \\
b_1 &=&
\frac{1}{2}{\left| m+ep \right|}+\frac{1}{2}\sqrt{K}
+\frac{1}{2}-\frac{1}{2}\sqrt{1-A}
\nonumber \\
c_1 &=& 1+{\left| m+ep \right|} \nonumber \\
A&=& 2E(k-p)+2\beta-2\gamma-e^2p^2.\end{aligned}$$ Similarly, the solution for $N(\nu)$ regular at $\nu=0$ is given by $$N(\nu) = \nu^{{\left| m-ep \right|}}(1-\nu^2)^{\frac{1}{2}+\frac{1}{2}\sqrt{1-B}}
F\left(a_2, b_2; c_2; \nu^2 \right) \label{solN}$$ with $$\begin{aligned}
a_2 &=&\frac{1}{2}{\left| m-ep \right|}+\frac{1}{2}+\frac{1}{2}\sqrt{1-B} -
\frac{\sqrt{K}}{2} \nonumber \\ b_2 &=&\frac{1}{2}{\left| m-ep \right|}+\frac{1}{2}+\frac{1}{2}\sqrt{1-B} +
\frac{\sqrt{K}}{2} \nonumber \\ c_2 &=& 1+{\left| m-ep \right|} \nonumber \\ B &=& 2E(k+p)-2\beta-2\gamma-e^2p^2.\end{aligned}$$ We can recover the bound state energy levels from these formulae by imposing that the wavefunction is also regular at $\mu =\infty$ and $\nu=1$. This will occur if: $$a_1 = -n_1, \qquad a_2 = -n_2$$ where $n_1, n_2$ are integers called the parabolic quantum numbers. This gives exactly the same energies for the bound states as in the radial calculation and a counting of states shows that they have the same degeneracy.
Scattering States
-----------------
We are more interested in the scattering states. In flat space, we seek to write the wavefunction at large $r$ as the sum of an incoming plane wave and an outgoing scattered spherical wave: $$\Psi \sim e^{-ikz} + f(\theta) \frac{e^{ikr}}{r},$$ we then interpret $f(\theta)$ as the amplitude per unit solid angle for a particle to be scattered at angle $\theta$ to the incoming wave. In hyperbolic space, the situation is very similar. Instead of plane waves, the appropriate objects in ${\mathbb{H}^3}$ are horospherical waves which are constant on the horospheres (see section \[horo\]). To discuss the scattering solutions of Schrödinger’s equation, it is convenient to use the coordinates $(\chi,
\theta, \phi)$ for ${\mathbb{H}^3}$, in which the metric takes the form: $$h = d\chi^2 + \sinh^2 \chi\left(d\theta^2+\sin^2\theta d\phi^2 \right).$$ In these coordinates, the horospherical wave solution of Schrödinger’s equation in hyperbolic space with no potential is given by: $$\Psi = (\cosh \chi - \sinh \chi \cos \theta)^{-1-i\kappa'} \label{schhoro}$$ and the spherical wave solution is: $$\Psi = \frac{e^{i\kappa'\chi}}{\sinh{ \chi}},$$ where $\kappa'$ is related to the energy $E$ by $\kappa' =
\sqrt{2E-1}$. Thus we shall seek a solution to the full Schrödinger equation (\[sch\]) which has the asymptotic form as $\chi \to \infty$ $$\Psi \sim (\cosh \chi - \sinh \chi \cos \theta)^{-1-i\kappa'} +
f(\theta)\frac{e^{i\kappa'\chi}}{\sinh{ \chi}} \label{asy}$$ and we will again interpret $f(\theta)$ as a scattering amplitude. In order to find a solution with these asymptotics, we look once again at the solution in pseudoparabolic coordinates. It is straightforward to show that (\[schhoro\]) in pseudoparabolic coordinates becomes $$\Psi=\left[(1+\mu^2)(1-\nu^2) \right]^{\frac{1}{2}+\frac{i\kappa'}{2}}.$$ The condition on the asymptotic form of the wavefunction as $\chi \to
\infty$ becomes a condition as $\nu \to 1$. We define $\kappa$ and $\lambda$ to be $$\kappa = \sqrt{2E(p+k)-1-2\gamma-2\beta+e^2p^2}, \qquad \lambda = \sqrt{2E(k-p)-1-2\gamma+2\beta-e^2p^2}.$$ In order to get the correct asymptotics, we set $m=-ep$ and $K=-1-i\lambda$. The solutions (\[solM\], \[solN\]) then simplify and we get: $$\begin{aligned}
M(\mu) &=& (1+\mu^2)^{\frac{1}{2}+\frac{i\lambda}{2}} \nonumber \\
N(\nu) &=& \nu^{2
{\left| ep \right|}}(1-\nu^2)^{\frac{1}{2}+\frac{i\kappa}{2}}F\left({\left| ep \right|}+1+\frac{i}{2}(\kappa+\lambda), {\left| ep \right|}+\frac{i}{2}(\kappa-\lambda); 1+2{\left| ep \right|};\nu^2 \right)\end{aligned}$$ As $\nu \to 1$, we can expand the hypergeometic function using the formula: $$F(a,b;c;x) \stackrel{\text{\scriptsize $x \to 1$}}{\sim}
\frac{\Gamma(c)\Gamma(c-a-b)}{\Gamma(c-a)\Gamma(c-b)} + (1-x)^{c-a-b} \frac{\Gamma(c)\Gamma(a+b-c)}{\Gamma(a)\Gamma(b)}.$$ Performing the expansion and multiplying by a factor to normalise the incoming wave, we find $$\Psi \stackrel{\text{\scriptsize $\nu \to 1$}}{\sim}
\left[(1+\mu^2)(1-\nu^2)
\right]^{\frac{1}{2}+\frac{i\kappa}{2}}(1+\mu^2)^{\frac{i}{2}(\lambda-\kappa)} +
\Delta (1-\nu^2)^{\frac{1}{2}-\frac{i\kappa}{2}}(1+\mu^2)^{\frac{1}{2}+\frac{i\lambda}{2}},$$ where $$\Delta = \frac{\Gamma(i\kappa) {\Gamma \left( {\left| ep \right|}-\frac{i}{2}(\kappa+\lambda) \right)}
{\Gamma \left( {\left| ep \right|}+1-\frac{i}{2}(\kappa-\lambda) \right)}}{{\Gamma \left( -i\kappa \right)}
{\Gamma \left( {\left| ep \right|}+1+\frac{i}{2}(\kappa+\lambda) \right)} {\Gamma \left( {\left| ep \right|}+\frac{i}{2}(\kappa-\lambda) \right)}}$$ We can now return to the $(\chi,\theta, \phi)$ coordinates, and we find that this formula becomes: $$\Psi \stackrel{\text{\scriptsize $\chi \to \infty$}}{\sim} (\cosh
\chi - \sinh \chi \cos
\theta)^{-1-i\kappa}e^{-i(\lambda-\kappa)\ln\sin\frac{\theta}{2}} +
\frac{\Delta}{2}\mathrm{cosec}^2 \frac{\theta}{2}
e^{-i(\lambda-\kappa)\ln\sin\frac{\theta}{2}}
\frac{e^{i\kappa\chi}}{\sinh{ \chi}}$$ We thus find the scattering amplitude to be: $$f(\theta) = \frac{\Delta}{2} \mathrm{cosec}^2 \frac{\theta}{2}.$$ It is interesting to note that both the incoming and outgoing wave are distorted relative to the proposed asymptotic form (\[asy\]). This occurs also in the Euclidean case, because the Coulomb potential does not decay fast enough to justify an expansion in terms of free waves far from the scattering centre.
It is possible to recover the bound state energy levels by making the analytic continuations $\kappa \to i \tilde{\kappa}$ and $\lambda \to
i \tilde{\lambda}$. We then find that the scattering amplitude has poles at precisely the values of $E$ which were found previously to be bound state energies. Another useful check of this formula is to use it to find the Rutherford scattering formula. We first set $p=\gamma=e=0$ and $k=\beta=1$, then we replace the hyperbolic radius $R_0$ by dimensional analysis. Finally we let $R_0 \to \infty$ and we find $$f(\theta) = - \frac{1}{2k'^2\sin^2\frac{\theta}{2}} \frac{{\Gamma \left( 1+i/k' \right)}}{{\Gamma \left( 1-i/k' \right)}}$$ where $E = \frac{1}{2}k'^2$. This is precisely Rutherford’s formula, as found in [@Landau:1959].
The two centre problem \[twocent\]
==================================
Separability of Schrödinger’s equation for the two-centre problem
-----------------------------------------------------------------
In [@Gibbons:1987sp] it was shown that the Schrödinger equation for the two-centre Taub-NUT metric separates in spheroidal coordinates. This generalises the fact that the Schrödinger equation for a diatomic molecule separates in the same way that the Runge-Lenz vector for Taub-NUT generalises that of the Hydrogen atom. We find here that in a suitable set of coordinates, the two-centre LeBrun metric has a separable Schrödinger equation. The coordinates are the pseudospheroidal coordinates used by Vozmischeva [@vosm], which for convenience are also described in section (\[pssp\])
We consider motion in a space with metric $$ds^2 = V h + V^{-1} (d \tau +\omega)^2 \label{dmet}$$ Where $V$ and $\omega$ are given by $$V(P) = k-p_1 \coth D(P,P_1)-p_2\coth D(P, P_2), \qquad d\omega =
\star_hdV. \label{defA}$$ It is convenient to work for the moment with the pseudosphere model of Hyperbolic space (see section \[pseudosphere\]). The general point $P \in {\mathbb{H}^3}$ has coordinates $(W,
X, Y, Z) \in \mathbb{E}^{3,1}$ which are subject to the constraint $W^2-X^2-Y^2-Z^2=1$. We suppose that the fixed centres are at $(\alpha, 0,0, \pm\beta)$. The distance between two points $P, P'$ is given in terms of the $SO(3,1)$ invariant inner product on $\mathbb{E}^{3,1}$ by: $$D(P, P') = \theta, \qquad \mathrm{where} \qquad \cosh \theta =
\frac{\langle P, P' \rangle}{{\left\|P\right\|}{\left\|P'\right\|}} = WW' -
XX'- YY' - ZZ'.$$ Thus the potential function $V$ takes the form in these coordinates $$V = k-p_1\coth{\theta_+}-p_2\coth{\theta_-}, \qquad \mathrm{with}\qquad
\cosh \theta_{\pm} = \alpha W \mp \beta Z. \label{doubleV}$$ In order to pass to the pseudospheroidal coordinates, we first take polar coordinates $(P, \phi)$ in the $X$-$Y$ plane. The pseudospheroidal coordinates $\xi$, $\eta$ are then defined in terms of $W, P, Z$ by the relations (\[psdspher\]): $$\begin{aligned}
\nonumber W &=& \frac{1}{\alpha}\sqrt{(\alpha^2-\xi^2)(\alpha^2+\eta^2)},
\\
\nonumber Z &=&
\frac{\mathrm{sgn}(Z)}{\beta}\sqrt{(\beta^2-\xi^2)(\beta^2+\eta^2)},
\\
P &=& \frac{\xi \eta}{\alpha \beta}.\end{aligned}$$ The metric on ${\mathbb{H}^3}$ in these coordinates is given by (\[spheroidalmetric\]) $$ds^2 = \frac{\xi^2+\eta^2}{(\alpha^2-\xi^2)(\beta^2-\xi^2)} d\xi^2 +
\frac{\xi^2+\eta^2}{(\alpha^2+\eta^2)(\beta^2+\eta^2)}d\eta^2 +
\frac{\xi^2\eta^2}{\alpha^2\beta^2}d\phi^2 \label{sphmet}$$ Using these relations with (\[doubleV\]) it is possible after some algebra to find the following formula for $V$ in terms of the pseudospheroidal coordinates: $$V = k - (p_1+p_2)
\frac{\sqrt{(\alpha^2+\eta^2)(\beta^2+\eta^2)}}{\eta^2+\xi^2} -
\mathrm{sgn}(Z)(p_1-p_2)\frac{\sqrt{(\alpha^2-\xi^2)(\beta^2-\xi^2)}}{\eta^2+\xi^2}.$$ The simplest way to compute $\omega$ is directly from the formula in (\[defA\]). Using (\[sphmet\]), again after some algebra, it can be shown that $\omega$ takes the form: $$\omega = \frac{1}{\alpha\beta} \left ( (p_1+p_2)\eta^2
\frac{\sqrt{(\alpha^2-\xi^2)(\beta^2-\xi^2)}}{\eta^2+\xi^2} -
\mathrm{sgn}(Z)(p_1-p_2)\xi^2 \frac{\sqrt{(\alpha^2+\eta^2)(\beta^2+\eta^2)}}{\eta^2+\xi^2} \right ) d \phi.$$
We consider the Schrödinger equation for the metric (\[dmet\]) with a potential $W$. The Schrödinger equation can be re-written in the form (\[sch\]). We make a separation ansatz $$\Psi_{m e}(\xi, \eta, \tau, \phi) = e^{i m \phi}e^{i e \tau}X(\xi)Y(\eta)$$ and we find that the Schrödinger equation separates when $W$ satisfies $$WV = \gamma +\beta_+ \coth \theta_+ +\beta_- \coth \theta_-.$$ In this case, the functions $X(\xi)$ and $Y(\eta)$ obey the ordinary differential equations $$\begin{aligned}
KX &=&\frac{\sqrt{(\alpha^2-\xi^2)(\beta^2-\xi^2)}}{\xi}{\frac{d }{d \xi}}\left(
\xi \sqrt{(\alpha^2-\xi^2)(\beta^2-\xi^2)} {\frac{d X}{d \xi}} \right) +
\left(A^+\xi^2-\frac{B^+}{\xi^2} \right) X \nonumber\\ && +
\left(C^+\mathrm{sgn}(Z)+\frac{D^+}{\xi^2}\right)\sqrt{(\alpha^2-\xi^2)(\beta^2-\xi^2)}
X \end{aligned}$$ and $$\begin{aligned}
-KY &=&\frac{\sqrt{(\alpha^2+\eta^2)(\beta^2+\eta^2)}}{\eta}{\frac{d }{d \eta}}\left(
\xi \sqrt{(\alpha^2+\eta^2)(\beta^2+\eta^2)} {\frac{d Y}{d \eta}} \right) +
\left(A^-\eta^2-\frac{B^-}{\eta^2} \right) Y \nonumber\\ && +
\left(C^-+\mathrm{sgn}(Z)\frac{D^-}{\eta^2}\right)\sqrt{(\alpha^2+\eta^2)(\beta^2+\eta^2)}
Y.\end{aligned}$$ $K$ is a separation constant. In the case where the potential vanishes, $K$ corresponds to a Killing tensor of the metric (\[dmet\]). We have defined some new constants $$\begin{aligned}
A^{\pm} &=& 2Ek-2\gamma-e^2k^2-e^2(p_1\mp p_2)^2, \nonumber \\
B^{\pm} &=& \alpha^2\beta^2(m^2+e^2(p_1\pm p_2)^2), \nonumber \\
C^\pm &=& 2e^2(p_1\mp p_2)k - 2E(p_1\pm p_2)-2(\beta_1\mp \beta_2),
\nonumber \\
D^\pm &=& \pm 2em\alpha\beta(p_1\pm p_2).\end{aligned}$$
Separability of the Hamilton-Jacobi equation for the two-centre problem
-----------------------------------------------------------------------
Additive separability of the Hamilton-Jacobi equation follows, formally at least, from the multiplicative separability of the Schrödinger equation using a semi-classical approximation. It is however straightforward, using the expressions for $V$ and $\omega$ to separate variables for the Hamilton-Jacobi equation in pseudospheroidal coordinates explicitly. We find that the Hamilton-Jacobi function takes the form: $$S = \phi p_\phi + \tau p_\tau + M(\xi) + N(\eta),$$ where $M$, $N$ satisfy ordinary differential equations: $$\begin{aligned}
\tilde{K} &=& (\alpha^2-\xi^2)(\beta^2-\xi^2)\left({\frac{d M}{d \xi}}
\right)^2 + a^+\xi^2+\frac{b^+}{\xi^2} \nonumber \\ && +
\left(c^+\mathrm{sgn}(Z)+\frac{d^+}{\xi^2}
\right)\sqrt{(\alpha^2-\xi^2)(\beta^2-\xi^2)}\end{aligned}$$ and $$\begin{aligned}
-\tilde{K} &=& (\alpha^2+\eta^2)(\beta^2+\eta^2)\left({\frac{d N}{d \eta}}
\right)^2 + a^-\eta^2+\frac{b^-}{\eta^2} \nonumber \\ && +
\left(c^-+\mathrm{sgn}(Z)\frac{d^-}{\eta^2}
\right)\sqrt{(\alpha^2+\eta^2)(\beta^2+\eta^2)}.\end{aligned}$$ The new constants are $$\begin{aligned}
a^{\pm} &=& p_\tau{}^2+p_\tau{}^2(p_1\mp p_2)^2+2\gamma-2Ek^2, \nonumber
\\
b^\pm &=&\alpha^2\beta^2(p_\phi{}^2+(p_1\pm p_2)^2p_\tau{}^2),
\nonumber \\
c^\pm &=& 2E(p_1 \mp p_2)+2(\beta_1\mp\beta_2)-2kp_\tau{}^2(p_1\mp
p_2), \nonumber \\
d^\pm &=& \pm 2 \alpha \beta p_\phi p_\tau (p_1\pm p_2).\end{aligned}$$
Thus the two centre problem, with a potential generalised from that of the one centre problem, is classically integrable in the Liouville sense, i.e. there are sufficiently many conserved quantities to reduce the problem to quadratures. The ‘extra’ conserved quantity, $\tilde{K}$ corresponds in the absence of a potential to a rank 2 Killing tensor of the metric (\[dmet\]).
The system is also quantum mechanically integrable. In the operator formalism, this corresponds to being able to find a basis of states which are eigenstates of operators which commute with the quantum Hamiltonian. This quantum integrability is a stronger result than classical integrability. In [@Carter:1977pq] Carter showed that a classical rank 2 Killing tensor will not in general generate a conserved charge in the quantum regime. There is an anomaly given by: $${ \left [ {\hat{K}}, {H} \right ]} \propto \left(K^{\nu[\mu}R^{\sigma]}{}_\nu
\right)_{;\sigma} \hat{p}_\mu.$$ For a Ricci flat background, this anomaly will always vanish and there will be a conserved quantum charge associated to the classical conserved quantity. In our case the Ricci tensor does not vanish so [*a priori*]{} we cannot expect a classical symmetry to give rise to a quantum conserved charge. The separation of variables for the Schrödinger equation shows however that the anomaly vanishes in this case.
Conclusion
==========
We have investigated the motion of hyperbolic monopoles in the limit where the monopoles are well separated and found many similarities with monopoles in Euclidean space. Because of the absence of boost symmetries for hyperbolic space it was necessary to consider the case where $N$ monopoles are fixed while one is free to move in the asymptotic field of the others. We found that this motion may be interpreted as a geodesic motion on a space whose metric is a LeBrun metric of negative mass. We interpret this as the metric on a non-geodesic surface contained within the full moduli space of the theory.
We then investigated in depth the classical and quantum motion of a monopole in the presence of a single fixed monopole at the origin. It was found that this system may be considered within a broader class of systems which have similar properties arising from the existence of an extra ‘hidden’ constant of the motion which generalises the Runge-Lenz vector of the classical Kepler problem. These systems have an enhanced dynamical symmetry algebra and this results in some attractive properties. The system is integrable in the Liouville sense and one can show that the orbits, when expressed in suitable coordinates, are conic sections. The hodograph, suitably defined, is elliptic and becomes circular precisely when the system under consideration is the hyperbolic Kepler system. The Hamilton-Jacobi equation separates in both spherically symmetric coordinates and pseudoparabolic coordinates, enabling the surfaces of constant action for scattering particles to be found analytically.
The classical integrability persists in the quantum regime and the Schrödinger equation separates in spherically symmetric and pseudoparabolic coordinates. This enables us to calculate the bound state energies and the scattering amplitude for a monopole moving in the field of another fixed at the origin. We find similarities with the hydrogen atom problem: the degeneracy of the energy levels is enhanced by the existence of the Runge-Lenz vector; the scattering amplitudes have the same angular dependence as appears in the Rutherford formula.
We have also considered the problem of a monopole moving in the field of two fixed monopoles and we find that it is integrable both as a classical and a quantum system. Geometrically the integrability properties of both the one and two centre cases are due to the existence of rank 2 Killing tensors. These tensors generate non-geometric transformations of the phase space which are symmetries of the system and give rise to conserved quantities which are quadratic in the momenta.
Thus we have found many similarities between the motion of a hyperbolic monopole about a fixed monopole and the same problem in flat space. The systems we considered generalise the original Kepler problem and exhibit many of beautiful properties which arise as a consequence of its symmetries.\
CMW would like to thank Sean Hartnoll, Julian Sonner and especially Gustav Holzegel for discussions and to acknowledge funding from PPARC.
Some useful properties of Hyperbolic Space
==========================================
Coordinates on Hyperbolic space
-------------------------------
For convenience, we collect here several coordinate systems for hyperbolic space which will prove useful in this work.
### The pseudosphere model {#pseudosphere}
The most easily visualised model of hyperbolic space is as the upper leaf of the unit pseudosphere in Minkowski space. This model shows most clearly the parallels between spherical and hyperbolic geometry: $$\label{psdsphr}
{\mathbb{H}^3}= \left \{ (W, X, Y, Z) \in \mathbb{E}^{3,1} : W^2-X^2-Y^2-Z^2=1,
W>0 \right \}$$ where the metric on $\mathbb{E}^{3,1}$ is given by $$\label{minkowski}
ds^2=-dW^2+dX^2+dY^2+dZ^2.$$ The metric on ${\mathbb{H}^3}$ is then the restriction of this metric to the tangent space of the pseudosphere. Lorentz transformations of the full space $\mathbb{E}^{3,1}$ preserve both the metric (\[minkowski\]) and the pseudosphere condition (\[psdsphr\]) and so correspond to isometries of ${\mathbb{H}^3}$. We see that $SO(3,1)$ acts transitively on ${\mathbb{H}^3}$, and we may write ${\mathbb{H}^3}= SO(3,1)/SO(3)$. As in the case of the three sphere in $\mathbb{E}^4$, the geodesics are given by the intersections of 2-planes through the origin with the pseudosphere. It is useful to define the various coordinate systems that we will use in terms of this model.
### Poincaré Coordinates {#confflat}
Among the best known of the coordinate systems on ${\mathbb{H}^3}$ are the Poincaré coordinates. These are obtained from the pseudosphere model by the analogue of stereographic projection.
$$\PandocStartInclude{figure3.pstex_t}\PandocEndInclude{input}{1991}{24}$$
We consider the projection through the point $(-1,0,0,0)$ onto the plane with normal $(1, 0, 0, 0)$ in $\mathbb{E}^{3,1}$ which passes through the origin. This situation is shown with one dimension suppressed in Figure \[conf\]. From the diagram, we see that the point $P$ in the pseudosphere is mapped to a point $P'$ on the plane $W=0$. We introduce cylindrical polar coordinates for $\mathbb{E}^{3,1}$ according to: $$\begin{aligned}
\nonumber X &=& R \sin \Theta \sin \Phi \\
\nonumber Y &=& R \sin \Theta \cos \Phi \\
Z &=& R \cos \Theta.
\label{cylind}\end{aligned}$$ We denote the coordinates of $P'$ by $(0, r,
\theta, \phi)$. Clearly from the diagram we have that the coordinates of $P'$ are related to those of $P$ by $$\frac{R}{W+1} = \frac{r}{1}, \qquad \quad \Theta = \theta, \qquad \quad \Phi = \phi.$$ Where the condition that $P$ lie on the pseudosphere becomes $W^2-R^2=1$. We note that since $W>R$, we must have $r<1$, so ${\mathbb{H}^3}$ has been mapped to the interior of the unit ball in $\mathbb{R}^3$. The sphere $r=1$ corresponds to the ‘sphere at infinity’ of ${\mathbb{H}^3}$. In the $r$, $\theta$, $\phi$ coordinates the metric on ${\mathbb{H}^3}$ can be written as $$\label{conformalmetric}
ds^2 = \frac{4}{(1-r^2)^2}\left \{ dr^2 + r^2(d \theta^2 + \sin^2\theta
d \phi^2) \right \}.$$ This is the model of ${\mathbb{H}^3}$ known as the Poincaré ball. We recognise the term in braces as the flat metric on $\mathbb{R}^3$ so that the metric is conformally flat in these coordinates. The geodesics in this model correspond to the arcs of circles which intersect the sphere $r=1$ orthogonally.
### Beltrami Coordinates {#beltrcoords}
The Beltrami coordinates on ${\mathbb{H}^3}$ are the hyperbolic analogue of the gnomonic coordinates on $S^3$. They are again defined by a projection, but this time we project through the origin onto the tangent plane to ${\mathbb{H}^3}$ at $(1,0,0,0)$, as shown in Figure \[belt\]
$$\PandocStartInclude{figure4.pstex_t}\PandocEndInclude{input}{2042}{24}$$
We can again write the coordinates of $P'$ in terms of those of $P$. We note that the projection will change the magnitude, but not the direction of the vector $\mathbf{X} = (X,Y,Z)$. This is simply the observation that the angles $\Phi$ and $\Theta$ are unchanged by the projection. The Beltrami coordinates $\mathbf{r}$ are defined in terms of the coordinates in $\mathbb{E}^{3,1}$ according to: $$\mathbf{r}=\frac{\mathbf{X}}{W} \label{beltcoord}$$ Once again, the condition that $P$ lies on the pseudosphere is $W^2-{\mathbf{X}}^2=1$, so we are again mapping ${\mathbb{H}^3}$ to the interior of the unit ball. The metric in Beltrami coordinates is given by $$\label{beltramimetric1}
ds^2= \frac{d {\mathbf{r}}^2}{1-{\left| {\mathbf{r}} \right|}^2} + \frac{({\mathbf{r}}\cdot d
{\mathbf{r}})^2}{\left ( 1-{\left| {\mathbf{r}} \right|}^2 \right )^2}.$$ Defining spherical polar coordinates on $\mathbb{R}^3$ in the usual way, the metric may alternatively be written $$\label{beltramimetric2}
ds^2= \frac{dr^2}{\left ( 1-r^2 \right )^2} + \frac{r^2}{ 1-r^2} (d
\theta^2 + \sin^2 \theta d \phi^2)$$ Since the geodesics on ${\mathbb{H}^3}$ are given by the intersection with 2-planes through the origin in the pseudosphere model, it is straightforward to see that they project back to straight lines in the Beltrami ball model.
### Pseudospheroidal Coordinates \[pssp\]
When considering the two centre problem in flat space, it is convenient to work in spheroidal coordinates. Since the two centres may be taken to lie at $(0, 0, \pm a)$, we take the polar angle $\phi$ as one of the coordinates. The other two coordinates are defined in terms of the distances to the centres, $r_+$ and $r_-$ by $$\zeta = \frac{r_+ + r_-}{2a}, \qquad \lambda = \frac{r_+ - r_-}{2a}.$$ The coordinate surfaces $\zeta = \mathrm{const.}$ are prolate spheroids and the surfaces $\lambda = \mathrm{const.}$ are hyperboloids. In these coordinates the Laplacian on flat space separates.
In our investigations we shall require an analogous set of coordinates for ${\mathbb{H}^3}$. We shall use the coordinates defined by Vozmischeva in [@vosm]. We first set $$X=P \cos \phi, \qquad Y = P \sin \phi,$$ so that the metric on $\mathbb{E}^{3,1}$ becomes $$ds^2 = -dW^2+dZ^2+dP^2+P^2 d \phi^2 \label{cylpolmet}$$ and the equation of the pseudosphere becomes $W^2-P^2-Z^2=1$. We assume that we have two centres located at $(\alpha,0,0, \pm \beta)$, where of course $\alpha^2-\beta^2=1$. The pseudospheroidal coordinates $\xi, \eta$ are defined by $$\begin{aligned}
\nonumber W &=& \frac{1}{\alpha}\sqrt{(\alpha^2-\xi^2)(\alpha^2+\eta^2)},
\\
\nonumber Z &=&
\frac{\mathrm{sgn}(Z)}{\beta}\sqrt{(\beta^2-\xi^2)(\beta^2+\eta^2)},
\\
P &=& \frac{\xi \eta}{\alpha \beta}, \label{psdspher}\end{aligned}$$ with $$0 \leq \xi \leq \beta, \qquad 0 \leq \eta < \infty$$ Since $\mathrm{sgn}(Z)$ enters these equations, the equations (\[psdspher\]) in fact define two coordinate patches, which together cover ${\mathbb{H}^3}$ and overlap along the plane $Z=0$. From these equations, we can deduce the relations $$\frac{W^2}{\alpha^2-\xi^2} =
\frac{Z^2}{\beta^2-\xi^2}-\frac{P^2}{\xi^2}, \qquad \frac{W^2}{\alpha^2+\eta^2} =
\frac{Z^2}{\beta^2+\eta^2}+\frac{P^2}{\eta^2} \label{cordsurf}$$ In order to interpret the geometric meaning of the $\xi, \eta$ coordinates, we may use the gnomonic projection and consider the coordinate surfaces in Beltrami coordinates. Using cylindrical polars on the Beltrami ball, from above we have that $$z = \frac{Z}{W}, \qquad \rho = \frac{P}{W},$$ while $\phi$ remains unchanged. Thus, in Beltrami coordinates, the equations which determine the coordinate surfaces of $\xi$ and $\eta$ become: $$\begin{aligned}
\frac{1}{\alpha^2-\xi^2} &=& \frac{z^2}{\beta^2-\xi^2} -
\frac{\rho^2}{\xi^2} \label{hyperb}\\
\frac{1}{\alpha^2+\eta^2} &=&
\frac{z^2}{\beta^2+\eta^2}+\frac{\rho^2}{\eta^2} \label{ellip}.\end{aligned}$$
(1,1)(0,0) (-10.5,233)[$\xi=0$]{} (-10.5,150)[$\eta=0$]{} (48,150)[$\xi=\beta$]{} (75,225)[$\eta=\infty$]{}
As $\xi$ and $\eta$ vary, these describe a family of hyperbolae and ellipses respectively. A plot of the coordinate curves in the $z-\rho$ plane is shown in Figure \[sphero2\], where for convenience we allow $\rho$ to be negative.
Using equations (\[cylpolmet\]) and (\[psdspher\]), one can show that the metric on ${\mathbb{H}^3}$ in pseudospheroidal coordinates is $$\label{spheroidalmetric}
ds^2 = \frac{\xi^2+\eta^2}{(\alpha^2-\xi^2)(\beta^2-\xi^2)} d\xi^2 +
\frac{\xi^2+\eta^2}{(\alpha^2+\eta^2)(\beta^2+\eta^2)}d\eta^2 + \frac{\xi^2\eta^2}{\alpha^2\beta^2}d\phi^2$$
### Pseudoparabolic Coordinates {#ppara}
For one-centre problems in flat space with a distinguished spatial direction, it is often useful to use parabolic coordinates. These may be thought of as spheroidal coordinates where one of the two centres has been allowed to recede to infinity, while the other is fixed at the origin. Again following Vozmischeva [@vosm], we shall construct an analogous set of coordinates on ${\mathbb{H}^3}$ from the pseudospheroidal coordinates given above.
We first apply a Lorentz transformation to $\mathbb{E}^{3,1}$ in order to move the centre at $(\alpha, 0, 0, -\beta)$ to $(1,0,0,0)$. Without loss of generality we may write $\alpha = \cosh \frac{\psi}{2}$, $\beta = \sinh \frac{\psi}{2}$. The point at $(W,Z,P,\phi)$ moves to $(W', Z', P', \phi')$, where the new coordinates are related to the old by: $$\begin{aligned}
\nonumber W &=& \cosh \frac{\psi}{2} W' - \sinh \frac{\psi}{2} Z', \\
\nonumber Z &=& \cosh \frac{\psi}{2} Z' - \sinh \frac{\psi}{2} W', \\
P&=& P', \qquad \quad \phi = \phi'. \label{lorentz}\end{aligned}$$ We also rescale the variables $\xi$ and $\eta$ by $$\xi = \alpha \xi' = \cosh \frac{\psi}{2} \xi', \qquad \eta = \beta
\eta' = \sinh\frac{\psi}{2} \eta' \label{rescale}$$ In order to find the new coordinate surfaces, we substitute (\[lorentz\]) and (\[rescale\]) into (\[cordsurf\]) and take the limit as $\psi \to \infty$, keeping terms of order $e^{-\psi}$. The new coordinate surfaces are then given by: $$\begin{aligned}
2Z'(W'-Z') &=& \frac{\xi'^2}{1-\xi'^2}(W'-Z')^2 -
\frac{1-\xi'^2}{\xi'^2}P'^2 = \mu^2(W'-Z')^2-\frac{P'^2}{\mu^2} \label{musurf}\\
2Z'(W'-Z') &=& -\frac{\eta'^2}{1+\eta'^2}(W'-Z')^2 +
\frac{1+\eta'^2}{\eta'^2}P'^2 = -\nu^2(W'-Z')^2+\frac{P'^2}{\nu^2} \label{nusurf}\end{aligned}$$ Where we have defined new coordinates $\mu = \frac{\xi'^2}{1-\xi'^2}$ and $\nu = \frac{\eta'^2}{1+\eta'^2}$. We now have no further use for the unprimed coordinates, so drop the primes. We can solve equations (\[musurf\]), (\[nusurf\]), together with the pseudosphere constraint $W^2-P^2-Z^2=1$ to express the points on the pseudosphere in $\mathbb{E}^{3,1}$ in terms of $\mu$ and $\nu$. This gives $$W = \frac{2+\mu^2-\nu^2}{2 \sqrt{(1-\nu^2)(1+\mu^2)}},\quad
P=\frac{\mu\nu}{\sqrt{(1-\nu^2)(1+\mu^2)}}, \quad Z =
\frac{\mu^2-\nu^2}{2 \sqrt{(1-\nu^2)(1+\mu^2)}}, \label{e31munu}$$
(1,1)(0,0) (-10.5,250)[$\mu=\infty$]{} (-10.5,190)[$\nu=0$]{} (-10.5,42)[$\mu=0$]{} (75,220)[$\nu=1$]{}
where $$\label{munurange}
0 \leq \mu < \infty, \qquad 0 \leq \nu < 1.$$ This time the coordinates cover the whole of ${\mathbb{H}^3}$. The sphere at infinity is given by $\nu =1$. We may once again use the gnomonic projection in order to visualise the coordinate surfaces as surfaces within the Beltrami ball model. We find that the Beltrami coordinates $z, \rho$ are given in terms of $\mu, \nu$ by: $$z = \frac{Z}{W}=\frac{\mu^2-\nu^2}{2+\mu^2-\nu^2}, \qquad \rho =
\frac{P}{W} = \frac{\mu\nu}{2+\mu^2-\nu^2}.$$ Either from these equations, or from the projected versions of equations (\[musurf\]), (\[nusurf\]), we find that the surfaces $\mu = \mathrm{const.}$ are hyperboloids and those of $\nu =
\mathrm{const.}$ are ellipsoids. The plane $\phi=0$ is shown in Figure \[para\].
Using equations (\[e31munu\]) and (\[cylpolmet\]), it is a matter of straightforward calculation to find the metric on ${\mathbb{H}^3}$ in the $\mu, \nu,
\phi$ coordinates. We find that $$\label{paraboloidalmetric}
ds^2 = \frac{\mu^2+\nu^2}{(1-\nu^2)(1+\mu^2)} \left [ \frac{d\mu^2}{1+\mu^2}+\frac{d\nu^2}{1-\nu^2}+\frac{d\phi^2}{\mu^{-2}+\nu^{-2}} \right ]$$
Horospheres \[horo\]
--------------------
$$\PandocStartInclude{figure7.pstex_t}\PandocEndInclude{input}{2258}{24}$$
When considering scattering processes in Euclidean space, the incoming wave is usually considered to be a plane wave, i.e. a wave whose phase is constant along any plane parallel to some vector. The important property of such planes is that they are everywhere normal to a set of parallel geodesics. Whether we are considering classical action waves or wavefunctions, the interpretation is that particles are moving parallel to some fixed direction. For hyperbolic space, we would like a similar set of waves to describe incoming particles initially parallel to some direction. In order to do this, we consider a pencil of parallel geodesics in ${\mathbb{H}^3}$, which meet at a point on $\partial
{\mathbb{H}^3}$. The horospheres are a set of surfaces everywhere normal to these geodesics. It is most convenient to visualise these surfaces in the Poincaré ball model, since this is conformally flat so angles are as one would expect in Euclidean space. A set of parallel geodesics in this model are a set of circular arcs which meet the sphere $r=1$ orthogonally at some given point, say $(0,0,1)$. A surface which is everywhere normal to this pencil of geodesics is a sphere which is tangent to the sphere $r=1$ at the point $(0,0,1)$. A picture of the $y=0$ plane is shown in figure \[hor\].
The horospheres may be thought of as a limit of a set of spheres in ${\mathbb{H}^3}$ whose centre goes to infinity whilst the radius also tends to infinity. The horospheres carry a natural Euclidean geometry and the restriction of the hyperbolic metric to each horosphere is flat, a result known as Wachter’s theorem [@Fenchel; @Coxeter]. Clearly there is nothing special about our choice of boundary point, so there is a set of horospheres associated with every point on $S^2_\infty = \partial {\mathbb{H}^3}$.
A brief calculation shows that the horospheres associated with a pencil of parallel geodesics originating from $(0,0,1)$ are given in pseudoparabolic coordinates by the equation $$(1+\mu^2)(1-\nu^2) = \mathrm{const.}$$
[1]{}
J. Bertrand, “Théorème relatif au mouvement d’un point attiré vers un centre fixe,” Compt. Rend. [**77**]{} (1873) 849.
H. Goldstein, “More on the prehistory of the Laplace or Runge-Lenz vector,” Am. J. Phys. [**44**]{} 1123.
R. Lipschitz, Q. J. Pure Appl. Math. [**12**]{} (1873) 349.
W. Killing, “Die Mechanik in den Nicht-Euklidischen Raumformen,” J. Reine Angew. Math. [**98**]{} (1885) 1.
E. Schrodinger, “Eigenvalues and Eigenfunctions,” Proc. Roy. Irish Acad. (Sect. A) [**46**]{} (1940) 9. P. W. Higgs, “Dynamical Symmetries In A Spherical Geometry. 1,” J. Phys. A [**12**]{} (1979) 309. A. V. Shchepetilov “Comment on “Central potentials on spaces of constant curvature: The Kepler problem on the two- dimensional sphere S2 and the hyperbolic plane H2” \[J. Math. Phys. [**46**]{} (2005) 052702\]” J. Math. Phys. [**46**]{} (2005) 114101
D. Zwanziger, “Exactly soluble nonrelativistic model of particles with both electric and magnetic charges,” Phys. Rev. [**176**]{} (1968) 1480. H. V. Mcintosh and A. Cisneros, “Degeneracy in the presence of a magnetic monopole,” J. Math. Phys. [**11**]{} (1970) 896. V. V. Gritsev, Yu. A. Kurochkin and V. S. Otchik, “Nonlinear symmetry algebra of the MIC-Kepler problem on the sphere $S^3$,” J. Phys. A: Math. and Gen. [**33**]{} (1979) 4903.
A. Nersessian and G. Pogosian, Phys. Rev. A [**63**]{} (2001) 020103 \[arXiv:quant-ph/0006118\]. Y. A. Kurochkin and V. S. Otchik “Symmetry and Interbasis Expansions in the MIC-Kepler problem in Lobachevsky Space” Nonlin. Phenom. in Compl. Syst. [**8**]{}:1 (2005) 19
A. V. Borisov and I. S. Mamaev “Superintegrable systems on a sphere,” Regul. Chaotic. Dynam. [**10**]{} (3), (2005) 257
N. S. Manton, “A Remark On The Scattering Of Bps Monopoles,” Phys. Lett. B [**110**]{} (1982) 54. M. F. Atiyah and N. J. Hitchin, “Low-energy scattering of nonAbelian magnetic monopoles,” Phil. Trans. Roy. Soc. Lond. A [**315**]{} (1985) 459. G. W. Gibbons and N. S. Manton, “Classical And Quantum Dynamics Of BPS Monopoles,” Nucl. Phys. B [**274**]{} (1986) 183. L. G. Feher and P. A. Horvathy, Phys. Lett. B [**183**]{} (1987) 182 \[Erratum-ibid. [**188B**]{} (1987) 512\]. C. LeBrun, “Explicit Self-Dual Metrics on $\mathbb{CP}_2 \# \cdots \#
\mathbb{CP}_2$,” J. Diff. Geom. [**34**]{} (1991) 223.
D. M. Austin and P. J. Braam, “Boundary values of hyperbolic monopoles,” Nonlinearity [**3**]{} (1990) 809.
M. F. Atiyah, “Magnetic monopoles in hyperbolic spaces” [*Proc. Bombay Colloq. 1984 on Vector Bundles on Algebraic Varieties*]{} (Oxford: Oxford University Press) 1-34.
N. S. Manton, “Monopole Interactions At Long Range,” Phys. Lett. B [**154**]{} (1985) 397 \[Erratum-ibid. [**157B**]{} (1985) 475\]. M. F. Atiyah and N. J. Hitchin, “The Geometry And Dynamics Of Magnetic Monopoles. M.B. Porter Lectures,” A. V. Shchepetilov, “Reduction of the two-body problem with central interaction on simply connected spaces of constant sectional curvature” J. Phys. A: Math. Gen. [**31**]{} (1998) 6297
A. J. Maciejewski and M. Przybylska “Non-integrability of restricted two body problems in constant curvature spaces,” Regul. Chaotic. Dynam. [**8**]{} (4), (2003) 413
O. Nash, “Differential geometry of monopole moduli spaces,” arXiv:math.dg/0610295. G. W. Gibbons and N. S. Manton, “The moduli space metric for well separated BPS monopoles,” Phys. Lett. B [**356**]{} (1995) 32 \[arXiv:hep-th/9506052\]. H. Goldstein, C. Poole and J. Safko, [*Classical Mecanics,*]{} Addison Wesley, 2002.
S. A. Hartnoll and G. Policastro, arXiv:hep-th/0412044. H. Pedersen and P. Tod, “Einstein metrics and hyperbolic monopoles,” Class. Quantum Grav. [**8**]{} (1991) 751.
I. M. Benn and P. Charlton, “Dirac symmetry operators from conformal Killing-Yano tensors,” Class. Quant. Grav. [**14**]{} (1997) 1037 \[arXiv:gr-qc/9612011\]. G. W. Gibbons and P. J. Ruback, “The Hidden Symmetries Of Taub-NUT And Monopole Scattering,” Phys. Lett. B [**188**]{} (1987) 226. G. W. Gibbons and P. J. Ruback, “The Hidden Symmetries Of Multicenter Metrics,” Commun. Math. Phys. [**115**]{} (1988) 267.
J. de Boer, F. Harmsze and T. Tjin, “Nonlinear finite W symmetries and applications in elementary systems,” Phys. Rept. [**272**]{} (1996) 139 \[arXiv:hep-th/9503161\]. C. Quesne “On some nonlinear extensions of the angular momentum algebra,” J. Phys. A: Math. Gen. [**28**]{} (1995) 2847.
M. Rocek “Representation theory of the nonlinear $SU(2)$ algebra,” Phys. Lett. B [**255**]{} (1991) 554
W. R. Hamilton “The hodograph, or a new method of expressing in symbolic language the Newtonian law of attraction,” Proc. Roy. Irish Acad. [**3**]{} (1847) 344.
J. L. Synge “Classical Dynamics” in [*Encyclopedia of Physics*]{}, ed. S. Flügge (Springer, Berlin, 1960), Vol. III/1.
E. G. P. Rowe “The Hamilton-Jacobi equation for Coulomb scattering,” Am. J. Phys. [**53**]{} (10), (1985) 997
E. G. P. Rowe “The classical limit of quantum mechanical Coulomb scattering,” J. Phys. A: Math. Gen. [**20**]{} (1987) 1419
G. W. Gibbons and P. J. Ruback, “Winding strings, Kaluza-Klein monopoles and Runge-Lenz vectors,” Phys. Lett. B [**215**]{} (1988) 653. R. Gregory, J. A. Harvey and G. W. Moore, Adv. Theor. Math. Phys. [**1**]{} (1997) 283 \[arXiv:hep-th/9708086\]. D. N. Page, “Green’s Functions For Gravitational Multi - Instantons,” Phys. Lett. B [**85**]{} (1979) 369. G. w. Meng, “The MICZ-Kepler problems in all dimensions,” arXiv:math-ph/0507029.
L. D. Landau and E. M. Lifshitz, [*Course of Theoretical Physics: Vol. 3 Quantum Mechanics – Non-relativistic theory,*]{} Pergamon 1959.
T. G. Vozmischeva, [*Integrable Problems of Celestial Mechanics in Spaces of Constant Curvature*]{}, Astrophysics and Space Science Library vol. 295, Kluwer Academic Publishers, 2003.
B. Carter, “Killing Tensor Quantum Numbers And Conserved Currents In Curved Space,” Phys. Rev. D [**16**]{} (1977) 3395. W. Fenchel, [*Elementary Geometry in Hyperbolic Space*]{}, de Gruyter Studies in Mathematics 11, de Gruyter: Berlin, New York, 1989.
H. S. M. Coxeter, [*Non-Euclidean Geometry*]{}, University of Toronto Press, 1942
[^1]: G.W.Gibbons@damtp.cam.ac.uk
[^2]: C.M.Warnick@damtp.cam.ac.uk
[^3]: For a review of the history of this problem see [@Shchepetilov]
[^4]: Unlike in the previous section, we do not take units such that the magnetic charge is an integer.
[^5]: We say that two geodesics are parallel if they meet on $\partial {\mathbb{H}^3}$. When we say a geodesic is parallel to the $z$-axis, we implicitly mean that it meets the positive $z$-axis on the boundary of ${\mathbb{H}^3}$. Two geodesics which do not meet, even on the boundary of ${\mathbb{H}^3}$ are ultra-parallel.
[^6]: The repulsive case follows in a similar fashion to the attractive case
|
I dont get how people leap to ET. Is there really any evidence that this is even a remote possibility? I think a 40 minute long transformer
explosion is more likely than a thawarted alien invasion No????
Originally posted by QUEEQUEG
Sounds like an electromagnetic pulse ,with anti air craft fire you heard in the background it may have been a military exercise or a skirmish .
I have read of another who experienced a similar scenario loud booms from the sky, followed by helicopters is it possible there is a secret war going
on ?
There is mounting evidence that this may be the case.A power struggle between the white hats and the military and banking cabals that have ruled for
so long.
The thought crossed my mind too. This documentary sort of tells it straight. But an up to date civil war in the USA ? Anything is possible of course.
Certain states might be in conflict with the mindset of the federal government ? Or it might be operations to stop drugs or terrorists ? The
mainstream media might not be reporting on it due to license restrictions placed on them ? Only speculating of course !
I dont think there is any power in the land phone lines. I could be wrong but I thought that was for signal only , not power. The power for the phone
itself is only if you have a wireless phone in your home. Then you use your house electric supply. If you have a phone with a cord for the hand set
then there is no electricity used at all. I know our house phone works in a power outage if I unplug the cordless phone and plug in an old one with a
cord for the hand set. The cordless one needs electricity for the base which is also an answering machine. The old style phone works even without
power.
Also, don't blame him for not recording anything. My camera on my phone is awful. In any condition that is slightly dark, my camera picks up
nothing. I was in the cinema and my friend was fooling around before the movie started, tried to record but my camera couldn't pick up on any of the
surroundings, despite the fact the lights were still on cos they were just showing ads still.
I will vouch for the OP as a regular guy and not someone to make up wild tales to entertain you all. Wow! that is a crazy thing to wake up to.
There was a battle in the civil war at Jackson and the town itself was burned down if I remember correctly, so if time warps exist you'd be in the
right spot for some high strangeness.
I did a search for news in your area and no one seems to be talking about it.
I certainly believe your story though, I don't wish to cast aspersions your way at all.
Let us know what you find out - if anything.
I don't even have a wild guess as to what you witnessed.
Perhaps there's things going on the public is oblivious to -
You can bet the government won't be telling us anything!
interesting story.....we had the power go out twice this year, first one was a transformer blew a couple blocks away, one big noise and power out.
2nd one turned out to be a tree or tree branches fell on the lines, that's what we were told...I find that really interesting that the power
company told him they don't know.....they went out and fixed it so how can they not know....why didn't they come up with some plausable reason to
pass it off....
Something very similar happened to me in central florida last night. I really got a chill when I logged on and saw this thread.
I woke up at around 3:30am to hear my dogs going crazy. I have several that bark but when my bulldog barks I know something is wrong. I was so tired I
just laid for a minute and tried to get my bearings and remember where my gun was just in case. They calmed down and i just fell back asleep. About 30
min later (guessing) they were going crazy again. I looked up and noticed my cable box was off(the only way to know that the power is off in my dark
bedroom). I never checked my phone but all the power was off and the dogs were going crazy staring down the backyard. There was nothing there but it
really freaked me out and was very out of the ordinary. And now while Im sitting here typing this a coworker comes in and tells me he had no sleep
because his neighbors dogs starting barking and going crazy around 2:30 this morning. strange things going on.
Great thread OP! Very very interesting. You say the phone was working but not getting service? I'm disappointed and surprised that you didn't think
to record some of it though , which would have been a better idea than going back to bed to lie down lol. and when you say it sounded like anti weapon
gunfire what is ' anti weapon' gunfire?
Again, great thread and than you for sharing
Originally posted by AriesJedi
I think it could have been an ionisation event. I can't tell you the cause.
If so, then start looking for hair dropping out, nausea, vomitting, diarrhea and maybe flulike symptoms.
If skin looks sunburnt then sloughs off or if gums or nose bleeds then take Vitamin E and C and put Vit E on sunburnt parts.
Welts and unexplainable rashes too.
Look for these symptoms in your pets also.
Polar bears and Alaskan Air hostesses are having problems with this already.
Fukishima was to hide these events.
Start boosting your immune system now and your pets, with supplements. I have.
Two of my pets have diarrhea at the moment, and ongoing neurological problems from an ionisation event last year, when they were tiny.
Be safe.
edit on 18/5/12 by AriesJedi because: spelling
@AriesJedi
Please pardon my ignorance AJ, but what the hell is an 'Ionisation Event'??
Omaha NE, heard what I thought was a thunderstorm in the distance around 4am. Thought I would get up if it got closer. Then at 6:45 aprox I heard
military choppers, that is unusual for around here. Our air base only gets them a few times a year. Not that this proves anything except there was
some activity. Circumstantial for now...
I suspect it could be war games, because two weeks ago they were setting off large ordnance in Iowa all day. It was loud enough to shake our
building, and to get me to call them and confirm. So now we have Fl, MS, NE. Quite a spread to be related, but interesting. Any other states
reporting in?
First of all, transformers aren't as simple as they used to be and have many parts to them. One part can blow, causing another to blow after several
minutes and so on, but even without that, after it blows, you still have live electrical wires going to the blown transformer and if there is any wind
of any kind, those wires are going to sway into one another, causing sparks and crackles, very bright flashes and very loud noises. With that type of
energy going on, they'd probably get helicopters out to see what in the world is going on. It can also cause other transformers down the line to blow
if the lines keep interacting, causing a wider-spread blackout and complications. So, this very well could have been a blown transformer, either as
the cause or the result of something else mundane.
You may prefer that it be aliens or some government cover-up, but that doesn't automatically make it so.
This content community relies on user-generated content from our member contributors. The opinions of our members are not those of site ownership who maintains strict editorial agnosticism and simply provides a collaborative venue for free expression. |
Edgar Warren Williams
Edgar Warren Williams (born June 12, 1949) is an American composer, conductor, and music theorist.
Williams obtained a bachelor's degree in composition from Duke University in 1971, then obtained a master's degree at Columbia University in 1973, studying with Charles Wuorinen, Mario Davidovsky, and Harvey Sollberger. He then matriculated at Princeton, where he received a Master's in Fine Arts in 1977 and a Ph.D. in 1982 and studied with Milton Babbitt and J.K. Randall. He was a faculty member and orchestral conductor at the College of William and Mary from 1979. Williams's compositional work is noted for its orchestrational and timbral complexity, and its use of pitch collections as melodic and thematic elements.
Compositions
Orchestral
1969 Of Orphalese
1984 Landscapes with figure
1998 Nosferatu: A Symphony of Horror
1999 Suite on "Nosferatu"
For concert band
1968 "To my Father" Prologue
1978 Across a Bridge of Dreams
1991 Into the dark
1993 Now showing!
2002 Music from behind the Moon
Prologue
Musicals
1970 Music for "In the Dark of the Moon"
1982 Music for "The merry wives of Windsor" - (text by William Shakespeare)
1985 Music for "Richard II" - (text by William Shakespeare)
Choral
1975 The mystic trumpeter, for mixed choir and orchestra
1976 Multum in parvo, for large mixed choir
1998 Star spangled Banner, canon for choir
Missa, For six-member men's choir, brass and piano
Vocal music
1985 Three songs, for high voice and piano - text: Margaret Tongue
1985 The bawds of euphony, for high voice and piano - text: Wallace Stevens
Two Lyrics, for middle voice and piano - text: James Agee
Chamber music
1968 Chamber Piece nr. 1
1968 Chamber Piece nr. 2
1971 String Quartet nr. 1
1980 Amoretti, for viola and piano
1985 Caprice, for violin
1996 String Quartet nr. 2
1999 String Trio
Fant'sy I (from "Hortus conclusus"), for 9 instruments
Fant'sy II (from "Hortus conclusus"), for 12 instruments
Fant'sy III (from "Hortus conclusus"), for 12 instruments
Piano
1987 Six studies
2005 Sonata
Guitar
2002 Guitar quartet
Electronic music
2000 Pentimenti
Publications
Edgar Warren Williams: Harmony and Voice Leading, New York: HarperCollins, 1992.
Edgar Warren Williams: Introduction to Music, New York: HarperCollins, 1991. (Co-author with Miller and Taylor.)
Edgar Warren Williams: Banqueting with the Emperor, in: Perspectives of New Music, Volume 35, Number 1(1998)
Edgar Warren Williams: A View of Schoenberg's Opus 19, No.2, in: College Music Symposium, Vol. 25 (1985)
Edgar Warren Williams: In and About Some Measures of Beethoven, in: 19th Century Music, November 1983
Edgar Warren Williams: On Complementary Interval Class Sets, in: Theory only, Vol.7 (June 1983)
References
Category:American composers
Category:Musicians from Florida |
A simple example showing how to use QTermWidget to control and display a remote terminal.
To run this example, you should:
1. Build client-side program. In my PC, I use 'apt-get' to install the QTermWidget library.
2. Start the shell-srv.py with specific paramenters.This will expose a shell via socket.
3. Start the client-side program from commandline with specific paramenters.
Now you will get your own remote terminal work with QTermWidget. |
"Didn't think I was gonna find out, huh?" "Is that what you thought?" "If you were me, you wouldn't have found out 'cause you're stupid." "You guys are fucking stupid." " I have a gambling problem." " A gambling problem?" "Shut the fuck up!" "Shut the fuck up!" "Got a little greedy?" "!" " I'm sorry, boss." " You're sorry, you're sorry!" "I'm sorry!" "I'm fucking sorry, 'cause you fucking morons fucked up!" "You're sorry!" "Here, you want the money?" "Is that what you want?" "You want money, you fucking idiots?" "Here, take the money." "Here, go ahead!" "Go ahead, take the fucking money!" "You fucking idiots!" "Take it, take it, take the fucking money!" "Here, take it." "Is that what you want?" "!" "Take the fucking... come here, you fucking cocksucker." " I'm scared of heights, boss." " And cut!" "Cut!" "Larry?" "All right... the still photographer was right in my way." " Huh?" " The video went in and out." "It broke off... please, take care of the video for me, Joe, because I can't see the thing." "From what I could tell, from what I could hear..." "From what you could tell?" "You missed the whole tape?" "Oh, no, it's great..." "he needs more money." " This isn't enough, I need more money." " He needs more money." "Every take I don't have enough money." " Give him another..." " Thanks." "I think it's really developing very, very well, particularly the end." "What I'd like to get into more quickly" " is the threat of the violence." " Okay, well, let me do this." "Let me take out Gino's balls in a plastic bag." "Take it out of my pocket, hold up his balls." "The balls will never read." "They're not gonna read as well." "Balls will read." "Why won't balls read?" "You got them in plastic?" "They'll be in a plastic bag with some formaldehyde or something?" "But it's a little graphic for this." "I'd rather... that's a big thing to do." "What's the matter with you?" "Do you know what you're doing?" "Do you really know what you're doing?" "This is just the threat of the violence, okay?" "What I'm concerned about, if this guy says something, you should slap him." " Like what?" " "Don't talk to me until I finish."" " Like that?" " Yeah, that kind of thing." "That's too hard." " How many takes are we gonna do?" " Two more." " Two more?" " Two more." " You shoot too much, Marty." " No, it's getting better each time." " Yeah, yeah, yeah." " Two more takes... one after the other." "Same slate." "We get the energy better on the second take that way." "You know, "Seinfeld," we did two takes and we were done." "We're just getting into it." "It's rich." "It's getting better and better every time you do it." "All right, try to watch this one, okay?" "I was gonna watch, but I couldn't get away from the earphones." " Then cut it or something." " No, you were really good." "I'm not gonna break it up." "All right." " What did he say?" " Listen..." "No, what was he saying?" "What was Martin Scorsese saying to you?" "I don't know." "He has this little way of talking to me" " where it's subtle but..." " He doesn't like it?" "I don't know, it's hard to tell." "Did my father call?" "Oh, no, he hasn't called yet." "But it's still early in LA." "I don't know why he hasn't called me back, you know?" "My mother's sick." "He should call me back." "I don't get it." "I know, I know." "It's hard to take anything you say seriously right now." "You just look crazy." "I don't know if we're going to make this plane." "I really don't know." "He does too many takes." "All right, Marty, what's going on?" "We ready?" " Let's go." "Joe?" " Get ready please, here we go." "Come on." "It's kind of nice to be home, isn't it?" "We should've made a right..." "we should've made..." "Honey, it's okay." " I don't know what he's doing." " It's fine." "I think I want to stop by my father's on the way back." "I'll have the cab stop and... drop me off." "You can take it back home." "Okay, just to check in?" "Yeah, it's weird that he hasn't called me back." "I don't know what's going on." "Okay." "Listen, we're gonna make a stop first." "I'm gonna get dropped off." "Okay, that's good." "Very good." "All right, honey." " Hey, Dad." " How are you, boychick?" " Good." "How you doing?" " All right, doing fine, yeah." " How'd you get here?" " I had the cab drop me off from the airport and Cheryl took it home." "Hey, I could've picked you up." "Look at this place." "Very nice." "Looks like you've been living here for a while." " Well, listen, you look good here." " How you doing, okay?" " Yeah." " I called, you never got back to me." "I was busy, you know, I got busy." "What do you mean, you "got busy"?" "What are you doing?" "Let me make you a cup of coffee, huh?" "Aw, I don't want any coffee." "I just came to check up on you." "How's Mom doing?" "Oh, well, you know how people do." "So... tell me about New York!" "Did you have a good time in New York?" "Um..." "I mean, busy...?" "You seem very jumpy." "What's the matter with you?" "Well, I didn't expect you to come in today." "I really didn't know you were here." "Where's Mom?" "Well... your mother." "Well, I'll tell you all about your mother, you know... after all, we brought her back." "Your mother, she got sicker and we had to bring her back to the hospital." " She's in the hospital?" " Yeah, well, not now." "But we had to bring her back for a while." "Why didn't you tell me?" "You didn't even call." "She didn't want to bother you." "You know how she is." "She said, "Don't bother him." "He's in New York." "Let him enjoy himself."" "She didn't want to spoil your trip." "She's not in the hospital now, so that's over with." " Don't worry about that." " She's feeling better?" "Well, in a way." "She did warn me." "She said, "If anything happens to me, don't bother Larry." "He's in New York and he wants to enjoy."" "So then, after a day or two... nobody goes on forever and ever and ever." "You're not gonna go on, I'm not gonna go on..." " Is she dead?" " Er, yeah." "Dead, dead, she's dead." "And she didn't want me to bother you." " What does that mean?" " Well, you were in New York." "You were having a good time, so we didn't call." "W-when did she die?" "Let's see, the funeral was on Monday..." " The what?" " so she had to die on..." " Funeral?" " Yeah, funeral." "W-why wasn't..." "I'm not at the funeral?" "What do you mean Monday was the funeral?" "Well, Monday was the funeral." "Why wasn't I at the funeral?" "Why didn't you call me?" "She told me not to bother you..." "She told you not to bother me?" "What is that supposed to mean?" "You were in New York." "You were busy." "So what?" "What do you mean, I was busy?" "You give me a call!" "You didn't call me?" "You didn't call me to tell me my mother died?" "The last words she said to me, "If anything happens to me, you don't bother Larry." "Don't spoil his trip in New York."" "That's insane!" "The woman did not want to bother you." "I missed her funeral because she told you not to call me?" " Is that what you're telling me?" "!" " That's right!" "Who's that, Larry?" "My condolences." " Your cousin." " I'm sorry." " How are you?" " Hi, Andy." "I'm sorry, I really am." "Heard you were in New York." "You missed a good one." "This was really a nice..." "I'm sorry I missed it." "Had I been informed," "I may have been able to attend my mother's funeral." " It was beautiful." " Very nice." "Very well attended, rabbi spoke beautifully... honestly, rabbi spoke beautifully." "Like a friend." "I noticed you called Andy in New York, and he flew in." "Your mother didn't say not to call Andy." "She said not to call you, that's all she ever said." "Why didn't you call me when you were there?" "It would have been nice if you called." "You know, I was busy, Andy." "I couldn't see you." "I'm not talking about that, just call me." "I figure if you're in town just call and say hello." "I didn't need to see you." "I didn't need to visit." "What's the difference?" "I could call when I'm in LA." " I don't see the logic to it." " You know what I'm talking about." "Don't be a putz." "What are you talking about?" " Don't know what you're talking about." " Are you arguing?" "Are you out of your mind?" "If you go to Florida, you're not gonna call Aunt Cher?" "Not necessarily." "You come to town, you give me a call." "If I can't see you, there's no point in calling!" "I didn't want to see you." "What is the matter with you?" "Two people related to each other, two people, two cousins, and you're arguing this way?" "Okay, forget..." "I'm sorry I didn't call you in New York." "I'm sorry you didn't either." "It would have been nice to hear your voice." "Let me show you who was at this funeral." "Everybody was there, my goodness." "Your Uncle Harold was there." "He told his famous joke that he always tells." "Yeah, about the temple, I know, I know." "Abe Lincoln, he's Jewish." "He got "shot in the temple."" "The food the first night was not so good." "It was just deli." "But I'll tell you, people brought over... we still got stuff in the fridge, it's delicious." "Yeah, we have a lot of hard-boiled eggs." "And the eulogy was nice?" " It was beautiful." " Take a look at how wonderful." "A lot of people turned out." ""Beautiful service, sorry about your loss." "Where's Larry?"" "The Sessons called to send their condolences." "Who else called?" " We don't have to..." " No, who called?" "Michael Adler called." "He wants to have lunch with you..." "I haven't spoken with this guy in five years." "What does he want to have lunch with me for?" "I don't know." "Caruso's called." "Your suit is ready, which is actually good." "You're gonna need it for Julie Blum's bat mitzvah." "And the Mandels are..." "That bat mitzvah, oh, God." "Is there anything worse?" "Can you think of anything worse?" "Go ahead, what else?" "And the Mandels want to confirm dinner on Saturday." "Okay." "No, that's not happening." "Cancel it." " No dinner with..." " No, can't do that." " What do you want me to tell them?" " Tell them whatever you want." "Okay." "Ahem... hi." "Mary, hi, it's Cheryl David." "We're not gonna be able to do dinner on Saturday." "Well, I'm sorry to say, but..." "Larry's mother just passed away." "And we're going to take some time with that." "Okay, thank you." "Okay, bye bye." "What did she say?" "She said she's very sorry to hear about your mother." "Really?" "Yeah, and she completely understood." "Huh." "Michael?" "Larry David." "Pretty good." "I'd love to, but you know what?" "My mom died." "Yeah." "So I'm just not gonna be doing much for a while." "Okay, yeah, absolutely." "As soon as I get it together..." "Hi." "It's Larry David." "Hey, I'll bet Julie's pretty excited about that bat mitzvah, huh?" "Unfortunately, we're not gonna be able to make it." "Well..." "my mother died." "Tell Julie good luck, sorry I can't be there." "And mazeltov." "You too, darling." "Larry, how did you ever land this role in this film?" "It's like unbelievable to me." "I'm happy for you," " but how did that happen?" " He saw me at the... at the lmprov screaming at the audience one night in New York." " You mean ages ago?" " Yeah, ages ago." "He remembered this?" "He remembered because I was having it out with this guy in the audience, and he thought" "I could play this tough Jew." "I don't know, it was weird." " Congratulations." " Thank you." "That's fucking unbelievable." "Maybe I should hang out by his house and scream and yell." "No, that's great." "Speaking of screaming and yelling," "I'm trying to calm down a little bit, so I decided..." "don't mock." "I'm gonna start..." "I've never done it before, to meditate." "You know, I used to do it." "Did you know that?" " I vaguely remember." " Yeah, I used to do it." "What do you do, actually?" "I had a mantra, you know, and you repeat this mantra in your head." " You repeat it?" " Yeah, say it over and over again." " Where do you get mantras?" " From a yoga instructor." "I'm not gonna..." "I have to sign up for a yoga class or a mantra class?" "You could say anything you want." "Give yourself your own mantra." "You want a mantra?" "I'll give you a mantra." ""Lonely, lonely..."" " "Lonely..." - "Lonely..."" " Just keep repeating it." " That would work?" "You want mine?" "I'll give you mine." " Is that allowed?" " Who's gonna stop us?" " Nobody." " It's totally applicable." "What is your mantra?" "Okay." "Actually..." " Are you taking it back?" " No, I'm telling you." " Oh." " Ji..." " That's it?" " Ji ya." "Ji ya?" "What does it mean?" "I have no idea." "But keep repeating it over and over again..." ""Ji ya, ji ya, ji ya"..." "you know, half an hour, 20 minutes, half an hour..." " "Ji..." oh, shit." " What?" "This guy, Ed Swindell." "He's spotted me." "He's gonna want to do a "stop-and-chat."" "Don't... don't, don't go, don't go." " Oh my God, I got to..." " Oh, what a fuck." "I got a lot of shopping to do." "Have a blast." " Hey, Larry." " Hey, Ed." "Good to see you." "What a surprise." "Good place, isn't it?" "Yeah, we're clothes shopping and I had to get out of there." "You know, little Deslys, "the princess,"" "she's holding up these two things." ""Which makes me look more growed-up, Daddy?"" "You know... my mother..." "just died." "Oh, Larry, I'm so sorry." "I kind of need to be alone with my own thoughts." "Oh, absolutely." "Jeez, bless your heart." "Our thoughts are with you." " Thank you." " Yeah, yeah." "Excuse me." "Yep?" "I'm looking for my mother's grave, Adele David." "She was just buried." "Yeah, yeah." "I think it's supposed to be right over there." "She got moved." "Special section." "What "special section"?" "You'd better talk to the general manager." "Take a right here and it's the first building on the right." "My mother was moved to a special section?" "Yes, evidently you were out of town." "Well, I would've been here, but I wasn't informed about it." "Well, obviously." "We have a section reserved for people who... well, who just don't qualify for the interment in consecrated ground." "It's a place where we put the villains, the suicides, the gentiles who are from mixed marriages..." "Okay, okay." "This is a horrendous mistake, okay?" "Let me explain, please." "When the shammas examined her, he found that she had a tattoo on the..." "Tattoo?" "My mother had a tattoo?" "Yes, sir." "It's on the right cheek of her right buttock if you will." "My mother had a tattoo on her ass?" "On her right buttock, yes, sir." "Now..." "So what if she did have a tattoo, so what?" "According to Leviticus, "You shall not make any gashes in your flesh for the dead, nor incise yourself."" "In other words, to adorn oneself in such a manner, was found by Maimonides..." "many, many, years ago, of course... to be an offense which would disqualify such a person from burial in consecrated ground." "Okay." "Look, I wasn't here." "I should've been here." "I wasn't called." "My father for some reason didn't call me." " Your dad was here." " If I was here, this never would've happened." "Sir, I'm here now and I'd like to rectify this." "I'd like to get her where she's supposed to be, where we paid for her plot." "Now, if there was some youthful indiscretion, and she got this tattoo..." "which I still can't even hardly believe my ears when you even tell me this... but okay, say she does have this tattoo over there." "You know..." "so come on." "So what?" "There's nothing I can do, sir." "The law is the law." "That's two things you didn't tell me." "All right, I'm sorry, I'm sorry, what can I do?" "What are we gonna do about this "special section" thing?" " We can't keep her there." " This is ridiculous." "Well, that's true, I don't understand this." "But they have this special section." "It's the stupidest, stupidest thing I ever heard of." " I agree with you totally." " Never heard of anything so insane." "I have heard of it." "She would be sick to her stomach if she knew." "Yes, she would be upset." "Bottom line is, she'd be sick to her stomach." "When did she get this tattoo?" "The tattoo?" "We were just married." "We walked down the boardwalk over there." "She saw a tattoo parlor." "She said, "Hey, let's do it."" "Your parents had tattoos." "With our names." "That was an epic..." "words of love." "A real show of love." "I can't imagine my parents making love." "I can't imagine you making love." "Wow!" "Well, that looks good." " Well, thank you." " Thank you very much." " Thank you, honey." " So what's for dinner?" "Turkey." "No, I had turkey for lunch." "Oh, well..." "It's all right, it's okay." "I'm gonna go check on that turkey." " I'll take whatever you have." " Thank you, Ned." "Bad call, huh?" "Having turkey for lunch?" "Well, who knew?" "I didn't know." "You doubled up." "What am I gonna do, order Chinese food in LA.?" "You can't order Chinese food in LA.?" "There's no good Chinese food in LA." "Right, 'cause all the good Chinese cooks went to New York." "A country of one billion people couldn't send one good chef to Los Angeles." "How can you possibly be arguing the quality of good Chinese food in LA. versus New York?" "All right, fine." "You know what?" "come here, come here." "All right, here's my idea, okay?" "I want to get..." "I want to move her body." "I want to move the body to where it's supposed to be, because Mom would not want to be there." "It's not right." "I feel terrible about it." "And..." "How do you move..." "how do we move her?" "I'm gonna try and pay off the gravedigger is what I'm gonna do." "Wow." "That does not sound like a good idea." "I think it sounds fantastic." "It's not dangerous because I don't have to do anything but pay off the gravedigger, that's all I have to do." "I think I can do it." "If he takes the money, fine, if not, well, at least I tried." "You think you can get this man to dig it up?" "If you offer somebody enough money, they'll do it." "I got to tell you, we tried everything we could." "We talked to these people." "They would have none of it." "If you can pay this guy off, I say go do it." "I'd like to contribute." "I'd like to contribute a few dollars." "You're not contributing." "This whole tattoo thing is just..." "I agree with you completely." " Honest to God, I think it's a great..." " I think it's terrible." " Shh... quiet, quiet." " All right." " We'll do it." " I think it's a great idea." " It's a great idea." " It's a scary idea." ""Ji ya, ji ya, ji ya..."" "Yeah, who is it?" " It's me." " LD?" " Yeah." " I can't, er..." "What's the matter, huh?" "I'm meditating." "Oh, my God." "You're kidding." "No, I'm getting into this and it's starting to work." "I just forgot to turn the phone off." "I'm just pissed off." "Oh, I'm sorry." "Actually, that's kind of what I'm calling about." " About what?" " I was calling about the mantra." "What about the mantra?" "It's good, by the way." "It's working." "I'm calling to see... maybe I could get it back." "Get it back?" "What is that?" "You gave it to me?" "I changed my mind." "I'd like to get it back." "You can't be an East Indian-giver." "Well, I had it first, kind of, you know." "You did, but you let me have it." "Now it's part of my whole being." "My essence screams of this mantra." "And it's been working, and I..." " Really Larry, it's not fair." " What about splitting it with me?" "Splitting it?" "What is this, a timeshare in the Hamptons?" " You don't split a mantra." " Who says you can't split a mantra?" " Why can't you?" " It strikes me as being a tad... homosexual." " Get out." "It's not a gay thing." " I mean, we're not homosexual." "You don't have to tell me." "I know I'm not a homosexual." "I know, but I'm really having a difficult time giving it back." "I mean, you did a nice turn and you know, and now you're reneging, you know?" "It's just that, you know, my mother just died." "Yeah, yeah, yeah." " All right, fine." " Yeah?" " Yeah, yeah. yeah." " Oh, fabulous." "Don't even think twice about it, all right?" " Great, so we'll split it." " Yeah okay, no problem." " Fantastic." " All right, man." "Bye." "Who's that?" " Lewis." " Lewis, how's Lewis?" " He's good." " Yeah?" " I am exhausted." " Oh, okay." "Good night, honey." "Good night?" "Really, good night?" "Good night." " What are you doing?" " What am I doing?" "No, no, please." "Honey, I just showered." "What?" "So what?" "that's good for me." "I don't feel like getting into all that right now." " What?" "Why not?" " I'm very tired." " You're kidding." " Nope." " Really?" " Mm-hmm." "You know, it was just that I've been going through a rough time, what with my mother and all." "Oh..." "I didn't even have a chance to say good-bye." "Oh, honey." "Hey!" "How you doing?" "Remember me?" "All right." "Meet me at the grave." "8:00 tonight." "You better bring some friends to help." " Help what?" " Dig." "All these stones look alike." "Completely, completely lost." "Watch your feet." "You step on one of these things, you'll trip..." " Hey, over here." " Hey." "Hey!" "Hey!" "You're late." "Yeah, well, we got kind of lost." "Welcome to the special section." " Oh my God." " Here you go, gentlemen." " Thank you." " Enjoy your work." "Thank you." "Hey, what about you?" "I only got four shovels." "Asshole." "All right." "Ji ya." "Ji ya." "Ji ya, ji ya, ji ya..." "Ji ya, ji ya, ji ya, I made it out of clay" "And when it's dry and ready, oh, ji ya I will play" "Yo!" "Ji ya, ji ya, ji ya, ya ji ya ji-ji-ji..." " Who is it?" " Your friend, Richard Lewis." "Oh, Richie boy!" " Larry..." " Oh, a little pop-in, huh?" " Yeah, a bit of a pop-in." " No call?" "No." "Happy?" "I don't know what you're talking about." "The mantra that you so nicely lent to me, that I said maybe 400,000 times..." ""Ji ya"?" "What, what?" "I found out what it meant from some chick who does this meditation stuff." " What does it mean?" " Well, you can take "ji ya,"" "and take that mantra and shove it up your ass." " You know what it means?" " No, what does it mean?" ""Fuck me."" "Fuck me!" "Fuck you!" "Hmm." "Beautiful day, isn't it?" "Yes, it is." " You hear the birds?" " Um-hm." "Sometimes I like to pretend that I'm deaf and I try to imagine what it would be like..." " Right." "...not to be able to hear them." "It's not so bad." "You expecting somebody?" " No." " Huh." "Hi." "Can we come in and talk to you please?" " Oh, sure." " You don't mind?" "Thank you." "We're looking for a Larry David, ma'am." "Can you help us?" " Oh, why?" " Is he here, ma'am?" "Well, I'm wondering what this is about." "We need to speak with him, ma'am." "Hey, that's him, that's the guy." "Mr. David?" "We're gonna need you to come with us, sir." "What are you talking about?" "Evidently you've been passing some bad bills around town, sir." " Can you help us out with that?" " Counterfeit bills, sir." "Yeah, that's right." "Counterfeit bills." "Put your hands down, sir." "Oh... okay, all right." "I know what happened here." "I was in this movie, and they gave me this counterfeit money." " I understand." " And... no, I'll..." " Relax your arms, sir." " You can't be serious." " Stay calm." " I'll give you real money." "No, but I'll give you real money." " My mother died..." " I'm very sorry." "Ji ya!" "Ji ya!" |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (1.8.0_66) on Mon Jun 01 11:11:21 PDT 2020 -->
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>com.marginallyclever.artPipeline.imageFilters (Makelangelo 7.23.0 API)</title>
<meta name="date" content="2020-06-01">
<link rel="stylesheet" type="text/css" href="../../../../stylesheet.css" title="Style">
<script type="text/javascript" src="../../../../script.js"></script>
</head>
<body>
<h1 class="bar"><a href="../../../../com/marginallyclever/artPipeline/imageFilters/package-summary.html" target="classFrame">com.marginallyclever.artPipeline.imageFilters</a></h1>
<div class="indexContainer">
<h2 title="Classes">Classes</h2>
<ul title="Classes">
<li><a href="Filter_BlackAndWhite.html" title="class in com.marginallyclever.artPipeline.imageFilters" target="classFrame">Filter_BlackAndWhite</a></li>
<li><a href="Filter_CMYK.html" title="class in com.marginallyclever.artPipeline.imageFilters" target="classFrame">Filter_CMYK</a></li>
<li><a href="Filter_DitherFloydSteinberg.html" title="class in com.marginallyclever.artPipeline.imageFilters" target="classFrame">Filter_DitherFloydSteinberg</a></li>
<li><a href="Filter_DitherFloydSteinbergColor.html" title="class in com.marginallyclever.artPipeline.imageFilters" target="classFrame">Filter_DitherFloydSteinbergColor</a></li>
<li><a href="Filter_GaussianBlur.html" title="class in com.marginallyclever.artPipeline.imageFilters" target="classFrame">Filter_GaussianBlur</a></li>
<li><a href="Filter_Invert.html" title="class in com.marginallyclever.artPipeline.imageFilters" target="classFrame">Filter_Invert</a></li>
<li><a href="ImageFilter.html" title="class in com.marginallyclever.artPipeline.imageFilters" target="classFrame">ImageFilter</a></li>
</ul>
</div>
</body>
</html>
|
The post elicited a surfeit of hits; it was selected by DCBeer.com as one of that blog's favorite beer blog posts for 2011; and it engendered an interesting give-and-take on Facebook between Anderson and Paul Hill, the On-Premise and Specialty Retail Sales Manager at Select Wines Inc, a wine and beer wholesaler in northern Virginia. I've copied the entire exchange, below, with permission.
Things to take note of:
Lists are inherently non-inclusive. The utility of a list will be directly related to its sample size, but, regardless of data, many beers, a priori, will have been left untasted or unmentioned.
The omission of brewpub beers on most beer lists. To review them would be Sisyphean: there are many, and there are many that open and close, seemingly weekly. The omission of brewpub beer —a non-trivial portion of the beer produced in the U.S.— leaves truly fresh beer prejudicially unheralded.
Not all wine geeks disdain good beer; not all beer geeks are ignorant of good wine.
Follow the link at the end of the discussion to a different selection of the 50 Best Beers: a 'geekier' list, as Hill points out.
***************
Paul Hill
I agree with a lot of what you've written. I actually had a discussion the other day on how I thought it was odd that when talking to winemakers they will expound endlessly on the brix, soil, slope, rainfall, multiple grape clones used, age and type of oak, porosity of said oak, filtration systems, fining agents, chemicals used or not used, trellising styles....etc.etc. But you ask them about the yeast, and unless it is a wine made with' native yeast' you'll usually get a "huh?" Or a "why?". But anyone that's ever brewed knows the decision on yeast is as important to the final result as your hops or grain choices. That being said, I disagree with your claim that wine geeks tend toward ...December 7 at 10:43am
Paul Hill
... Macro lagers.
There's plenty of us out there who can appreciate the"balance" or cleanness of a Montrachet as well as the wild character of a geueze. The only problem with brett is when its where it shouldn't be. If its not appropriate for the style...its a distraction and a flaw. Thats as true for a pils as it is for a pinot grigio. Admittedly I don't know of any wines where its appropriate, but I've had wineries who almost embrace their"infections" a house character...of course I hated the wines. Another thing about the list. The WS Top 100 list is out of usually 6 to 8 THOUSAND wines they tasted. This top 25 is out of the 131 beers they reviewed for the year. I'm pretty sure we've all had more than that this year. So, I thought it was a reasonable list considering only 31 non US beers had the possibility of making the list, and obviously not only hundreds of breweries were excluded, but multiple states had no representation in their sample pool. Ya kind of have to take the list with a grain of salt when that means at least almost 20% of the beers they tried scored 92+. Maybe they only tasted 4 sour beers on the year. Whatever...beer geeks, and wine snobs...we all know lists if any kind only exist so we point out their flaws.December 7 at 10:57am
Nick Anderson
Good points. I was admittedly painting with a broad brush with the macro thing, but it's something I've noticed over the years. A LOT of wine people drink nothing but Miller Lite, Corona, etc when they turn to beer. Those folks tend to be the ones who're the most sensitive to brett so that's where I went.
Also: I really liked the WE Top 25 which is why I commented on it in the first place. I too wish we'd hear more about the yeast strains used in winemaking. Maybe it's just the beer geek in me, but I'm awfully curious about who uses what and what characteristics which strains may impart.
December 7 at 11:03am
Paul Hill
True, but I've always been amazed when dealing with winemakers and brewers around the world, that after they leave work...more often than not the wine makers want to go out and drink a beer(beer geeky beers), and the brewers very often talk more passionately about the wines they have cellared at home. I guess that can be chalked up to"one is work, one is fun". But its all about taste sensations regardless of where it comes from. Maybe all the BG's and WS's dancing around your hippy campfire should just be called flavor junkies!
December 7 at 11:07am
Nick Anderson
Yeah, I think so. The whole difference between people into beer and wine is choice of beverage; in the end we're all looking for something interesting.December 7 at 11:44am
Paul Hill
Just looked at the list again. To show how small a sample we're dealing with here. Saw that allagash triple was#10. Love the beer, but allagash is definitely in the upper echelon of us brewers that embrace brett, oak, and are blurring the line between wine and beer. Why weren't any of their other beers on the list? The allagash black was#1 last year. Oh, because they only tasted one beer from Maine this year.December 7 at 11:58am
Nick Anderson
True, but it's not Beer Enthusiast magazine. Another aspect of the list I found interesting was seeing what they picked out to feature to their (primarily) wine-centric readership from the relatively small sample of beers sampled.December 7 at 12:17pm
Paul Hill
What about this list?
The Fifty Best Beers: Guide to the world's best beers. Definitely raises the "beer geek" factor.December 8 at 10:03am
Nick Anderson
That's a pretty damn good list right there.December 8 at 10:08am |
I don't completely understand why, but I have to say the presentation of the death of the Ruby Hash Rocket Syntax ("=>") is pretty awesome. Not sure if this is going to happen in future Ruby 1.9 releases or if both versions are valid now and the hashrocket syntax will just be deprecated. |
The King of Carpet Cleaning and Marble Restoration
About Us
Color King has over 20 year of experience cleaning commercial and residential carpets, polishing and restoring marble, cleaning and sealing tile and grout and water removal.
We want customers for life and are proud of the number of referrals and recommendations we get from our satisfied customers. Check out our impressive or testimonial and referral list here. Click here to give Color King a review and let us know how we did.
Frequently, Color King is called in to put out fires from other companies errors and mistakes.
Color King is proud to serve Palm Beach and Broward Counties, Boca Raton and the Delray Beach area. We are licensed and insured, receiving an A+, the highest overall rating from the Better Business Bureau (BBB).
Each Color King job site will have at least one family member present, to ensure quality, performance and most importantly, your satisfaction.
A+ rating with the Better Business Bureau
Satisfied Customer:
"I must commend both you and your technician...for the professional manner in which you completed this task. From beginning to end, the diamond finish, polishing, cleaning, sealing and buffing have resulted in a floor that looks absolutely new."- Barbara Hornak |
# TimeSeries_Seq2Seq
This repo aims to be a useful collection of notebooks/code for understanding and implementing seq2seq neural networks for time series forecasting. Networks are constructed with keras/tensorflow.
## Instructions for Working With Notebooks:
Navigate to the directory you want the git repo to live in.
1. Run ```git clone https://github.com/JEddy92/TimeSeries_Seq2Seq.git```
2. Obtain the wikipedia web traffic data from [kaggle](https://www.kaggle.com/c/web-traffic-time-series-forecasting/data).
Store it in a folder called "data" at the top level of this repo (this is where the notebooks point to when reading data).
|
/* group.c
*
* Slightly better groupchats implementation.
*
* Copyright (C) 2014 Tox project All Rights Reserved.
*
* This file is part of Tox.
*
* Tox 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 3 of the License, or
* (at your option) any later version.
*
* Tox 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 Tox. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "group.h"
#include "util.h"
/* return 1 if the groupnumber is not valid.
* return 0 if the groupnumber is valid.
*/
static uint8_t groupnumber_not_valid(const Group_Chats *g_c, int groupnumber)
{
if ((unsigned int)groupnumber >= g_c->num_chats)
return 1;
if (g_c->chats == NULL)
return 1;
if (g_c->chats[groupnumber].status == GROUPCHAT_STATUS_NONE)
return 1;
return 0;
}
/* Set the size of the groupchat list to num.
*
* return -1 if realloc fails.
* return 0 if it succeeds.
*/
static int realloc_groupchats(Group_Chats *g_c, uint32_t num)
{
if (num == 0) {
free(g_c->chats);
g_c->chats = NULL;
return 0;
}
Group_c *newgroup_chats = realloc(g_c->chats, num * sizeof(Group_c));
if (newgroup_chats == NULL)
return -1;
g_c->chats = newgroup_chats;
return 0;
}
/* Create a new empty groupchat connection.
*
* return -1 on failure.
* return groupnumber on success.
*/
static int create_group_chat(Group_Chats *g_c)
{
uint32_t i;
for (i = 0; i < g_c->num_chats; ++i) {
if (g_c->chats[i].status == GROUPCHAT_STATUS_NONE)
return i;
}
int id = -1;
if (realloc_groupchats(g_c, g_c->num_chats + 1) == 0) {
id = g_c->num_chats;
++g_c->num_chats;
memset(&(g_c->chats[id]), 0, sizeof(Group_c));
}
return id;
}
/* Wipe a groupchat.
*
* return -1 on failure.
* return 0 on success.
*/
static int wipe_group_chat(Group_Chats *g_c, int groupnumber)
{
if (groupnumber_not_valid(g_c, groupnumber))
return -1;
uint32_t i;
sodium_memzero(&(g_c->chats[groupnumber]), sizeof(Group_c));
for (i = g_c->num_chats; i != 0; --i) {
if (g_c->chats[i - 1].status != GROUPCHAT_STATUS_NONE)
break;
}
if (g_c->num_chats != i) {
g_c->num_chats = i;
realloc_groupchats(g_c, g_c->num_chats);
}
return 0;
}
static Group_c *get_group_c(const Group_Chats *g_c, int groupnumber)
{
if (groupnumber_not_valid(g_c, groupnumber))
return 0;
return &g_c->chats[groupnumber];
}
/*
* check if peer with real_pk is in peer array.
*
* return peer index if peer is in chat.
* return -1 if peer is not in chat.
*
* TODO: make this more efficient.
*/
static int peer_in_chat(const Group_c *chat, const uint8_t *real_pk)
{
uint32_t i;
for (i = 0; i < chat->numpeers; ++i)
if (id_equal(chat->group[i].real_pk, real_pk))
return i;
return -1;
}
/*
* check if group with identifier is in group array.
*
* return group number if peer is in list.
* return -1 if group is not in list.
*
* TODO: make this more efficient and maybe use constant time comparisons?
*/
static int get_group_num(const Group_Chats *g_c, const uint8_t *identifier)
{
uint32_t i;
for (i = 0; i < g_c->num_chats; ++i)
if (sodium_memcmp(g_c->chats[i].identifier, identifier, GROUP_IDENTIFIER_LENGTH) == 0)
return i;
return -1;
}
/*
* check if peer with peer_number is in peer array.
*
* return peer number if peer is in chat.
* return -1 if peer is not in chat.
*
* TODO: make this more efficient.
*/
static int get_peer_index(Group_c *g, uint16_t peer_number)
{
uint32_t i;
for (i = 0; i < g->numpeers; ++i)
if (g->group[i].peer_number == peer_number)
return i;
return -1;
}
static uint64_t calculate_comp_value(const uint8_t *pk1, const uint8_t *pk2)
{
uint64_t cmp1 = 0, cmp2 = 0;
unsigned int i;
for (i = 0; i < sizeof(uint64_t); ++i) {
cmp1 = (cmp1 << 8) + (uint64_t)pk1[i];
cmp2 = (cmp2 << 8) + (uint64_t)pk2[i];
}
return (cmp1 - cmp2);
}
enum {
GROUPCHAT_CLOSEST_NONE,
GROUPCHAT_CLOSEST_ADDED,
GROUPCHAT_CLOSEST_REMOVED
};
static int friend_in_close(Group_c *g, int friendcon_id);
static int add_conn_to_groupchat(Group_Chats *g_c, int friendcon_id, int groupnumber, uint8_t closest, uint8_t lock);
static int add_to_closest(Group_Chats *g_c, int groupnumber, const uint8_t *real_pk, const uint8_t *temp_pk)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
if (public_key_cmp(g->real_pk, real_pk) == 0)
return -1;
unsigned int i;
unsigned int index = DESIRED_CLOSE_CONNECTIONS;
for (i = 0; i < DESIRED_CLOSE_CONNECTIONS; ++i) {
if (g->closest_peers[i].entry && public_key_cmp(real_pk, g->closest_peers[i].real_pk) == 0) {
return 0;
}
}
for (i = 0; i < DESIRED_CLOSE_CONNECTIONS; ++i) {
if (g->closest_peers[i].entry == 0) {
index = i;
break;
}
}
if (index == DESIRED_CLOSE_CONNECTIONS) {
uint64_t comp_val = calculate_comp_value(g->real_pk, real_pk);
uint64_t comp_d = 0;
for (i = 0; i < (DESIRED_CLOSE_CONNECTIONS / 2); ++i) {
uint64_t comp;
comp = calculate_comp_value(g->real_pk, g->closest_peers[i].real_pk);
if (comp > comp_val && comp > comp_d) {
index = i;
comp_d = comp;
}
}
comp_val = calculate_comp_value(real_pk, g->real_pk);
for (i = (DESIRED_CLOSE_CONNECTIONS / 2); i < DESIRED_CLOSE_CONNECTIONS; ++i) {
uint64_t comp = calculate_comp_value(g->closest_peers[i].real_pk, g->real_pk);
if (comp > comp_val && comp > comp_d) {
index = i;
comp_d = comp;
}
}
}
if (index == DESIRED_CLOSE_CONNECTIONS) {
return -1;
}
uint8_t old_real_pk[crypto_box_PUBLICKEYBYTES];
uint8_t old_temp_pk[crypto_box_PUBLICKEYBYTES];
uint8_t old = 0;
if (g->closest_peers[index].entry) {
memcpy(old_real_pk, g->closest_peers[index].real_pk, crypto_box_PUBLICKEYBYTES);
memcpy(old_temp_pk, g->closest_peers[index].temp_pk, crypto_box_PUBLICKEYBYTES);
old = 1;
}
g->closest_peers[index].entry = 1;
memcpy(g->closest_peers[index].real_pk, real_pk, crypto_box_PUBLICKEYBYTES);
memcpy(g->closest_peers[index].temp_pk, temp_pk, crypto_box_PUBLICKEYBYTES);
if (old) {
add_to_closest(g_c, groupnumber, old_real_pk, old_temp_pk);
}
if (!g->changed)
g->changed = GROUPCHAT_CLOSEST_ADDED;
return 0;
}
static unsigned int pk_in_closest_peers(Group_c *g, uint8_t *real_pk)
{
unsigned int i;
for (i = 0; i < DESIRED_CLOSE_CONNECTIONS; ++i) {
if (!g->closest_peers[i].entry)
continue;
if (public_key_cmp(g->closest_peers[i].real_pk, real_pk) == 0)
return 1;
}
return 0;
}
static int send_packet_online(Friend_Connections *fr_c, int friendcon_id, uint16_t group_num, uint8_t *identifier);
static int connect_to_closest(Group_Chats *g_c, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
if (!g->changed)
return 0;
unsigned int i;
if (g->changed == GROUPCHAT_CLOSEST_REMOVED) {
for (i = 0; i < g->numpeers; ++i) {
add_to_closest(g_c, groupnumber, g->group[i].real_pk, g->group[i].temp_pk);
}
}
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type == GROUPCHAT_CLOSE_NONE)
continue;
if (!g->close[i].closest)
continue;
uint8_t real_pk[crypto_box_PUBLICKEYBYTES];
uint8_t dht_temp_pk[crypto_box_PUBLICKEYBYTES];
get_friendcon_public_keys(real_pk, dht_temp_pk, g_c->fr_c, g->close[i].number);
if (!pk_in_closest_peers(g, real_pk)) {
g->close[i].type = GROUPCHAT_CLOSE_NONE;
kill_friend_connection(g_c->fr_c, g->close[i].number);
}
}
for (i = 0; i < DESIRED_CLOSE_CONNECTIONS; ++i) {
if (!g->closest_peers[i].entry)
continue;
int friendcon_id = getfriend_conn_id_pk(g_c->fr_c, g->closest_peers[i].real_pk);
uint8_t lock = 1;
if (friendcon_id == -1) {
friendcon_id = new_friend_connection(g_c->fr_c, g->closest_peers[i].real_pk);
lock = 0;
if (friendcon_id == -1) {
continue;
}
set_dht_temp_pk(g_c->fr_c, friendcon_id, g->closest_peers[i].temp_pk);
}
add_conn_to_groupchat(g_c, friendcon_id, groupnumber, 1, lock);
if (friend_con_connected(g_c->fr_c, friendcon_id) == FRIENDCONN_STATUS_CONNECTED) {
send_packet_online(g_c->fr_c, friendcon_id, groupnumber, g->identifier);
}
}
g->changed = GROUPCHAT_CLOSEST_NONE;
return 0;
}
/*
* Add a peer to the group chat.
*
* return peer_index if success or peer already in chat.
* return -1 if error.
*/
static int addpeer(Group_Chats *g_c, int groupnumber, const uint8_t *real_pk, const uint8_t *temp_pk,
uint16_t peer_number)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
//TODO
int peer_index = peer_in_chat(g, real_pk);
if (peer_index != -1) {
id_copy(g->group[peer_index].temp_pk, temp_pk);
if (g->group[peer_index].peer_number != peer_number)
return -1;
return peer_index;
}
peer_index = get_peer_index(g, peer_number);
if (peer_index != -1)
return -1;
Group_Peer *temp;
temp = realloc(g->group, sizeof(Group_Peer) * (g->numpeers + 1));
if (temp == NULL)
return -1;
memset(&(temp[g->numpeers]), 0, sizeof(Group_Peer));
g->group = temp;
id_copy(g->group[g->numpeers].real_pk, real_pk);
id_copy(g->group[g->numpeers].temp_pk, temp_pk);
g->group[g->numpeers].peer_number = peer_number;
g->group[g->numpeers].last_recv = unix_time();
++g->numpeers;
add_to_closest(g_c, groupnumber, real_pk, temp_pk);
if (g_c->peer_namelistchange)
g_c->peer_namelistchange(g_c->m, groupnumber, g->numpeers - 1, CHAT_CHANGE_PEER_ADD,
g_c->group_namelistchange_userdata);
if (g->peer_on_join)
g->peer_on_join(g->object, groupnumber, g->numpeers - 1);
return (g->numpeers - 1);
}
static int remove_close_conn(Group_Chats *g_c, int groupnumber, int friendcon_id)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
uint32_t i;
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type == GROUPCHAT_CLOSE_NONE)
continue;
if (g->close[i].number == (unsigned int)friendcon_id) {
g->close[i].type = GROUPCHAT_CLOSE_NONE;
kill_friend_connection(g_c->fr_c, friendcon_id);
return 0;
}
}
return -1;
}
/*
* Delete a peer from the group chat.
*
* return 0 if success
* return -1 if error.
*/
static int delpeer(Group_Chats *g_c, int groupnumber, int peer_index)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
uint32_t i;
for (i = 0; i < DESIRED_CLOSE_CONNECTIONS; ++i) { /* If peer is in closest_peers list, remove it. */
if (g->closest_peers[i].entry && id_equal(g->closest_peers[i].real_pk, g->group[peer_index].real_pk)) {
g->closest_peers[i].entry = 0;
g->changed = GROUPCHAT_CLOSEST_REMOVED;
break;
}
}
int friendcon_id = getfriend_conn_id_pk(g_c->fr_c, g->group[peer_index].real_pk);
if (friendcon_id != -1) {
remove_close_conn(g_c, groupnumber, friendcon_id);
}
Group_Peer *temp;
--g->numpeers;
void *peer_object = g->group[peer_index].object;
if (g->numpeers == 0) {
free(g->group);
g->group = NULL;
} else {
if (g->numpeers != (uint32_t)peer_index)
memcpy(&g->group[peer_index], &g->group[g->numpeers], sizeof(Group_Peer));
temp = realloc(g->group, sizeof(Group_Peer) * (g->numpeers));
if (temp == NULL)
return -1;
g->group = temp;
}
if (g_c->peer_namelistchange)
g_c->peer_namelistchange(g_c->m, groupnumber, peer_index, CHAT_CHANGE_PEER_DEL, g_c->group_namelistchange_userdata);
if (g->peer_on_leave)
g->peer_on_leave(g->object, groupnumber, peer_index, peer_object);
return 0;
}
static int setnick(Group_Chats *g_c, int groupnumber, int peer_index, const uint8_t *nick, uint16_t nick_len)
{
if (nick_len > MAX_NAME_LENGTH)
return -1;
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
/* same name as already stored? */
if (g->group[peer_index].nick_len == nick_len)
if (nick_len == 0 || !memcmp(g->group[peer_index].nick, nick, nick_len))
return 0;
if (nick_len)
memcpy(g->group[peer_index].nick, nick, nick_len);
g->group[peer_index].nick_len = nick_len;
if (g_c->peer_namelistchange)
g_c->peer_namelistchange(g_c->m, groupnumber, peer_index, CHAT_CHANGE_PEER_NAME, g_c->group_namelistchange_userdata);
return 0;
}
static int settitle(Group_Chats *g_c, int groupnumber, int peer_index, const uint8_t *title, uint8_t title_len)
{
if (title_len > MAX_NAME_LENGTH || title_len == 0)
return -1;
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
/* same as already set? */
if (g->title_len == title_len && !memcmp(g->title, title, title_len))
return 0;
memcpy(g->title, title, title_len);
g->title_len = title_len;
if (g_c->title_callback)
g_c->title_callback(g_c->m, groupnumber, peer_index, title, title_len, g_c->title_callback_userdata);
return 0;
}
static void set_conns_type_close(Group_Chats *g_c, int groupnumber, int friendcon_id, uint8_t type)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return;
uint32_t i;
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type == GROUPCHAT_CLOSE_NONE)
continue;
if (g->close[i].number != (unsigned int)friendcon_id)
continue;
if (type == GROUPCHAT_CLOSE_ONLINE) {
send_packet_online(g_c->fr_c, friendcon_id, groupnumber, g->identifier);
} else {
g->close[i].type = type;
}
}
}
/* Set the type for all close connections with friendcon_id */
static void set_conns_status_groups(Group_Chats *g_c, int friendcon_id, uint8_t type)
{
uint32_t i;
for (i = 0; i < g_c->num_chats; ++i) {
set_conns_type_close(g_c, i, friendcon_id, type);
}
}
static int handle_status(void *object, int friendcon_id, uint8_t status)
{
Group_Chats *g_c = object;
if (status) { /* Went online */
set_conns_status_groups(g_c, friendcon_id, GROUPCHAT_CLOSE_ONLINE);
} else { /* Went offline */
set_conns_status_groups(g_c, friendcon_id, GROUPCHAT_CLOSE_CONNECTION);
//TODO remove timedout connections?
}
return 0;
}
static int handle_packet(void *object, int friendcon_id, uint8_t *data, uint16_t length);
static int handle_lossy(void *object, int friendcon_id, const uint8_t *data, uint16_t length);
/* Add friend to group chat.
*
* return close index on success
* return -1 on failure.
*/
static int add_conn_to_groupchat(Group_Chats *g_c, int friendcon_id, int groupnumber, uint8_t closest, uint8_t lock)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
uint16_t i, ind = MAX_GROUP_CONNECTIONS;
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type == GROUPCHAT_CLOSE_NONE) {
ind = i;
continue;
}
if (g->close[i].number == (uint32_t)friendcon_id) {
g->close[i].closest = closest;
return i; /* Already in list. */
}
}
if (ind == MAX_GROUP_CONNECTIONS)
return -1;
if (lock)
friend_connection_lock(g_c->fr_c, friendcon_id);
g->close[ind].type = GROUPCHAT_CLOSE_CONNECTION;
g->close[ind].number = friendcon_id;
g->close[ind].closest = closest;
//TODO
friend_connection_callbacks(g_c->m->fr_c, friendcon_id, GROUPCHAT_CALLBACK_INDEX, &handle_status, &handle_packet,
&handle_lossy, g_c, friendcon_id);
return ind;
}
/* Creates a new groupchat and puts it in the chats array.
*
* type is one of GROUPCHAT_TYPE_*
*
* return group number on success.
* return -1 on failure.
*/
int add_groupchat(Group_Chats *g_c, uint8_t type)
{
int groupnumber = create_group_chat(g_c);
if (groupnumber == -1)
return -1;
Group_c *g = &g_c->chats[groupnumber];
g->status = GROUPCHAT_STATUS_CONNECTED;
g->number_joined = -1;
new_symmetric_key(g->identifier + 1);
g->identifier[0] = type;
g->peer_number = 0; /* Founder is peer 0. */
memcpy(g->real_pk, g_c->m->net_crypto->self_public_key, crypto_box_PUBLICKEYBYTES);
int peer_index = addpeer(g_c, groupnumber, g->real_pk, g_c->m->dht->self_public_key, 0);
if (peer_index == -1) {
return -1;
}
setnick(g_c, groupnumber, peer_index, g_c->m->name, g_c->m->name_length);
return groupnumber;
}
static int group_kill_peer_send(const Group_Chats *g_c, int groupnumber, uint16_t peer_num);
/* Delete a groupchat from the chats array.
*
* return 0 on success.
* return -1 if failure.
*/
int del_groupchat(Group_Chats *g_c, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
group_kill_peer_send(g_c, groupnumber, g->peer_number);
unsigned int i;
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type == GROUPCHAT_CLOSE_NONE)
continue;
g->close[i].type = GROUPCHAT_CLOSE_NONE;
kill_friend_connection(g_c->fr_c, g->close[i].number);
}
for (i = 0; i < g->numpeers; ++i) {
if (g->peer_on_leave)
g->peer_on_leave(g->object, groupnumber, i, g->group[i].object);
}
free(g->group);
if (g->group_on_delete)
g->group_on_delete(g->object, groupnumber);
return wipe_group_chat(g_c, groupnumber);
}
/* Copy the public key of peernumber who is in groupnumber to pk.
* pk must be crypto_box_PUBLICKEYBYTES long.
*
* returns 0 on success
* returns -1 on failure
*/
int group_peer_pubkey(const Group_Chats *g_c, int groupnumber, int peernumber, uint8_t *pk)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
if ((uint32_t)peernumber >= g->numpeers)
return -1;
memcpy(pk, g->group[peernumber].real_pk, crypto_box_PUBLICKEYBYTES);
return 0;
}
/* Copy the name of peernumber who is in groupnumber to name.
* name must be at least MAX_NAME_LENGTH long.
*
* return length of name if success
* return -1 if failure
*/
int group_peername(const Group_Chats *g_c, int groupnumber, int peernumber, uint8_t *name)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
if ((uint32_t)peernumber >= g->numpeers)
return -1;
if (g->group[peernumber].nick_len == 0) {
memcpy(name, "Tox User", 8);
return 8;
}
memcpy(name, g->group[peernumber].nick, g->group[peernumber].nick_len);
return g->group[peernumber].nick_len;
}
/* List all the peers in the group chat.
*
* Copies the names of the peers to the name[length][MAX_NAME_LENGTH] array.
*
* Copies the lengths of the names to lengths[length]
*
* returns the number of peers on success.
*
* return -1 on failure.
*/
int group_names(const Group_Chats *g_c, int groupnumber, uint8_t names[][MAX_NAME_LENGTH], uint16_t lengths[],
uint16_t length)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
unsigned int i;
for (i = 0; i < g->numpeers && i < length; ++i) {
lengths[i] = group_peername(g_c, groupnumber, i, names[i]);
}
return i;
}
/* Return the number of peers in the group chat on success.
* return -1 on failure
*/
int group_number_peers(const Group_Chats *g_c, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
return g->numpeers;
}
/* return 1 if the peernumber corresponds to ours.
* return 0 on failure.
*/
unsigned int group_peernumber_is_ours(const Group_Chats *g_c, int groupnumber, int peernumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return 0;
if (g->status != GROUPCHAT_STATUS_CONNECTED)
return 0;
if ((uint32_t)peernumber >= g->numpeers)
return 0;
return g->peer_number == g->group[peernumber].peer_number;
}
/* return the type of groupchat (GROUPCHAT_TYPE_) that groupnumber is.
*
* return -1 on failure.
* return type on success.
*/
int group_get_type(const Group_Chats *g_c, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
return g->identifier[0];
}
/* Send a group packet to friendcon_id.
*
* return 1 on success
* return 0 on failure
*/
static unsigned int send_packet_group_peer(Friend_Connections *fr_c, int friendcon_id, uint8_t packet_id,
uint16_t group_num, const uint8_t *data, uint16_t length)
{
if (1 + sizeof(uint16_t) + length > MAX_CRYPTO_DATA_SIZE)
return 0;
group_num = htons(group_num);
uint8_t packet[1 + sizeof(uint16_t) + length];
packet[0] = packet_id;
memcpy(packet + 1, &group_num, sizeof(uint16_t));
memcpy(packet + 1 + sizeof(uint16_t), data, length);
return write_cryptpacket(fr_c->net_crypto, friend_connection_crypt_connection_id(fr_c, friendcon_id), packet,
sizeof(packet), 0) != -1;
}
/* Send a group lossy packet to friendcon_id.
*
* return 1 on success
* return 0 on failure
*/
static unsigned int send_lossy_group_peer(Friend_Connections *fr_c, int friendcon_id, uint8_t packet_id,
uint16_t group_num, const uint8_t *data, uint16_t length)
{
if (1 + sizeof(uint16_t) + length > MAX_CRYPTO_DATA_SIZE)
return 0;
group_num = htons(group_num);
uint8_t packet[1 + sizeof(uint16_t) + length];
packet[0] = packet_id;
memcpy(packet + 1, &group_num, sizeof(uint16_t));
memcpy(packet + 1 + sizeof(uint16_t), data, length);
return send_lossy_cryptpacket(fr_c->net_crypto, friend_connection_crypt_connection_id(fr_c, friendcon_id), packet,
sizeof(packet)) != -1;
}
#define INVITE_PACKET_SIZE (1 + sizeof(uint16_t) + GROUP_IDENTIFIER_LENGTH)
#define INVITE_ID 0
#define INVITE_RESPONSE_PACKET_SIZE (1 + sizeof(uint16_t) * 2 + GROUP_IDENTIFIER_LENGTH)
#define INVITE_RESPONSE_ID 1
/* invite friendnumber to groupnumber
* return 0 on success
* return -1 on failure
*/
int invite_friend(Group_Chats *g_c, int32_t friendnumber, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
uint8_t invite[INVITE_PACKET_SIZE];
invite[0] = INVITE_ID;
uint16_t groupchat_num = htons((uint16_t)groupnumber);
memcpy(invite + 1, &groupchat_num, sizeof(groupchat_num));
memcpy(invite + 1 + sizeof(groupchat_num), g->identifier, GROUP_IDENTIFIER_LENGTH);
if (send_group_invite_packet(g_c->m, friendnumber, invite, sizeof(invite))) {
return 0;
} else {
wipe_group_chat(g_c, groupnumber);
return -1;
}
}
static unsigned int send_peer_query(Group_Chats *g_c, int friendcon_id, uint16_t group_num);
/* Join a group (you need to have been invited first.)
*
* expected_type is the groupchat type we expect the chat we are joining is.
*
* returns group number on success
* returns -1 on failure.
*/
int join_groupchat(Group_Chats *g_c, int32_t friendnumber, uint8_t expected_type, const uint8_t *data, uint16_t length)
{
if (length != sizeof(uint16_t) + GROUP_IDENTIFIER_LENGTH)
return -1;
if (data[sizeof(uint16_t)] != expected_type)
return -1;
int friendcon_id = getfriendcon_id(g_c->m, friendnumber);
if (friendcon_id == -1)
return -1;
if (get_group_num(g_c, data + sizeof(uint16_t)) != -1)
return -1;
int groupnumber = create_group_chat(g_c);
if (groupnumber == -1)
return -1;
Group_c *g = &g_c->chats[groupnumber];
uint16_t group_num = htons(groupnumber);
g->status = GROUPCHAT_STATUS_VALID;
g->number_joined = -1;
memcpy(g->real_pk, g_c->m->net_crypto->self_public_key, crypto_box_PUBLICKEYBYTES);
uint8_t response[INVITE_RESPONSE_PACKET_SIZE];
response[0] = INVITE_RESPONSE_ID;
memcpy(response + 1, &group_num, sizeof(uint16_t));
memcpy(response + 1 + sizeof(uint16_t), data, sizeof(uint16_t) + GROUP_IDENTIFIER_LENGTH);
if (send_group_invite_packet(g_c->m, friendnumber, response, sizeof(response))) {
uint16_t other_groupnum;
memcpy(&other_groupnum, data, sizeof(other_groupnum));
other_groupnum = ntohs(other_groupnum);
memcpy(g->identifier, data + sizeof(uint16_t), GROUP_IDENTIFIER_LENGTH);
int close_index = add_conn_to_groupchat(g_c, friendcon_id, groupnumber, 0, 1);
if (close_index != -1) {
g->close[close_index].group_number = other_groupnum;
g->close[close_index].type = GROUPCHAT_CLOSE_ONLINE;
g->number_joined = friendcon_id;
}
send_peer_query(g_c, friendcon_id, other_groupnum);
return groupnumber;
} else {
g->status = GROUPCHAT_STATUS_NONE;
return -1;
}
}
/* Set the callback for group invites.
*
* Function(Group_Chats *g_c, int32_t friendnumber, uint8_t type, uint8_t *data, uint16_t length, void *userdata)
*
* data of length is what needs to be passed to join_groupchat().
*/
void g_callback_group_invite(Group_Chats *g_c, void (*function)(Messenger *m, int32_t, uint8_t, const uint8_t *,
uint16_t, void *), void *userdata)
{
g_c->invite_callback = function;
g_c->invite_callback_userdata = userdata;
}
/* Set the callback for group messages.
*
* Function(Group_Chats *g_c, int groupnumber, int friendgroupnumber, uint8_t * message, uint16_t length, void *userdata)
*/
void g_callback_group_message(Group_Chats *g_c, void (*function)(Messenger *m, int, int, const uint8_t *, uint16_t,
void *), void *userdata)
{
g_c->message_callback = function;
g_c->message_callback_userdata = userdata;
}
/* Set the callback for group actions.
*
* Function(Group_Chats *g_c, int groupnumber, int friendgroupnumber, uint8_t * message, uint16_t length, void *userdata)
*/
void g_callback_group_action(Group_Chats *g_c, void (*function)(Messenger *m, int, int, const uint8_t *, uint16_t,
void *), void *userdata)
{
g_c->action_callback = function;
g_c->action_callback_userdata = userdata;
}
/* Set handlers for custom lossy packets.
*
* NOTE: Handler must return 0 if packet is to be relayed, -1 if the packet should not be relayed.
*
* Function(void *group object (set with group_set_object), int groupnumber, int friendgroupnumber, void *group peer object (set with group_peer_set_object), const uint8_t *packet, uint16_t length)
*/
void group_lossy_packet_registerhandler(Group_Chats *g_c, uint8_t byte, int (*function)(void *, int, int, void *,
const uint8_t *, uint16_t))
{
g_c->lossy_packethandlers[byte].function = function;
}
/* Set callback function for peer name list changes.
*
* It gets called every time the name list changes(new peer/name, deleted peer)
* Function(Group_Chats *g_c, int groupnumber, int peernumber, TOX_CHAT_CHANGE change, void *userdata)
*/
void g_callback_group_namelistchange(Group_Chats *g_c, void (*function)(Messenger *m, int, int, uint8_t, void *),
void *userdata)
{
g_c->peer_namelistchange = function;
g_c->group_namelistchange_userdata = userdata;
}
/* Set callback function for title changes.
*
* Function(Group_Chats *g_c, int groupnumber, int friendgroupnumber, uint8_t * title, uint8_t length, void *userdata)
* if friendgroupnumber == -1, then author is unknown (e.g. initial joining the group)
*/
void g_callback_group_title(Group_Chats *g_c, void (*function)(Messenger *m, int, int, const uint8_t *, uint8_t,
void *), void *userdata)
{
g_c->title_callback = function;
g_c->title_callback_userdata = userdata;
}
/* Set a function to be called when a new peer joins a group chat.
*
* Function(void *group object (set with group_set_object), int groupnumber, int friendgroupnumber)
*
* return 0 on success.
* return -1 on failure.
*/
int callback_groupchat_peer_new(const Group_Chats *g_c, int groupnumber, void (*function)(void *, int, int))
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
g->peer_on_join = function;
return 0;
}
/* Set a function to be called when a peer leaves a group chat.
*
* Function(void *group object (set with group_set_object), int groupnumber, int friendgroupnumber, void *group peer object (set with group_peer_set_object))
*
* return 0 on success.
* return -1 on failure.
*/
int callback_groupchat_peer_delete(Group_Chats *g_c, int groupnumber, void (*function)(void *, int, int, void *))
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
g->peer_on_leave = function;
return 0;
}
/* Set a function to be called when the group chat is deleted.
*
* Function(void *group object (set with group_set_object), int groupnumber)
*
* return 0 on success.
* return -1 on failure.
*/
int callback_groupchat_delete(Group_Chats *g_c, int groupnumber, void (*function)(void *, int))
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
g->group_on_delete = function;
return 0;
}
static unsigned int send_message_group(const Group_Chats *g_c, int groupnumber, uint8_t message_id, const uint8_t *data,
uint16_t len);
#define GROUP_MESSAGE_PING_ID 0
int group_ping_send(const Group_Chats *g_c, int groupnumber)
{
if (send_message_group(g_c, groupnumber, GROUP_MESSAGE_PING_ID, 0, 0)) {
return 0;
} else {
return -1;
}
}
#define GROUP_MESSAGE_NEW_PEER_ID 16
#define GROUP_MESSAGE_NEW_PEER_LENGTH (sizeof(uint16_t) + crypto_box_PUBLICKEYBYTES * 2)
/* send a new_peer message
* return 0 on success
* return -1 on failure
*/
int group_new_peer_send(const Group_Chats *g_c, int groupnumber, uint16_t peer_num, const uint8_t *real_pk,
uint8_t *temp_pk)
{
uint8_t packet[GROUP_MESSAGE_NEW_PEER_LENGTH];
peer_num = htons(peer_num);
memcpy(packet, &peer_num, sizeof(uint16_t));
memcpy(packet + sizeof(uint16_t), real_pk, crypto_box_PUBLICKEYBYTES);
memcpy(packet + sizeof(uint16_t) + crypto_box_PUBLICKEYBYTES, temp_pk, crypto_box_PUBLICKEYBYTES);
if (send_message_group(g_c, groupnumber, GROUP_MESSAGE_NEW_PEER_ID, packet, sizeof(packet))) {
return 0;
} else {
return -1;
}
}
#define GROUP_MESSAGE_KILL_PEER_ID 17
#define GROUP_MESSAGE_KILL_PEER_LENGTH (sizeof(uint16_t))
/* send a kill_peer message
* return 0 on success
* return -1 on failure
*/
static int group_kill_peer_send(const Group_Chats *g_c, int groupnumber, uint16_t peer_num)
{
uint8_t packet[GROUP_MESSAGE_KILL_PEER_LENGTH];
peer_num = htons(peer_num);
memcpy(packet, &peer_num, sizeof(uint16_t));
if (send_message_group(g_c, groupnumber, GROUP_MESSAGE_KILL_PEER_ID, packet, sizeof(packet))) {
return 0;
} else {
return -1;
}
}
#define GROUP_MESSAGE_NAME_ID 48
/* send a name message
* return 0 on success
* return -1 on failure
*/
static int group_name_send(const Group_Chats *g_c, int groupnumber, const uint8_t *nick, uint16_t nick_len)
{
if (nick_len > MAX_NAME_LENGTH)
return -1;
if (send_message_group(g_c, groupnumber, GROUP_MESSAGE_NAME_ID, nick, nick_len)) {
return 0;
} else {
return -1;
}
}
#define GROUP_MESSAGE_TITLE_ID 49
/* set the group's title, limited to MAX_NAME_LENGTH
* return 0 on success
* return -1 on failure
*/
int group_title_send(const Group_Chats *g_c, int groupnumber, const uint8_t *title, uint8_t title_len)
{
if (title_len > MAX_NAME_LENGTH || title_len == 0)
return -1;
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
/* same as already set? */
if (g->title_len == title_len && !memcmp(g->title, title, title_len))
return 0;
memcpy(g->title, title, title_len);
g->title_len = title_len;
if (g->numpeers == 1)
return 0;
if (send_message_group(g_c, groupnumber, GROUP_MESSAGE_TITLE_ID, title, title_len))
return 0;
else
return -1;
}
/* Get group title from groupnumber and put it in title.
* title needs to be a valid memory location with a max_length size of at least MAX_NAME_LENGTH (128) bytes.
*
* return length of copied title if success.
* return -1 if failure.
*/
int group_title_get(const Group_Chats *g_c, int groupnumber, uint8_t *title, uint32_t max_length)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
if (g->title_len == 0 || g->title_len > MAX_NAME_LENGTH)
return -1;
if (max_length > g->title_len)
max_length = g->title_len;
memcpy(title, g->title, max_length);
return max_length;
}
static void handle_friend_invite_packet(Messenger *m, uint32_t friendnumber, const uint8_t *data, uint16_t length)
{
Group_Chats *g_c = m->group_chat_object;
if (length <= 1)
return;
const uint8_t *invite_data = data + 1;
uint16_t invite_length = length - 1;
switch (data[0]) {
case INVITE_ID: {
if (length != INVITE_PACKET_SIZE)
return;
int groupnumber = get_group_num(g_c, data + 1 + sizeof(uint16_t));
if (groupnumber == -1) {
if (g_c->invite_callback)
g_c->invite_callback(m, friendnumber, *(invite_data + sizeof(uint16_t)), invite_data, invite_length,
g_c->invite_callback_userdata);
return;
}
break;
}
case INVITE_RESPONSE_ID: {
if (length != INVITE_RESPONSE_PACKET_SIZE)
return;
uint16_t other_groupnum, groupnum;
memcpy(&groupnum, data + 1 + sizeof(uint16_t), sizeof(uint16_t));
groupnum = ntohs(groupnum);
Group_c *g = get_group_c(g_c, groupnum);
if (!g)
return;
if (sodium_memcmp(data + 1 + sizeof(uint16_t) * 2, g->identifier, GROUP_IDENTIFIER_LENGTH) != 0)
return;
uint16_t peer_number = rand(); /* TODO: what if two people enter the group at the same time and
are given the same peer_number by different nodes? */
unsigned int tries = 0;
while (get_peer_index(g, peer_number) != -1) {
peer_number = rand();
++tries;
if (tries > 32)
return;
}
memcpy(&other_groupnum, data + 1, sizeof(uint16_t));
other_groupnum = ntohs(other_groupnum);
int friendcon_id = getfriendcon_id(m, friendnumber);
uint8_t real_pk[crypto_box_PUBLICKEYBYTES], temp_pk[crypto_box_PUBLICKEYBYTES];
get_friendcon_public_keys(real_pk, temp_pk, g_c->fr_c, friendcon_id);
addpeer(g_c, groupnum, real_pk, temp_pk, peer_number);
int close_index = add_conn_to_groupchat(g_c, friendcon_id, groupnum, 0, 1);
if (close_index != -1) {
g->close[close_index].group_number = other_groupnum;
g->close[close_index].type = GROUPCHAT_CLOSE_ONLINE;
}
group_new_peer_send(g_c, groupnum, peer_number, real_pk, temp_pk);
break;
}
default:
return;
}
}
/* Find index of friend in the close list;
*
* returns index on success
* returns -1 on failure.
*/
static int friend_in_close(Group_c *g, int friendcon_id)
{
unsigned int i;
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type == GROUPCHAT_CLOSE_NONE)
continue;
if (g->close[i].number != (uint32_t)friendcon_id)
continue;
return i;
}
return -1;
}
/* return number of connected close connections.
*/
static unsigned int count_close_connected(Group_c *g)
{
unsigned int i, count = 0;
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type == GROUPCHAT_CLOSE_ONLINE) {
++count;
}
}
return count;
}
#define ONLINE_PACKET_DATA_SIZE (sizeof(uint16_t) + GROUP_IDENTIFIER_LENGTH)
static int send_packet_online(Friend_Connections *fr_c, int friendcon_id, uint16_t group_num, uint8_t *identifier)
{
uint8_t packet[1 + ONLINE_PACKET_DATA_SIZE];
group_num = htons(group_num);
packet[0] = PACKET_ID_ONLINE_PACKET;
memcpy(packet + 1, &group_num, sizeof(uint16_t));
memcpy(packet + 1 + sizeof(uint16_t), identifier, GROUP_IDENTIFIER_LENGTH);
return write_cryptpacket(fr_c->net_crypto, friend_connection_crypt_connection_id(fr_c, friendcon_id), packet,
sizeof(packet), 0) != -1;
}
static unsigned int send_peer_kill(Group_Chats *g_c, int friendcon_id, uint16_t group_num);
static int handle_packet_online(Group_Chats *g_c, int friendcon_id, uint8_t *data, uint16_t length)
{
if (length != ONLINE_PACKET_DATA_SIZE)
return -1;
int groupnumber = get_group_num(g_c, data + sizeof(uint16_t));
uint16_t other_groupnum;
memcpy(&other_groupnum, data, sizeof(uint16_t));
other_groupnum = ntohs(other_groupnum);
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
int index = friend_in_close(g, friendcon_id);
if (index == -1)
return -1;
if (g->close[index].type == GROUPCHAT_CLOSE_ONLINE) {
return -1;
}
if (count_close_connected(g) == 0) {
send_peer_query(g_c, friendcon_id, other_groupnum);
}
g->close[index].group_number = other_groupnum;
g->close[index].type = GROUPCHAT_CLOSE_ONLINE;
send_packet_online(g_c->fr_c, friendcon_id, groupnumber, g->identifier);
if (g->number_joined != -1 && count_close_connected(g) >= DESIRED_CLOSE_CONNECTIONS) {
int fr_close_index = friend_in_close(g, g->number_joined);
if (fr_close_index == -1)
return -1;
if (!g->close[fr_close_index].closest) {
g->close[fr_close_index].type = GROUPCHAT_CLOSE_NONE;
send_peer_kill(g_c, g->close[fr_close_index].number, g->close[fr_close_index].group_number);
kill_friend_connection(g_c->fr_c, g->close[fr_close_index].number);
g->number_joined = -1;
}
}
return 0;
}
#define PEER_KILL_ID 1
#define PEER_QUERY_ID 8
#define PEER_RESPONSE_ID 9
#define PEER_TITLE_ID 10
// we could send title with invite, but then if it changes between sending and accepting inv, joinee won't see it
/* return 1 on success.
* return 0 on failure
*/
static unsigned int send_peer_kill(Group_Chats *g_c, int friendcon_id, uint16_t group_num)
{
uint8_t packet[1];
packet[0] = PEER_KILL_ID;
return send_packet_group_peer(g_c->fr_c, friendcon_id, PACKET_ID_DIRECT_GROUPCHAT, group_num, packet, sizeof(packet));
}
/* return 1 on success.
* return 0 on failure
*/
static unsigned int send_peer_query(Group_Chats *g_c, int friendcon_id, uint16_t group_num)
{
uint8_t packet[1];
packet[0] = PEER_QUERY_ID;
return send_packet_group_peer(g_c->fr_c, friendcon_id, PACKET_ID_DIRECT_GROUPCHAT, group_num, packet, sizeof(packet));
}
/* return number of peers sent on success.
* return 0 on failure.
*/
static unsigned int send_peers(Group_Chats *g_c, int groupnumber, int friendcon_id, uint16_t group_num)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
uint8_t packet[MAX_CRYPTO_DATA_SIZE - (1 + sizeof(uint16_t))];
packet[0] = PEER_RESPONSE_ID;
uint8_t *p = packet + 1;
uint16_t sent = 0;
unsigned int i;
for (i = 0; i < g->numpeers; ++i) {
if ((p - packet) + sizeof(uint16_t) + crypto_box_PUBLICKEYBYTES * 2 + 1 + g->group[i].nick_len > sizeof(packet)) {
if (send_packet_group_peer(g_c->fr_c, friendcon_id, PACKET_ID_DIRECT_GROUPCHAT, group_num, packet, (p - packet))) {
sent = i;
} else {
return sent;
}
p = packet + 1;
}
uint16_t peer_num = htons(g->group[i].peer_number);
memcpy(p, &peer_num, sizeof(peer_num));
p += sizeof(peer_num);
memcpy(p, g->group[i].real_pk, crypto_box_PUBLICKEYBYTES);
p += crypto_box_PUBLICKEYBYTES;
memcpy(p, g->group[i].temp_pk, crypto_box_PUBLICKEYBYTES);
p += crypto_box_PUBLICKEYBYTES;
*p = g->group[i].nick_len;
p += 1;
memcpy(p, g->group[i].nick, g->group[i].nick_len);
p += g->group[i].nick_len;
}
if (sent != i) {
if (send_packet_group_peer(g_c->fr_c, friendcon_id, PACKET_ID_DIRECT_GROUPCHAT, group_num, packet, (p - packet))) {
sent = i;
}
}
if (g->title_len) {
uint8_t Packet[1 + g->title_len];
Packet[0] = PEER_TITLE_ID;
memcpy(Packet + 1, g->title, g->title_len);
send_packet_group_peer(g_c->fr_c, friendcon_id, PACKET_ID_DIRECT_GROUPCHAT, group_num, Packet, sizeof(Packet));
}
return sent;
}
static int handle_send_peers(Group_Chats *g_c, int groupnumber, const uint8_t *data, uint16_t length)
{
if (length == 0)
return -1;
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
const uint8_t *d = data;
while ((unsigned int)(length - (d - data)) >= sizeof(uint16_t) + crypto_box_PUBLICKEYBYTES * 2 + 1) {
uint16_t peer_num;
memcpy(&peer_num, d, sizeof(peer_num));
peer_num = ntohs(peer_num);
d += sizeof(uint16_t);
int peer_index = addpeer(g_c, groupnumber, d, d + crypto_box_PUBLICKEYBYTES, peer_num);
if (peer_index == -1)
return -1;
if (g->status == GROUPCHAT_STATUS_VALID
&& public_key_cmp(d, g_c->m->net_crypto->self_public_key) == 0) {
g->peer_number = peer_num;
g->status = GROUPCHAT_STATUS_CONNECTED;
group_name_send(g_c, groupnumber, g_c->m->name, g_c->m->name_length);
}
d += crypto_box_PUBLICKEYBYTES * 2;
uint8_t name_length = *d;
d += 1;
if (name_length > (length - (d - data)) || name_length > MAX_NAME_LENGTH)
return -1;
setnick(g_c, groupnumber, peer_index, d, name_length);
d += name_length;
}
return 0;
}
static void handle_direct_packet(Group_Chats *g_c, int groupnumber, const uint8_t *data, uint16_t length,
int close_index)
{
if (length == 0)
return;
switch (data[0]) {
case PEER_KILL_ID: {
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return;
if (!g->close[close_index].closest) {
g->close[close_index].type = GROUPCHAT_CLOSE_NONE;
kill_friend_connection(g_c->fr_c, g->close[close_index].number);
}
}
break;
case PEER_QUERY_ID: {
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return;
send_peers(g_c, groupnumber, g->close[close_index].number, g->close[close_index].group_number);
}
break;
case PEER_RESPONSE_ID: {
handle_send_peers(g_c, groupnumber, data + 1, length - 1);
}
break;
case PEER_TITLE_ID: {
settitle(g_c, groupnumber, -1, data + 1, length - 1);
}
break;
}
}
#define MIN_MESSAGE_PACKET_LEN (sizeof(uint16_t) * 2 + sizeof(uint32_t) + 1)
/* Send message to all close except receiver (if receiver isn't -1)
* NOTE: this function appends the group chat number to the data passed to it.
*
* return number of messages sent.
*/
static unsigned int send_message_all_close(const Group_Chats *g_c, int groupnumber, const uint8_t *data,
uint16_t length, int receiver)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return 0;
uint16_t i, sent = 0;
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type != GROUPCHAT_CLOSE_ONLINE)
continue;
if ((int)i == receiver)
continue;
if (send_packet_group_peer(g_c->fr_c, g->close[i].number, PACKET_ID_MESSAGE_GROUPCHAT, g->close[i].group_number, data,
length))
++sent;
}
return sent;
}
/* Send lossy message to all close except receiver (if receiver isn't -1)
* NOTE: this function appends the group chat number to the data passed to it.
*
* return number of messages sent.
*/
static unsigned int send_lossy_all_close(const Group_Chats *g_c, int groupnumber, const uint8_t *data, uint16_t length,
int receiver)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return 0;
unsigned int i, sent = 0, num_connected_closest = 0, connected_closest[DESIRED_CLOSE_CONNECTIONS];
for (i = 0; i < MAX_GROUP_CONNECTIONS; ++i) {
if (g->close[i].type != GROUPCHAT_CLOSE_ONLINE)
continue;
if ((int)i == receiver)
continue;
if (g->close[i].closest) {
connected_closest[num_connected_closest] = i;
++num_connected_closest;
continue;
}
if (send_lossy_group_peer(g_c->fr_c, g->close[i].number, PACKET_ID_LOSSY_GROUPCHAT, g->close[i].group_number, data,
length))
++sent;
}
if (!num_connected_closest) {
return sent;
}
unsigned int to_send = 0;
uint64_t comp_val_old = ~0;
for (i = 0; i < num_connected_closest; ++i) {
uint8_t real_pk[crypto_box_PUBLICKEYBYTES];
uint8_t dht_temp_pk[crypto_box_PUBLICKEYBYTES];
get_friendcon_public_keys(real_pk, dht_temp_pk, g_c->fr_c, g->close[connected_closest[i]].number);
uint64_t comp_val = calculate_comp_value(g->real_pk, real_pk);
if (comp_val < comp_val_old) {
to_send = connected_closest[i];
comp_val_old = comp_val;
}
}
if (send_lossy_group_peer(g_c->fr_c, g->close[to_send].number, PACKET_ID_LOSSY_GROUPCHAT,
g->close[to_send].group_number, data, length)) {
++sent;
}
unsigned int to_send_other = 0;
comp_val_old = ~0;
for (i = 0; i < num_connected_closest; ++i) {
uint8_t real_pk[crypto_box_PUBLICKEYBYTES];
uint8_t dht_temp_pk[crypto_box_PUBLICKEYBYTES];
get_friendcon_public_keys(real_pk, dht_temp_pk, g_c->fr_c, g->close[connected_closest[i]].number);
uint64_t comp_val = calculate_comp_value(real_pk, g->real_pk);
if (comp_val < comp_val_old) {
to_send_other = connected_closest[i];
comp_val_old = comp_val;
}
}
if (to_send_other == to_send) {
return sent;
}
if (send_lossy_group_peer(g_c->fr_c, g->close[to_send_other].number, PACKET_ID_LOSSY_GROUPCHAT,
g->close[to_send_other].group_number, data, length)) {
++sent;
}
return sent;
}
#define MAX_GROUP_MESSAGE_DATA_LEN (MAX_CRYPTO_DATA_SIZE - (1 + MIN_MESSAGE_PACKET_LEN))
/* Send data of len with message_id to groupnumber.
*
* return number of peers it was sent to on success.
* return 0 on failure.
*/
static unsigned int send_message_group(const Group_Chats *g_c, int groupnumber, uint8_t message_id, const uint8_t *data,
uint16_t len)
{
if (len > MAX_GROUP_MESSAGE_DATA_LEN)
return 0;
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return 0;
if (g->status != GROUPCHAT_STATUS_CONNECTED)
return 0;
uint8_t packet[sizeof(uint16_t) + sizeof(uint32_t) + 1 + len];
uint16_t peer_num = htons(g->peer_number);
memcpy(packet, &peer_num, sizeof(peer_num));
++g->message_number;
if (!g->message_number)
++g->message_number;
uint32_t message_num = htonl(g->message_number);
memcpy(packet + sizeof(uint16_t), &message_num, sizeof(message_num));
packet[sizeof(uint16_t) + sizeof(uint32_t)] = message_id;
if (len)
memcpy(packet + sizeof(uint16_t) + sizeof(uint32_t) + 1, data, len);
return send_message_all_close(g_c, groupnumber, packet, sizeof(packet), -1);
}
/* send a group message
* return 0 on success
* return -1 on failure
*/
int group_message_send(const Group_Chats *g_c, int groupnumber, const uint8_t *message, uint16_t length)
{
if (send_message_group(g_c, groupnumber, PACKET_ID_MESSAGE, message, length)) {
return 0;
} else {
return -1;
}
}
/* send a group action
* return 0 on success
* return -1 on failure
*/
int group_action_send(const Group_Chats *g_c, int groupnumber, const uint8_t *action, uint16_t length)
{
if (send_message_group(g_c, groupnumber, PACKET_ID_ACTION, action, length)) {
return 0;
} else {
return -1;
}
}
/* High level function to send custom lossy packets.
*
* return -1 on failure.
* return 0 on success.
*/
int send_group_lossy_packet(const Group_Chats *g_c, int groupnumber, const uint8_t *data, uint16_t length)
{
//TODO: length check here?
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
uint8_t packet[sizeof(uint16_t) * 2 + length];
uint16_t peer_number = htons(g->peer_number);
memcpy(packet, &peer_number, sizeof(uint16_t));
uint16_t message_num = htons(g->lossy_message_number);
memcpy(packet + sizeof(uint16_t), &message_num, sizeof(uint16_t));
memcpy(packet + sizeof(uint16_t) * 2, data, length);
if (send_lossy_all_close(g_c, groupnumber, packet, sizeof(packet), -1) == 0) {
return -1;
}
++g->lossy_message_number;
return 0;
}
static void handle_message_packet_group(Group_Chats *g_c, int groupnumber, const uint8_t *data, uint16_t length,
int close_index)
{
if (length < sizeof(uint16_t) + sizeof(uint32_t) + 1)
return;
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return;
uint16_t peer_number;
memcpy(&peer_number, data, sizeof(uint16_t));
peer_number = ntohs(peer_number);
int index = get_peer_index(g, peer_number);
if (index == -1) {
/* We don't know the peer this packet came from so we query the list of peers from that peer.
(They would not have relayed it if they didn't know the peer.) */
send_peer_query(g_c, g->close[close_index].number, g->close[close_index].group_number);
return;
}
uint32_t message_number;
memcpy(&message_number, data + sizeof(uint16_t), sizeof(message_number));
message_number = ntohl(message_number);
if (g->group[index].last_message_number == 0) {
g->group[index].last_message_number = message_number;
} else if (message_number - g->group[index].last_message_number > 64 ||
message_number == g->group[index].last_message_number) {
return;
}
g->group[index].last_message_number = message_number;
uint8_t message_id = data[sizeof(uint16_t) + sizeof(message_number)];
const uint8_t *msg_data = data + sizeof(uint16_t) + sizeof(message_number) + 1;
uint16_t msg_data_len = length - (sizeof(uint16_t) + sizeof(message_number) + 1);
switch (message_id) {
case GROUP_MESSAGE_PING_ID: {
if (msg_data_len != 0)
return;
g->group[index].last_recv = unix_time();
}
break;
case GROUP_MESSAGE_NEW_PEER_ID: {
if (msg_data_len != GROUP_MESSAGE_NEW_PEER_LENGTH)
return;
uint16_t new_peer_number;
memcpy(&new_peer_number, msg_data, sizeof(uint16_t));
new_peer_number = ntohs(new_peer_number);
addpeer(g_c, groupnumber, msg_data + sizeof(uint16_t), msg_data + sizeof(uint16_t) + crypto_box_PUBLICKEYBYTES,
new_peer_number);
}
break;
case GROUP_MESSAGE_KILL_PEER_ID: {
if (msg_data_len != GROUP_MESSAGE_KILL_PEER_LENGTH)
return;
uint16_t kill_peer_number;
memcpy(&kill_peer_number, msg_data, sizeof(uint16_t));
kill_peer_number = ntohs(kill_peer_number);
if (peer_number == kill_peer_number) {
delpeer(g_c, groupnumber, index);
} else {
return;
//TODO
}
}
break;
case GROUP_MESSAGE_NAME_ID: {
if (setnick(g_c, groupnumber, index, msg_data, msg_data_len) == -1)
return;
}
break;
case GROUP_MESSAGE_TITLE_ID: {
if (settitle(g_c, groupnumber, index, msg_data, msg_data_len) == -1)
return;
}
break;
case PACKET_ID_MESSAGE: {
if (msg_data_len == 0)
return;
uint8_t newmsg[msg_data_len + 1];
memcpy(newmsg, msg_data, msg_data_len);
newmsg[msg_data_len] = 0;
//TODO
if (g_c->message_callback)
g_c->message_callback(g_c->m, groupnumber, index, newmsg, msg_data_len, g_c->message_callback_userdata);
break;
}
case PACKET_ID_ACTION: {
if (msg_data_len == 0)
return;
uint8_t newmsg[msg_data_len + 1];
memcpy(newmsg, msg_data, msg_data_len);
newmsg[msg_data_len] = 0;
//TODO
if (g_c->action_callback)
g_c->action_callback(g_c->m, groupnumber, index, newmsg, msg_data_len, g_c->action_callback_userdata);
break;
}
default:
return;
}
send_message_all_close(g_c, groupnumber, data, length, -1/*TODO close_index*/);
}
static int handle_packet(void *object, int friendcon_id, uint8_t *data, uint16_t length)
{
Group_Chats *g_c = object;
if (length < 1 + sizeof(uint16_t) + 1)
return -1;
if (data[0] == PACKET_ID_ONLINE_PACKET) {
return handle_packet_online(g_c, friendcon_id, data + 1, length - 1);
}
if (data[0] != PACKET_ID_DIRECT_GROUPCHAT && data[0] != PACKET_ID_MESSAGE_GROUPCHAT)
return -1;
uint16_t groupnumber;
memcpy(&groupnumber, data + 1, sizeof(uint16_t));
groupnumber = ntohs(groupnumber);
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
int index = friend_in_close(g, friendcon_id);
if (index == -1)
return -1;
switch (data[0]) {
case PACKET_ID_DIRECT_GROUPCHAT: {
handle_direct_packet(g_c, groupnumber, data + 1 + sizeof(uint16_t), length - (1 + sizeof(uint16_t)), index);
break;
}
case PACKET_ID_MESSAGE_GROUPCHAT: {
handle_message_packet_group(g_c, groupnumber, data + 1 + sizeof(uint16_t), length - (1 + sizeof(uint16_t)), index);
break;
}
default: {
return 0;
}
}
return 0;
}
/* Did we already receive the lossy packet or not.
*
* return -1 on failure.
* return 0 if packet was not received.
* return 1 if packet was received.
*
* TODO: test this
*/
static unsigned int lossy_packet_not_received(Group_c *g, int peer_index, uint16_t message_number)
{
if (peer_index == -1)
return -1;
if (g->group[peer_index].bottom_lossy_number == g->group[peer_index].top_lossy_number) {
g->group[peer_index].top_lossy_number = message_number;
g->group[peer_index].bottom_lossy_number = (message_number - MAX_LOSSY_COUNT) + 1;
g->group[peer_index].recv_lossy[message_number % MAX_LOSSY_COUNT] = 1;
return 0;
}
if ((uint16_t)(message_number - g->group[peer_index].bottom_lossy_number) < MAX_LOSSY_COUNT) {
if (g->group[peer_index].recv_lossy[message_number % MAX_LOSSY_COUNT]) {
return 1;
}
g->group[peer_index].recv_lossy[message_number % MAX_LOSSY_COUNT] = 1;
return 0;
}
if ((uint16_t)(message_number - g->group[peer_index].bottom_lossy_number) > (1 << 15))
return -1;
uint16_t top_distance = message_number - g->group[peer_index].top_lossy_number;
if (top_distance >= MAX_LOSSY_COUNT) {
sodium_memzero(g->group[peer_index].recv_lossy, sizeof(g->group[peer_index].recv_lossy));
g->group[peer_index].top_lossy_number = message_number;
g->group[peer_index].bottom_lossy_number = (message_number - MAX_LOSSY_COUNT) + 1;
g->group[peer_index].recv_lossy[message_number % MAX_LOSSY_COUNT] = 1;
return 0;
}
if (top_distance < MAX_LOSSY_COUNT) {
unsigned int i;
for (i = g->group[peer_index].bottom_lossy_number; i != (g->group[peer_index].bottom_lossy_number + top_distance);
++i) {
g->group[peer_index].recv_lossy[i % MAX_LOSSY_COUNT] = 0;
}
g->group[peer_index].top_lossy_number = message_number;
g->group[peer_index].bottom_lossy_number = (message_number - MAX_LOSSY_COUNT) + 1;
g->group[peer_index].recv_lossy[message_number % MAX_LOSSY_COUNT] = 1;
return 0;
}
return -1;
}
static int handle_lossy(void *object, int friendcon_id, const uint8_t *data, uint16_t length)
{
Group_Chats *g_c = object;
if (length < 1 + sizeof(uint16_t) * 3 + 1)
return -1;
if (data[0] != PACKET_ID_LOSSY_GROUPCHAT)
return -1;
uint16_t groupnumber, peer_number, message_number;
memcpy(&groupnumber, data + 1, sizeof(uint16_t));
memcpy(&peer_number, data + 1 + sizeof(uint16_t), sizeof(uint16_t));
memcpy(&message_number, data + 1 + sizeof(uint16_t) * 2, sizeof(uint16_t));
groupnumber = ntohs(groupnumber);
peer_number = ntohs(peer_number);
message_number = ntohs(message_number);
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
int index = friend_in_close(g, friendcon_id);
if (index == -1)
return -1;
if (peer_number == g->peer_number)
return -1;
int peer_index = get_peer_index(g, peer_number);
if (peer_index == -1)
return -1;
if (lossy_packet_not_received(g, peer_index, message_number))
return -1;
const uint8_t *lossy_data = data + 1 + sizeof(uint16_t) * 3;
uint16_t lossy_length = length - (1 + sizeof(uint16_t) * 3);
uint8_t message_id = lossy_data[0];
++lossy_data;
--lossy_length;
if (g_c->lossy_packethandlers[message_id].function) {
if (g_c->lossy_packethandlers[message_id].function(g->object, groupnumber, peer_index, g->group[peer_index].object,
lossy_data, lossy_length) == -1) {
return -1;
}
} else {
return -1;
}
send_lossy_all_close(g_c, groupnumber, data + 1 + sizeof(uint16_t), length - (1 + sizeof(uint16_t)), index);
return 0;
}
/* Set the object that is tied to the group chat.
*
* return 0 on success.
* return -1 on failure
*/
int group_set_object(const Group_Chats *g_c, int groupnumber, void *object)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
g->object = object;
return 0;
}
/* Set the object that is tied to the group peer.
*
* return 0 on success.
* return -1 on failure
*/
int group_peer_set_object(const Group_Chats *g_c, int groupnumber, int peernumber, void *object)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
if ((uint32_t)peernumber >= g->numpeers)
return -1;
g->group[peernumber].object = object;
return 0;
}
/* Return the object tide to the group chat previously set by group_set_object.
*
* return NULL on failure.
* return object on success.
*/
void *group_get_object(const Group_Chats *g_c, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return NULL;
return g->object;
}
/* Return the object tide to the group chat peer previously set by group_peer_set_object.
*
* return NULL on failure.
* return object on success.
*/
void *group_peer_get_object(const Group_Chats *g_c, int groupnumber, int peernumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return NULL;
if ((uint32_t)peernumber >= g->numpeers)
return NULL;
return g->group[peernumber].object;
}
/* Interval in seconds to send ping messages */
#define GROUP_PING_INTERVAL 20
static int ping_groupchat(Group_Chats *g_c, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
if (is_timeout(g->last_sent_ping, GROUP_PING_INTERVAL)) {
if (group_ping_send(g_c, groupnumber) != -1) /* Ping */
g->last_sent_ping = unix_time();
}
return 0;
}
static int groupchat_clear_timedout(Group_Chats *g_c, int groupnumber)
{
Group_c *g = get_group_c(g_c, groupnumber);
if (!g)
return -1;
uint32_t i;
for (i = 0; i < g->numpeers; ++i) {
if (g->peer_number != g->group[i].peer_number && is_timeout(g->group[i].last_recv, GROUP_PING_INTERVAL * 3)) {
delpeer(g_c, groupnumber, i);
}
if (g->group == NULL || i >= g->numpeers)
break;
}
return 0;
}
/* Send current name (set in messenger) to all online groups.
*/
void send_name_all_groups(Group_Chats *g_c)
{
unsigned int i;
for (i = 0; i < g_c->num_chats; ++i) {
Group_c *g = get_group_c(g_c, i);
if (!g)
continue;
if (g->status == GROUPCHAT_STATUS_CONNECTED) {
group_name_send(g_c, i, g_c->m->name, g_c->m->name_length);
}
}
}
/* Create new groupchat instance. */
Group_Chats *new_groupchats(Messenger *m)
{
if (!m)
return NULL;
Group_Chats *temp = calloc(1, sizeof(Group_Chats));
if (temp == NULL)
return NULL;
temp->m = m;
temp->fr_c = m->fr_c;
m->group_chat_object = temp;
m_callback_group_invite(m, &handle_friend_invite_packet);
return temp;
}
/* main groupchats loop. */
void do_groupchats(Group_Chats *g_c)
{
unsigned int i;
for (i = 0; i < g_c->num_chats; ++i) {
Group_c *g = get_group_c(g_c, i);
if (!g)
continue;
if (g->status == GROUPCHAT_STATUS_CONNECTED) {
connect_to_closest(g_c, i);
ping_groupchat(g_c, i);
groupchat_clear_timedout(g_c, i);
}
}
//TODO
}
/* Free everything related with group chats. */
void kill_groupchats(Group_Chats *g_c)
{
unsigned int i;
for (i = 0; i < g_c->num_chats; ++i) {
del_groupchat(g_c, i);
}
m_callback_group_invite(g_c->m, NULL);
g_c->m->group_chat_object = 0;
free(g_c);
}
/* Return the number of chats in the instance m.
* You should use this to determine how much memory to allocate
* for copy_chatlist.
*/
uint32_t count_chatlist(Group_Chats *g_c)
{
uint32_t ret = 0;
uint32_t i;
for (i = 0; i < g_c->num_chats; i++) {
if (g_c->chats[i].status != GROUPCHAT_STATUS_NONE) {
ret++;
}
}
return ret;
}
/* Copy a list of valid chat IDs into the array out_list.
* If out_list is NULL, returns 0.
* Otherwise, returns the number of elements copied.
* If the array was too small, the contents
* of out_list will be truncated to list_size. */
uint32_t copy_chatlist(Group_Chats *g_c, int32_t *out_list, uint32_t list_size)
{
if (!out_list) {
return 0;
}
if (g_c->num_chats == 0) {
return 0;
}
uint32_t i, ret = 0;
for (i = 0; i < g_c->num_chats; ++i) {
if (ret >= list_size) {
break; /* Abandon ship */
}
if (g_c->chats[i].status > GROUPCHAT_STATUS_NONE) {
out_list[ret] = i;
ret++;
}
}
return ret;
}
|
Wednesday, November 26, 2008
The world financial crisis may often seem intangible, with talk of collateralized mortgage swaps and huge multi-billion dollar bailout plans, but in the end it comes down to nuts-and-bolts sacrifices made on a local level. Wildomar is a 22-square mile city in the TemeculaValley that recently incorporated, but is already dealing with tough economic decisions. As part of Marketplace's "Close to Home" series, KPCC's Steven Cuevas takes a look at this Southern California town.
Listen to Steven's full story this afternoon on Marketplace beginning at 3 p.m.
Guests:
Steven Cuevas, KPCC's Inland Empire reporter
IN STUDIO
Wildomar Mayor Bob Cashman
Call him @
[NPR NEWS]
2:00 – 2:30
Smoke & Mirrors: How California Pays to Fight Wildfires
Even as the hills of Sylmar and Orange County are still smoldering and Southern California anxiously awaits the next red flag warning, various local and state fire fighting agencies are gearing up for the next round of wildfires. All of this preparation, not to mention actually fighting the increasingly intense fires, is insanely expensive and even in the face of a year-round fire season California’s system for funding this operations remains opaque and antiquated. In fact, California is alone among western states in paying for fire suppression out of its general fund. Is there a better way to fund fire fighting?
No one should question the philanthropic credentials of the Dodgers and their owners, Frank and Jamie McCourt: through the Dodgers Dream Foundation the team just committed to building 42 youth baseball fields around Southern California. But Dodgers President Jamie McCourt posed an interesting rhetorical question when asked about potential big-ticket free agent signings: in a time of recession, does it look strange for the team to commit $20+ million a year to a player like Manny Ramirez? Asks McCourt: “We’re really trying to understand, would they rather have the 50 fields?”
Guests:
Jamie McCourt, president of the Los Angeles Dodgers
BY TAPE
Matt “Money” Smith: Host of “Petros and Money” and of “The Lakers’ Zone” on KLAC
The day after Thanksgiving is typically a bright spot in the retail calendar, kicking off the holiday shopping season. But this year, when consumer spending reached record lows, Black Friday may turn bleak. Retailers do have a few rays of hope in pent-up demand and lower gasoline prices. Martha Olney, Adjunct Professor of Economics at U.C. Berkeley, joins Patt to see if sales will meet the low expectations this season.
Guests:
Martha Olney, Adjunct Professor of Economics, UC Berkeley. Olney is an expert on consumer spending and consumer debt, as well as the history of the Great Depression.
ON TAPE
1:20 – 1:40
Jetpack Dreams
Journalist Mac Montandon was once certain that by no later than the year 2000 humans would have traded in their beat up, gas-guzzling cars for shiny metal backpacks welded to jet engines. That disappointment lead him on a quest, from the first mention of the jetpack in a 1928 science fiction story, through modern Internet forums of jetpack enthusiasts and the Niagra Falls “International Rocketbelt Convention,” to the true story behind a bizarre mid-1990s case of kidnapping, imprisonment and murder—all in the name of the jetpack. Montandon joins Patt to speak about his journey writing “Jetpack Dreams: One Man’s Up and Down (But Mostly Down) Search for the Greatest Invention That Never Was” and the colorful pop history of this seemingly mythic machine.
Guest:
Mac Montandon: Author, “Jetpack Dreams: One Man’s Up and Down (But Mostly Down) Search for the Greatest Invention That Never Was”
ON TAPE
1:40 – 2:00
Ronald Reagan: From Leading Man to World Leader
In his new book, “Ronald Reagan: The Hollywood Years,” author Marc Eliot sheds light on Ronald Reagan as president…of the Screen Actors Guild. Eliot documents a period of Reagan’s life that has been left largely unexamined by biographers, and in doing so, lends new insight into the qualities that made Reagan one of America’s most popular presidents. Patt and Eliot cover Reagan’s days as a Hollywood bachelor, his place in the “Irish Mafia,” and how Hollywood shaped a future president of the United States.
Guest:
Marc Eliot, author "Ronald Reagan: The Hollywood Years"
ON TAPE
[NPR NEWS]
2:00 – 3:00
How to Eat Supper
Lynne Rosetto Kasper has been sharing cooking tips on public radio for more than a decade. Her new book, “How to Eat Supper,” is a meditation on how to bridge supper traditions of yore with today’s busy schedules—creating a meal from one dish, a piece of bread, or those cans that have been sitting in your cabinet for over a year. Named one of the 12 best cooking teachers in America by the James Beard Foundation, Lynne brings her talent to life hosting American Public Media's "The Splendid Table." She’s here to talk about "How to Eat Supper," and to impart some of her wisdom to those cooks still in the kitchen.
Young performers from Holy Redeemer Catholic School in Montrose (8th Grade)
WHAT: Music Center Christmas Tree Lighting
WHEN: Monday, December 1, 2008 at 5:00 pm
WHERE: Los Angeles County Music Center
135 N. Grand Avenue
Los Angeles, CA 90012
(Thomas Guide p. 634, F3)
LOS ANGELES COUNTY-- Los Angeles County Supervisor Michael D. Antonovich will officially kick off the holiday season in Los Angeles County with the annual lighting of the County Christmas Tree on December 1, 2008 at 5 p.m. – continuing a special tradition begun by late Supervisor Kenneth Hahn in honor of the County’s children.
Supervisor Antonovich will be joined by talented young performers from Holy Redeemer Catholic School in Montrose, to help flip the switch to light the 50-foot tree.
“Throughout history, the Christmas Tree has been a symbol of life and hope for peace and prosperity,” said Supervisor Antonovich. “For people of all faiths, it represents a time for families and friends to gather together to renew the bonds of love that give us fulfillment and joy. As we light the County tree, we invite all of our County’s citizens to reflect on the glory of the season and share our celebration.”
The tradition of lighting a Christmas tree in the United States began over a hundred years ago. In 1923, President Calvin Coolidge started the National Christmas Tree lighting Ceremony, every year on the White House lawn.
LOS ANGELES COUNTY – Los Angeles County Supervisor Michael D. Antonovich will be sworn-in Monday for an eighth term on the Board of Supervisors representing the County’s Fifth Supervisorial District.
Michael Reagan, eldest son to President Ronald Reagan, talk show host and best-selling author, will serve as Master of Ceremonies for the swearing-in ceremony.
“It is my pledge to you that in my eighth term, I will continue to make Public Safety my Number One priority and fight for efficient, responsive County government to improve the quality of life for all County residents,” said Antonovich.
LOS ANGELES – Because of current rainfall, the County Health Officer is cautioning residents who are planning to visit Los Angeles County beaches to be careful of swimming, surfing, and playing in ocean waters around discharging storm drains, creeks, and rivers. Bacteria, debris, trash, and other public health hazards from city streets and mountain areas are likely to enter ocean waters though these outlets.
“Fortunately, discharging storm drains, creeks, and rivers only comprises a small portion of the beach, and therefore, anybody who wants to go to the beach will be able to enjoy their outing,” said Jonathan E. Fielding, MD, MPH, Public Health Director and Health Officer. “We do advise swimmers and surfers to stay away from the storm drains, creeks and rivers as there is the possibility that bacteria or chemicals from debris and trash may contaminate the water near and around these areas, and some individuals may become ill.”
Areas of the beach apart from discharging storm drains, creeks, and rivers are exempted from this advisory. This advisory will be in effect until at least Sunday, November 30th at 7:00 a.m. This advisory may be extended depending on further rainfall.
Recorded information on beach conditions is available 24-hours a day on the County's beach closure hotline: 1-800-525-5662. Information is also available online at our website: http://www.publichealth.lacounty.gov/beach/.
The Department of Public Health is committed to protecting and improving the health of the nearly 10 million residents of Los Angeles County. Through a variety of programs, community partnerships and services, Public Health oversees environmental health, disease control, and community and family health. Public Health comprises more than 4,000 employees and an annual budget exceeding $750 million. To learn more about Public Health and the work we do, please visit http://www.publichealth.lacounty.gov.
Grab some Thanksgiving leftovers and a spot on the couch next to grandma—it’s officially StoryCorps’ National Day of Listening! StoryCorps founder David Isay joins Patt to talk about his oral history project, which helps everyday people document their lives and those of their loved ones by asking the questions that matter. This holiday season StoryCorps wants you to sit down with the people around you—an older relative, a friend, a teacher, or a familiar face from the neighborhood, and listen to their stories. Isay hopes you’ll hear and celebrate the courage, humor, trials and triumphs in everyday lives.
Guests:
David Isay (EYE-say) - founder of StoryCorps; His new book is “Listening Is an Act of Love: A Celebration of American Life from the StoryCorps Project.”
1:20 – 1:40
And You Shall Know Us By The Trail of Our Vinyl
Over an eight year journey, Roger Bennett and Josh Kun scoured the world, collecting thousands of vinyl LPs from dusty attics, garage sales, and archives. Together, these once-loved and now long-forgotten audio gems tell the story of Jews in America, and are the subject of Bennett and Kun’s new book, “And You Shall Know Us By the Trail of Our Vinyl: The Jewish Past as Told by the Records We Have Loved and Lost.” From Chubby Checker’s re-recording of the Twist to the tune of Hava Nagilah, to Lena Horne singing in Yiddish, and Perry Como’s rendition of Kol Nidre, this book celebrates the cultural cross-pollination of America. Josh joins Patt to speak about his journey.
Guests:
Josh Kun, Co-author of “And You Shall Know Us By The Trail of Our Vinyl” and Associate Professor in the AnnenbergSchool of Communication at USC
1:40 – 2:00
Before You Hit the Parties, the Stores, and Your Loved Ones…
It’s Black Friday! But instead of shopping, we’re catching up with our veteran comedian Wayne Federman about his “Very Federman Christmas 3: The Annual Comedy-Music Holiday Show,” (read: a cage fight between Christmas and Hanukah). PattMorrison’s very own Comedy Congress has finally launched one of its own into stardom—but you’ll have to listen to find out how. Wayne joins Patt to talk about why he’s converted to Christmas and the sweet life of celebrity.
Guests:
Wayne Federman, “Committee Chairman” on Comedy Congress. Wayne’s appeared in movies like “Knocked Up,” guest-starred in “Curb Your Enthusiasm,” and is co-author of “Pete Maravich: The Authorized Biography of “Pistol” Pete."
[NPR NEWS]
2:00 – 2:30
An Imperfect Offering
In this searing memoir, former president of Doctors Without Borders James Orbinski explores the nature of humanitarian action and makes an urgent appeal to confront suffering around the world in a time of political and moral uncertainty. He gives a doctor’s indelible testimony from the front lines in Peru, Somalia, Afghanistan, Rwanda, Zaire, drawing on his own experiences as a medical student working in Rwanda, investigating the conditions of pediatric AIDS, and his work with Doctors Without Borders. Though it all, James Orbinski still believes in “the good we can be if we so choose.”
Guest:
James Orbinski, a former international president of Medecins Sans Frontieres (MSF)/Doctors Without Borders. He accepted the Nobel Peace Prize for MSF in 1999.
BY TAPE
2:30 – 2:3:00
Tried By War
It may be hard to imagine a time when the role of commander and chief was not seemingly all-powerful, but the constitution and historical precedent had little to say about the role before Abraham Lincoln assumed it. As the only president whose entire administration was book-ended by war, Lincoln furnished our modern idea of commander-in-chief as he went along, battle by battle, often overstepping the narrow rights granted to the president. Civil War historian James McPherson pays homage to Lincoln in light of his upcoming bicentennial and reveals a portrait of leadership in his study of this less chartered territory of Lincoln’s legacy, “Tried By War: Abraham Lincoln as Commander in Chief.”
It’s amazing how much the world can change in just seven months. Back on April 29th, Patt was broadcasting from the Milken Institute’s Global Conference as we were just starting to experience the first waves from the credit crunch and the bursting real estate bubble. Gas was still hovering around $4/gallon, Lehman Brothers and Bear Sterns were still respected Wall St. investment firms, and Peter Orszag was still director of the Congressional Budget Office. He's now the newly appointed director of the Obama’s White House Office of Management & Budget. Patt sat down with Orszag back in April and today we reprise a part of that interview to glimpse what to expect from the new Administration.
Guests:
Peter Orszag, director of the Congressional Budget Office; incoming director of the Office of Management & Budget—taped on Tuesday, April 29th
ON TAPE
1:20 – 1:40
Jetpack Dreams
Journalist Mac Montandon was once certain that by no later than the year 2000 humans would have traded in their beat up, gas-guzzling cars for shiny metal backpacks welded to jet engines. That disappointment lead him on a quest, from the first mention of the jetpack in a 1928 science fiction story, through modern Internet forums of jetpack enthusiasts and the Niagra Falls “International Rocketbelt Convention,” to the true story behind a bizarre mid-1990s case of kidnapping, imprisonment and murder—all in the name of the jetpack. Montandon joins Patt to speak about his journey writing “Jetpack Dreams: One Man’s Up and Down (But Mostly Down) Search for the Greatest Invention That Never Was” and the colorful pop history of this seemingly mythic machine.
Guest:
Mac Montandon: Author, “Jetpack Dreams: One Man’s Up and Down (But Mostly Down) Search for the Greatest Invention That Never Was”
ON TAPE
1:40 – 2:00
Ronald Reagan: From Leading Man to World Leader
In his new book, “Ronald Reagan: The Hollywood Years,” author Marc Eliot sheds light on Ronald Reagan as president…of the Screen Actors Guild. Eliot documents a period of Reagan’s life that has been left largely unexamined by biographers, and in doing so, lends new insight into the qualities that made Reagan one of America’s most popular presidents. Patt and Eliot cover Reagan’s days as a Hollywood bachelor, his place in the “Irish Mafia,” and how Hollywood shaped a future president of the United States.
Guest:
Marc Eliot, author "Ronald Reagan: The Hollywood Years"
ON TAPE
[NPR NEWS]
2:00 – 3:00
How to Eat Supper
Lynne Rosetto Kasper has been sharing cooking tips on public radio for more than a decade. Her new book, “How to Eat Supper,” is a meditation on how to bridge supper traditions of yore with today’s busy schedules—creating a meal from one dish, a piece of bread, or those cans that have been sitting in your cabinet for over a year. Named one of the 12 best cooking teachers in America by the James Beard Foundation, Lynne brings her talent to life hosting American Public Media's "The Splendid Table." She’s here to talk about "How to Eat Supper," and to impart some of her wisdom to those cooks still in the kitchen.
WHERE: Los Angeles County Waterworks District 40 customers in Lancaster and West Palmdale, Lake Los Angeles, and Acton.
WHEN: From 6:00 a.m. Sunday, December 7 to 6:00 a.m. Saturday, December 13.
WHY: Planned upgrade and expansion work at the Quartz Hill Water Treatment Plant will require a complete shutdown for six days, reducing water supplies by 60%. All customers will need to minimize use of water to avoid potential water shortages. Up to 80% of water is used outdoors so cutting back is crucial.
LOS ANGELES - Cold weather has arrived in Los Angeles County, and the Department of Public Health would like to remind residents to use safe methods to heat their homes. Never use a barbeque, stove, or oven to heat your house.
"Every year in LA County there are carbon monoxide poisonings from a barbeque, stove, or oven used as a source of warmth," said Jonathan E. Fielding, MD, MPH, Director of Public Health and Health Officer. "Using central heating, electric heaters, well-ventilated natural gas heaters or ventilated fireplaces are safer ways to stay warm. There are also places where people can go, such as public facilities or shelters, when the weather is too cold and other resources are not available."
Carbon monoxide is a colorless, odorless gas produced by stoves, barbeques, ovens, and gas-powered appliances (such as generators). Symptoms of carbon monoxide poisoning include shortness of breath, headaches, muscle and joint pain, and nausea. Exposure to high levels of carbon monoxide can lead to death within minutes. Those suffering from carbon monoxide poisoning should be taken outside, into fresh air, immediately, and should be taken to an emergency room for immediate medical treatment. Young children and seniors are especially vulnerable to the harmful effects of carbon monoxide poisoning.
When heating your home:
Check to make sure heating appliances are in good working condition before using them.
Furnaces and fireplaces should be checked to ensure that chimneys or flues are not blocked to allow for proper ventilation.
Install a carbon monoxide detector in your home to reduce the risk of poisoning.
If you use an outdoor generator, place it as far away from the home as possible, as carbon monoxide can seep into the home through windows, doors, and crawl spaces.
A winter shelter program is available for seniors and those looking for a place to beat cold weather. Locations and transportation information can be found on the Los Angeles Homeless Services Authority's website at: http://www.lahsa.org/year_round_shelter.asp, or by calling the LA County Information line at 2-1-1 from any landline or cell phone.
The Department of Public Health is committed to protecting and improving the health of the nearly 10 million residents of Los Angeles County. Through a variety of programs, community partnerships and services, Public Health oversees environmental health, disease control, and community and family health. Public Health comprises more than 4,000 employees and an annual budget exceeding $750 million. To learn more about Public Health and the work we do, please visit http://www.publichealth.lacounty.gov.
The Probation Department thanks St Didacus Catholic Church for opening its doors and allowing us to serve our community in this time of need. Our hearts and prayers go out to each of the families that were affected by the Sayre fire earlier this month.
WHEN: Thursday, November 27, 2008
Noon to 3pm
WHERE: St. Didacus Catholic Church
14337 Astoria Street
Sylmar, 91342
Thomas Guide Page 481 (J-5)
For more information, please contact event coordinator Patrick Hammond at |
Incidence and treatment of retinopathy of prematurity in England between 1990 and 2011: database study.
To study the incidence and treatment of retinopathy of prematurity (ROP) in England, 1990-2011. English national Hospital Episode Statistics were analysed, for babies born in hospital and for inpatient admissions, to obtain annual rates of diagnosis of, and treatment for, babies with ROP. National data on low birthweight (LBW) babies, born <1500 g and therefore eligible for ROP screening, were used as denominators in calculating rates of ROP per 1000 babies at risk. The recorded incidence of ROP increased tenfold, from 12.8 per 1000 LBW babies in 1990 to 125.5 per 1000 LBW babies in 2011. Tretment rates for ROP by cryotherapy or laser rose from 1.7 to 14.8 per 1000 LBW babies between 1990 and 2011. In 1990, 13.3% of babies with ROP were treated with cryotherapy, which fell to 0.1% in 2011. Rates for laser treatment rose from 1.8% of babies with ROP in 1999 to 11.7% in 2011. Increased neonatal survival, improved awareness of ROP and dissemination of guidance on screening and treatment of ROP will all have contributed to the substantial rise in recorded incidence of ROP between 1990 and 2011. Retinal ablation is now almost always performed using laser treatment rather than cryotherapy. |
Sterling Silver Ring with Pave CZ Fleur de Lis Charm
Sterling Silver Ring with Pave CZ Fleur de Lis Charm
ProductDiscontinued
SALE PRICE! $15
Regular Price: $28
Size
Product Info
Size & Materials
Shipping Info
Return Info
Recently Viewed
The Sterling Silver Ring with Pave CZ Fleur de Lis Charm is the perfect ring for someone who admires the beauty of the Fleur de Lis. The pave CZ Fleur de Lis that dangles from this simple sterling silver band is about 1/4 inch wide and is 1/2 an inch long. You will love the way this sterling silver ring looks on your hand! Pair this ring up with one of our matching fleur de lis necklaces to create a fabulous look!
Metal
sterling-silver
Charm Size
1/2 inch dangling Fleur de Lis
Approx Weight
2.5 grams
TCW
.33 carats
Stone Color
white
Stone Shape
round-brilliant-shape
Item Type
wedding-bands
Metal Stamp
925-sterling
Gem Type
cubic-zirconia
Material
NA
• First Class - FREE with orders over $50 | $5.95 - 2 to 5 Business Days
• Priority Mail - $8.95 - 2 to 3 Business Days
• UPS 2 Day Air (lower 48 states) - $16.95 - 2 Business Days
• UPS 2 Day Air (Alaska & Hawaii) - $19.95 - 2 Business Days
• UPS Next Day - $24.95 - 1 Business Day
• USPS First Class Canada - $12.95 | 7 to 10 Business Days
• UPS Canada - $35.00 - 1 to 3 Business Days
• UPS International - $60.00 - 1 to 3 Business Days
Eve's Addiction.com wants you to be a happy customer. We want you to be completely satisfied with the personalized jewelry or gift purchase that you receive from us. We do understand that you may not like your purchase for some reason.
You may return or exchange your item within 60 days of purchase if you are not satisfied with it. The jewelry must be returned in its original condition for a refund or exchange. Engraved, personalized, photo, monogram, name and initial, chocolate and clearance items are not returnable or exchangeable. |
1. Field of the Invention
The present invention relates to a polishing apparatus for polishing a workpiece such as a semiconductor wafer to a planar mirror finish, and more particularly to a polishing apparatus for polishing a workpiece by pressing a polishing pad or a grinding plate and the workpiece against each other while moving them in sliding contact with each other.
2. Description of the Related Art
Recent rapid progress in semiconductor device integration demands smaller and smaller wiring patterns or interconnections and also narrower spaces between interconnections which connect active areas. One of the processes available for forming such interconnection is photolithography. Though the photolithography process can form narrower interconnections, it requires that surfaces on which pattern images are to be focused by a stepper be as flat as possible because the depth of focus of the optical system is relatively small. It is therefore necessary to make the surfaces of semiconductor wafers flat for photolithography. One customary way of flattening the surface of semiconductor wafers has been to polish semiconductor wafers by polishing apparatus.
Heretofore, polishing apparatus for polishing semiconductor wafers comprises a turntable with a polishing pad attached thereto and a top ring for holding a semiconductor wafer to be polished. The top ring which holds a semiconductor wafer to be polished presses the semiconductor wafer against the polishing pad on the turntable. While an abrasive liquid is being supplied to the polishing pad, the top ring and the turntable are rotated about their own axes to polish the surface of the semiconductor wafer to a planar mirror finish.
FIG. 1 of the accompanying drawings shows a conventional polishing apparatus. As shown in FIG. 1, the conventional polishing apparatus comprises a turntable 5 with a polishing pad 6 attached to an upper surface thereof, a top ring 1 for holding a semiconductor wafer 4 which is a workpiece to be polished while rotating and pressing the semiconductor wafer 4 against the polishing pad 6, and an abrasive liquid supply nozzle 9 for supplying an abrasive liquid Q to the polishing pad 6. The upper surface of the polishing pad 6 provides a polishing surface. The top ring 1 is connected to a top ring drive shaft 8, and supports on its lower surface a resilient mat 2 such as of polyurethane or the like. The semiconductor wafer 4 is held on the top ring 1 in contact with the resilient mat 2. The top ring 1 also has a cylindrical guide ring 3 mounted on a lower outer circumferential surface thereof for preventing the semiconductor wafer 4 from being disengaged from the lower surface of the top ring 1 while the semiconductor wafer 4 is being polished. The guide ring 3 is fixed to the top ring 1 against relative movement in the circumferential direction. The guide ring 3 has a lower end projecting downwardly beyond the lower supporting surface of the top ring 1. The guide ring 3 holds the semiconductor wafer 4 on the lower supporting surface of the top ring 1 against dislodgment from the top ring 1 due to frictional forces developed between the semiconductor wafer 4 and the polishing pad 6 while the semiconductor wafer 4 is being polished.
In operation, the semiconductor wafer 4 is held against the lower surface of the resilient mat 2 on the top ring 1, and pressed against the polishing pad 6 by the top ring 1. The turntable 5 and the top ring 1 are rotated about their own axes to move the polishing pad 6 and the semiconductor wafer 4 relatively to each other in sliding contact for thereby polishing the semiconductor wafer 4. At this time, the abrasive liquid Q is supplied from the abrasive liquid supply nozzle 9 to the polishing pad 6. The abrasive liquid Q comprises, for example, an alkaline solution with fine abrasive grain particles suspended therein. Therefore, the semiconductor wafer 4 is polished by both a chemical action of the alkaline solution and a mechanical action of the fine abrasive grain particles. Such a polishing process is referred to as a chemical and mechanical polishing (CMP) process.
Another known polishing apparatus employs a grinding plate made of abrasive grain particles bonded by a synthetic resin for polishing a workpiece. The grinding plate is mounted on the turntable, and an upper surface of the grinding plate provides a polishing surface. Since this polishing apparatus does not employ a soft polishing pad and a slurry-like abrasive liquid, it can polish the workpiece to a highly accurate finish. The polishing process by the grinding plate is also advantageous in that it is less harmful to the environment because it discharges no waste abrasive liquid.
The conventional polishing apparatus shown in FIG. 1 has a spherical bearing 7 positioned between the top ring 1 and the top ring drive shaft 8. The spherical bearing 7 allows the top ring 1 to be tilted quickly with respect to the top ring drive shaft 8 even when the top ring 1 encounters a small slant on the upper surface of the turntable 5. The top ring drive shaft 8 is kept in driving engagement with the top ring 1 by a torque transmission pin 107 on the top ring drive shaft 8 and torque transmission pins 108 on the top ring 1. The torque transmission pins 107, 108 are held in sliding point-to-point contact with each other. When the top ring 1 is tilted with respect to the top ring drive shaft 8, the torque of the top ring drive shaft 8 is smoothly and reliably transmitted to the top ring 1 because the torque transmission pins 107, 108 change their point of contact while transmitting the torque.
The above conventional polishing apparatus are problematic in that while polishing a workpiece, the polishing apparatus suffer large vibrations owing to frictional forces developed between the turntable and the top ring with the workpiece interposed therebetween. An analysis suggests that such large vibrations are caused by a combined action of resistant forces by the rotating top ring and the rotating turntable which are rotated independently of each other, such resistant forces being dependent on frictional forces developed between the surface of the workpiece and the surface of the polishing pad or grinding plate, and restoring forces exerted by the top ring drive shaft and a turntable drive shaft.
When the vibrations become large, the polished surface of the workpiece develops polish irregularities or scratches or other surface damage, and hence the workpiece cannot be polished stably. The vibrations may become so intensive that the workpiece may be forcibly detached from the top ring and no longer will be polished. |
/*
* This file is part of WebLookAndFeel library.
*
* WebLookAndFeel library 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 3 of the License, or
* (at your option) any later version.
*
* WebLookAndFeel library 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 WebLookAndFeel library. If not, see <http://www.gnu.org/licenses/>.
*/
package com.alee.demo.api.example;
import com.alee.api.annotations.NotNull;
import com.alee.extended.tab.DocumentData;
import java.util.HashMap;
import java.util.Map;
/**
* @author Mikle Garin
*/
public final class ExampleData extends DocumentData
{
/**
* Examples data cache.
*/
private static final Map<String, ExampleData> cache = new HashMap<String, ExampleData> ();
/**
* Example this data represents.
*/
@NotNull
private final Example example;
/**
* Constructs new example data.
*
* @param example example to construct data for
*/
private ExampleData ( @NotNull final Example example )
{
super ( example.getId (), example.getIcon (), example.getTitle (), example.createContent () );
// todo setForeground ( example.getFeatureState ().getForeground () );
this.example = example;
}
/**
* Returns example this data represents.
*
* @return example this data represents
*/
@NotNull
public Example getExample ()
{
return example;
}
/**
* Returns new or cached example data.
*
* @param example example to retrieve data for
* @return new or cached example data
*/
@NotNull
public static ExampleData forExample ( @NotNull final Example example )
{
final String id = example.getId ();
if ( !cache.containsKey ( id ) )
{
cache.put ( id, new ExampleData ( example ) );
}
return cache.get ( id );
}
} |
This page displays photos sent in by our viewers.
A narrative and credit are given where possible.
Please enjoy!
"Brooklyn Supreme"
The world's largest horse at 19.2 hands and 3,200 lbs. "Brookie" wore a 40-inch collar and boasted a girth measurement of 10 feet, 2 inches around. It took 30 inches of iron for each of his horseshoes. Foaled in 1928, he eventually became the property of C.G. Good of Iowa. Good's partner, Ralph Fogleman, exhibited the big horse around the country, charging spectators 10 cents apiece. Brookie died in 1948.
Photo by Sharon Michael of Stallion Station's Kaleidoscope Farm
Gray Percheron stallion in show harness. Taken at the Nevada draft horse and mule show in Nevada during the mid-80s.
'Lovesong Bo'
He is a 10 year old registered Percheron stallion. When I first saw him 6 years ago, he was a dark dappled grey - he now looks like a different horse as he is pure white. He is definitely a gentle giant. He is very well mannered. Jan
P.S. That's me in the picture with him. - Apple Branch Ranch - Unity, Maine
This is a photo I took last Sunday near Waterloo, IA of Amish Draft Horses resting on a sandy creek bank.
These are horses who really work for a living. Contributed by Susan of Susan's Arabians and Pintos/ Thanks Susan!!
Bear Valley Miniature and Draft Horses
We farm about 40 acres mostly with our Belgian Draft Horses. Here are a few pictures for you to view of our Gentle Giants. Our farm is located in S.E.MN. At the present time we have 5 Belgians and are expecting 2 foals next year. My husband Lloyd is in the pictures driving the horses. They are his pride and joy as they are very hard working horses and very loyal to their owner.
Thanks to Betty and Lloyd Budensiek for sharing these wonderful photographs with all of us Gentle Giants lovers!!
--
My name is Denise Bell-Evans, and attached is a photo of myself and my 2 yr old Belgian stallion
GRAYHAVEN'S SPIKE.
He will be 2 yrs in June (2001) and stands 16.3+ hands at this time. I have owned many different breeds through the years and at this time have Paints, Thoroughbreds and Appaloosas. I love them all, but I have to say that if Spike is a typical Belgian, everyone should own one! He is quiet (even around mares in season), intelligent, kind, and much much more. Because of him I am now hooked on this breed and am expecting to purchase Spike's sister very soon!
I would love it if this photo could be added to the gentle giants page. I think it just conveys, somehow,
the kindness of Spike and the breed.
Thank you very much, Denise
P.S. I met my NOW husband through RURAL SINGLES ! Thank you, thank you, thank you!!!!
I would be very proud if you place a picture of my 7 year old clydesdale gelding "DUNCAN".
We are living in the Netherlands. I own him for a year now and I'm so happy with him.
Many thanks - Liesbeth Wesdijk.
I was thrilled to see the photo of Brooklyn Supreme in this site. My father worked for Ralph Fogelman in the 30s as a handler / groomer for these Gentle Giants as they were shown at Iowa county fairs and other venues thru out the state. Dad would ride in the boxcar with the horses as they traveled by train. I'm submitting a picture of four other horses they showed. (that's my father holding the lead on the fourth horse.) He has named them on the back of the picture:
Left to right: Tatton Coming King; Tatton Treasure; Tatton Blossom and Tatton Sun Beam. Unfortunatly there is no date supplied but it has to be in the late 1920s or early 30s. I recall him telling of one of the horses being poisoned at a fair; perhaps it was Brooklyn Supreme...I don't remember. He loved these horses!
Dorothy Shupe Sheehan
Phoenix, AZ
Another beautiful piece of art by Adeline Halvorson.
"Diggin' In" by Adeline Halvorson
Loyal Partner by Adeline Halvorson
Thundering Hooves by Adeline Halvorson
A Moments Rest by Adeline Halvorson
At Ease by Adeline Halvorson
|
Inequality is a big, big subject. There's racial inequality, gender inequality, and lots and lots of other kinds of inequality. This is Econ, so we're going to talk about wealth inequality and income inequality. There's no question that economic inequality is real. But there is disagreement as to whether income inequality is a problem, and what can or should be done about it.
It is interesting to see how unequal some income is for people around the world. Especially in countries like China and India that have some of the world's largest populations. These same countries also have some of the lowest incomes in the world for the majority of their citizens. Adding to that, it is intriguing to see how only a small percentage of people hold most of the wealth in the world, while the vast majority of the world population aren't even close to that level of wealth. While the income inequality gap has increased significantly since the time of the industrial revolution and continues to grow bigger.
"Obesity is a global problem, but more people are getting fatter in developing countries than anywhere else. If current trends continue, obese children will soon outnumber those who are undernourished. Nearly half of the world’s overweight and obese children under five years old, live in Asia. And in Africa, the number of overweight children under five has increased by nearly 50% since 2000. Hunger still blights many parts of the world. But the share of people who do not have enough to eat is in decline. Globally one in nine people in the world suffer from chronic undernourishment. One in ten are obese. If current trends continue, the share of obese children in the world will surpass the number of undernourished by 2022. Africa has the fastest-growing middle class in the world. A move from traditional foods to high-calorie fast food and a more sedentary lifestyle is driving the rise in obesity. Health systems in Africa, more focused on treating malnourishment and diseases like malaria and HIV, are ill equipped to deal with obesity-related illnesses like heart disease and diabetes. "
This video has taught me some new facts in regard to the obesity crisis going on in the world. Growing up, I would hear so much about the obesity crisis here in America and how the rest of the world is so healthy for the most part. This video has given me a new perspective on the current obesity crisis, and that it isn't just an American problem anymore, but is now becoming a global problem.
One part of this video in particular which stood out to me was that in all of these developing nations that are suddenly becoming obese, American fast food chains are embedding themselves in their societies. It's no wonder that obesity is no longer just an American problem, but becoming a wold crisis since all of these American fast food chains are moving into these developing nations. It seems as though if the world wants to see a decline in obesity, we must stop eating so much processed food from these types of restaurants and get the proper amount of exercise needed for a healthy lifestyle.
“China’s president, Xi Jinping, wants to be able to challenge America’s military might in the western Pacific. He is making big progress. China’s once bloated armed forces are becoming leaner and a lot more capable. They are also benefiting from a defense budget that is growing at a steady 6-7% a year, in line with GDP. The IISS declares that China has become an innovator in military technology and is not merely ‘catching up’ with the West. For some of the most advanced science, Mr. Xi is tapping the private sector. The Pentagon has to woo skeptical Silicon Valley companies; firms in China do what the government tells them to do. In two years’ time, if not before, America is likely to lose its monopoly of radar-beating stealth combat aircraft with the introduction into service of China’s Chengdu J-20.”
From reading this article, it is clear for one to see that China is not just "catching up" to America with their military technology, but are becoming a true rival. The President of China is clearly putting a larger emphasis on restructuring the Chinese military. The Chinese government is also trimming the fat their military has had before in the past and creating a larger, more organized budget for their military branch. One major advantage China has over America, is that its private sector non-state tech firms have to do what their government tells them to do. Unlike the American government where they have to create deals and contracts with non-state tech firms for new military technology. This allows China to demand whatever they want from their tech firms in order to advance their military technology. Although, as long as American tech firms continue improve in their technology at an advanced rate and maintain a good relationship with the American government, the U.S. military will continue to be a strong rival in the present day arms race. It remains clear though, that America will indeed have to break a sweat in order to supersede China in regards to advancement in military technology.
"Algeria’s ‘lost generation’ has been shaped by years of conflict, unemployment and state repression. Sheep fighting offers an arena where young men can escape the constant supervision of the state."
Seth Dixon's insight:
I must confess that it was a mixture of morbid curiosity, the allure of the strangely exotic, with more than a dash of horror that initially impelled me to read this article. If if is not your thing (and I'm guessing that by the title you should already know), I certainly understand and don't recommend that you read it. However, there was some intriguing geography in the article as it painted a bleak picture of disenfranchised young men in a pent-up country that did not experience an Arab Spring. Some elements in this article that I thing might intrigue geography teachers are: the pastoral folk culture of North Africa impacting their popular culture pastimes, complexly gendered cultural customs and place-based cultural politics.
Scientists using high-tech, airplane-based lidar mapping tools have discovered tens of thousands of structures constructed by the Maya.
Archaeologists have spent more than a century traipsing through the Guatemalan jungle, Indiana Jones-style, searching through dense vegetation to learn what they could about the Maya civilization. Scientists using high-tech, airplane-based lidar mapping tools have discovered tens of thousands of structures constructed by the Maya: defense works, houses, buildings, industrial-size agricultural fields, even new pyramids.
The lidar system fires rapid laser pulses at surfaces and measures how long it takes that light to return to sophisticated measuring equipment. Doing that over and over again lets scientists create a topographical map of sorts. Months of computer modeling allowed the researchers to virtually strip away half a million acres of jungle that has grown over the ruins. What's left is a surprisingly clear picture of how a 10th-century Maya would see the landscape.
This article is not only about our expanding knowledge of Mayan civilization, although it is fascinating that experts are learning more about the cultural and historical geography of Guatemala. It also highlights some problems that physical geography can sometimes pose to researchers, and the solutions that are becoming possible because of improving technology. Archaeologists, rather than hiking through dense forests on the off chance of happening upon something recognizable as an ancient structure, can now use laser imaging to see past the overgrowth.
This article is particularly interesting because it not only claims to change the way we think of the Mayans, but it also describes the methods used for unearthing the ruins of a civilization that has been lost. By using the Lidar system, archaeologists were able to discover a city with thousands of houses, pyramids and other buildings.
Archaeologists are using new high-tech, airplane-based lidar mapping tools to discover Mayan structures that have gone undetected for hundreds of years. This new method for archaeology has proved very successful as well, since tens of thousands of hidden Mayan structures have been detected using these new tools. This helps paint a different picture of what Mayan civilization was really like. For example, archaeologists now believe that the Mayan civilization may have had a population two to three times the size originally estimated and a much larger extension of land than previously thought. At the end of this article, what really made me think was how the Guatemalan jungle once hindered archaeologists from discovering Mayan structures, but now the jungle is seen as useful in preserving these structures over time, so they are not destroyed by people. It seems as though there is still much to learn about the Mayan civilization and their culture.
"The Story Map Swipe and Spyglass app template enables users to interact with two web maps or two layers of a single web map, depending on how you build your story. The app enables you to present a single view, or to develop a narrative showing a series of locations or views of the same maps."
"A fitness tracking app and national security don’t seem to be connected, and yet this month, the Pentagon has spent serious time discussing how to mitigate the impact Strava’s global data set being post online."
Seth Dixon's insight:
Geospatial intelligence is a knife that cuts both ways. We must consider all the possible ramifications of what might happen as we repackage, render and display geographic information.
Questions to Ponder: What are three discernible patterns that you can identify by analyzing the Strava Heatmap? What does this particular case study show for cartographers and others interesting in creating spatial information? What does this say for regular people now fully immersed in the midst of a geospatial revolution?
"The U.S. Census Bureau has designed a multimedia application experience, a story map, called 'Rural America: How Does the U.S. Census Bureau Define Rural?' This story map contains interactive web maps, tables, information, and images to help explain how the Census Bureau defines 'rural.' Many rural communities rely on American Community Survey (ACS) 5-year estimates, rather than ACS 1-year estimates, because of population thresholds. This story map helps data users understand the history and definition of 'rural.' Watch this video and then visit the story map to learn more." Visit the Story Map: http://go.usa.gov/x8yPZ
Seth Dixon's insight:
Census geography brings statistical data to life as seen in their newly designed interactive story map, called "Rural America: How Does the U.S. Census Bureau Define 'Rural?" Not only does this story map helps explain how the Census Bureau defines rural, but it displays some fantastic data that helps students to explore rural America. Many APHG teachers refer to unit 5 as the "ag unit" but the full title, Agriculture, food production, and rural land use, certainly does highlight why this can be a valuable resource.
The U.S. Census Bureau defines "rural" as an area with less than 50,000 people living in it. The majority of the United States is actually considered rural while a small minority of the country is labeled as urban. But interestingly enough, most rural areas are clustered around urban areas rather than in random locations. It seems as though the further out one ventures out from the center of an urban area like a major city, the more the population begins to decrease. One can also see in the same situation, the area transition from urban to rural. U.S. Census data can tell us a lot about populations in rural and urban areas and the correlation between them which can be important to know for many reasons.
Improving skills in literacy and numeracy are vitally important components of school education. But it is wrong to assume that these can only be achieved by teaching English and Mathematics respectively. Many other subjects can and do teach these skills using real life examples. Geography is one of these subjects. Articulating orally and in writing one’s understanding of the world is one sure way of increasing literacy. Collecting, analysing and using information about the world increases students’ numeracy, and gives them a better grounding as citizens and future employees. But geography is much more than this. Surely we should aspire to our children and grandchildren having a greater understanding of their world: what is happening around them, analysing the causes and assessing solutions?"
Seth Dixon's insight:
I know that understanding the importance of geography is nothing new to my readers, but I am gathering articles that are useful to share with administrators and colleagues in the fight against geographic ignorance. One this site I've tagged these articles under tag "geography matters."
In this article, Roger Crofts explains how in most schools the main subject focus for students is literacy, math, science, and sometimes a foreign language. While social sciences such as geography usually get put on the back burner in the education system. He also makes the argument that geography helps teach imperative skills like literacy and math which is why this subject should have more of an emphasis in school settings. In response to Crofts' article and from my own experience in public schools, his article lines right up with what I was taught when I was younger. When I was in high school, there was a heavy push to learn math, literacy, and science, and also to be tested on these subjects with standardized tests. I feel that there should be a heavy emphasis on these subjects in schools, but there should also still be room for other classes that are creative and help to mold well rounded individuals. Furthermore, I believe this could become possible if standardized tests occurred less and more focus was put on the actual student rather than their standardized test scores.
This article talks about the many fake maps arising on the internet in order to get likes or for people to re-share it. Many times there are maps with incorrect data going around on the internet because some people want their content to go viral so bad they are willing to make up statistics in order for it to do so. This is why it is always important to check the sources for content you come across, and not just believe every piece of material you come across on the internet. Too many times people are misled by false information on the internet because they don't check the source it came from. As technology like the internet becomes more advanced, hopefully we will become more skilled at discerning false information such as fake maps on the web.
I've never really wondered which parts of the country produce the milk I consume on a regular basis. But as the maps in this article show there are certain parts of country that are densely populated with cows for the sole purpose of producing milk. This article also indicates that the "cow islands" in the Southeastern part of the United States are becoming smaller, while the density of the "cow islands" in the Northern and Western parts of the country are increasing at a significantly steady rate. While reading this article, I learned more about where the most cows in the U.S. are producing milk and how that might affect the price of the milk I buy.
"Before it could publish an issue on race, the magazine first had to look at its own history. 'Some of what you find in our archives leaves you speechless,' writes editor Susan Goldberg. The 1916 caption of the picture of these aboriginal Australians described them as 'savages who rank lowest in intelligence of all human beings.'"
Seth Dixon's insight:
This is both incredibly obvious, and remarkably shocking. I don't think that any academic geographic should be surprised that for generations, National Geographic's goals to describe the world's people and it mission to sell magazines made its coverage a product of the cultural norms of the times, the magazine producers and subscribers. Still, this open honesty coming from National Geographic about National Geographic's past is a breath of fresh air that is quite encouraging, even if some still think that National Geographic's issue and cover miss the mark.
Questions to Ponder: Are there some voyeuristic tendencies we might exhibit as well learn about, or discuss other cultures? How do we highlight culture differences without making making those with different cultural practices seem as innately 'other' or 'less than?'
"Dollar General stores thrive in low-income rural towns, and the deep-discount chain has opened hundreds of new shops in the past year."
Dollar General is set to open 1,000 locations this year, for a total of more than 14,000 stores. It will have more stores than McDonald's has restaurants in the entire country. That includes plenty of urban locations, but the chain's bright yellow and black signs pop up about every 10 miles along many remote state highways. Like Walmart, it has rural roots. Dollar General started in small-town Kentucky. Al Cross, who runs the Institute for Rural Journalism at the University of Kentucky, says Dollar General competes with the world's largest retailer on price and convenience.
I found this article to be very relevant since the first Dollar General store I've ever seen just popped up within the last year in Rhode Island. Apparently Dollar General is such a big chain in the rest of the country, that it has more stores than Walmart does. According to this article, there are certain advantages and disadvantages of Dollar General building stores in the rural parts of the country. For example this article talks about how people in some rural areas have towns that are so small they don't have any local grocers. So when a Dollar General is built in a town like that, it is a huge benefit to the town. In other cases with small towns that already have a local grocery store, Dollar General can put that store out of business with the difference in their prices. Ultimately, whether or not Dollar General's expansion into rural areas of the U.S. can be seen as negative or positive depends on the local business structure in those small towns.
"Are American's trashing the English language? The Economists language expert, Lane Greene, knows a thing or two about English. Lane is a fan of words, lots of words, and Lane is an American living in London. He's become accustomed to British English slang. But Lane often hears Britons complain that there are too many American words and expressions creeping into British English, these are called Americanisms. British writer Matthew Engel can't stand Americanisms being used in Britain and even wrote a book about it. But are Americanisms trashing British English?"
Seth Dixon's insight:
This video touches on important cultural and spatial dynamics of the linguistic change impacting the world's current lingua franca...in other words, this is incredibly relevant to human geography.
I found this video very enjoyable to watch and I learned a lot more about how British people feel about the American language, especially in their own culture. I knew that American English and British English had some small differences with the spelling of some words and differences in some terms for the same object such as lift and elevator. But I didn't realize how some American phrases or "Americanisms" have crept into the British English language and are causing some English citizens to be upset about it.
In response to this information, I have to side with Lane Greene's opinion towards the end of this video. The fact that "Americanisms" are creeping into the British English language is the sign of a healthy and developing language. It means that one language that is being affected by another language because it has a global reach throughout the world. This is a positive thing that shouldn't be feared because as we can see from history, languages change over time and tend to never stay the same.
"As the container shipping industry continues to boom, companies are adopting new technologies to move cargo faster and shifting to crewless ships. But it’s not all been smooth sailing and the future will see fewer players stay above water."
I found this video to be quite informative about the process of shipping goods throughout the world. I didn't know that 95% of world wide goods are shipped in container vessels. I also never really put much thought into how goods were shipped before watching this video. One piece of information that stuck out to me was that not too long ago ships would spend more time loading cargo at ports than they would actually traveling. That was until the idea of using containers to ship goods on top of shipping vessels was developed. It seems like such a simple idea, but is truly one that has changed the shipping industry forever. This container system saves time, energy, money, and is indeed the most effective way to ship goods throughout the world.
"150 years after its unification, Italy remains riven by regional differences." For more of these videos, visit http://arcg.is/1IeK3dT
Seth Dixon's insight:
Italy’s a country that we may think of as monolithic, but (like so many other countries) it has some deep and persistent regional distinctions. These videos are older, but the the divisions discussed are still pertinent. Stratfor also added a video of Italy in their "Geographic Challenge" series. I've updated my map which spatially indexes 70+ of their videos that are especially relevant to geography teachers to include this one. These videos are great starting points for students that are researching a particular country.
I had a friend in middle school and high school who's father was an Italian immigrant. He was from Turin, which is very far north. My friend always used to call people from Southern Italy, and specifically Sicily, things like gangsters and ghetto. I used to think it was kind of silly. This video reminded me of my friend and now I can more fully understand why she had that point of view. The north of Italy is more financially stable than the south and enjoys much lower rates of unemployment. Another noteworthy point that this video brought up was the language diversity among Italians. For whatever reason I have always thought of everyone in the country speaking mainstream Italian, when in reality there are many dialects that are so different, Tuscans may have no idea what Sicilians were saying. My friend must think that since southern Italians are not as wealthy and may not speak the same type of Italian she knows, they must be inferior. The fact that the North is more financially well off has lead the number of Prime Ministers from the north to be far greater than the south. All of these factors create tension between the north and the south. This just goes to show that just because a geographic region is considered to be the same country, it does not mean that it is strongly united or the same throughout.
What is interesting about Italy is that the region it is in has been around for and has influenced world culture for thousands of years. But Italy as a nation is fairly new as it was only developed into a unified state 150 years ago. What is also interesting about Italy's geography is that many cultural and economic trends differ from the Northern part to the Southern part of the country. For example, a person in Northern Italy is likely to make twice as much income as someone in Southern Italy. Adding to that, as far as culture goes, there is also a division among the different dialects throughout the North and South of Italy as well. As a result of this information, one can see how important it is to not lump an entire nation into one category for it is made up of various elements from the different divisions and opinions among it's people.
"While the Korean War of the early 1950s never formally ended, its aftermath has created starkly divergent worlds for those living on either side of the north-south divide. What follows is a look at life in the two Koreas; how such a night-and-day difference came to be; and where the crisis could go from here. Both governments claimed to be the legitimate rulers of the peninsula. Tensions between north and south gradually mounted, until finally, in June 1950, hundreds of thousands of North Korean troops stormed across the 38th parallel. The unsuspecting South Korean defenders were outgunned and outnumbered, and beat a hasty retreat southward."
Seth Dixon's insight:
This excellent interactive was created by Esri's Story Maps team using the Story MapCascadeapp--making it an great resources of the geography of the Korean Peninsula as well as a stellar example of how maps, infographics, videos, images and text can be combined using ArcGIS online.
"Play this interactive game--move the 15 red countries to their appropriate locations to turn the countries green. If you give up, you can double click on a red country to locate it (but it will turn blue)."
Seth Dixon's insight:
The old link to this map quiz no longer works but here is a new version. This online game where you return the “misplaced” country on the map is more than just and exercise in locating places (there are many online map quizzes for that sort of activity). What makes this one unique is that as you move the country further north or south the country expands or contracts according to how that country would be projected if that were its actual location on a Mercator map. This is a great way to introduce the importance of map projections.
This is an interesting quiz to test your world geography skills. It gives you the shape of a country in red and you have to place the shape on the correct country. If you can't find the correct country, just double tap the shape and it will show you which country it belongs to. This was definitely a challenge for me since I only got two of the countries correct. I found particular difficulty with locating the smaller countries with less features that stand out. Although I only got two answers right, I did enjoy this map quiz because it helped me to realize that I should brush up on my world geography skills more to help me stay informed with what's going on in the world.
A shortage of developable land have pushed Hong Kong's housing prices skyward, leading some to live in spaces the size of closets.
Seth Dixon's insight:
Overpopulation doesn't feel like a serious issue when you live in a land characterized by wide open spaces, but in some densely settled urban centers, the issues become quite personal. Hong Kong is currently facing a housing shortage. This article nicely explains the difficulties that living in the so-called coffin homes makes for the residents. This photo gallery humanizes this difficult living condition.
The photo gallery in this article helps to give an accurate depiction of the housing crisis in Hong Kong with many people living in units that are 4 by 6 feet. Many families have to live in separate units because they are so small and can't usually fit more than one person. The bright side of the housing crisis in Hong Kong is that these "coffin homes" allow people to live in the major city at a cheaper cost, although it definitely comes with a hefty price with such tiny living quarters. The future looks positive though, as Hong Kong promises to build over 400,000 new homes over the next decade. This will help improve the housing crisis and hopefully phase these "coffin homes" out of existence once and for all.
In May 2013, GeoGuessr came online and quickly became a favorite quiz game of geo-enthusiasts. Using 5 random locations in Google Street View. The game player can search the area in Street View and then make a guess as to where it is on the map. Using GeoSettr, you can create your own GeoGuessr challenge by choosing five locations on Google Street View.
Seth Dixon's insight:
You can customize your own GeoGuessr quizzes now, as others pan and zoom in the StreetView to explore the landscape you selected and find more context clues as to where that location is. Try my sample quiz that I made based on these 5 clues.
The best place to get clam cakes and doughboys in RI
My hometown is home to this center of athletic excellence
This monument was a part of my research in this Latin American city
This is where I went to school to get my Ph.D.
Home to the movie “Close Encounters,” this National Monument has always fascinated me.
"As neighborhoods, restaurants and museums become more photogenic, are we experiencing an 'Instagramization' of the world?"
Penang is one of a number of cities capitalizing on the wild popularity of photo-based social media apps such as Instagram, which has 800 million users (that’s more than a tenth of the world’s population). It’s part of a wider phenomenon of public and private spaces being designed to appeal to users of such apps. This phenomenon is subtly changing our visual landscapes—on the streets, in restaurants, in stores, in museums and more. Call it the “Instagramization” of the world.
Restaurants have been at the forefront of Instagramization. Since social media mentions can make or break a restaurant’s success, owners have become attuned to what visual aspects of food and décor appeal to customers. Restaurant designers are going for photo-friendly background materials like slate and whitewashed wood, and using plain white plates. Some are deliberately incorporating Instagram-appealing visuals that feature the restaurant’s name or logo—floor tiles, neon signs—hoping they’ll wind up in a snap.
Over the course of years Instagram has become increasingly popular and especially in Penang. Penang is one out many cities capitalizing on photo based social media such as Instagram. This phenomenon is changing our landscapes, streets, museums, in restauraunts and stores. We call it Instagramization.
I am admittedly a little bit torn on whether this is a good or bad thing. This "Instagramization" does drive art and restaurants to look better, but is it for the right reasons? I have an Instagram, and I do these very same things, but I still have to question the motivations. Are we appreciating art again for the right reasons? Long ago we as humans had an appreciation for art stretching all the way back to cave paintings on walls, long before social media. This trend of only now getting so much into art seems to be more for personal branding, showing off, and trying to impress our friends/followers, maybe even impress ourselves on a deeper level. If we did not hashtag and get likes for our artsy pictures, would we still be so ready to post them, or love them? Do we love the creative world around us? Or do we love what the art around us does for us? There is nothing really wrong with either, but it is a question to consider. The restaurants and tourist spots would probably say "Who cares?" and who could really blame them? They benefit, which is a great thing. I guess when it comes down to it, whether it is for ourselves or for a love of various forms of expression, it is a nice thing that humanity is getting into art again.
This article helps to explain the interesting topic of social media in this current age and how it is shaping our culture. Author of the article Emily Matchar points out how many places in big cities are becoming more and more visually appealing for tourists and customers to come and take pictures for Instagram. She further gives examples of this by how restaurants are putting much more thought into designing their establishments than ever before in hopes that their customers will take a picture there and upload it Instagram. These, restaurants are also creating dishes and beverages that are more colorful as well as pleasing to look at to encourage their customers to post a picture of their food online. Posting these pictures online benefits these restaurants by helping increase their presence online leading to a potentially larger customer base. Matchar goes on to say how this not only changes the way restaurants are trying to use social media to their advantage, but how many other businesses and public places are trying to as well. Pointing out that even museums are coming up with more interactive exhibits for attendees to take pictures of. Overall, I found that this article had an insightful view into the power of social media and how it is molding the way we look at things in our world.
The ice in the Arctic is disappearing. Melting Arctic ice means new economic opportunities: trade routes in the Arctic ocean, and access to natural resources. Because of this, the Arctic nations are now moving to expand their border claims. Russia has shown that it’s the most ambitious, using a potent combination of soft power and military buildup to advance its agenda. They’ve said the Arctic is rightfully theirs.
Seth Dixon's insight:
This video is the second video in "Vox borders" series that is shaping up to be an excellent resources for geography educators. This focus is on Svalbard and Russia's designs within the Arctic, but this TestTube episode is a shorter version that emphasizes how receding summer ice is being seen as an economic opportunity for all maritime claims in the Arctic. Canada, the U.S., Russia, and Denmark (Greenland) all are subtly expanding their maritime claims.
Questions to Ponder: How do borders impact the develop/preservation of the Arctic? How should uninhabited lands and waters be administered politically?
Since the 1980's a significant amount of ice in Antarctic ocean has melted away. This is a big deal because this is causing the changing of borders in this part of the world. With all the ice melting in Antarctica, this opens up new shipping lanes with much faster routes. This also makes it much easier for to drill for natural resources such as gas and oil, that were once difficult to get to because they were covered in ice. This is causing countries like Russia, Canada, Finland, and others to desire for new borders to be drawn up, hopefully in favor of their nation. Russia has even started developing military bases on some of the coast line that is opening up in Antarctica. It will be interesting to see how the borders in the Arctic circle are going to change and how it will also effect world trade in that part of the world.
"What is the difference between 'a hearty welcome' and 'a cordial reception'? In a brief, action-packed history of the English language, Kate Gardoqui explains why these semantically equal phrases evoke such different images."
Seth Dixon's insight:
This TED-ED video (and lesson) shows how the connotations of English words often times depend on the linguistic root (sweat--Germanic, perspire--Latin). English has obviously changed much over the years, but this other TED-ED video (and lesson) also shows some good language family information and traces it back to proto-Indo-European roots.
It is very interesting to see how far the English language has come and how much is has changed over the past 1600 years. Adding to that it is intriguing to see what other languages had an influence on English. I knew that German and English were very similar languages which made sense that German had a large influence on the English language. Although, it did take me by surprise that French has made quite an impact on English as well. Also, that royal Englishmen spoke French for three centuries. That piece of information shocked me since France and England have had such a historic rivalry that lasted for centuries. Overall, I enjoyed this video and the border maps helped me to better understand the evolution of the English language.
Hinduism shares an intricate, intimate relationship with the climate, geography, and biodiversity of South Asia; its festivals, deities, mythology, scriptures, calendar, rituals, and even superstitions are rooted in nature. There is a strong bond between Hinduism and South Asia’s forests, wildlife, rivers, seasons, mountains, soils, climate, and richly varied geography, which is manifest in the traditional layout of a typical Hindu household’s annual schedule. Hinduism’s existence is tied to all of these natural entities, and more prominently, to South Asia’s rivers.
Hinduism as a religion celebrates nature’s bounty, and what could be more representative of nature’s bounty than a river valley? South Asian rivers have sustained and nourished Hindu civilizations for centuries. They are responsible for our prosperous agriculture, timely monsoons, diverse aquatic ecosystems, riverine trade and commerce, and cultural richness. Heavily dammed, drying in patches, infested by sand mafia and land grabbers, poisoned by untreated sewage and industrial waste, and hit by climate change — our rivers, the cradle of Hinduism, are in a sorry state.
If there is ever a threat to Hinduism, this is it. Destroy South Asia’s rivers and with it, Hinduism’s history and mythology will be destroyed. Rituals will turn into mockery, festivals, a farce, and Hinduism itself, a glaring example of man’s hypocritical relationship with nature. The fact that we worship our rivers as mothers and then choke them to death with all sorts of filth is already eminent.
Seth Dixon's insight:
This might be a controversial op-ed because it has a strong perspective on the religious and environmental dimensions of modern Indian politics...that said, I think it is well worth the read. The Ganges is both a holy river, and a polluted river; that juxtaposition leads to many issues confronting India today.
Gauri Noolkar, explains in this article how much of Hinduism is related to India's nature, and how influential the Indian continent's river systems are on the country's leading religion. Noolkar, informs her audience about how pollution and greed for natural resources is killing the riverbeds of India. Which ultimately is leading to a negative impact on Hinduism in India, since much of the religion is influenced by the country's many rivers. For example, numerous Hindus make pilgrimages to and along the many famous rivers of India. Also, there are many religious sites erected next to rivers in India such as ghats which are stairs leading down into these rivers. These pilgrimages and religious sites are being affected by India's rivers by being dammed, polluted, dried up, and filled with toxic waste. Noolkar concludes her article by proclaiming that if Hinduism in India is to survive, drastic steps need to be taken in order to restore and preserve India's ancient river basins.
Sharing your scoops to your social media accounts is a must to distribute your curated content. Not only will it drive traffic and leads through your content, but it will help show your expertise with your followers.
Integrating your curated content to your website or blog will allow you to increase your website visitors’ engagement, boost SEO and acquire new visitors. By redirecting your social media traffic to your website, Scoop.it will also help you generate more qualified traffic and leads from your curation work.
Distributing your curated content through a newsletter is a great way to nurture and engage your email subscribers will developing your traffic and visibility.
Creating engaging newsletters with your curated content is really easy. |
Tobacco smoking and esophageal and gastric cardia adenocarcinoma: a meta-analysis.
Smoking has been related to esophageal and gastric cardia adenocarcinoma, but the magnitude of the association is uncertain. We conducted a meta-analysis of 33 studies published up to January 2010. We derived summary estimates using random-effects models. Compared with never-smokers, the pooled relative risk (RR) was 1.76 (95% confidence interval = 1.54-2.01) for ever-smokers, 2.32 (1.96-2.75) for current smokers, and 1.62 (1.40-1.87) for ex-smokers. There was no important difference between esophageal (RR = 1.85 for ever- vs. never-smokers) and gastric cardia (RR = 1.76) adenocarcinoma. We found a direct association with dose (RR = 2.48 [2.14-2.86] for ≥ 20 cigarettes/d) and duration (RR = 2.32 [1.92-2.82] for ≥ 40 years) of cigarette consumption. This meta-analysis estimates the excess of esophageal and gastric cardia adenocarcinoma risk for smokers. This risk was similar for the 2 cancer sites. |
Thoughts on Popular Culture and Unpopular Culture by Jaime J. Weinman (email me)
Monday, February 09, 2009
Grudge Match: Souled Spike vs. Wuss-Boy Angel
This one is mostly for Buffy the Vampire Slayer viewers. In the first three seasons of Buffy, it was widely believed that no vampire could possibly be a bigger wuss than Angel. When he went over to his own show, free from the emasculating influence of Buffy, he became less of a wuss. However, after Spike got a soul, he became just as wussy as Angel had been (and he'd been trending that way even before the ensoulment; simply having a crush on Buffy turns any vampire into a pathetic wimp). He, too, became less of a doormat after he was shoehorned into Angel.
So the question is, who would win a fight between these two vampires who have souls but no cojones: Angel from the early seasons of Buffy, or the souled Spike from the final season of Buffy?
Spike from the earlier seasons, or Angel from his own show, do not count here; it's just these specific versions of the characters fighting. Who will be better able to escape the curse of loving a WB network (or UPN, if you count that as a network) heroine?
(The only person who ever managed to love Buffy and not lose all trace of self-respect? Xander from the first couple of seasons. Even as the show's resident doofus, he was still cooler than Angel.) |
On the physiological role of cytosolic 5'-nucleotidase II (cN-II): pathological and therapeutical implications.
Among the members of the 5'-nucleotidase family, there is only one membrane-bound ectosolic isoenzyme. This esterase prefers AMP as substrate but can hydrolyze a number of purine and pyrimidine phosphorylated compounds, indicating that no evolutive pressure to develop a more restricted specificity was exerted on this enzyme. On the contrary, five cytosolic isoforms have been evolved, probably by convergent evolution, showing different and restricted substrate specificity. The different isoforms have different level of expression and distribution in organs of vertebrates. The cytosolic nucleotidase specific for IMP and GMP (cN-II), is an enzyme allosterically regulated, structurally strongly conserved and expressed at a low but constant level in all organs and tissues in vertebrates. As far as we know, alteration of cN-II expression is limited to pathological conditions. In this review, we report the results of the modulation of cN-II specific activity exerted by silencing or hyperexpression in different cell types, in the attempt to better understand its role and implications in pathology and therapy. |
babyliss curl machine review 2014
s transport infrastructure and providing an increasingly significant contribution to its economic growth.babyliss c1000e curl secret sur cheveux court bouillon We want to remind you that we have lots of her beshine pics in our past updates and you can take a look at them too. You always need to ensure you have the correct Pouch for the right piece of Military Equipment but you also need to know it is durable enough to keep your kit safe and secure throughout vigorous use and any live fire situations you may find yourself in.
Definitely the man gets instantly rock solid when this sexy chick shows her hottest body parts, we like that hot ass.babyliss pro miracurl el corte ingles zaragoza In the event that you are an active gamer of mobile games, it is likely you know that in recent times Google Android as well as &hellip. Gareth suggests in this post on reddit that some Pi 3s are not running at full speed and therefore not generating the heat seen by others.babyliss pro curl vs miracurl
The existing Paddington station is a central London railway terminus and London Underground station complex served by four underground lines – the Bakerloo, Hammersmith & City, District and Circle lines. If you receive any errors here, you can find alternate ways to change these addresses in the WordPress documentation. Yes we do have another massage parlor videos update but for this one we bring you two videos in one update.how to use babyliss curling iron pro 180 gr
Again, whether you fully believe Donaghy or not, he does provide a fascinating perspective into the world of refereeing that simply no one else can provide. |
983 F.2d 1048
U.S.v.Osinowo
NO. 92-1147
United States Court of Appeals,Second Circuit.
Nov 20, 1992
1
Appeal From: E.D.N.Y.
2
AFFIRMED.
|
Total hip arthroplasty (THA) is one of the most successful surgical procedures in medical history and is an important treatment option for several end-stage hip diseases that lead to functional impairment of the joint. Annually, approximately one million patients worldwide benefit from this procedure. Although osteoarthritis is the most common indication, the procedure can also be used in the treatment of other conditions, such as femoral neck fracture, avascular necrosis of femoral head, hip dysplasia, and inflammatory arthritis^([@r1]-[@r3])^.
In the mid-twentieth century, Charnley^([@r4])^ contributed significantly to the evolution of THA by introducing the concept of low friction arthroplasty. Since then, demand for the procedure has grown because of advances in prosthetic materials, manufacturing processes, and surgical techniques, as well as increased life expectancy^([@r2],[@r3])^. Despite such progress, the implant lasts for ≤ 25 years in 58% of patients, according to a meta-analysis conducted by Evans et al.^([@r5])^.
Despite the high rates of surgical success in THA, complications may occur and vary according to patient age, bone quality, and patient-specific comorbidities^([@r6])^. Some of the major complications are aseptic loosening, dislocation, infection, fractures, postoperative hematoma, and heterotopic ossification. Although radiography continues to be the primary diagnostic imaging method used in the short- and long-term assessment of patients with pain after THA, ultrasound, computed tomography, and magnetic resonance imaging also play important roles in this scenario. Advances in diagnostic imaging, such as conventional pulse sequence optimization and metal artifact reduction techniques in magnetic resonance imaging, can be quite useful in the detection and characterization of potential complications of THA, such as synovitis and adverse local tissue reaction^([@r2],[@r3],[@r7],[@r8])^.For effective analysis of the images obtained in diagnostic examinations, it is essential to recognize the type of arthroplasty (hemiarthroplasty or total arthroplasty) and prosthesis (unipolar or bipolar), as well as the type of implant fixation (cemented, cementless, or with screws), because complications may originate from the presence of these materials in the hip^([@r1],[@r5],[@r7])^.
In a pictorial essay in the current issue of **Radiologia Brasileira**, Enge Júnior et al.^([@r9])^ described the main complications of THA. The authors provided information on the types of arthroplasty, prostheses, and implant fixation, focusing on the main radiographic findings of the potential complications of this procedure. The authors also provided detailed characterizations of complications such as periprosthetic fracture, osteolysis/infection, wear, dislocation, and heterotopic calcification, together with illustrative figures of radiographs and CT scans.
It is important for radiologists to be familiar with the imaging aspects of the complications of THA. The correct interpretation of these findings is crucial, not only for the outcome of each case but also for treatment planning.
|
1. Field of the Invention
This invention relates to an improvement in a permanent magnet for an electronic lens used for e.g., electron beam control of a cathode-ray tube for a projector.
2. Prior Art
For a device of this kind, there has been already proposed a first prior art shown in FIG. 5 as the side cross sectional view.
As shown in FIG. 5, a ring-shaped permanent magnet 1 as an electronic lens is fitted on a neck portion 8 of a cathode-ray tube (glass bulb) so as to render the lens effect to an electron beam emitted toward the front side of the electron gun, and to allow an image on the fluorescent surface to have a small spherical aberration and produce no halation.
This permanent magnet 1 is magnetized as shown in a Z-axis direction, i.e., in an axial direction along which an electron beam travels. Onto both magnetic pole end surfaces, ring-shaped flat plate like magnetic pole plates 2a, 2b of magnetic body are bonded. These plates are circumferentially fitted in a manner that the inner circumferential surface of the ring-shaped permanent magnet 1 is slightly spaced from the outer circumferential surface of the neck portion 8. An electron beam 9 emitted from the cathode 4 toward the anode 7 travels while adjusted by first and second grids 5 and 6 on the way to pass through an inner hole of the electron lens (permanent magnet 1). As a result, the electron beam 9 is focused to reach the fluorescent surface (not shown).
FIG. 6 shows the construction of the first prior art of the electron lens wherein FIG. 6(a) is a side cross sectional view and FIG. 6(b) is a front view. Further, FIG. 4 is an actual measurement characteristic curve diagram of the width of the magnetic density curve in a direction of the electron beam showing the length in a direction of the electron beam of the permanent magnet and the half-value of the maximum magnetic flux density in an electron lens comprised of a permanent magnet alone.
A second prior art is disclosed in the Japanese patent application laid open No. 211940/86.
In all drawings, the same reference numerals denote the same or corresponding members, respectively.
It is disclosed in the second prior art (shown in FIG. 8 as the side cross sectional view) that a permanent magnet for an electronic lens comprises at least two ring-shaped permanent magnets 1a, 1b, . . . which are individually magnetized and are connected in the same magnetic pole direction, and the half-value width of the magnetic flux density distribution on the Z-axis of the permanent magnets 1a, 1b . . . have 80 to 200% of the inner diameters of the permanent magnets. In this example, reference numerals 2.sub.1a, 2.sub.1b, 2.sub.2a and 2.sub.2b all denote magnetic pole pieces, respectively.
However, in the case of the structure of the electronic lens shown in the above-mentioned first prior art, as shown in FIG. 7, the magnetic flux density distribution diagram in the Z-axis direction from the magnetic pole piece 2a to the magnetic pole piece 2b is represented by the magnetic flux density curve 15.
When an attempt is made to set the width in the Z-axis direction indicating the half-value 15b of the value 15a at which the magnetic flux density is maximized (which is referred to as "half-value width") to a fairly good value, e.g., about 26 mm, the length (thickness) in the Z-axis direction of the permanent magnet of FIG. 6(a) must be considerably elongated. For this reason, the permanent magnet is difficult to manufacture, and becomes expensive.
On the other hand, it is seemingly true that the second prior art has eliminated the drawbacks with the first prior art.
FIG. 9 is a magnetic flux density distribution diagram in the second prior art of FIG. 8 wherein the magnetic flux density curve 17 shows the distribution in the Z-axis direction from the magnetic pole piece 2.sub.1a to the magnetic pole piece 2.sub.2b, and 17a and 17b represent the magnetic flux density maximum value and the half-value of the maximum value, respectively. Plotting in FIG. 8 is made in comparison with the first prior art.
However, the second prior art is only considered as means adapted so that the permanent magnet of the first prior art is divided into two sections to manufacture them as the permanent magnets 1a and 1b, respectively, to connect these magnets in the Z-axis direction. Although the manufacturing cost is somewhat reduced in the case of the second prior art, there is not so positively appraised improvement from a viewpoint of the use requirement of a large quantity of permanent magnets of the expensive member, its operation or effect, and the advantage indicating to what degree the second prior art has been advanced as compared to the first prior art.
In the case of an electronic lens of this kind, a control scheme is employed to allow a direct current to flow in the excitation coil to superimpose a magnetic flux in the same direction as the direction of a magnetic field produced by the permanent magnet to control the value of the direct current, thus to adjust the strength of the magnetic field.
FIG. 11 shows the construction of a permanent magnet to which means according to this invention provided with a yoke 3 of a ferromagnetic body is applied, wherein a lead wire 17 for supplying a current to the excitation coil is connected to a coil 15 wound onto a bobbin 14 via a take-out hole 16 bored or opened in the magnetic pole piece 2a.
For this reason, it is required to ordinarily provide a take-out hole 6 on one side of the magnetic pole piece 2a or 2b.
For ordinary magnetic pole piece or yoke, soft iron such that the content of carbon is less than 0.3% is used.
However, the provision of the take-out hole 16 for taking out the lead wire 17 to the outside in the magnetic pole piece 2a allows the physical condition of the magnetic pole piece 2a to be uneven, resulting in disturbed or inhomogeneous strength distribution of the magnetic field based on the magnetic flux 9.
In addition, because soft iron such that the content of carbon is less than 0.3% is used as the magnetic pole piece or the yoke, where a high frequency magnetic field is produced in the vicinity thereof, an undesirable elevation of temperature due to eddy current loss would take place. |
$1,200 Covid-19 Stimulus Checks Protected under Bankruptcy Law in Minnesota
Protecting Your $1,200 Stimulus Checks
The Covid-19 pandemic has almost brought the world to a stand-still. People are staying home in a bid to stay safe and comply with orders. Many businesses have closed shop. Here in Minnesota, many employees have been laid off or downscaled, and most people are not guaranteed regular income.
President Trump recently passed the Coronavirus Aid, Relief, and Economic Security (CARES) Act. The bill provides a $2 trillion aid package to cushion Americans from the ongoing economic decline. Those who qualify for the aid will get checks of up to $1,200.
The stimulus checks are meant to cater to basic needs. To this end, the government has made changes to bankruptcy law to protect the aid money from claims by creditors.
The dangerous thing, however, is that the Coronavirus stimulus payments are not protected from debt collectors, bank levy, or garnishment outside of bankruptcy. It seems unfair, but Congress did nothing to stop debt collectors from suing people and then using the judgment they get from suing to freeze peoples’ bank accounts and take the Coronavirus stimulus money.
An effective way to make sure that money doesn’t get taken from you is to file bankruptcy. As soon as any type of bankruptcy is filed, you get automatic and immediate legal protection from all lawsuits, wage garnishments, and bank account freezes. This protection is called the automatic stay.
Protecting Individuals
As mentioned, many businesses have closed. The CARES Act has mandated temporary amendments to the Small Business Recognition Act (SBRA) to protect SMEs.
Changes made to the SBRA include upping the filing of debt threshold from $2,725,625 to $7,500,000. This new threshold will hold for one year before reverting to the former limit. The limit expansion, in addition to other changes, will help SMEs in the following ways:
Simplifying the Chapter 11 plan process
Disbanding committees of unsecured creditors to cut costs
Giving SMEs permission to retain equity under some circumstances
Shortening deadlines in some cases
These changes and their benefits work towards the best interests of SMEs to protect them against creditors now that the pandemic has disrupted business. And, since the SBRA is still new, courts may interpret the law broadly to further work towards SMEs’ best interests.
Protecting Small Businesses
The average American will also be freed of obligations to creditors for as long as the pandemic remains prevalent. The CARES Act has made several temporary amendments to Chapter 7 bankruptcy and Chapter 13 bankruptcy.
Changes to both chapters seek to exclude relief money paid out by the federal government to individuals because of the Covid-19 pandemic from claims by creditors.
Amendments for Income Definitions
The relief money has been taken out of the definition of “current monthly income” under Chapter 7 bankruptcy and Chapter 13 bankruptcy, which means that it cannot be considered when determining a debtor’s eligibility. The money has also been taken out of the definition of “disposable income” under Chapter 13’s plan confirmation.
Amendments for Chapter 13 Payment Plans
In addition to changes made to income definitions, the amendments also allow debtors to request changes to their payment plans under Chapter 13.
According to the new law, “if the debtor is experiencing or has experienced a materials financial hardship due, directly or indirectly, to the coronavirus disease 2019 (Covid-19) pandemic,” they are eligible to make changes to their payment plans.
Before the amendment, debtors were allowed to negotiate payment extension plans for a maximum period of five years. Now, debtors can negotiate extensions for a maximum period of seven years. The amendments also provide for a softer and more lenient stance on the creditor’s part.
These amendments take effect nationwide. For Minnesotans, the new exemptions apply to a range of assistance programs, including:
Minnesota Family Investment Program
MinnesotaCare
Medicare part B premiums
Medicare part D extra help
Supplementary Security Income
County crisis funds
Energy/fuel assistance and food support
MFIP Diversionary Work Program
Keep Creditors Away – Ask Walker & Walker How!
Here at Walker & Walker Law Offices, PLLC, we specialize in resolving financial disputes. Debtors and creditors are in unchartered territory brought about by the impacts of the Covid-19 pandemic, but we are on top of developments.
St. Paul
Blaine
Walker & Walker Law Offices, PLLC, designated a debt relief agency by an Act of Congress and the President of the United States, has proudly assisted consumers seeking relief under the U.S. Bankruptcy Code for over 40 years.
This website is for informational purposes only. The information contained should not be interpreted as legal advice. Only a local attorney with actual knowledge of your personal situation can give you legal advice. Viewing this site website does not create an attorney/client relationship. |
Three-dimensional printing in surgery: a review of current surgical applications.
Three-dimensional printing (3DP) is gaining increasing recognition as a technique that will transform the landscape of surgical practice. It allows for the rapid conversion of anatomic images into physical objects, which are being used across a variety of surgical specialties. It has been unclear which groups are leading the way in coming up with novel ways of using the technology and what specifically the technology is being used for. The aim of this article was to review the current applications of 3DP in modern surgical practice. An electronic search was carried out in MEDLINE, EMBASE, and PsycINFO for terms related to 3DP. These were then screened for relevance and practical applications of the technology in surgery. Four hundred eighty-eight articles were initially found, and these were eventually narrowed down to 93 full-text articles. It was determined that there were three main areas in which the technology is being used to print: (1) anatomic models, (2) surgical instruments, and (3) implants and prostheses. Different specialties are at different stages in the use of the technology. The costs involved with implementing the technology and time taken for printing are important factors to consider before widespread use. For the foreseeable future, this is an exciting and interesting technology with the capacity to radically change health care and revolutionize modern surgery. |
Under current state law, only internal candidates can become the State Police colonel, who is appointed by the governor.
Baker, speaking to the Globe editorial board Friday, said he doesn’t think a civilian would be qualified to oversee the 2,150-trooper force. But allowing the governor’s office to consider candidates who have law enforcement backgrounds but are not currently within the department’s ranks “is certainly worth talking about.”
Governor Charlie Baker says he would be open to legislation allowing candidates from outside the State Police to be considered for its top position, a change his Democratic challenger has repeatedly pushed amid still-simmering scandals at the agency.
“I think it’s got to be somebody who has stripes on their shoulders, somehow,” Baker said, using the police colonel from a different state as an example of a potential candidate, given the law changed.
“It’s got to be somebody who’s been shot at or understands what these people put up with every day, when they work in the gang and fugitive units and do that kind of work,” Baker said.
The State Police have been plagued by a raft of embarrassing problems over the last year, ranging from an overtime fraud scandal to attempts in recent months to destroy more than a hundred boxes of payroll, attendance, and personnel documents amid ongoing investigations.
Jay Gonzalez, Baker’s Democratic opponent, has repeatedly seized on the issues, calling for Baker to “immediately fire” his hand-picked colonel, Kerry A. Gilpin, and charging that outside leadership should be brought in to shake up the status quo.
Gonzalez has also said legislation should be drafted to change state law, allowing for an outside candidates.
Baker — who is seeking a second term on Nov. 6 — has regularly backed Gilpin, who he installed as colonel in November 2017. On Friday, he noted she submitted evidence against 46 troopers to prosecutors to pursue amid the overtime fraud scandal, and said in the face of the issues the agency has faced, “I believe we did many of the right things.”
But his response to Gonzalez’s criticisms has predominantly centered on defending his, and the agency’s response, to the issues, as opposed to the potentially changing the law about its leadership.
As for a potential bill, he said, “It would depend on the way [legislators] framed it.”
During the wide-ranging interview at the Globe, Baker also signalled he’d be interested in other types of legislative changes if reelected.
His administration pushed, and won, a three-year reprieve from state law in 2015 to more freely outsource work to private contractors at the MBTA — a move that the T claims enabled it to save hundreds of millions of dollars.
Baker didn’t seek an extension before the waiver from the so-called Pacheco Law ran out in July. But he said he’d be interested in loosening the constructs of the law on a far-wider scale.
“I think that’s definitely something that should be on the table for discussion . . . or at least a change to it,” Baker said.
The idea would likely be controversial and could face resistance in the Democratic-controlled Legislature.
The law — named for state Senator Marc R. Pacheco, who championed it in the 1990s — requires agencies to prove that outsourcing work done by public employees will save money while maintaining quality.
Baker’s successful pursuit of a waiver for the T was hotly debated, and pitted his administration against the powerful Carmen’s Union Local 589. But he lamented what he called the law’s natural deterrents, noting his pursuit of privatizing emergency mental health services in southeastern Massachusetts was approved by state Auditor Suzanne Bump but only after an intensive, year-long process.
Baker also sounded a cautious note amid the ongoing sweepstakes among cities to be the site of Amazon’s second headquarters.
Boston made the company’s initial cut, but Baker, whose administration has promoted multiple places around Boston to Amazon, said the state is unlikely to offer major tax incentives in an attempt to lure the massive project to Massachusetts.
“We made pretty clear to them that most of the stuff we’re willing to do with respect to public resources was going to involve what I would call betterments [such as public infrastructure improvements] . . . and that a really significant tax package was probably not going to be part of the way we were going to think about this.”
Reach Matt Stout at matt.stout@globe.com. Follow him on Twitter @mattpstout. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.