Constructive Relationships Between Algebraic Thickness and Normality

We study the relationship between two measures of Boolean functions; \emph{algebraic thickness} and \emph{normality}. For a function $f$, the algebraic thickness is a variant of the \emph{sparsity}, the number of nonzero coefficients in the unique GF(2) polynomial representing $f$, and the normality is the largest dimension of an affine subspace on which $f$ is constant. We show that for $0 < \epsilon<2$, any function with algebraic thickness $n^{3-\epsilon}$ is constant on some affine subspace of dimension $\Omega\left(n^{\frac{\epsilon}{2}}\right)$. Furthermore, we give an algorithm for finding such a subspace. We show that this is at most a factor of $\Theta(\sqrt{n})$ from the best guaranteed, and when restricted to the technique used, is at most a factor of $\Theta(\sqrt{\log n})$ from the best guaranteed. We also show that a concrete function, majority, has algebraic thickness $\Omega\left(2^{n^{1/6}}\right)$.Comment: Final version published in FCT'201

Adding Isolated Vertices Makes some Online Algorithms Optimal

An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with 'enough' isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs with at least one isolated vertex. These algorithms are not online optimal in general. The online optimality results for these greedy algorithms imply optimality according to various worst case performance measures, such as the competitive ratio. It is also shown that, despite this worst case optimality, there are Freckle graphs where the greedy independent set algorithm is objectively less good than another algorithm. It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.Comment: A footnote in the .tex file didn't show up in the last version. This was fixe

Online Multi-Coloring with Advice

We consider the problem of online graph multi-coloring with advice. Multi-coloring is often used to model frequency allocation in cellular networks. We give several nearly tight upper and lower bounds for the most standard topologies of cellular networks, paths and hexagonal graphs. For the path, negative results trivially carry over to bipartite graphs, and our positive results are also valid for bipartite graphs. The advice given represents information that is likely to be available, studying for instance the data from earlier similar periods of time.Comment: IMADA-preprint-c

Инновационная экономика: аспектыэкономической и информационной безопасности в логистике инноваций

In this article you can find the main problems of resource support of innovative economy and the favorable complex decisions on improvement ofthe existing logistic approaches from the point of view of safetyEn el presente artículo se destacan los principales problemas de apoyo a los recursos de la economía innovadora y se ofrecen decisiones favorables sobre la mejora de los enfoques logísticos existentes desde el punto de vista de la seguridadEste artigo destaca os principais problemas de apoio aos recursos da economia inovadora e oferece decisões favoráveis sobre a melhoria das abordagens logísticas existentes do ponto de vista da segurançaОсвещены основные проблемы ресурсного обеспечения инновационной экономики, предложены выгодные комплексные решения по улучшению существующих логистических подходов с точки зрения безопасности

Efficient noninteractive certification of RSA moduli and beyond

In many applications, it is important to verify that an RSA public key (N; e) speci es a permutation over the entire space ZN, in order to prevent attacks due to adversarially-generated public keys. We design and implement a simple and e cient noninteractive zero-knowledge protocol (in the random oracle model) for this task. Applications concerned about adversarial key generation can just append our proof to the RSA public key without any other modi cations to existing code or cryptographic libraries. Users need only perform a one-time veri cation of the proof to ensure that raising to the power e is a permutation of the integers modulo N. For typical parameter settings, the proof consists of nine integers modulo N; generating the proof and verifying it both require about nine modular exponentiations. We extend our results beyond RSA keys and also provide e cient noninteractive zero- knowledge proofs for other properties of N, which can be used to certify that N is suitable for the Paillier cryptosystem, is a product of two primes, or is a Blum integer. As compared to the recent work of Auerbach and Poettering (PKC 2018), who provide two-message protocols for similar languages, our protocols are more e cient and do not require interaction, which enables a broader class of applications.https://eprint.iacr.org/2018/057First author draf

Implementing Grover Oracles for Quantum Key Search on AES and LowMC

