Results 31 to 40 of about 882 (191)
H.A. Welker and pedagogical lexicography [PDF]
CITATION: Tarp, S. 2010. H.A. Welker and pedagogical lexicography. Lexikos, 20:730-749, doi:10.5788/20-0-166.The original publication is available at http://lexikos.journals.ac.zaThe lexicographer Herbert Andreas Welker's book of more than 500 pages ...
Лапчук, Т. М. +3 more
core +1 more source
Development in Lexicography: From Polyfunctional to Monofunctional Accounting Dictionaries
This article describes the theoretical foundation of the accounting dictionaries as well as its practical results. Furthermore, the implementation of the project shows how the constant interaction of lexicographical theory with practical dictionary work ...
Sandro Nielsen, Pedro A. Fuertes-Olivera
doaj +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley +1 more source
Towards Characterization of Five‐List‐Colorability of Toroidal Graphs
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák +1 more
wiley +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
Os dicionários para aprendizes de línguas estrangeiras são obras relativamente recentes no mercado editorial e atendem uma demanda por obras pedagógicas que foi ignorada pelos lexicógrafos durante muito tempo.
Magali Sanches Duran +1 more
doaj +1 more source
A Coarse Geometric Approach to Graph Layout Problems
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Poseben tematski sklop letošnje prve številke vsebuje osem kratkih znanstvenih prispevkov, ki pregledno opisujejo trenutno stanje na področju leksikografije na Danskem, Švedskem, Norveškem, Hrvaškem, v Grčiji, Baskiji, Estoniji in Braziliji.
Vojko Gorjanc, Špela Arhar Holdt
doaj +1 more source
Solving for Blameless and Optimal Control Under Prioritized Safety Constraints
Summary of the proposed method for solving for blameless and optimal control sequences. ABSTRACT In many safety‐critical optimal control problems, users may request multiple safety constraints that are jointly infeasible due to external factors such as subsystem failures, unexpected disturbances, or fuel limitations.
Natalia Pavlasek +3 more
wiley +1 more source
Multimodal Exemplification: The Expansion of Meaning in Electronic Dictionaries
This article investigates electronic dictionaries under the framework of Systemic-Functional Multimodal Discourse Analysis (SF-MDA) and argues for improving their exemplification multimodally.
Xiqin Liu
doaj +1 more source

