Preclusion

The study in this paper describes retrospective view of the escalator accidents. It also deals with the epidemiology of escalator allied injuries among adults and even in children from the delineation of Consumer Product Safety Commission (CPSC) and National Electronic Injury Surveillance System (NEISS). Invention of escalators has facilitated the travel of passengers in large number. It strengthened the power of technology at the same time it frightened the pedestrians, remembering that it is dangerous if it is used in a careless manner. Work in this paper gives a clear cut view of the escalator linked accidents, preventive measures required to overcome the fear called "escalator-accident". This paper also gives the classification of the escalator accidents in terms of age groups of the people using escalators and also in terms of escalator correlated injuries. It also describes the percentage distribution of the accidents among different age grouped people. CPSC has found that the escalator implicated accidents are more in number than those compared with that of the elevator related accidents. Escalator linked injuries occur more frequently and this frequency of occurrence results in significant trauma.

Sobre preclusiones procesales en el derecho chileno en tiempo de reformas. Ensayo de una teoría general desde un enfoque valorativo jurídico hasta las aplicaciones particulares de la preclusión. Estudio se enfoca en los principios y en los procesos escritos y orales.

El presente trabajo analiza la sentencia No. 838-16-EP/21 emitida por la Corte Constitucional del Ecuador, que se refiere a la falta de legitimación en la causa como una nueva excepción a la regla de preclusión establecida en la sentencia No. 0037-16- SEP-CC. En la sentencia se examinan las razones por las que la Corte no debería pronunciarse sobre el fondo cuando el accionante no es ni haya debido ser parte en el proceso.

This research aims to discuss the efficiency crisis that affects the Judiciary in Brazil as a consequence of mass repetitive litigation. It further discusses potential procedural solutions to deal with it. In the first part, it analyzes the current situation of Brazilian Courts: its workload and consequent delay in the jurisdictional solutions, and its impact on the due process and access to justice. Secondly, it analyses procedural mechanisms aimed at dealing with the judicial workload and delay of dispute resolution in Brazil. To do so, I  engage in a compared analysis of the aggregation techniques adopted in the United States. The techniques selected for this study are those understood to be the best tools to deliver efficiency to civil procedure, which are further subdivided into two groups: the ones related to cases arising from the same transaction or occurrence (i.e. preclusion mechanisms) and secondly, the ones used to solve procedures uniquely discussing the same question of law (i.e. stare decisis). Therefore, the study shall be divided into three chapters: one for problematic, one for studying the class action and one for stare decisis. The class action will be compared with the Brazilian technique for solving mass tort cases (ação civil pública para tutela de interesses individuais homogêneos), suggesting modifications and improvements in the Brazilian legislation which derive from the analysis of the American class action experience. Stare decisis is then compared with the Brazilian experience of case law and binding jurisprudence. The overarching goal is to identify the best procedural techniques for solving repetitive litigation and ultimately improving the Brazilian procedural system, with efficiency and fairness

The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching. In this paper we find the conditional matching preclusion number for triangular ladder, Cn with parallel chords, Trampoline Graph, diamond Snake Graph and KPolygonal Snake Graph.