Grover's search algorithm gives a quantum attack against block ciphers by searching for a key that matches a small number of plaintext-ciphertext pairs. This attack uses $O(\sqrt{N})$ calls to the cipher to search a key space of size $N$. Previous work in the specific case of AES derived the full gate cost by analyzing quantum circuits for the cipher, but focused on minimizing the number of qubits. In contrast, we study the cost of quantum key search attacks under a depth restriction and introduce techniques that reduce the oracle depth, even if it requires more qubits. As cases in point, we design quantum circuits for the block ciphers AES and LowMC. Our circuits give a lower overall attack cost in both the gate count and depth-times-width cost models. In NIST's post-quantum cryptography standardization process, security categories are defined based on the concrete cost of quantum key search against AES. We present new, lower cost estimates for each category, so our work has immediate implications for the security assessment of post-quantum cryptography. As part of this work, we release Q# implementations of the full Grover oracle for AES-128, -192, -256 and for the three LowMC instantiations used in Picnic, including unit tests and code to reproduce our quantum resource estimates. To the best of our knowledge, these are the first two such full implementations and automatic resource estimations.Comment: 36 pages, 8 figures, 14 table

Lower bounds for several online variants of bin packing

We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.Comment: WAOA 201

Изучение структуры асфальтенов и кокса, выделенных из продуктов крекинга смеси нефтяных остатков и подсолнечного масла методом рентгеноструктурного анализа

The aim of the work is to evaluate the effect of sunflower oil additives in oil residues on the structure of the formed asphaltenes and coke in the cracking process. Cracking of oil residues and their mixtures with sunflower oil in various ratios is carried out. Comparison of the data of X‑ray structural analysis of asphaltenes and coke isolated from products of cracking is performed. The analysis showed that the addition of sunflower oil to oil residues leads to changes in the parameters of the macrostructure of asphaltenes and coke obtained in products of cracking. In coke isolated from products of cracking obtained in the presence of sunflower oil, the height of the stack of aromatic sheets (Lc) increases, while the distance between the aromatic layers (dm) does not change significantly. In asphaltenes isolated from products of cracking, the average diameter of the aromatic sheets (La) and the distance between saturated structures (dr) vary significantly. The role of sunflower oil is explained by the participation of triglyceride degradation products (mainly fatty acids and olefins) in condensation processes, which makes it possible to reduce the yield in coke and asphaltenesЦелью работы являлось оценить влияние добавок подсолнечного масла в нефтяные остатки на структуру образующихся асфальтенов и кокса в процессе крекинга. Был проведен крекинг нефтяных остатков и их смесей с подсолнечным маслом в различных соотношениях. Выполнено сравнение данных рентгеноструктурного анализа асфальтенов и кокса, выделенных из продуктов крекинга. Анализ показал, что добавление в нефтяные остатки подсолнечного масла, приводит к изменению параметров макроструктуры асфальтенов и кокса, полученных в продуктах крекинга. В коксе, выделенном из продуктов крекинга, полученных в присутствии подсолнечного масла, увеличивается высота стопки ароматических слоёв (Lc), расстояние между ароматическими слоями (dm) существенно не меняется. В асфальтенах, выделенных из продуктов крекинга, существенно варьируется средний диаметр ароматического листа (La) и расстояние между насыщенными структурами (dr). Роль подсолнечного масла объясняется участием продуктов деструкции триглицеридов (главным образом это жирные кислоты и олефины) в процессах конденсации, что позволяет снизить выход кокса и асфальтено

A cross-national study on the antecedents of work–life balance from the fit and balance perspective

Drawing on the perceived work–family fit and balance perspective, this study investigates demands and resources as antecedents of work–life balance (WLB) across four countries (New Zealand, France, Italy and Spain), so as to provide empirical cross-national evidence. Using structural equation modelling analysis on a sample of 870 full time employees, we found that work demands, hours worked and family demands were negatively related to WLB, while job autonomy and supervisor support were positively related to WLB. We also found evidence that resources (job autonomy and supervisor support) moderated the relationships between demands and work–life balance, with high resources consistently buffering any detrimental influence of demands on WLB. Furthermore, our study identified additional predictors of WLB that were unique to some national contexts. For example, in France and Italy, overtime hours worked were negatively associated with WLB, while parental status was positively associated with WLB. Overall, the implications for theory and practice are discussed.Peer ReviewedPostprint (author's final draft