Results 1  10
of
253,702
Requirements for Internet Hosts  Application and Support
 STD 3, RFC 1123, IETF
, 1989
"... This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. Distribution of this document is unlimited. Summary This RFC is one of a pair that defines and discusses the r ..."
Abstract

Cited by 319 (1 self)
 Add to MetaCart
This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. Distribution of this document is unlimited. Summary This RFC is one of a pair that defines and discusses the requirements for Internet host software. This RFC covers the application and support protocols; its companion RFC1122 covers the communication protocol layers: link layer, IP layer, and transport layer.
A RiskFactor Model Foundation for RatingsBased Bank Capital Rules
 Journal of Financial Intermediation
, 2003
"... When economic capital is calculated using a portfolio model of credit valueatrisk, the marginal capital requirement for an instrument depends, in general, on the properties of the portfolio in which it is held. By contrast, ratingsbased capital rules, including both the current Basel Accord and i ..."
Abstract

Cited by 283 (1 self)
 Add to MetaCart
When economic capital is calculated using a portfolio model of credit valueatrisk, the marginal capital requirement for an instrument depends, in general, on the properties of the portfolio in which it is held. By contrast, ratingsbased capital rules, including both the current Basel Accord and its proposed revision, assign a capital charge to an instrument based only on its own characteristics. I demonstrate that ratingsbased capital rules can be reconciled with the general class of credit VaR models. Contributions to VaR are portfolioinvariant only if (a) there is only a single systematic risk factor driving correlations across obligors, and (b) no exposure in a portfolio accounts for more than an arbitrarily small share of total exposure. Analysis of rates of convergence to asymptotic VaR leads to a simple and accurate portfoliolevel addon charge for undiversified idiosyncratic risk. There is no similarly simple way to address violation of the single factor assumption.
Phong Tessellation
, 2008
"... Modern 3D engines used in realtime applications provide shading that hides the lack of higher order continuity inside the shapes using modulated normals, textures, and tonemapping – artifacts remain only on interior contours and silhouettes if the surface geometry is not smooth. The basic idea in ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
in this paper is to apply a purely local refinement strategy that inflates the geometry enough to avoid these artifacts. Our technique is a geometric version of Phong normal interpolation, not applied on normals but on the vertex positions. We call this strategy Phong Tessellation.
AUTOMATIC FINITE ELEMENT MESHING OF PLANAR VORONOI TESSELLATIONS
"... The concept of Voronoi tessellation has recently been extensively used in materials science, especially to model the geometrical features of random microstructures like aggregates of grains in polycrystals, patterns of intergranular cracks and composites. Solution of the underlying field equations u ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
usually requires use of numerical methods such as finite elements. The framework for automatic generation of quadrilateral finite element meshing of planar Voronoi tessellation is proposed in the paper, resulting in a powerful set of tools to be used in the rather wide field of micromechanics. As far
Tessellations of solvmanifolds
 TRANS. AMER. MATH. SOC
, 1994
"... Let A be a closed subgroup of a connected, solvable Lie group G, such that the homogeneous space AnG is simply connected. As a special case of a theorem of C. T. C. Wall, it is known that every tessellation AnG=\Gamma of AnG is finitely covered by a compact homogeneous space G 0 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let A be a closed subgroup of a connected, solvable Lie group G, such that the homogeneous space AnG is simply connected. As a special case of a theorem of C. T. C. Wall, it is known that every tessellation AnG=\Gamma of AnG is finitely covered by a compact homogeneous space G 0
PIECE BY PIECE: A METHOD OF CARTOGRAPHIC LINE GENERALIZATION USING REGULAR HEXAGONAL TESSELLATION
"... but most involve parameters selected arbitrarily or heuristically, with little or no reference to the scale change between original data and generalized output. Also, while routines such as the DouglasPeucker algorithm achieve simplified line correlates by retention of characteristic points from th ..."
Abstract
 Add to MetaCart
the input line, little analysis has been devoted to whether those points remain characteristic at the generalization target scale. A new algorithm is presented based on regular hexagonal tessellation. Mosaics of equilateral hexagons are used to sample lines, where the hexagon width relates directly
Tessellation Methods for Modeling the Material Structure
"... structure, packing. Abstract. Tessellation methods are a relatively new approach for modeling the structure of a material. In this paper, such structures are interpreted as sphere packing models, where molecules and atoms represent spheres of equal or different size. Based on the review of the liter ..."
Abstract
 Add to MetaCart
structure, packing. Abstract. Tessellation methods are a relatively new approach for modeling the structure of a material. In this paper, such structures are interpreted as sphere packing models, where molecules and atoms represent spheres of equal or different size. Based on the review
RANDOM CLUSTER TESSELLATIONS
, 712
"... Abstract. This article describes, in elementary terms, a generic approach to produce discrete random tilings and similar random structures by using point process theory. The standard Voronoi and Delone tilings can be constructed in this way. For this purpose, convex polytopes are replaced by their v ..."
Abstract
 Add to MetaCart
by their vertex sets. Three explicit constructions are given to illustrate the concept. 1.
An Algorithm for Creation of an Optimized Adaptive Grid for Improved Explicit Finite Difference Scheme
"... Abstract: This paper deals with the two main shortcomings of explicit finite difference schemes: the use of a discretization grid with the same resolution over the entire problem space, and low level of precision and stability. We present a combination of two improvements. Their application is illu ..."
Abstract
 Add to MetaCart
Abstract: This paper deals with the two main shortcomings of explicit finite difference schemes: the use of a discretization grid with the same resolution over the entire problem space, and low level of precision and stability. We present a combination of two improvements. Their application
TESSELLATING THE HYPERBOLIC PLANE
"... Abstract. The main goal of this paper will be to determine which hyperbolic polygons can be used to tessellate the hyperbolic plane. Sections 14 will be devoted to providing the context of the hyperbolic plane and developing the basic tools needed to prove the key theorems of this paper. In these s ..."
Abstract
 Add to MetaCart
Abstract. The main goal of this paper will be to determine which hyperbolic polygons can be used to tessellate the hyperbolic plane. Sections 14 will be devoted to providing the context of the hyperbolic plane and developing the basic tools needed to prove the key theorems of this paper
Results 1  10
of
253,702