Results 121 to 130 of about 366,295 (267)
Automated Crossdating With a Modified Version of the Dendrochronology Program CROS
Archaeometry, EarlyView.ABSTRACT The basic principle of dendrochronology involves matching patterns of tree‐ring widths, with the objective of dating wood of unknown age. The various crossdating procedures rely on statistical methods. The legacy CROS program written in FORTRAN IV contains algorithms, variants of which have been incorporated into modern crossdating programs ...
Michael O. Schwartz
wiley +1 more source
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures
Computer Graphics Forum, EarlyView.We encode information about geometric structure into the pointers of a sparse voxel directed acyclic graph (SVDAG). Each pointer carries information about the structure of the node it points to. Our encoding improves ray tracing performance and reduces model size in memory.
Jaina Modisett, Markus Billeter
wiley +1 more source
Современные информационные технологии и IT-образованиеThe current situation in the world, characterized by sanctions pressure, disruption of logistics, trade, industrial and technological connections and the deepening digitalization of society, has led to a change in the state’s strategy towards the need to
Elena Smirnova +2 more
doaj +1 more source
2D Piecewise Linear Scalar Fields with Invertible Integral Lines
Computer Graphics Forum, EarlyView.Abstract Integral lines of the gradient flow are standard features in continuously differentiable scalar fields that enjoy some useful properties: They cover the domain densely, do not split, merge, or intersect, and are therefore invertible. For widely used discretizations of scalar fields, the corresponding polygonal approximations of integral lines ...
T.L. Erxleben +3 more
wiley +1 more source
Embedding Optimization of Layouts via Distortion Minimization
Computer Graphics Forum, EarlyView.Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley +1 more source
Design, implementation and experiment of a YeSQL Web Crawler
, 2012 We describe a novel, "focusable", scalable, distributed web crawler based on GNU/Linux and PostgreSQL that we designed to be easily extendible and which we have released under a GNU public licence.
Deveaud, Romain +4 more
core +1 more source
Diabetes, Obesity and Metabolism, EarlyView.ABSTRACT Aims Obesity is characterised by pathological alterations in visceral white adipose tissue (vWAT) that may contribute to the development of type 2 diabetes (T2D). While microRNAs (miRNAs) are key post‐transcriptional regulators, comprehensive human vWAT profiling across metabolic states remains limited.
Elsa Villa‐Fernández +19 more
wiley +1 more source
Exact solution algorithms for biobjective mixed integer programming problems
International Transactions in Operational Research, EarlyView.Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley +1 more source