This paper aims to contribute to the goal of finding influential legal precedents by quantitative methods. A lot of work has been made in this direction worldwide, especially in the context of common law jurisdictions. However, this type of work is extremely scarce in the Brazilian literature. In addition, our work also contributes to the research of network analysis and the law by applying these methods to unprecedented amount of data and narrowing our inquiry to a single law area, corporate law. Furthermore, whereas most of the literature applying network analysis to judicial decisions had access to readily available data on the citations to precedent within each ruling, our raw data was nothing but the full text of decisions. We focus on data produced by the Superior Court of Justice (STJ), the highest court in Brazil for matters of federal law, including statutory interpretation of civil, criminal and corporate law. The Court issued an astonishing 282040 opinions tagged as related to corporate law between 2008 and 2018. This amount of cases is unparalleled internationally for superior courts and for studies in network analysis and law. In our results, we rank precedents quantitatively based on the citations they receive and make. We also qualitatively analyze some of the results, especially related to groups identified in the network with the Modularity algorithm. Our findings also reveal that corporate law jurisprudence in the STJ is quantitatively dominated by a few legal issues around one single theme that is only tangentially related to corporate law. That is, a type of contract used for the expansion of telephone landlines, which also allowed the consumer to become a shareholder of the telecommunication company. This comparison is especially pertinent because the utter lack of data on the quantitative weight of STJ precedents means the national literature has been operating in a void of objective measurements, one which has been filled with cherry-picked rulings and subjective ranking criteria.
Wireless networks can vary both the transmission power and modulation of links. Existing routing protocols do not take transmission power control (TPC) and modulation adaptation (also known as rate adaptation – RA) into account at the same time, even though the performance of wireless networks can be significantly improved when routing algorithms use link characteristics to build their routes. This article proposes and evaluates extensions to routing protocols to cope with TPC and RA. The enhancements can be applied to any link state or distance vector routing protocols. An evaluation considering node density, node mobility and link error show that TPC- and RA-aware routing algorithms improve the average latency and the end-to-end throughput, while consuming less energy than traditional protocols. 相似文献
In this paper, we present a 3D face photography system based on a facial expression training dataset, composed of both facial range images (3D geometry) and facial texture (2D photography). The proposed system allows one to obtain a 3D geometry representation of a given face provided as a 2D photography, which undergoes a series of transformations through the texture and geometry spaces estimated. In the training phase of the system, the facial landmarks are obtained by an active shape model (ASM) extracted from the 2D gray-level photography. Principal components analysis (PCA) is then used to represent the face dataset, thus defining an orthonormal basis of texture and another of geometry. In the reconstruction phase, an input is given by a face image to which the ASM is matched. The extracted facial landmarks and the face image are fed to the PCA basis transform, and a 3D version of the 2D input image is built. Experimental tests using a new dataset of 70 facial expressions belonging to ten subjects as training set show rapid reconstructed 3D faces which maintain spatial coherence similar to the human perception, thus corroborating the efficiency and the applicability of the proposed system. 相似文献
A DSS integrating empty and full containers transshipment operations is presented, addressing the typically unbalanced export/import containers trading problem. The problem is modeled as a network, where nodes represent customers, leasing companies, harbors and warehouses, while arcs represent transportation routes. The underlying mathematical model operates in stages, first prioritizing and adjusting full containers demands considering available empty containers supplies, and then statically optimizing costs. Transportation routes are registered and dynamically controlled, cyclically, for a given time horizon. The DSS is flexible, allowing several parameters to be configured. Experimental examples using randomly generated parameters were conducted to evaluate the effectiveness of the system. 相似文献
In the present work, a constructive learning algorithm was employed to design a near-optimal one-hidden layer neural network structure that best approximates the dynamic behavior of a bioprocess. The method determines not only a proper number of hidden neurons but also the particular shape of the activation function for each node. Here, the projection pursuit technique was applied in association with the optimization of the solvability condition, giving rise to a more efficient and accurate computational learning algorithm. As each activation function of a hidden neuron is defined according to the peculiarities of each approximation problem, better rates of convergence are achieved, guiding to parsimonious neural network architectures. The proposed constructive learning algorithm was successfully applied to identify a MIMO bioprocess, providing a multivariable model that was able to describe the complex process dynamics, even in long-range horizon predictions. The resulting identification model was considered as part of a model-based predictive control strategy, producing high-quality performance in closed-loop experiments. 相似文献
This paper presents a real-time framework that combines depth data and infrared laser speckle pattern (ILSP) images, captured from a Kinect device, for static hand gesture recognition to interact with CAVE applications. At the startup of the system, background removal and hand position detection are performed using only the depth map. After that, tracking is started using the hand positions of the previous frames in order to seek for the hand centroid of the current one. The obtained point is used as a seed for a region growing algorithm to perform hand segmentation in the depth map. The result is a mask that will be used for hand segmentation in the ILSP frame sequence. Next, we apply motion restrictions for gesture spotting in order to mark each image as a ‘Gesture’ or ‘Non-Gesture’. The ILSP counterparts of the frames labeled as “Gesture” are enhanced by using mask subtraction, contrast stretching, median filter, and histogram equalization. The result is used as the input for the feature extraction using a scale invariant feature transform algorithm (SIFT), bag-of-visual-words construction and classification through a multi-class support vector machine (SVM) classifier. Finally, we build a grammar based on the hand gesture classes to convert the classification results in control commands for the CAVE application. The performed tests and comparisons show that the implemented plugin is an efficient solution. We achieve state-of-the-art recognition accuracy as well as efficient object manipulation in a virtual scene visualized in the CAVE. 相似文献
In this paper, we propose a multiresolution approach for surface reconstruction from clouds of unorganized points representing an object surface in 3-D space. The proposed method uses a set of mesh operators and simple rules for selective mesh refinement, with a strategy based on Kohonen's self-organizing map (SOM). Basically, a self-adaptive scheme is used for iteratively moving vertices of an initial simple mesh in the direction of the set of points, ideally the object boundary. Successive refinement and motion of vertices are applied leading to a more detailed surface, in a multiresolution, iterative scheme. Reconstruction was experimented on with several point sets, including different shapes and sizes. Results show generated meshes very close to object final shapes. We include measures of performance and discuss robustness. 相似文献
This paper analyzes the application of Moran’s index and Geary’s coefficient to the characterization of lung nodules as malignant
or benign in computerized tomography images. The characterization method is based on a process that verifies which combination
of measures, from the proposed measures, has been best able to discriminate between the benign and malignant nodules using
stepwise discriminant analysis. Then, a linear discriminant analysis procedure was performed using the selected features to
evaluate the ability of these in predicting the classification for each nodule. In order to verify this application we also
describe tests that were carried out using a sample of 36 nodules: 29 benign and 7 malignant. A leave-one-out procedure was
used to provide a less biased estimate of the linear discriminator’s performance. The two analyzed functions and its combinations
have provided above 90% of accuracy and a value area under receiver operation characteristic (ROC) curve above 0.85, that
indicates a promising potential to be used as nodules signature measures. The preliminary results of this approach are very
encouraging in characterizing nodules using the two functions presented.