In 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v )≥n for every pair of nonadjacent vertices u and v , then G is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have been obtained, so-called “Ore-type degree conditions”. In [R. J. Faudree, R. H. Schelp, A. Saito, and I. Schiermeyer, Discrete Math 307 (2007), 873–87...

Core Erlang is a new, o ial ore language for the on urrent fun tional language Erlang. Core Erlang is fun tional, stri t, dynami ally typed, pattern mat hing, higher order and on urrent. It has been developed in ooperation between the High-Performan e Erlang proje t at Uppsala University and the Erlang/Open Tele om Platform development team at Eri sson, and is a entral omponent in the new relea...

The processing mineralogy characteristics of an oxidized lead-zinc ore from Sichuan were studied systematically using numerous modern instruments. Results showed that lead and zinc oxide content in the ore exceeded the minimum industrial grade, and also included a relatively high concentration of silver and iron. This ore is composed of many different minerals. Major zinc-containing minerals in...

Mining companies world-wide are faced with the problem of how to accurately value and plan extraction projects subject to uncertainty in both future price and ore grade. Whilst the methodology of modelling price uncertainty is reasonably well understood, modelling ore-grade uncertainty is a much harder problem to formulate, and when attempts have been made the solutions take unfeasibly long tim...

We take an application of the Kernel Lemma by Kostochka and Yancey [10] to its logical conclusion. The consequence is a sort of magical way to draw conclusions about list coloring (and online list coloring) just from the existence of an independent set incident to many edges. We use this to prove an Ore-degree version of Brooks’ Theorem for online list-coloring. The Ore-degree of an edge xy in ...

-Current network devices enable connectivity between end systems with support for routing with a defined set of protocol software bundled with the hardware. These devices do not support user customization or the introduction of new software applications. Programmable network devices allow for the dynamic downloading of customized programs into network devices allowing for the introduction of ne...

In the article performed an analysis of ore reclaiming and overloading point characteristics at modern opencast mines. Ore reclaiming represents the most effective way of stability support of power-intensive and expensive technological dressing process, and, consequently, of maintenance of the optimal production and set-up parameters of extraction and quality of finished product. The paper prop...

Chromite ores are basically classified on basis of Cr2O3 content and Cr to Fe ratio in a sample. The higher content of Cr increases the value of the ore but this is greatly affected by the presence of impurities in form of silicates, oxides or hydroxides. The present study was performed to analyze the impurities of chromite ore collected from Prangghar (Mohmand agency), Pakistan. From x-ray dif...

We consider a recent security definition of Chenette, Lewi, Weis, and Wu for order-revealing encryption (ORE) and order-preserving encryption (OPE) (FSE 2016). Their definition says that the comparison of two ciphertexts should only leak the index of the most significant bit on which the differ. While their work could achieve ORE with short ciphertexts that expand the plaintext by a factor ≈ 1....

-Current network devices enable connectivity between end systems with support for routing with a defined set of protocol software bundled with the hardware. These devices do not support user customization or the introduction of new software applications. Active networking devices allow for the dynamic downloading of customized programs into network devices allowing for the introduction of new p...