Results 51 to 60 of about 9,118,619 (182)

The Catholicon Anglicum (1483): A reconsideration

open access: yesNJES: Nordic Journal of English studies, 2004
Within the history of English lexicography, bilingual word lists with the language order Latin-English precede those with the order English- Latin. Stein (1985) compared the two earliest English-Latin dictionaries, the Promptorium parvulorum (1440) and ...
Gabriele Stein
doaj   +1 more source

Scalable Computation of Topological Abstractions for Scalar Data

open access: yesComputer Graphics Forum, EarlyView.
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will   +6 more
wiley   +1 more source

SRComp: short read sequence compression using burstsort and Elias omega coding. [PDF]

open access: yesPLoS ONE, 2013
Next-generation sequencing (NGS) technologies permit the rapid production of vast amounts of data at low cost. Economical data storage and transmission hence becomes an increasingly important challenge for NGS experiments.
Jeremy John Selva, Xin Chen
doaj   +1 more source

Trapped in the Cave: Toward a Platonic Theory of Ideology

open access: yesEuropean Journal of Philosophy, EarlyView.
Abstract This paper is about showing that Plato has a theory of ideology in the broadly Marxist sense of distorted self‐consciousness of social life. Focusing on the Allegory of the Cave and related passages in the Republic, the paper argues that in the Cave, Plato illustrates the social mediation of human psychology, which contributes to the soul's ...
John D. Proios
wiley   +1 more source

Lexicographical ordering of hypergraphs via spectral moment

open access: yes, 2023
The lexicographical ordering of hypergraphs via spectral moments is called the $S$-order of hypergraphs.In this paper, the $S$-order of hypergraphs is investigated.We characterize the first and last hypergraphs in an $S$-order of all uniform hypertrees ...
Bu, Changjiang, Zhou, Hong
core  

Random‐key optimization for 2D irregular packing with reusable area evaluation

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The diverse constraints of industrial applications lead to variants of two‐dimensional (2D) irregular packing problems that require tailored solution methods. This paper addresses a real‐world industrial challenge by proposing a new problem definition, the maximum reusable contiguous area problem (MRCAP), and a novel metric, the maximum ...
Felipe S. C. Roberto   +5 more
wiley   +1 more source

Lexicography and the Relevance Criterion

open access: yesLexikos, 2012
Until recently, lexicography and information science could rightly be considered two disciplines which had developed along parallel lines but with no or very little formal relation between them.
Theo J.D. Bothma, Sven Tarp
doaj   +1 more source

Minimizing cutting costs in 1D rod cutting

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We study a one‐dimensional rod‐cutting problem arising from an industrial setting where cutting itself carries cost. Each order specifies a length interval, and the task is to assign orders to warehouse rods so that all orders are satisfied while the number of cuts is minimized.
Bowen Li, Attila Sali
wiley   +1 more source

Culturemes and Non-Equivalent Lexis in Dictionaries

open access: yesCognitive Studies | Études cognitives, 2015
Culturemes and Non-Equivalent Lexis in Dictionaries The article raises the question of the need to improve the structural diversity and operational capabilities of the modern dictionary (bi- or multilingual) to avoid lacunes in the transmission of ...
Maciej Paweł Jaskot, Iurii Ganoshenko
doaj   +1 more source

Unusual algorithms for lexicographical enumeration [PDF]

open access: yes, 2000
Using well-known results, we consider algorithms for finding minimal words of given length n in regular and context-free languages. We also show algorithms enumerating the words of given length n of regular and contextfree languages in lexicographical ...
Dömösi Pál
core  

Home - About - Disclaimer - Privacy