scholarly journals Performance Analysis of Identification Codes

Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1067
Author(s):  
Sencer Derebeyoğlu ◽  
Christian Deppe ◽  
Roberto Ferrara
Keyword(s):  
Performance Analysis ◽  
Computational Cost ◽  
Identification Code ◽  
Code Construction ◽  
Reed Solomon Codes ◽  
Trade Offs ◽  
The One ◽  
The Cost

In this paper, we analyze the construction of identification codes. Identification codes are based on the question: “Is the message I have just received the one I am interested in?”, as opposed to Shannon’s transmission, where the receiver is interested in not only one, but any, message. The advantage of identification is that it allows rates growing double exponentially in the blocklength at the cost of not being able to decode every message, which might be beneficial in certain applications. We focus on a special identification code construction based on two concatenated Reed-Solomon codes and have a closer look at its implementation, analyzing the trade-offs of identification with respect to transmission and the trade-offs introduced by the computational cost of identification codes.

scholarly journals Carabid Beetle (Coleoptera: Carabidae) Response to Soil Properties of Urban Wastelands in Warsaw, Poland

2020 ◽  
Vol 12 (24) ◽  
pp. 10673
Author(s):  
Axel Schwerk ◽  
Marzena Wińska-Krysiak ◽  
Arkadiusz Przybysz ◽  
Ewa Zaraś-Januszkiewicz ◽  
Piotr Sikorski
Keyword(s):  
Negative Impact ◽  
Carabid Beetle ◽  
Carabid Beetles ◽  
Soil Parameters ◽  
City Development ◽  
Space Management ◽  
Trade Offs ◽  
Beetle Assemblages ◽  
Trace Element Contamination ◽  
The One

Urban wasteland is of special interest to city planners. However, to integrate such areas into city space management with consideration of nature conservation aspects, a sound assessment of their ecological potential is necessary. The aim of this paper was to analyze whether carabid beetle assemblages of the wastelands are affected by soil parameters, particularly trace element contamination. Therefore, we studied the carabid fauna in relation to selected soil parameters on 56 sampling plots situated in 24 wastelands located in the city of Warsaw (Poland). The results have confirmed our assumptions that the number of species, as well as the number of individual carabid beetles, are negatively affected by an increasing amount of pollutants in the soil. Particularly, the trace elements Pb, Cu, and Cd showed a significantly negative impact. The results are of value when it comes to the use of urban wastelands in the context of sustainable city development. Future use of urban wastelands will be faced with trade-offs between the use for public interests (e.g., housing space) and ecological interests. Phytoremediation and entomoremediation may be included in decontamination measures. The results of studies, such as the one conducted by us, may help to select the respective wastelands for certain purposes.

scholarly journals A framework for reducing the overhead of the quantum oracle for use with Grover’s algorithm with applications to cryptanalysis of SIKE

2020 ◽  
Vol 15 (1) ◽  
pp. 143-156
Author(s):  
Jean-François Biasse ◽  
Benjamin Pring
Keyword(s):  
Search Algorithm ◽  
Circuit Complexity ◽  
Quantum Circuit ◽  
Grover’S Algorithm ◽  
Search Problems ◽  
Trade Offs ◽  
Single Target ◽  
Grover's Algorithm ◽  
Quantum Oracle ◽  
The Cost

AbstractIn this paper we provide a framework for applying classical search and preprocessing to quantum oracles for use with Grover’s quantum search algorithm in order to lower the quantum circuit-complexity of Grover’s algorithm for single-target search problems. This has the effect (for certain problems) of reducing a portion of the polynomial overhead contributed by the implementation cost of quantum oracles and can be used to provide either strict improvements or advantageous trade-offs in circuit-complexity. Our results indicate that it is possible for quantum oracles for certain single-target preimage search problems to reduce the quantum circuit-size from $O\left(2^{n/2}\cdot mC\right)$ (where C originates from the cost of implementing the quantum oracle) to $O(2^{n/2} \cdot m\sqrt{C})$ without the use of quantum ram, whilst also slightly reducing the number of required qubits.This framework captures a previous optimisation of Grover’s algorithm using preprocessing [21] applied to cryptanalysis, providing new asymptotic analysis. We additionally provide insights and asymptotic improvements on recent cryptanalysis [16] of SIKE [14] via Grover’s algorithm, demonstrating that the speedup applies to this attack and impacting upon quantum security estimates [16] incorporated into the SIKE specification [14].

