منابع مشابه
Residual intersection theory with reducible schemes
We develop a formula (Theorem 5.1) which allows to compute top Chern classes of vector bundles on the vanishing locus V (s) of a section of this bundle. This formula particularly applies in the case when V (s) is the union of locally complete intersections giving the individual contribution of each component and their mutual intersections. We conclude with applications to the enumeration of rat...
متن کاملGenerating Frequent Patterns Through Intersection Between Transactions
the problem of frequent itemset mining is considered in this paper. One new technique proposed to generate frequent patterns in large databases without time-consuming candidate generation. This technique is based on focusing on transaction instead of concentrating on itemset. This algorithm based on take intersection between one transaction and others transaction and the maximum shared items be...
متن کاملThe Resolution of the Generic Residual Intersection of a Complete Intersection
The concept of residual intersection, introduced by Artin and Nagata [l] in 1972, is a fruitful generalization of linkage as the following two examples attest. Let I be a strongly Cohen-Macaulay ideal in a CohenMacaulay local ring R. If Z satisfies the condition (G,), then Huneke [6, Proposition 4.31 has proved that the extended Rees algebra R[It, t‘1 is defined by an ideal which is obtained fr...
متن کاملGeneralized intersection cuts and a new cut generating paradigm
Intersection cuts are generated from a polyhedral cone and a convex set S whose interior contains no feasible integer point. We generalize these cuts by replacing the cone with a more general polyhedron C. The resulting generalized intersection cuts dominate the original ones. This leads to a new cutting plane paradigm under which one generates and stores the intersection points of the extreme ...
متن کاملGenerating Textual Entailment Using Residual LSTMs
Generating textual entailment (GTE) is a recently proposed task to study how to infer a sentence from a given premise. Current sequence-to-sequence GTE models are prone to produce invalid sentences when facing with complex enough premises. Moreover, the lack of appropriate evaluation criteria hinders researches on GTE. In this paper, we conjecture that the unpowerful encoder is the major bottle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1992
ISSN: 0021-8693
DOI: 10.1016/0021-8693(92)90072-t