Results 51 to 60 of about 1,234 (232)

From Nominalisation to Passive in Old Tibetan: Reconstructing Grammatical Meaning in an Extinct Language1

open access: yesTransactions of the Philological Society, EarlyView.
Abstract Based on an analysis of the Old Literary Tibetan corpus—a corpus of the oldest documented Tibetic language—the present study provides evidence that literary Tibetan v3 verb stems (commonly termed ‘future’) initially encoded passive voice. New arguments put forward in this article range from Trans‐Himalayan nominal morphology to early Tibetan ...
Joanna Bialek
wiley   +1 more source

A geometric view of cryptographic equation solving [PDF]

open access: yes, 2008
This paper considers the geometric properties of the Relinearisation algorithm and of the XL algorithm used in cryptology for equation solving. We give a formal description of each algorithm in terms of projective geometry, making particular use of the ...
Paterson M. B.   +5 more
core   +1 more source

The Use of an Improved Access Structure in Dictionaries*

open access: yesLexikos, 2011
<p>Abstract: Dictionary consultation procedures often fail because the structure of a dictionary impedes the user from sufficient access to the data.
Rufus H. Gouws
doaj   +1 more source

‘Enthusiasts’ and ‘Fanatics’: The Decembrists as a Case Study in French Influence on Russian Culture, Emotions and Thought

open access: yesHistory, EarlyView.
Abstract Participants in Russia's 1825 Decembrist uprising against the Tsarist regime were, quite literally, a case study in French cultural influence upon Russia. This is particularly true as it relates to Russia's emotional cultures. Although this has not, traditionally, been the primary focus of historical analysis of this event (in Soviet or ...
ADAM COKER
wiley   +1 more source

Lexicographic Max-Ordering - A Solution Concept for Multicriteria Combinatorial Optimization [PDF]

open access: yes, 1995
In this paper we will introduce the concept of lexicographic max-ordering solutions for multicriteria combinatorial optimization problems. Section 1 provides the basic notions of multicriteria combinatorial optimization and the definition of ...
Ehrgott, Matthias
core  

Lexicographic generation of ordered trees

open access: yesTheoretical Computer Science, 1980
AbstractWe show a one-one correspondence between all the regular binary trees with n internal nodes and certain integer sequences, an algorithm for generating these trees lexicographically, and the ranking function and the corresponding unranking procedure.
openaire   +1 more source

Five Principles for a New Economic Consensus

open access: yesGlobal Policy, EarlyView.
ABSTRACT This paper puts forward five principles for a new economic consensus, which could serve as a modern alternative to the Washington Consensus of 35 years ago. They are built on new ideas that have gained currency in economics over the past three decades. We also provide examples of the policies that could follow from these principles.
Timothy Besley, Andrés Velasco
wiley   +1 more source

Volume Quantization with Flexible Singularities for Hexahedral Meshing

open access: yesComputer Graphics Forum, EarlyView.
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley   +1 more source

The measurement of opportunity inequality: a cardinality-based approach [PDF]

open access: yes, 1995
We consider the problem of ranking distributions of opportunity sets on the basis of equality. First, conditional on agents' preferences over individual opportunity sets, we formulate the analogues ofthe notions ofthe Lorenz partial ordering, equalizing ...
Ok, Efe A., Kranich, Laurence
core  

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

open access: yesComputer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

Home - About - Disclaimer - Privacy