scholarly journals Analytical Model of Induction Machines with Multiple Cage Faults Using the Winding Tensor Approach

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5076
Author(s):  
Javier Martinez-Roman ◽  
Ruben Puche-Panadero ◽  
Angel Sapena-Bano ◽  
Carla Terron-Santiago ◽  
Jordi Burriel-Valencia ◽  
...  
Keyword(s):  
Computational Cost ◽  
Induction Machines ◽  
Diagnostic Techniques ◽  
Analytical Models ◽  
Tensor Algebra ◽  
Diagnostic Systems ◽  
Technical Literature ◽  
Twin Model ◽  
Ring Segment ◽  
The One

Induction machines (IMs) are one of the main sources of mechanical power in many industrial processes, especially squirrel cage IMs (SCIMs), due to their robustness and reliability. Their sudden stoppage due to undetected faults may cause costly production breakdowns. One of the most frequent types of faults are cage faults (bar and end ring segment breakages), especially in motors that directly drive high-inertia loads (such as fans), in motors with frequent starts and stops, and in case of poorly manufactured cage windings. A continuous monitoring of IMs is needed to reduce this risk, integrated in plant-wide condition based maintenance (CBM) systems. Diverse diagnostic techniques have been proposed in the technical literature, either data-based, detecting fault-characteristic perturbations in the data collected from the IM, and model-based, observing the differences between the data collected from the actual IM and from its digital twin model. In both cases, fast and accurate IM models are needed to develop and optimize the fault diagnosis techniques. On the one hand, the finite elements approach can provide highly accurate models, but its computational cost and processing requirements are very high to be used in on-line fault diagnostic systems. On the other hand, analytical models can be much faster, but they can be very complex in case of highly asymmetrical machines, such as IMs with multiple cage faults. In this work, a new method is proposed for the analytical modelling of IMs with asymmetrical cage windings using a tensor based approach, which greatly reduces this complexity by applying routine tensor algebra to obtain the parameters of the faulty IM model from the healthy one. This winding tensor approach is explained theoretically and validated with the diagnosis of a commercial IM with multiple cage faults.

scholarly journals Wideband Rectangular Foldable and Non-foldable Antenna for Internet of Things Applications

2019 ◽  
Vol 2019 ◽  
pp. 1-5 ◽  
Author(s):  
Steve W. Y. Mung ◽  
Cheuk Yin Cheung ◽  
Ka Ming Wu ◽  
Joseph S. M. Yuen
Keyword(s):  
Internet Of Things ◽  
Printed Circuit Board ◽  
Circuit Board ◽  
Design Parameters ◽  
Multiple Frequency ◽  
Wireless Applications ◽  
Printed Circuit ◽  
Iot Applications ◽  
Trade Offs ◽  
The Cost

This article presents a simple wideband rectangular antenna in foldable and non-foldable (printed circuit board (PCB)) structures for Internet of Things (IoT) applications. Both are simple structures with two similar rectangular metal planes which cover multiple frequency bands such as GPS, WCDMA/LTE, and 2.4 GHz industrial, scientific, and medical (ISM) bands. This wideband antenna is suitable to integrate into the short- and long-range wireless applications such as the short-range 2.4 GHz ISM band and standard cellular bands. This lowers the overall size of the product as well as the cost in the applications. In this article, the configuration and operation principle are presented as well as its trade-offs on the design parameters. Simulated and experimental results of foldable and non-foldable (PCB) structures show that the antenna is suited for IoT applications.

scholarly journals A Study on the Feasibility of Anaerobic Co-Digestion of Raw Cheese Whey with Coffee Pulp Residues

Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3611
Author(s):  
Sandra Gonzalez-Piedra ◽  
Héctor Hernández-García ◽  
Juan M. Perez-Morales ◽  
Laura Acosta-Domínguez ◽  
Juan-Rodrigo Bastidas-Oyanedel ◽  
...  
Keyword(s):  
Methane Production ◽  
Kinetic Models ◽  
Cheese Whey ◽  
Maximum Yield ◽  
Gompertz Model ◽  
Coffee Pulp ◽  
The One ◽  
The Cost ◽  
Best Fit ◽  
Cheese Production

