Online Search Tool for Graphical Patterns in Electronic Band Structures

We present an online graphical pattern search tool for electronic band structure data contained within the Organic Materials Database (OMDB) available at https://omdb.diracmaterials.org/search/pattern. The tool is capable of finding user-specified graphical patterns in the collection of thousands of band structures from high-throughput ab initio calculations in the online regime. Using this tool, it only takes a few seconds to find an arbitrary graphical pattern within the ten electronic bands near the Fermi level for 26,739 organic crystals. The tool can be used to find realizations of functional materials characterized by a specific pattern in their electronic structure, for example, Dirac materials, characterized by a linear crossing of bands; topological insulators, characterized by a "Mexican hat" pattern or an effectively free electron gas, characterized by a parabolic dispersion. The source code of the developed tool is freely available at https://github.com/OrganicMaterialsDatabase/EBS-search and can be transferred to any other electronic band structure database. The approach allows for an automatic online analysis of a large collection of band structures where the amount of data makes its manual inspection impracticable.Comment: 8 pages, 8 figure

Nonlinear dispersion of stationary waves in collisionless plasmas

A nonlinear dispersion of a general stationary wave in collisionless plasma is obtained in a non-differential form from a single-particle oscillation-center Hamiltonian. For electrostatic oscillations in nonmagnetized plasma, considered as a paradigmatic example, the linear dielectric function is generalized, and the trapped particle contribution to the wave frequency shift $\Delta\omega$ is found analytically as a function of the wave amplitude $a$. Smooth distributions yield $\Delta\omega\sim a^{1/2}$, as usual. However, beam-like distributions of trapped electrons result in different power laws, or even a logarithmic nonlinearity, which are derived as asymptotic limits of the same dispersion relation

Алгоритми та програмні рішення для тестування вразливості в інтерфейсі SQL у веб-програмах

Software security gains importance day by day and developers try to secure web applications as much as possible to protect confidentiality, integrity and availability that are described in the fundamental security model so-called CIA triad. SQL injection vulnerability which can violate the confidentiality and integrity principles of the CIA triad is reviewed, and SQL injection attack execution and protection techniques are explained. The common frameworks’ solutions against SQL injection vulnerability were compared, and this comparison shown the most used techniques in this domain. Error-based and time-based detection algorithms for SQL injection’s identification are developed to create a vulnerability scanner that can detect SQL attacks which cause vulnerability in web applications, and these algorithms are represented in form of UML-activity diagrams. In order to discover all possible links and forms to perform SQL injection vulnerability tests in the entire website, a web crawler is needed. Breadth-First Search (BFS) algorithm for developing the web crawler is proposed, and the appropriate pseudo code and activity diagram are provided. Besides, Common Vulnerability Scoring System (CVSS) that is used to measure severity score of attacks that can violate CIA triad principles is reviewed. Qualitative severity score rating scale of CVSS is explained. An example of CVSS calculation is represented. Necessary components of a vulnerability scanner are explained. A vulnerability scanner prototype is developed using explained algorithms. Process results of this vulnerability scanner’s usage for real web applications are represented. Conclusions are made, and goals of future work are defined.Безпека програмного забезпечення щоденно набуває все більшого значення, і розробники намагаються максимально захистити веб-програми, щоб забезпечити їх конфіденційність, цілісність та доступність, які описані в основній моделі безпеки так званої тріади CIA. Розглянута вразливість SQL-ін'єкцій, яка може порушувати принципи конфіденційності та цілісності тріади ЦРУ та пояснюються виконання SQL-атак та методи захисту від них. Було проведено порівняння загальних структурних рішень для усунення вразливості SQL-ін’єкцій, яке виявило найпоширеніші технології у цій галузі. Розроблені алгоритми виявлення на основі помилок та на основі вимірі часу для ідентифікації SQL-ін’єкцій для створення сканера вразливості, який може виявити SQL-атаки, що викликають уразливість в веб-додатках, і ці алгоритми представлені у формі UML-діаграм активності. Щоб виявити всі можливі посилання та форми для виконання тестів вразливості на всьому веб-сайті, потрібен пошуковий веб-робот. Запропоновано алгоритм Breadth-First Search (BFS) для розробки веб-сканеру, для нього наведено псевдокод та діаграма активності. Розглядається система загальної оцінки вразливості (CVSS), яка використовується для вимірювання ступеня тяжкості атак, що можуть порушувати принципи захисту тріади ЦРУ. Роз'яснено якісну оціночну шкалу CVSS. Представлений приклад розрахунку CVSS. Розроблено прототип сканера вразливості з використанням запропонованих алгоритмів. Результати застосування цього сканеру вразливості представлені прикладами оцінки реальних веб-застосувань. Зроблено висновки, визначені цілі майбутньої роботи

