منابع مشابه
Sieving, Property Τ , and Random 3-manifolds
These are notes for a talk I gave in the Group theory seminar during the Fall of 2007 at the University of Wisconsin. The goal is to introduce the reader to the method of sieving from analytic number theory in the context of arithmetic groups. We do this by discussing properties of Random 3-Manifolds which were studied by Dunfeld and Thurston [2]. The primary source for this talk is Kowalski’s ...
متن کاملReplace Sieving for Lunar Soil Particle Size Distribution Data
Introduction: Sieving was used extensively until 1999 to determine the particle size distribution of lunar samples. This method is time-consuming, and requires more than a gram of material in order to obtain a result in which one may have confidence. This is demonstrated by the difference in geometric mean and median for samples measured by [1], in which a 14-gram sample produced a geometric me...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملAnalysis of critical paths in a project network with random fuzzy activity times
Project planning is part of project management, which is relates to the use of schedules such as Gantt charts to plan and subsequently report progress within the project environment. Initially, the project scope is defined and the appropriate methods for completing the project are determined. In this paper a new approach for the critical path analyzing a project network with random fuzzy activi...
متن کاملBlock Sieving Algorithms Block Sieving Algorithms
Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2000
ISSN: 0307-904X
DOI: 10.1016/s0307-904x(99)00055-4