منابع مشابه
A SKOS-based multilingual thesaurus of geological time scale for interoperability of online geological maps
The usefulness of online geological maps is hindered by linguistic barriers. Multilingual geoscience thesauri alleviate linguistic barriers of geological maps. However, the benefits of multilingual geoscience thesauri for online geological maps are less studied. In this regard, we developed a multilingual thesaurus of geological time scale (GTS) to alleviate linguistic barriers of GTS records a...
متن کاملMaps for the International Geological Congress at Madrid.
Qua Vadimus? PROFESSOR ERNST COHEN .................... 407 So-called Volcanic Earthquakes: DR. T. A. JAGGAR...... 414 New York City as a Field for Earthquake Study: DR. CHESTER A. REEDS .. ................. 415 William E. Safford: DR. WILL C. BARNES ................-. . ....... 418 Scientific Events: Development of the Biological Laboratory at Cold Spring Harbor; The Mellon Lectures at the Uni...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Colouring graphs with bounded generalized colouring number
Given a graph G and a positive integer p, χp(G) is the minimum number of colours needed to colour the vertices of G so that for any i ≤ p, any subgraph H of G of tree-depth i gets at least i colours. This paper proves an upper bound for χp(G) in terms of the k-colouring number colk(G) of G for k = 2p−2. Conversely, for each integer k, we also prove an upper bound for colk(G) in terms of χk+2(G)...
متن کاملEdge-colouring and total-colouring chordless graphs
A graph G is chordless if no cycle in G has a chord. In the present work we investigate the chromatic index and total chromatic number of chordless graphs. We describe a known decomposition result for chordless graphs and use it to establish that every chordless graph of maximum degree ∆ ≥ 3 has chromatic index ∆ and total chromatic number ∆+1. The proofs are algorithmic in the sense that we ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geological Magazine
سال: 1882
ISSN: 0016-7568,1469-5081
DOI: 10.1017/s0016756800171882