In this paper, a study on the feasibility of the treatment of raw cheese whey by anaerobic co-digestion using coffee pulp residues as a co-substrate is presented. It considers raw whey generated in artisanal cheese markers, which is generally not treated, thus causing environmental pollution problems. An experimental design was carried out evaluating the effect of pH and the substrate ratio on methane production at 35 °C (i.e., mesophilic conditions). The interaction of the parameters on the co-substrate degradation and the methane production was analyzed using a response surface analysis. Furthermore, two kinetic models were proposed (first order and modified Gompertz models) to determine the dynamic profiles of methane yield. The results show that co-digestion of the raw whey is favored at pH = 6, reaching a maximum yield of 71.54 mLCH4 gVSrem−1 (31.5% VS removed) for raw cheese whey and coffee pulp ratio of 1 gVSwhey gVSCoffe−1. The proposed kinetic models successfully fit the experimental methane production data, the Gompertz model being the one that showed the best fit. Then, the results show that anaerobic co-digestion can be used to reduce the environmental impact of raw whey. Likewise, the methane obtained can be integrated into the cheese production process, which could contribute to reducing the cost per energy consumption.

scholarly journals Electoral Incentives and the Allocation of Public Funds

2020 ◽  
Author(s):  
Frederico Finan ◽  
Maurizio Mazzocco
Keyword(s):  
Electoral System ◽  
Policy Reforms ◽  
Public Funds ◽  
Term Limit ◽  
The Public ◽  
Public Projects ◽  
Electoral Incentives ◽  
Using Data ◽  
The One ◽  
The Cost

Abstract Politicians allocate public resources in ways that maximize political gains, and potentially at the cost of lower welfare. In this paper, we quantify these welfare costs in the context of Brazil’s federal legislature, which grants its members a budget to fund public projects within their states. Using data from the state of Roraima, we estimate a model of politicians’ allocation decisions and find that 26.8% of the public funds allocated by legislators are distorted relative to a social planner’s allocation. We then use the model to simulate three potential policy reforms to the electoral system: the adoption of approval voting, imposing a one-term limit, and redistricting. We find that a one-term limit and redistricting are both effective at reducing distortions. The one-term limit policy, however, increases corruption, which makes it a welfare-reducing policy.

scholarly journals The S66 Non-Covalent Interactions Benchmark Reconsidered Using Explicitly Correlated Methods Near the Basis Set Limit

2018 ◽  
Vol 71 (4) ◽  
pp. 238 ◽  
Author(s):  
Manoj K. Kesharwani ◽  
Amir Karton ◽  
Nitai Sylvetsky ◽  
Jan M. L. Martin
Keyword(s):  
Computational Cost ◽  
The Other ◽  
Basis Set ◽  
Basis Sets ◽  
Explicitly Correlated ◽  
Non Covalent Interactions ◽  
Explicitly Correlated Methods ◽  
The One ◽  
High Level ◽  
Covalent Interactions

The S66 benchmark for non-covalent interactions has been re-evaluated using explicitly correlated methods with basis sets near the one-particle basis set limit. It is found that post-MP2 ‘high-level corrections’ are treated adequately well using a combination of CCSD(F12*) with (aug-)cc-pVTZ-F12 basis sets on the one hand, and (T) extrapolated from conventional CCSD(T)/heavy-aug-cc-pV{D,T}Z on the other hand. Implications for earlier benchmarks on the larger S66×8 problem set in particular, and for accurate calculations on non-covalent interactions in general, are discussed. At a slight cost in accuracy, (T) can be considerably accelerated by using sano-V{D,T}Z+ basis sets, whereas half-counterpoise CCSD(F12*)(T)/cc-pVDZ-F12 offers the best compromise between accuracy and computational cost.

scholarly journals A MEAN FIELD GAME ANALYSIS OF SIR DYNAMICS WITH VACCINATION