Percolation model for nodal domains of chaotic wave functions

Nodal domains are regions where a function has definite sign. In recent paper [nlin.CD/0109029] it is conjectured that the distribution of nodal domains for quantum eigenfunctions of chaotic systems is universal. We propose a percolation-like model for description of these nodal domains which permits to calculate all interesting quantities analytically, agrees well with numerical simulations, and due to the relation to percolation theory opens the way of deeper understanding of the structure of chaotic wave functions.Comment: 4 pages, 6 figures, Late

Spectral Variability of Quasars in the Sloan Digital Sky Survey. II: The C IV Line

We examine the variability of the high-ionizaton C IV line in a sample of 105 quasars observed at multiple epochs by the Sloan Digital Sky Survey. We find a strong correlation between the change in the C IV line flux and the change in the line width, but no correlations between the change in flux and changes in line center and skewness. The relation between line flux change and line width change is consistent with a model in which a broad line base varies with greater amplitude than the line core. The objects studied here are more luminous and at higher redshift than those normally studied for variability, ranging in redshift from 1.65 to 4.00 and in absolute r-band magnitude from roughly -24 to -28. Using moment analysis line-fitting techniques, we measure line fluxes, centers, widths and skewnesses for the C IV line at two epochs for each object. The well-known Baldwin Effect is seen for these objects, with a slope beta = -0.22. The sample has a median intrinsic Baldwin Effect slope of beta = -0.85; the C IV lines in these high-luminosity quasars appear to be less responsive to continuum variations than those in lower luminosity AGN. Additionally, we find no evidence for variability of the well known blueshift of the C IV line with respect to the low-ionization Mg II line in the highest flux objects, indicating that this blueshift might be useful as a measure of orientation.Comment: 52 pages, 14 figures, accepted for publication in Ap

Dust Reddening in SDSS Quasars

We explore the form of extragalactic reddening toward quasars using a sample of 9566 quasars with redshifts 0<z<2.2, and accurate optical colors from the Sloan Digital Sky Survey (SDSS). We confirm that dust reddening is the primary explanation for the red ``tail'' of the color distribution of SDSS quasars. Our fitting to 5-band photometry normalized by the modal quasar color as a function of redshift shows that this ``tail'' is well described by SMC-like reddening but not by LMC-like, Galactic, or Gaskell et al. (2004) reddening. Extension to longer wavelengths using a subset of 1886 SDSS-2MASS matches confirms these results at high significance. We carry out Monte-Carlo simulations that match the observed distribution of quasar spectral energy distributions using a Lorentzian dust reddening distribution; 2% of quasars selected by the main SDSS targeting algorithm (i.e., which are not extincted out of the sample) have E_{B-V} > 0.1; less than 1% have E_{B-V} > 0.2, where the extinction is relative to quasars with modal colors. Reddening is uncorrelated with the presence of intervening narrow-line absorption systems, but reddened quasars are much more likely to show narrow absorption at the redshift of the quasar than are unreddened quasars. Thus the reddening towards quasars is dominated by SMC-like dust at the quasar redshift.Comment: 29 pages including 8 figures. AJ, September 2004 issu

A Very High Speed True Random Number Generator with Entropy Assessment

International audienceThe proposed true random number generator (TRNG) exploits the jitter of events propagating in a self-timed ring (STR) to generate random bit sequences at a very high bit rate. It takes advantage of a special feature of STRs that allows the time elapsed between successive events to be set as short as needed, even in the order of picoseconds. If the time interval between the events is set in concordance with the clock jitter magnitude, a simple entropy extraction scheme can be applied to generate random numbers. The proposed STR-based TRNG (STRNG) follows AIS31 recommendations: by using the proposed stochastic model, designers can compute a lower entropy bound as a function of the STR characteristics (number of stages, oscillation period and jitter magnitude). Using the resulting entropy assessment, they can then set the compression rate in the arithmetic post-processing block to reach the required security level determined by the entropy per output bit. Implementation of the generator in two FPGA families confirmed its feasibility in digital technologies and also confirmed it can provide high quality random bit sequences that pass the statistical tests required by AIS31 at rates as high as 200 Mbit/s