An sl_n stable homotopy type for matched diagrams

There exists a simplified Bar-Natan Khovanov complex for open 2-braids. The Khovanov cohomology of a knot diagram made by gluing tangles of this type is therefore often amenable to calculation. We lift this idea to the level of the Lipshitz-Sarkar stable homotopy type and use it to make new computations. Similarly, there exists a simplified Khovanov-Rozansky sl_n complex for open 2-braids with oppositely oriented strands and an even number of crossings. Diagrams made by gluing tangles of this type are called matched diagrams, and knots admitting matched diagrams are called bipartite knots. To a pair consisting of a matched diagram and a choice of integer n >= 2, we associate a stable homotopy type. In the case n = 2 this agrees with the Lipshitz-Sarkar stable homotopy type of the underlying knot. In the case n >= 3 the cohomology of the stable homotopy type agrees with the sl_n Khovanov-Rozansky cohomology of the underlying knot. We make some consistency checks of this sl_n stable homotopy type and show that it exhibits interesting behaviour. For example we find a CP^2 in the sl_3 type for some diagram, and show that the sl_4 type can be interesting for a diagram for which the Lipshitz-Sarkar type is a wedge of Moore spaces.Comment: 62 pages, color figure

Sanctions for E-Discovery Violations: By the Numbers

This Article reviews our comprehensive survey of written opinions from cases in federal courts prior to January 1, 2010, involving motions for sanctions relating to the discovery of electronically stored information (ESI) We analyzed each case for various factors, including date, court, type of case, sanctioning authority, sanctioned party, sanctioned misconduct, sanction type, sanctions to counsel, if any, and the protections provided from sanctions by Federal Rule of Civil Procedure 37(e) The survey identified 401 sanction cases and 230 sanction awards and showed that sanction motions and awards have increased over time, particularly in the last five years Sanctions against counsel are rare but are also increasing Sanction motions have been filed in all types of cases and in courts across the country Failure to produce ESI is the most common basis for sanctions Courts have used a variety of different rules, statutes, and powers to sanction parties for e-disco very violations, including Rule 37 and the inherent power of the court, and courts impose many different sanction types on e-discovery violators, including the severe sanctions of dismissal, default Judgment, adverse jury instructions, and sizeable monetary awards Rule 37(e) has not provided broad protection from such sanction

Sanctions for E-Discovery Violations: By the Numbers

This Article reviews our comprehensive survey of written opinions from cases in federal courts prior to January 1, 2010, involving motions for sanctions relating to the discovery of electronically stored information (ESI) We analyzed each case for various factors, including date, court, type of case, sanctioning authority, sanctioned party, sanctioned misconduct, sanction type, sanctions to counsel, if any, and the protections provided from sanctions by Federal Rule of Civil Procedure 37(e) The survey identified 401 sanction cases and 230 sanction awards and showed that sanction motions and awards have increased over time, particularly in the last five years Sanctions against counsel are rare but are also increasing Sanction motions have been filed in all types of cases and in courts across the country Failure to produce ESI is the most common basis for sanctions Courts have used a variety of different rules, statutes, and powers to sanction parties for e-disco very violations, including Rule 37 and the inherent power of the court, and courts impose many different sanction types on e-discovery violators, including the severe sanctions of dismissal, default Judgment, adverse jury instructions, and sizeable monetary awards Rule 37(e) has not provided broad protection from such sanction

Advanced data driven visualisation for geo-spatial data

Most current 3D landscape visualisation systems either use bespoke hardware solutions, or offer a limited amount of interaction and detail when used in realtime mode. We are developing a modular, data driven 3D visualisation system that can be readily customised to specific requirements. By utilising the latest software engineering methods and bringing a dynamic data driven approach to geo-spatial data visualisation we will deliver an unparalleled level of customisation in near-photo realistic, realtime 3D landscape visualisation. In this paper we show the system framework and describe how this employs data driven techniques. In particular we discuss how data driven approaches are applied to the spatiotemporal management aspect of the application framework, and describe the advantages these convey