Groups with the same prime graph as the simple group Dn(5)

Let G be a finite group. The prime graph of G is denoted by Γ(G). Let G be a finite group such that Γ(G)=Γ(Dn(5)), where n≥6. In the paper, as the main result, we show that if n is odd, then G is recognizable by the prime graph and if n is even, then G is quasirecognizable by the prime graph.Нехай G — скшченна група. Простий граф групи GG позначимо через Γ(G). Нехай G — скінченна група така, що Γ(G)=Γ(Dn(5)), де n≥6. Як основний результат роботи доведено, що для непарних n група G розтзнається простим графом, а для парних n група G є такою, що квазiрозпiзнається простим графом

Bounds on the diameter of Cayley graphs of the symmetric group

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for sets of generators containing a permutation fixing at least 37% of the points.Comment: 17 pages, 6 table

A Protocol for Generating Random Elements with their Probabilities

We give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x, P(x)) with probability close to P(x). In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (x, p), then the probability that the verifier outputs x is close to p. Simple examples show that this cannot be achieved. Instead, we show that the following weaker condition holds (in a well defined sense) on average: If (x, p) is output, then p is an upper bound on the probability that x is output. Our protocol yields a new transformation to turn interactive proofs where the verifier uses private random coins into proofs with public coins. The verifier has better running time compared to the well-known Goldwasser-Sipser transformation (STOC, 1986). For constant-round protocols, we only lose an arbitrarily small constant in soundness and completeness, while our public-coin verifier calls the private-coin verifier only once

Supply chain forecasting when information is not shared

The operations management literature is abundant in discussions on the benefits of information sharing in supply chains. However, there are many supply chains where information may not be shared due to constraints such as compatibility of information systems, information quality, trust and confidentiality. Furthermore, a steady stream of papers has explored a phenomenon known as Downstream Demand Inference (DDI) where the upstream member in a supply chain can infer the downstream demand without the need for a formal information sharing mechanism. Recent research has shown that, under more realistic circumstances, DDI is not possible with optimal forecasting methods or Single Exponential Smoothing but is possible when supply chains use a Simple Moving Average (SMA) method. In this paper, we evaluate a simple DDI strategy based on SMA for supply chains where information cannot be shared. This strategy allows the upstream member in the supply chain to infer the consumer demand mathematically rather than it being shared. We compare the DDI strategy with the No Information Sharing (NIS) strategy and an optimal Forecast Information Sharing (FIS) strategy in the supply chain. The comparison is made analytically and by experimentation on real sales data from a major European supermarket located in Germany. We show that using the DDI strategy improves on NIS by reducing the Mean Square Error (MSE) of the forecasts, and cutting inventory costs in the supply chain

Non-stationary demand forecasting by cross-sectional aggregation

In this paper the relative effectiveness of top-down (TD) versus bottom-up (BU) approaches is compared for cross-sectionally forecasting aggregate and sub-aggregate demand. We assume that the sub-aggregate demand follows a non-stationary Integrated Moving Average (IMA) process of order one and a Single Exponential Smoothing (SES) procedure is used to extrapolate future requirements. Such demand processes are often encountered in practice and SES is one of the standard estimators used in industry (in addition to being the optimal estimator for an IMA process). Theoretical variances of forecast error are derived for the BU and TD approach in order to contrast the relevant forecasting performances. The theoretical analysis is supported by an extensive numerical investigation at both the aggregate and sub-aggregate level, in addition to empirically validating our findings on a real dataset from a European superstore. The results demonstrate the increased benefit resulting from cross-sectional forecasting in a non-stationary environment than in a stationary one. Valuable insights are offered to demand planners and the paper closes with an agenda for further research in this area. © 2015 Elsevier B.V. All rights reserved

Wild plants used for food by Hungarian ethnic groups living in the Carpathian Basin

A list of plant species used for food in Hungary and among Hungarian ethnic groups of the Carpathian Basin during the 19th and 20th centuries was compiled from 71 ethnographic and ethnobotanical sources and a survey among contemporary Hungarian botanists. Species used as food, spice, beverage or occasional snacks were collected. Sources mention 236 plant species belonging to 68 families. Most wild fleshy fruits (mostly Rosa, Rubus, Cornus, Ribes, Vaccinium spp.), dry fruits and seeds (Fagus, Quercus, Corylus, Castanea, Trapa spp.), several green vegetables (e.g. Rumex, Urtica, Humulus, Chenopodiaceae spp., Ranunculus ficaria), bulbs and tubers (Lathyrus tuberosus, Helianthus tuberosus, Chaerophyllum bulbosum, Allium spp.) used for food in Europe, are also known to be consumed in Hungary. A characteristic feature of Hungarian plant use was the mass consumption of the underground parts of several marsh (e.g. Typha, Phragmites, Sagittaria, Alisma, Butomus, Bolboschoenus spp., as well as the endemic Armoracia macrocarpa) and steppe species (e.g. Crambe tataria, Rumex pseudonatronatus). Consuming wild food plants is still important among Hungarians living in Transylvania: even nowadays more than 40 species are gathered and used at some locations

Scientific investigations in the Gulf of Mexico and Caribbean Sea during the 1974-1975 Calypso cruise, parts 1 and 2

The distribution and concentrations of the standing crop of phytoplankton and nutrient salts in the Gulf of Mexico and the Caribbean Sea were investigated to provide ground truth for correlating temperature and chlorophyll-a measurements with observations from NASA U-2 aircraft equipped with specially designed sensors for measuring ocean color phenomena. The physical, chemical, and biological data obtained is summarized. Sampling procedures and methods used for determining plant pigments, species composition of phytoplankton, nutrient salt analysis, and the euphotic zones are described

The incidence of prostate cancer in Iran: Results of a population-based cancer registry

Background: Little is known about the epidemiology of prostate cancer in Iranian men. We carried out an active prostate cancer surveillance program in five provinces of Iran. Methods: Data used in this study were obtained from population-based cancer registries between 1996 and 2000. Results: The age-standardized incidence rate of prostate carcinoma in the five provinces was 5.1 per 100,000 person-years. No significant difference was seen in the age-standardized incidence rate of prostate cancer within the provinces studied. The mean±SD age of patients with prostate cancer was 67±13.5 years. Conclusion: The incidence of prostate cancer in Iran is very low as compared to the Western countries. This can partly be explained by lack of nationwide screening program, younger age structure and quality of cancer registration system in Iran

Fast Monte Carlo Algorithms for Permutation Groups

AbstractWe introduce new, elementary Monte Carlo methods to speed up and greatly simplify the manipulation of permutation groups (given by a list of generators). The methods are of a combinatorial character, using only elementary group theory. The key idea is that under certain conditions, "random subproducts" of the generators successfully emulate truly random elements of a group. We achieve a nearly optimal O(n3 logcn) asymptotic running time for membership testing, where n is the size of the permutation domain. This is an improvement of two orders of magnitude compared to known elementary algorithms and one order of magnitude compared to algorithms which depend on heavy use of group theory. An even greater asymptotic speedup is achieved for normal closures, a key ingredient in group-theoretic computation, now constructible in Monte Carlo time O(n2 logcn), i.e., essentially linear time (as a function of the input length). Some of the new techniques are sufficiently general to allow polynomial-time implementations in the very general model of "black box groups" (group operations are performed by an oracle). In particular, the normal closure algorithm has a number of applications to matrix-group computation. It should be stressed that our randomized algorithms are not heuristic: the probability of error is guaranteed not to exceed a bound ϵ > 0, prescribed by the user. The cost of this requirement is a factor of |log ϵ| in the running time