2020 ◽  
pp. 1-18
Author(s):  
Josu Doncel ◽  
Nicolas Gast ◽  
Bruno Gaujal
Keyword(s):  
Mean Field ◽  
Vaccination Strategy ◽  
Game Analysis ◽  
Total Cost ◽  
Mean Field Game ◽  
Vaccination Behavior ◽  
Switching Curve ◽  
The One ◽  
The Cost ◽  
Vaccination Period

We analyze a mean field game model of SIR dynamics (Susceptible, Infected, and Recovered) where players choose when to vaccinate. We show that this game admits a unique mean field equilibrium (MFE) that consists in vaccinating at a maximal rate until a given time and then not vaccinating. The vaccination strategy that minimizes the total cost has the same structure as the MFE. We prove that the vaccination period of the MFE is always smaller than the one minimizing the total cost. This implies that, to encourage optimal vaccination behavior, vaccination should always be subsidized. Finally, we provide numerical experiments to study the convergence of the equilibrium when the system is composed by a finite number of agents ( $N$ ) to the MFE. These experiments show that the convergence rate of the cost is $1/N$ and the convergence of the switching curve is monotone.

Demographic life history traits of reproductive natterjack toads (Bufo calamita) vary between northern and southern latitudes

2006 ◽  
Vol 27 (3) ◽  
pp. 365-375 ◽  
Author(s):  
Delfi Sanuy ◽  
Christoph Leskovar ◽  
Neus Oromi ◽  
Ulrich Sinsch
Keyword(s):  
Life History ◽  
Life History Traits ◽  
Large Female ◽  
Breeding Period ◽  
Female Size ◽  
Data Set ◽  
Bufo Calamita ◽  
Trade Offs ◽  
Age Variation ◽  
The Cost

AbstractDemographic life history traits were investigated in three Bufo calamita populations in Germany (Rhineland-Palatinate: Urmitz, 50°N; 1998-2000) and Spain (Catalonia: Balaguer, Mas de Melons, 41°N; 2004). We used skeletochronology to estimate the age as number of lines of arrested growth in breeding adults collected during the spring breeding period (all localities) and during the summer breeding period (only Urmitz). A data set including the variables sex, age and size of 185 males and of 87 females was analyzed with respect to seven life history traits (age and size at maturity of the youngest first breeders, age variation in first breeders, longevity, potential reproductive lifespan, median lifespan, age-size relationship). Spring and summer cohorts at the German locality differed with respect to longevity and potential reproductive lifespan by one year in favour of the early breeders. The potential consequences on fitness and stability of cohorts are discussed. Latitudinal variation of life history traits was mainly limited to female natterjacks in which along a south-north gradient longevity and potential reproductive lifespan increased while size decreased. These results and a review of published information on natterjack demography suggest that lifetime number of offspring seem to be optimized by locally different trade-offs: large female size at the cost of longevity in southern populations and increased longevity at the cost of size in northern ones.

Hiding Data in Plain Sight: Towards Provably Unbreakable Encryption with Short Secret Keys and One-Way Functions

2021 ◽  
Author(s):  
Mircea-Adrian Digulescu
Keyword(s):  
Encryption Scheme ◽  
Secret Key ◽  
Small Probability ◽  
Random Data ◽  
Computing Power ◽  
Plain Text ◽  
Secret Keys ◽  
The One ◽  
One Way Function ◽  
The Cost

It has long been known that cryptographic schemes offering provably unbreakable security exist, namely the One Time Pad (OTP). The OTP, however, comes at the cost of a very long secret key - as long as the plain-text itself. In this paper we propose an encryption scheme which we (boldly) claim offers the same level of security as the OTP, while allowing for much shorter keys, of size polylogarithmic in the computing power available to the adversary. The Scheme requires a large sequence of truly random words, of length polynomial in the both plain-text size and the logarithm of the computing power the adversary has. We claim that it ensures such an attacker cannot discern the cipher output from random data, except with small probability. We also show how it can be adapted to allow for several plain-texts to be encrypted in the same cipher output, with almost independent keys. Also, we describe how it can be used in lieu of a One Way Function.

Sign in / Sign up

Export Citation Format

Share Document