Synthesis of tacrine analogues derived from n-aryl-5-amino-4-cyanopyrazoles

Synthesis of eleven tacrine analogues derived from N-aryl-5-amino-4-cyanopyrazoles, by a Friedländer type reaction, is described. Their structures were confirmed by 1H and 13C NMR spectroscopy, elemental analysis and/or mass spectrometry.Fundação para a Ciência e Tecnologia and FEDER (POCTI-SFA-3-686

Effective and flexible modeling approach to investigate various 3D Talbot carpets from a spatial finite mask

We present an effective modeling approach for a fast calculation of the Talbot carpet from an initially 2-dimensional mask pattern. The introduced numerical algorithm is based on a modified angular-spectrum method, in which it is possible to consider the border effects of the Talbot region from a mask with a finite aperture. The Bluestein’s fast Fourier transform (FFT) algorithm is applied to speed up the calculation. This approach allows as well to decouple the sampling points in the real space and the spatial frequency domain so that both parameters can be chosen independently. As a result an extended three-dimensional Talbot-carpet can be calculated with a minimized number of numerical steps and computation time, but still with high accuracy. The algorithm was applied to various 2-dimensional mask patterns and illumination setups. The influence of specific mask patterns to the resulting field intensity distribution is discussed

3-Amino-5-(piperidin-1-yl)thio­phene-2,4-dicarbonitrile

In the title compound, C11H12N4S, the thio­phene ring is roughly planar, with a maximum deviation of 0.012 (1) Å for the S atom, and makes a dihedral angle of 7.89 (8)° with the mean plane of the piperidine ring, which is in a chair conformation. The crystal packing is stabilized by pairs of centrosymmetric inter­molecular N—H⋯N hydrogen bonds, which results in the formation of a step-wise chain parallel to [10]

Thomae type formulae for singular Z_N curves

We give an elementary and rigorous proof of the Thomae type formula for singular $Z_N$ curves. To derive the Thomae formula we use the traditional variational method which goes back to Riemann, Thomae and Fuchs.Comment: 22 page

Simple deterministic dynamical systems with fractal diffusion coefficients

We analyze a simple model of deterministic diffusion. The model consists of a one-dimensional periodic array of scatterers in which point particles move from cell to cell as defined by a piecewise linear map. The microscopic chaotic scattering process of the map can be changed by a control parameter. This induces a parameter dependence for the macroscopic diffusion coefficient. We calculate the diffusion coefficent and the largest eigenmodes of the system by using Markov partitions and by solving the eigenvalue problems of respective topological transition matrices. For different boundary conditions we find that the largest eigenmodes of the map match to the ones of the simple phenomenological diffusion equation. Our main result is that the difffusion coefficient exhibits a fractal structure by varying the system parameter. To understand the origin of this fractal structure, we give qualitative and quantitative arguments. These arguments relate the sequence of oscillations in the strength of the parameter-dependent diffusion coefficient to the microscopic coupling of the single scatterers which changes by varying the control parameter.Comment: 28 pages (revtex), 12 figures (postscript), submitted to Phys. Rev.

Ecosystem Services in Conservation Planning: Targeted Benefits vs. Co-Benefits or Costs?

There is growing support for characterizing ecosystem services in order to link conservation and human well-being. However, few studies have explicitly included ecosystem services within systematic conservation planning, and those that have follow two fundamentally different approaches: ecosystem services as intrinsically-important targeted benefits vs. substitutable co-benefits. We present a first comparison of these two approaches in a case study in the Central Interior of British Columbia. We calculated and mapped economic values for carbon storage, timber production, and recreational angling using a geographical information system (GIS). These ‘marginal’ values represent the difference in service-provision between conservation and managed forestry as land uses. We compared two approaches to including ecosystem services in the site-selection software Marxan: as Targeted Benefits, and as Co-Benefits/Costs (in Marxan's cost function); we also compared these approaches with a Hybrid approach (carbon and angling as targeted benefits, timber as an opportunity cost). For this analysis, the Co-Benefit/Cost approach yielded a less costly reserve network than the Hybrid approach (1.6% cheaper). Including timber harvest as an opportunity cost in the cost function resulted in a reserve network that achieved targets equivalently, but at 15% lower total cost. We found counter-intuitive results for conservation: conservation-compatible services (carbon, angling) were positively correlated with each other and biodiversity, whereas the conservation-incompatible service (timber) was negatively correlated with all other networks. Our findings suggest that including ecosystem services within a conservation plan may be most cost-effective when they are represented as substitutable co-benefits/costs, rather than as targeted benefits. By explicitly valuing the costs and benefits associated with services, we may be able to achieve meaningful biodiversity conservation at lower cost and with greater co-benefits

A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems

International audienceWe investigate the security of the family of MQQ public key cryptosystems using multivariate quadratic quasigroups (MQQ). These cryptosystems show especially good performance properties. In particular, the MQQ-SIG signature scheme is the fastest scheme in the ECRYPT benchmarking of cryptographic systems (eBACS). We show that both the signature scheme MQQ-SIG and the encryption scheme MQQ-ENC, although using different types of MQQs, share a common algebraic structure that introduces a weakness in both schemes. We use this weakness to mount a successful polynomial time key-recovery attack. Our key-recovery attack finds an equivalent key using the idea of so-called {\it good keys} that reveals the structure gradually. In the process we need to solve a MinRank problem that, because of the structure, can be solved in polynomial-time assuming some mild algebraic assumptions. We highlight that our theoretical results work in characteristic $2$ which is known to be the most difficult case to address in theory for MinRank attacks. Also, we emphasize that our attack works without any restriction on the number of polynomials removed from the public-key, that is, using the minus modifier. This was not the case for previous MinRank like-attacks against \MQ\ schemes. From a practical point of view, we are able to break an MQQ-SIG instance of $80$ bits security in less than $2$ days, and one of the more conservative MQQ-ENC instances of $128$ bits security in little bit over $9$ days. Altogether, our attack shows that it is very hard to design a secure public key scheme based on an easily invertible MQQ structure

Cryptanalysis of The Lifted Unbalanced Oil Vinegar Signature Scheme

In 2017, Ward Beullens \textit{et al.} submitted Lifted Unbalanced Oil and Vinegar (LUOV)\cite{beullens2017field}, a signature scheme based on the famous multivariate public key cryptosystem (MPKC) called Unbalanced Oil and Vinegar (UOV), to NIST for the competition for post-quantum public key scheme standardization. The defining feature of LUOV is that, though the public key $\mathcal{P}$ works in the extension field of degree $r$ of $\mathbb{F}_2$, the coefficients of $\mathcal{P}$ come from $\mathbb{F}_2$. This is done to significantly reduce the size of $\mathcal{P}$. The LUOV scheme is now in the second round of the NIST PQC standardization process. In this paper we introduce a new attack on LUOV. It exploits the lifted structure of LUOV to reduce direct attacks on it to those over a subfield. We show that this reduces the complexity below the targeted security for the NIST post-quantum standardization competition