In this work we study, design, and evaluate computational methods to support interpretation of statutory terms. We propose a novel task of discovering sentences for argumentation about the meaning of statutory terms. The task models the analysis of past treatment of statutory terms, an exercise lawyers routinely perform using a combination of manual and computational approaches. We treat the discovery of sentences as a special case of ad hoc document retrieval. The specifics include retrieval of short texts (sentences), specialized document types (legal case texts), and, above all, the unique definition of document relevance provided in detailed annotation guidelines. To support our experiments we assembled a data set comprising 42 queries (26,959 sentences) which we plan to release to the public in the near future in order to support further research. Most importantly, we investigate the feasibility of developing a system that responds to a query with a list of sentences that mention the term in a way that is useful for understanding and elaborating its meaning. This is accomplished by a systematic assessment of different features that model the sentences’ usefulness for interpretation. We combine features into a compound measure that accounts for multiple aspects. The definition of the task, the assembly of the data set, and the detailed task analysis provide a solid foundation for employing a learning-to-rank approach.
In this paper, we present a novel technique which simulates directional light scattering for more realistic interactive visualization of volume data. Our method extends the recent directional occlusion shading model by enabling light source positioning with practically no performance penalty. Light transport is approximated using a tilted cone‐shaped function which leaves elliptic footprints in the opacity buffer during slice‐based volume rendering. We perform an incremental blurring operation on the opacity buffer for each slice in front‐to‐back order. This buffer is then used to define the degree of occlusion for the subsequent slice. Our method is capable of generating high‐quality soft shadowing effects, allows interactive modification of all illumination and rendering parameters, and requires no pre‐computation. 相似文献
In this study, an optimization of the airfoil of a sailplane is carried out by a recently developed multi-objective genetic algorithm based on microevolution, containing crowding, range adaptation, knowledge-based reinitialization and ε-dominance. Its efficiency was tested on a set of test problems. The results are encouraging, suggesting that very small populations can be used effectively to solve real-world multi-objective optimization problems in many cases of interest. 相似文献
A convergence with a fixed regulator v in lattice ordered groups is applied to MV-algebras. For each Archimedean MV-algebra A there exists a v-Cauchy completion A* and it is uniquely determined up to isomorphisms over A. The relation between the Dedekind completion A∧ of A and A* is established. There is solved a question of the existence of the greatest v-Cauchy complete ideal of A. 相似文献
For the given observations set of the ARMA (autoregressive moving average) process, the likelihood function depends, not only on model parameters, but on the starting values of the input and output. Therefore, it is called theconditional likelihood function. Theunconditional likelihood function can be obtained in two ways. The first is to set the starting values to zero, as is often done, and the second is to set them to the properly estimated values. The difference between these two types of likelihood functions is significant when the given data sequence is short, and any of the zeros of the moving average part is close to the boundary of the unit circle.In this paper the direct method of starting value estimation and its application to two off-line ARMA estimation algorithms, the maximum likelihood (ML) algorithm and the iterative inverse filtering (ITIF) algorithm, is proposed. Experimental results prove both increased efficiency and stability of these algorithms.The importance of setting the starting values properly is also significant when the recursive algorithm, with previously estimated parameters, has to be restarted. The advantage of the proposed reinitialization method is shown on the recursive lattice algorithm working in the block mode. 相似文献
Using a new design of helium-methane gas-flow detector of conversion electrons for Mössbauer spectroscopy, non-uniform nucleation of the primary -Fe-Co phase on both contact and free surfaces of the Ar(+H2) annealed amorphous Fe75Co9B16 alloy was observed in its early crystallization stage. In this state the amount of crystalline phase on the contact ribbon side surpasses that on the free one by a factor of three, whereas no traces of volume crystallization were observed in the transmission spectra. By applying ion implantation to both ribbon surfaces, a slight reduction of the crystalline phase contribution was found. Magnetic domain structure observations were performed in order to evaluate the influence of surface crystallization on magnetic properties. 相似文献
The well-known Brooks? Theorem says that each graph G of maximum degree is k-colorable unless . We generalize this theorem by allowing higher degree vertices with prescribed types of neighborhood. 相似文献