The pair (GH , ·) is called a special loop if (G, ·) is a loop with an arbitrary subloop (H, ·) called its special subloop. A special loop (GH , ·) is called a second Smarandache Bol loop (S2ndBL) if and only if it obeys the second Smarandache Bol identity (xs · z)s = x(sz · s) for all x, z in G and s in H. The popularly known and well studied class of loops called Bol loops fall into this clas...

The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking for reduced divisors with smooth Mumford representation [4]; for non-hyperelliptic curves it is faster to obtain relations using special linear systems of divisors [2, 3]. ...

Abstract Recently, the method of estimating magnetic field through monochromatic images by deep learning has been proposed, demonstrating good morphological similarity but somewhat poor polarity consistency relative to real observation. In this paper, we propose estimate from H α using a conditional generative adversarial network (cGAN) as basic framework. The Global Oscillation Network Group a...

The Hurwitz space is a compactification of the space of rational functions of a given degree. We study the intersection of various strata of this space with its boundary. A study of the cohomology ring of the Hurwitz space then allows us to obtain recurrence relations for certain numbers of ramified coverings of a sphere by a sphere with prescribed ramifications. Generating functions for these ...

The group membership problem for permutation groups is perhaps the most important problem of computational group theory. Solution of this problem seems to depend intrinsically on constructing a strong generating set. Until now, recognizing if a set of generators is strong has been thought to be as hard as constructing a strong generating set from an arbitrary generating set. This paper shows ho...

Introduction to Gaussian Random Function Simulation The so-called Gaussian Random Function simulation (GRFS) differs substantially from the Sequential Gaussian simulation (SGS) from GSLIB. GRFS more accurately reproduces distributions. It is typically faster than SGS, with additional efficiencies due to its parallel architecture. GRFS also has an option to run a fast collocated cosimulation – f...

Long-term observations of vegetation phenology can be used to monitor the response of terrestrial ecosystems to climate change. Satellite remote sensing provides the most efficient means to observe phenological events through time series analysis of vegetation indices such as the Normalized Difference Vegetation Index (NDVI). This study investigates the potential of a Photochemical Reflectance ...

This paper describes a new representation for the solutions of the resource-constrained project scheduling problem (RCPSP) denoted Activity Set List. The most efficient heuristics for the problem use the activity list representation and the serial SGS method to construct the corresponding solution (schedule). The activity list may induce a search space of representations much larger then the sp...

The purpose of this paper is to justify the claim that a method for generating primes presented at EUROCRYPT'89 generates primes with virtually uniform distribution. Using convincing heuristic arguments, the conditional probability distributions of the size of the largest prime factor p 1 (n) of a number n on the order of N is derived, given that n satisses one of the conditions 2n+1 is prime, ...

We present a new algorithm that nds all primes up to n using at most O(n= log log n) arithmetic operations and O(n=(log n log log n)) space. This algorithm is an improvement of a linear prime number sieve due to Pritchard. Our new algorithm matches the running time of the best previous prime number sieve, but uses less space by a factor of (log n). In addition, we present the results of our imp...