cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
K8s Pro Sentinel: Extend Secret Security in Kubernetes Cluster
Creators: name: Gunathilake, Kavindu
name: Ekanayake, Indrajith
Publisher: name: arXiv
Year: 2024
Subjects: subject: Distributed, Parallel, and Cluster Computing (cs.DC)
subject: Cryptography and Security (cs.CR)
subject: FOS: Computer and information sciences

description: Microservice architecture is widely adopted among distributed systems. It follows the modular approach that decomposes large software applications into independent services. Kubernetes has become the standard tool for managing these microservices. It stores sensitive information like database passwords, API keys, and access tokens as Secret Objects. There are security mechanisms employed to safeguard these confidential data, such as encryption, Role Based Access Control (RBAC), and the least privilege principle. However, manually configuring these measures is time-consuming, requires specialized knowledge, and is prone to human error, thereby increasing the risks of misconfiguration. This research introduces K8s Pro Sentinel, an operator that automates the configuration of encryption and access control for Secret Objects by extending the Kubernetes API server. This automation reduces human error and enhances security within clusters. The performance and reliability of the Sentinel operator were evaluated using Red Hat Operator Scorecard and chaos engineering practices.
description: 9th International Conference on Information Technology Research (ICITR) 2024
On Adaptive Control with Closed-loop Reference Models: Transients, Oscillations, and Peaking
Creators: name: Gibson, Travis E.
name: Annaswamy, Anuradha M.
name: Lavretsky, Eugene
Publisher: name: arXiv
Year: 2013
Subjects: subject: Systems and Control (eess.SY)
subject: Optimization and Control (math.OC)
subject: Adaptation and Self-Organizing Systems (nlin.AO)
subject: FOS: Electrical engineering, electronic engineering, information engineering
subject: FOS: Mathematics
subject: FOS: Physical sciences

description: One of the main features of adaptive systems is an oscillatory convergence that exacerbates with the speed of adaptation. Recently it has been shown that Closed-loop Reference Models (CRMs) can result in improved transient performance over their open-loop counterparts in model reference adaptive control. In this paper, we quantify both the transient performance in the classical adaptive systems and their improvement with CRMs. In addition to deriving bounds on L-2 norms of the derivatives of the adaptive parameters which are shown to be smaller, an optimal design of CRMs is proposed which minimizes an underlying peaking phenomenon. The analytical tools proposed are shown to be applicable for a range of adaptive control problems including direct control and composite control with observer feedback. The presence of CRMs in adaptive backstepping and adaptive robot control are also discussed. Simulation results are presented throughout the paper to support the theoretical derivations.
Solar Model Independent Constraints on the Sterile Neutrino Interpretation of the Gallium Anomaly
Creators: name: Gonzalez-Garcia, M. C.
name: Maltoni, Michele
name: Pinheiro, João Paulo
Publisher: name: arXiv
Year: 2024
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: High Energy Physics - Experiment (hep-ex)
subject: FOS: Physical sciences

description: We perform a global analysis of most up-to-date solar neutrino data and KamLAND reactor antineutrino data in the framework of the 3+1 sterile neutrino mixing scenario (invoked to explain the results of the Gallium source experiments) with the aim of quantifying the dependence of the (in)compatibility of the required mixing with assumptions on the initial fluxes. The analysis of solar data is performed in two alternative ways: using the flux predicted by the latest standard solar models, and in a model independent approach where the solar fluxes are also determined by the fit. The dependence on the normalization of the capture rate in the solar Gallium experiments is also quantified. Similarly, in the KamLAND analysis we consider both the case where the reactor flux normalization is assumed to be known a priori, as well as a normalization free case which relies solely on available neutrino data. Using a parameter goodness of fit test, we find that in most cases the compatibility between Gallium and solar+KamLAND data only occur at the $3σ$ level or higher. We also discuss the implications of enforcing better compatibility by tweaking the mechanism for the energy production in the Sun.
description: 9 pages, 3 figures, 1 table. Matches published version
Time-space trade-offs for triangulating a simple polygon
Creators: name: Aronov, Boris
name: Korman, Matias
name: Pratt, Simon
name: Van Renssen, André
name: Roeloffzen, Marcel
Publisher: name: Journal of Computational Geometry
Year: 2017

description: An $s$-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses $O(s)$ additional words of space. We present a randomized $s$-workspace algorithm for triangulating a simple polygon $P$ of $n$ vertices that runs in $O(n^2/s+n \log n \log^{5} (n/s))$ expected time using $O(s)$ variables, for any $s \leq n$. In particular, when $s \leq \frac{n}{\log n\log^{5}\log n}$ the algorithm runs in $O(n^2/s)$ expected time.
description: Journal of Computational Geometry, Vol. 8 No. 1 (2017)
title: Comparing the genetic material of pathogens to explain disease outbreaks: BfR Opinion No 047/2019 of 28 November 2019
Creators: name: Bundesinstitut Für Risikobewertung
Publisher: name: Bundesbehörden und Einrichtungen im Geschäftsbereich des Bundesministeriums für Ernährung und Landwirtschaft (BMEL)
Year: 2019
Subjects: subject: 000

description: BfR-Stellungnahmen, vol. 2019, no. 047
Black Holes from Fermi Ball Collapse
Creators: name: Lu, Yifan
name: Picker, Zachary S. C.
name: Profumo, Stefano
name: Kusenko, Alexander
Publisher: name: arXiv
Year: 2024
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: Fermi balls are non-topological solitons that can naturally form in an early universe containing a dark sector with heavy fermions and an attractive interaction mediated by a light scalar field. We compute the Fermi ball mass and radius scaling relations when the potential of the scalar field $φ$ has a non-negligible quartic coupling $λφ^4$. The resulting Fermi balls reach `saturation' very rapidly, even when their radius is much smaller than the effective Yukawa force range. These objects can therefore grow by mergers or by accretion of ambient dark fermions, until they become so dense that they fall within their Schwarzschild radius and collapse to black holes. This setup, therefore, provides an example of a rather natural and economical dark sector scenario for the formation of primordial black holes.
description: 13 pages, 3 figures
The projection median as a weighted average
Creators: name: Durocher, Stephane
name: Leblanc, Alexandre
name: Skala, Matthew
Publisher: name: Journal of Computational Geometry
Year: 2017

description: The projection median of a set $P$ of $n$ points in $\mathbb{R}^d$ is a robust geometric generalization of the notion of univariate median to higher dimensions. In its original definition, the projection median is expressed as a normalized integral of the medians of the projections of $P$ onto all lines through the origin. We introduce a new definition in which the projection median is expressed as a weighted mean of $P$, and show the equivalence of the two definitions. In addition to providing a definition whose form is more consistent with those of traditional statistical estimators of location, this new definition for the projection median allows many of its geometric properties to be established more easily, as well as enabling new randomized algorithms that compute approximations of the projection median with increased accuracy and efficiency, reducing computation time from $O(n^{d+\epsilon})$ to $O(mnd)$, where $m$ denotes the number of random projections sampled. Selecting $m \in \Theta(\epsilon^{-2} d^2 \log n)$ or $m \in \Theta(\min ( d + \epsilon^{-2} \log n, \epsilon^{-2} n))$, suffices for our algorithms to return a point within relative distance $\epsilon$ of the true projection median with high probability, resulting in running times $O(d^3 n \log n)$ and $O(\min(d^2 n, d n^2))$ respectively, for any fixed $\epsilon$.
description: Journal of Computational Geometry, Vol. 8 No. 1 (2017)
Electrochemical tape-and-paper-based sensors suitable for oral pH measurements
Creators: name: Cherebin, Oreoluwa
Publisher: name: IUPUI ScholarWorks
Year: 2021

description: Indiana University-Purdue University Indianapolis (IUPUI)
description: Low oral pH (<5.5) has been shown to play an important role in dental erosion. The measurement of oral pH can be useful in preventative care, in aiding the dental caregiver in determining the likeliness of future dental cavities. The measurement of oral pH has become a popular area of research in an effort to develop a more quantitative method for the diagnosis of dental caries. We are developing an electrochemical tape-and-paper-based pH sensor for future applications in oral pH measurements. These tape-and-paper-based devices are low-cost, easy to fabricate, sterilizable, disposable and portable. The presence of intrinsic material defects of the painted graphite electrode generates oxo-groups which are electroactive. Some of these electroactive species, such as quinone, are pH-dependent and allow for the measurement of pH using cyclic voltammetry. There is shift in the potential of the redox peaks corresponding to the sensing species that can be correlated with the pH of a sample. We optimized the assay with a conditioning oxidative potential pre-treatment step and an ionic adjuster to carry out the pH measurements. We characterized the devices in different buffer solutions, as well as commercial pH standards and establish calibration curves. The reproducibility of the electrochemical response of the devices was also successfully across multiple devices and users. Their shelf-life was demonstrated to be at least three months. The devices successfully measured the pH of beverage and mouthwash, and different formulations of artificial saliva. Their performance in the presence bacteria and in growth media was assessed. Some complex matrices such as growth media required some additional optimization. Towards this objective we fabricated and tested devices with various formulations of carbon paste for the painted working electrode. These flexible tape-and-paper-based devices are promising sensors for pH measurements in oral samples and potentially even for in vivo and in situ pH measurements.
Measurement of the Parity-Violating Asymmetry in Electron-Deuteron Scattering in the Nucleon Resonance Region
Creators: name: Wang, D.
name: Pan, K.
name: Subedi, R.
name: Deng, X.
name: Ahmed, Z.
name: Allada, K.
name: Aniol, K. A.
name: Armstrong, D. S.
name: Arrington, J.
name: Bellini, V.
name: Beminiwattha, R.
name: Benesch, J.
name: Benmokhtar, F.
name: Camsonne, A.
name: Canan, M.
name: Cates, G. D.
name: Chen, J. -P.
name: Chudakov, E.
name: Cisbani, E.
name: Dalton, M. M.
name: de Jager, C. W.
name: De Leo, R.
name: Deconinck, W.
name: Deur, A.
name: Dutta, C.
name: Fassi, L. El
name: Flay, D.
name: Franklin, G. B.
name: Friend, M.
name: Frullani, S.
name: Garibaldi, F.
name: Giusa, A.
name: Glamazdin, A.
name: Golge, S.
name: Grimm, K.
name: Hafidi, K.
name: Hansen, O.
name: Higinbotham, D. W.
name: Holmes, R.
name: Holmstrom, T.
name: Holt, R. J.
name: Huang, J.
name: Hyde, C. E.
name: Jen, C. M.
name: Jones, D.
name: Kang, H.
name: King, P.
name: Kowalski, S.
name: Kumar, K. S.
name: Lee, J. H.
name: LeRose, J. J.
name: Liyanage, N.
name: Long, E.
name: McNulty, D.
name: Margaziotis, D. J.
name: Meddi, F.
name: Meekins, D. G.
name: Mercado, L.
name: Meziani, Z. -E.
name: Michaels, R.
name: Mihovilovic, M.
name: Muangma, N.
name: Myers, K. E.
name: Nanda, S.
name: Narayan, A.
name: Nelyubin, V.
name: Nuruzzaman
name: Oh, Y.
name: Parno, D.
name: Paschke, K. D.
name: Phillips, S. K.
name: Qian, X.
name: Qiang, Y.
name: Quinn, B.
name: Rakhman, A.
name: Reimer, P. E.
name: Rider, K.
name: Riordan, S.
name: Roche, J.
name: Rubin, J.
name: Russo, G.
name: Saenboonruang, K.
name: Saha, A.
name: Sawatzky, B.
name: Shahinyan, A.
name: Silwal, R.
name: Sirca, S.
name: Souder, P. A.
name: Suleiman, R.
name: Sulkosky, V.
name: Sutera, C. M.
name: Tobias, W. A.
name: Urciuoli, G. M.
name: Waidyawansa, B.
name: Wojtsekhowski, B.
name: Ye, L.
name: Zhao, B.
name: Zheng, X.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Nuclear Experiment (nucl-ex)
subject: FOS: Physical sciences

description: We report on parity-violating asymmetries in the nucleon resonance region measured using $5 - 6$ GeV longitudinally polarized electrons scattering off an unpolarized deuterium target. These results are the first parity-violating asymmetry data in the resonance region beyond the $Δ(1232)$, and provide a verification of quark-hadron duality in the nucleon electroweak $γZ$ interference structure functions at the (10-15)% level. The results are of particular interest to models relevant for calculating the $γZ$ box-diagram corrections to elastic parity-violating electron scattering measurements.
description: 7 pages, 1 figure, to appear in Phys. Rev. Lett
On interference among moving sensors and related problems
Creators: name: De Carufel, Jean-Lou
name: Katz, Matthew J.
name: Korman, Matias
name: Van Renssen, André
name: Roeloffzen, Marcel
name: Smorodinsky, Shakhar
Publisher: name: Journal of Computational Geometry
Year: 2017

description: We show that for any set of $n$ moving points in $\Re^d$ and any parameter $2 \le k \le n$, one can select a fixed non-empty subset of the points of size $O(k \log k)$, such that the Voronoi diagram of this subset is ``balanced'' at any given time (i.e., it contains $O(n/k)$ points per cell). We also show that the bound $O(k \log k)$ is near optimal even for the one dimensional case in which points move linearly in time. As an application, we show that one can assign communication radii to the sensors of a network of $n$ moving sensors so that at any given time, their interference is $O(\sqrt{n\log n})$. This is optimal up to an $O(\sqrt{\log n})$ factor. In order to obtain these results, we extend well-known results from $\varepsilon$-net theory to kinetic environments.
description: Journal of Computational Geometry, Vol. 8 No. 1 (2017)
Work hardening during pyramidal slip in zinc
Creators: name: Ahmed, Nazeer
Publisher: name: California Institute of Technology
Year: 1965
Subjects: Aeronautics
Aeronautical Engineering

description: NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document.

The elastic stress field and energy associated with an infinite straight edge dislocation in a hexagonal crystal parallel to the line of intersection of the (0001) and the [...] planes with its Burger's Vector in the [...] plane and the [...] direction is determined taking into account the anisotropy of the crystal. The nature of the solution is found to depend on the relative numerical values of the five independent elastic constants. All possible solutions are investigated and the solution for an isotropic crystal determined as a limiting case.

The interaction force between two edge dislocations of opposite sign gliding on consecutive glide planes is studied. Expressions for the total energy of such a dislocation dipole are developed. Numerical results are given at three temperatures,-77[degrees]C, 31[degrees]C and 139[degrees]C.

These results are used to develop a quantitative theory of strain hardening in a single zinc crystal subjected to uniaxial tension or compression in the direction of its crystallographic axis. It is proposed that such strain hardening is produced by the dislocation dipoles that are formed on dislocations which are moving on any one of the six [...] pyramidal planes when they intersect similar dislocations which are moving on other planes of the same type. The density of such dislocation dipoles as a function of the uniaxial strain along the crystallographic axis is determined and possible future avenues of research that could utilize these results indicated.
E-scooter Rider Detection System in Driving Environments
Creators: name: Apurv, Kumar
Publisher: name: IUPUI ScholarWorks
Year: 2021
Subjects: Object detection method
Data collection procedures
E-scooter safety
Ego vehicle
Artificial Intelligence Research
Image classification CNNs
Driving Environment

description: Indianapolis
description: E-scooters are ubiquitous and their number keeps escalating, increasing their interactions with other vehicles on the road. E-scooter riders have an atypical behavior that varies enormously from other vulnerable road users, creating new challenges for vehicle active safety systems and automated driving functionalities. The detection of e-scooter riders by other vehicles is the first step in taking care of the risks. This research presents a novel vision-based system to differentiate between e-scooter riders and regular pedestrians and a benchmark dataset for e-scooter riders in natural environments. An efficient system pipeline built using two existing state-of-the-art convolutional neural networks (CNN), You Only Look Once (YOLOv3) and MobileNetV2, performs detection of these vulnerable e-scooter riders.
A Generalized Power-Law Diagnostic for Infrared Galaxies at z>1: Active Galactic Nuclei and Hot Interstellar Dust
Creators: name: Caputi, Karina I.
Publisher: name: arXiv
Year: 2013
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: FOS: Physical sciences

description: I present a generalized power-law diagnostic that allows to identify the presence of active galactic nuclei (AGN) in infrared (IR) galaxies at z>1, down to flux densities at which the extragalactic IR background is mostly resolved. I derive this diagnostic from the analysis of 174 galaxies with Snu(24)>80 microJy and spectroscopic redshifts zspec>1 in the Chandra Deep Field South, for which I study the rest-frame UV/optical/near-IR spectral energy distributions (SEDs), after subtracting a hot-dust, power-law component with three possible spectral indices alpha=1.3, 2.0 and 3.0. I obtain that 35% of these 24micron sources are power-law composite galaxies (PLCGs), which I define as those galaxies for which the SED fitting with stellar templates, without any previous power-law subtraction, can be rejected with >2sigma confidence. Subtracting the power-law component from the PLCG SEDs produces stellar-mass correction factors <1.5 in >80% of cases. The PLCG incidence is especially high (47%) at z=1.0-1.5. To unveil which PLCGs host AGN, I conduct a combined analysis of 4Ms X-ray data, galaxy morphologies, and a greybody modelling of the hot dust. I find that: 1) 77% of all the X-ray AGN in my 24micron sample at z=1.0-1.5 are recognised by the PLCG criterion; 2) PLCGs with alpha=1.3 or 2.0 have regular morphologies and T_dust >~1000 K, indicating nuclear activity. Instead, PLCGs with alpha=3.0 are characterised by disturbed galaxy dynamics, and a hot interstellar medium can explain their dust temperatures T_dust ~700-800 K. Overall, my results indicate that the fraction of AGN among 24 micron sources is between ~30% and 52% at z=1.0-1.5.
description: 12 pages, including 12 figures. ApJ in press. No changes with respect to previous version, except for minor spelling corrections and reference update
Towards plane spanners of degree 3
Creators: name: Biniaz, Ahmad
name: Bose, Prosenjit
name: De Carufel, Jean-Lou
name: Gavoille, Cyril
name: Maheshwari, Anil
name: Smid, Michiel
Publisher: name: Journal of Computational Geometry
Year: 2017

description: Let $S$ be a finite set of points in the plane. In this paper we consider the problem of computing plane spanners of degree at most three for $S$. • If $S$ is in convex position, then we present an algorithm that constructs a plane $\frac{3+4\pi}{3}$-spanner for $S$ whose vertex degree is at most 3. • If $S$ is the vertex set of a non-uniform rectangular lattice, then we present an algorithm that constructs a plane $3\sqrt{2}$-spanner for $S$ whose vertex degree is at most 3. • If $S$ is in general position, then we show how to compute plane degree-3 spanners for $S$ with a linear number of Steiner points.
description: Journal of Computational Geometry, Vol. 8 No. 1 (2017)
Hyperplane separability and convexity of probabilistic point sets
Creators: name: Fink, Martin
name: Hershberger, John
name: Kumar, Nirman
name: Suri, Subhash
Publisher: name: Journal of Computational Geometry
Year: 2017

description: We describe an $O(n^d)$-time algorithm for computing the exact probability that two $d$-dimensional probabilistic point sets are linearly separable, for any fixed $d \geq 2$. A probabilistic point in $d$-space is a normal point, but with an associated probability of existence; the existence probabilities of all points are independent. We also show that the $d$-dimensional separability problem is equivalent to a $(d+1)$-dimensional convex hull membership problem, which asks for the probability that a query point lies inside the convex hull of $n$ probabilistic points. Using this reduction, we improve the current best bound for the convex hull membership problem by a factor of $n$. In addition, our algorithms can handle input degeneracies in which more than $k+1$ points may lie on a $k$-dimensional subspace, thus resolving an open problem in Agarwal et al 2013. Finally, we prove lower bounds for the separability problem via a reduction from the $k$-SUM problem, which show in particular that our $O(n^2)$ algorithms for $2$-dimensional separability and $3$-dimensional convex hull membership are nearly optimal.
description: Journal of Computational Geometry, Vol. 8 No. 2 (2017): Special Issue of Selected Papers from SoCG 2016
title: Методика оценки рисков безопасности информационных технологий для сложных промышленных объектов в распределенных киберфизических системах
Creators: name: ., И.И. Лившиц – к.т.н., доцент, факультет безопасности информационных технологий, СПб НИУ информационных технологий, механики и оптики E-mail: Livshitz.il@yandex.ru А.А. Зайцева – к.т.н., ст. науч. сотрудник, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: cher@iias.spb.su
Publisher: name: Издательство Радиотехника
Year: 2019

description: Постановка проблемы. В настоящее время значительно возросло внимание к обеспечению безопасности различных объектов критической инфраструктуры и в том числе к обеспечению информационной безопасности.
Цель. Сформулировать и рассмотреть проблему формирования оценки рисков безопасности информационных технологий как важный этап общего процесса обеспечения безопасности сложных промышленных объектов в распределенных киберфизических системах. Рассмотрена методика, основанная на современных риск-ориентированных стандартах ISO/IEC серии 27001 и 15408, а также ряде иных стандартов для оценки информационных технологий и аудита систем менеджмента.
Результаты. Предложенная методика позволяет получить расчетные результаты оценки рисков безопасности информационных технологий в ограничениях размещения и состава компонент сложных промышленных объектов.
Практическая значимость. Полученные результаты могут быть применены при формировании независимой оценки безопасности информационных технологий сложных промышленных объектов с требуемой точностью.
Energy Evolution for the Sivers Asymmetries in Hard Processes
Creators: name: Sun, Peng
name: Yuan, Feng
Publisher: name: arXiv
Year: 2013
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: We investigate the energy evolution of the azimuthal spin asymmetries in semi-inclusive hadron production in deep inelastic scattering (SIDIS) and Drell-Yan lepton pair production in pp collisions. The scale dependence is evaluated by applying an approximate solution to the Collins-Soper-Sterman (CSS) evolution equation at one-loop order which is adequate for moderate Q^2 variations. This describes well the unpolarized cross sections for SIDIS and Drell-Yan process in the $Q^2$ range of 2.4-100GeV^2. A combined analysis of the Sivers asymmetries in SIDIS from HERMES and COMPASS experiments, and the predictions for the Drell-Yan process at RHIC at \sqrt{S}=200GeV are presented. We further extend to the Collins asymmetries and find, for the first time, a consistent description for HERMES/COMPASS and BELLE experiments with the evolution effects. We emphasize an important test of the evolution effects by studying di-hadron azimuthal asymmetry in e^+e^- annihilation at moderate energy range, such as at BEPC at \sqrt{S}=4.6GeV.
description: 8 pages, 4 figures; references added, presentation improved
Approximating minimum-area rectangular and convex containers for packing convex polygons
Creators: name: Alt, Helmut
name: De Berg, Mark
name: Knauer, Christian
Publisher: name: Journal of Computational Geometry
Year: 2017

description: We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.
description: Journal of Computational Geometry, Vol. 8 No. 1 (2017)
Degree four plane spanners: Simpler and better
Creators: name: Kanj, Iyad
name: Perkovic, Ljubomir
name: Turkoglu, Duru
Publisher: name: Journal of Computational Geometry
Year: 2017

description: Let $\mathcal{P}$ be a set of $n$ points embedded in the plane, and let $\mathcal{C}$ be the complete Euclidean graph whose point-set is $\mathcal{P}$. Each edge in $\mathcal{C}$ between two points $p$, $q$ is realized as the line segment $[pq]$ and is assigned a weight equal to the Euclidean distance $|pq|$. In this paper, we show how to construct in $O(n \lg n)$ time a plane spanner of $\mathcal{C}$ of maximum degree at most $4$ and of stretch factor at most $20$. This improves a long sequence of results on the construction of bounded degree plane spanners of $\mathcal{C}$. Our result matches the smallest known upper bound of $4$ by Bonichon et al. on the maximum degree while significantly improving their stretch factor upper bound from $156.82$ to $20$. The construction of our spanner is based on Delaunay triangulations defined with respect to the equilateral-triangle distance, and uses a different approach than that used by Bonichon et al. Our approach leads to a simple and intuitive construction of a well-structured spanner and reveals useful structural properties of Delaunay triangulations defined with respect to the equilateral-triangle distance. The structure of the constructed spanner implies that when $\mathcal{P}$ is in convex position, the maximum degree of the spanner is at most $3$. Combining the above degree upper bound with the fact that $3$ is a lower bound on the maximum degree of any plane spanner of $\mathcal{C}$ when the point-set $\mathcal{P}$ is in convex position, the results in this paper give a tight bound of $3$ on the maximum degree of plane spanners of $\mathcal{C}$ for point-sets in convex position.
description: Journal of Computational Geometry, Vol. 8 No. 2 (2017): Special Issue of Selected Papers from SoCG 2016
Landau-Lifshitz theory of the longitudinal spin Seebeck effect
Creators: name: Hoffman, Silas
name: Sato, Koji
name: Tserkovnyak, Yaroslav
Publisher: name: arXiv
Year: 2013
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: FOS: Physical sciences

description: Thermal-bias-induced spin angular momentum transfer between a paramagnetic metal and ferromagnetic insulator is studied theoretically based on the stochastic Landau-Lifshitz-Gilbert (LLG) phenomenology. Magnons in the ferromagnet establish a nonequilibrium steady state by equilibrating with phonons via bulk Gilbert damping and electrons in the paramagnet via spin pumping, according to the fluctuation-dissipation theorem. Subthermal magnons and the associated spin currents are treated classically, while the appropriate quantum crossover is imposed on high-frequency magnetic fluctuations. We identify several length scales in the ferromagnet, which govern qualitative changes in the dependence of the thermally-induced spin current on the magnetic film thickness.
description: 9 pages, 4 figures
title: Методы детектирования агрессивных пользователей информационного пространства на основе генеративно-состязательных нейронных сетей
Creators: name: ., М.Ю. Уздяев – аспирант, мл. науч. сотрудник, лаборатория технологий больших данных социокиберфизических систем, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: m.y.uzdiaev@gmail.com Д.К. Левоневский – науч. сотрудник, лаборатория технологий больших данных социокиберфизических систем, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: dlewonewski.8781@gmail.com О.О. Шумская – аспирант, мл. науч. сотрудник, лаборатория автономных робототехнических систем, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: shumskaya.oo@gmail.com М.А. Летенков – мл. науч. сотрудник, лаборатория технологий больших данных социокиберфизических систем, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: o1prime@yandex.ru
Publisher: name: Издательство Радиотехника
Year: 2019

description: Постановка проблемы. В связи с постоянным расширением спектра человеческой деятельности, разворачивающейся в виртуальных информационных пространствах, также увеличивается разнообразие возможных взаимодействий пользователя с такими системами. Соответственно, расширяется круг потенциальных деструктивных действий, которые могут предприниматься в подобном информационном пространстве. В таких условиях актуализируется проблема выявления агрессии в действиях пользователей информационных пространств на основе видео-, аудио- и текстовых материалов. Решению проблем такого рода посвящено данное исследование.
Цель. Исследовать подходы к детектированию внешних проявлений агрессии в рамках более обширной задачи распознавания внешних проявлений эмоций с использованием современных архитектур нейронных сетей, в частности, GAN (генеративно-состязательная нейронная сеть). Осветить возможности кластеризации внешних проявлений эмоций, выявленных на изображениях и видео, изучить существующие методы, позволяющие надежно отличать проявление агрессии от проявления других эмоций.
Результаты. Проанализированы возможности определения психофизического состояния человека на основе выражения его лица, возможные ошибки нейронных сетей при выявлении агрессии, а также генерация синтетических данных для получения обучающей выборки. В контексте решаемой задачи продемонстрированы современные методы машинного обучения, в частности, обучение с переносом (transfer learning), рассмотрены возможности применения архитектуры GAN.
Практическая значимость. Ключевая новизна предложенного метода заключается в том, что все доступные данные анализируются в рамках одной модели. Предложенные подходы позволяют решать поставленные задачи с привлечением сравнительно небольших вычислительных мощностей, обучать модель на синтетических данных, достигать высоких результатов на ограниченном объеме данных, избегать переобучения модели. Предложенные методы применимы при обработке многомодальных данных и потенциально могут быть актуальны для решения более универсальных задач, связанных с распознаванием эмоций.
On isolating points using unit disks
Creators: name: Gibson, Matt
name: Kanade, Gaurav
name: Penninger, Rainer
name: Varadarajan, Kasturi
name: Vigan, Ivo
Publisher: name: Journal of Computational Geometry
Year: 2016

description: Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which separate the points, we consider the problem of selecting a minimum subset of the disks such that any path between any pair of points is intersected by at least one of the selected disks. We present a $(9 + \epsilon)$-approximation algorithm for this problem and show that it is NP-complete even if all disks have unit radius and no disk contains any points. Using a similar hardness reduction, we further show that the Multiterminal Cut problem remains NP-complete on unit disk graphs. Lastly, we prove that removing a minimum subset of a collection of unit disks, such that the plane minus the arrangement of the remaining disks consists of a single connected region is also NP-complete.
description: Journal of Computational Geometry, Vol. 7 No. 1 (2016)
title: Управление политическими рисками в нефтегазовой отрасли с точки зрения международных стандартов
Creators: name: ., И.Р. Сафин – начальник управления контроля производства, Филиал «Газпром Интернэшнл» (Санкт-Петербург) E-mail: isafin@yandex.ru
Publisher: name: Издательство Радиотехника
Year: 2019

description: Постановка проблемы. Вопросы управления политическими рисками являются ключевыми для нефтегазовых компаний, работающих в различных странах мира, в связи с потенциальными последствиями для их активов и проектов, которые несут данные риски. Предлагается следующая постановка проблемы – обеспечить поддержку руководству компаний и их акционерам при принятии стратегических решений в области управления нефтегазовыми проектами на основе применения международных стандартов в области качества и управления рисками.
Цель. Рассмотреть принципиальные подходы к управлению политическими рисками для целей практического применения в нефтегазовых проектах с точки зрения международных стандартов ИСО 9001 и ИСО 31000.
Результаты. Исследованы вопросы внутреннего и внешнего контекста организации, вовлечения заинтересованных сторон, идентификации, анализа и оценки рисков, подготовки конкретных мероприятий по управлению политическими рисками, их мониторинга и корректировки, анализа эффективности реализуемых мероприятий. Далее цикл управления политическими рисками рассмотрен на практическом примере управления нефтегазовым проектом в одной из российских компаний.
Практическая значимость. Даны рекомендации по применению риск-ориентированного подхода при принятии инвестиционных решений и реализации нефтегазовых проектов с точки зрения критических элементов системы управления рисками. Отмечена практическая значимость не только для предприятий нефтегазовой отрасли – в целом рассмотренные подходы применимы к любым другим предприятиям и проектам.
A plane 1.88-spanner for points in convex position
Creators: name: Biniaz, Ahmad
name: Amani, Mahdi
name: Maheshwari, Anil
name: Smid, Michiel
name: Bose, Prosenjit
name: De Carufel, Jean-Lou
Publisher: name: Journal of Computational Geometry
Year: 2016

description: Let $S$ be a set of $n$ points in the plane that is in convex position. For a real number $t>1$, we say that a point $p$ in $S$ is $t$-good if for every point $q$ of $S$, the shortest-path distance between $p$ and $q$ along the boundary of the convex hull of $S$ is at most $t$ times the Euclidean distance between $p$ and $q$. We prove that any point that is part of (an approximation to) the diameter of $S$ is $1.88$-good. Using this, we show how to compute a plane $1.88$-spanner of $S$ in $O(n)$ time, assuming that the points of $S$ are given in sorted order along their convex hull. Previously, the best known stretch factor for plane spanners was $1.998$ (which, in fact, holds for any point set, i.e., even if it is not in convex position).
description: Journal of Computational Geometry, Vol. 7 No. 1 (2016)
title: Автоматическое распознавание возраста и пола диктора на основе глубоких нейронных сетей
Creators: name: ., М.В. Маркитантов – мл. науч. сотрудник, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: m.markitantov@yandex.ru А.А. Карпов – д.т.н., доцент, гл. науч. сотрудник, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: karpov@iias.spb.su
Publisher: name: Издательство Радиотехника
Year: 2019

description: Постановка проблемы. Современные системы автоматического распознавания возраста и пола диктора не позволяют получить удовлетворительную точность распознавания. Это осложняется влиянием таких факторов, как, например, фоновый шум и голосовая вариативность.
Цель. Разработать подходы для автоматического распознавания возраста и пола диктора, которые позволят увеличить точность распознавания.
Результаты. Результаты исследования могут использоваться в различных автоматических системах верификации и идентификации дикторов, в частности, в работе телефонных контакт-центров, учреждений здравоохранения и для повышения эффективности целевой рекламы, что обуславливает практическую значимость работы. В работе использовались методы исследования, среди которых ведущими были следующие: анализ, синтез, обобщение и эксперимент. Проводились эксперименты с использованием разных топологий DNN, включая нейронные сети с полносвязными и сверточными слоями. Обучение и тестирование предложенных моделей производилось на корпусе немецкой речи aGender. При распознавании пола и возраста по отдельности получена точность 88,10% и 57,53% соответственно. В совместном распознавании пола и возраста диктора предложенная система достигла точности (accuracy) 48,41%.
Практическая значимость. DNN позволила достичь лучшего результата по распознаванию возраста диктора по голосу в сравнении с существующими классическими подходами.
Two-point L1 shortest path queries in the plane
Creators: name: Chen, Danny Z.
name: Inkulu, Rajasekhar
name: Wang, Haitao
Publisher: name: Journal of Computational Geometry
Year: 2016

description: Let $P$ be a set of $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices in the plane. We consider the problem of building a data structure that can quickly compute an $L_1$ shortest obstacle-avoiding path between any two query points $s$ and $t$. Previously, a data structure of size $O(n^2\log n)$ was constructed in $O(n^2\log^2 n)$ time that answers each two-point query in $O(\log^2 n+k)$ time, i.e., the shortest path length is reported in $O(\log^2 n)$ time and an actual path is reported in additional $O(k)$ time, where $k$ is the number of edges of the output path. In this paper, we build a new data structure of size $O(n+h^2 \log h 4^{\sqrt{\log h}})$ in $O(n+h^2 \log^{2}h 4^{\sqrt{\log h}})$ time that answers each query in $O(\log n+k)$ time. (In contrast, for the Euclidean version of this two-point query problem, the best known algorithm uses $O(n^{11})$ space to achieve an $O(\log n+k)$ query time.) Further, we extend our techniques to the weighted rectilinear version in which the ``obstacles" of $P$ are rectilinear regions with ``weights" and allow $L_1$ paths to travel through them with weighted costs. Previously, a data structure of size $O(n^2\log^2 n)$ was built in $O(n^2\log^2 n)$ time that answers each query in $O(\log^2 n+k)$ time. Our new algorithm answers each query in $O(\log n+k)$ time with a data structure of size $O(n^2 \log n 4^{\sqrt{\log n}})$ that is built in $O(n^2 \log^2 n 4^{\sqrt{\log n}})$ time.
description: Journal of Computational Geometry, Vol. 7 No. 1 (2016)
title: Метод мультимодального распознавания одноручных элементов языка жестов
Creators: name: ., А.А. Аксёнов – мл. науч. сотрудник, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: a.aksenov95@mail.ru Д.А. Рюмин – науч. сотрудник, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: dl_03.03.1991@mail.ru И.А. Кагиров – мл. науч. сотрудник, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: kagirov@iias.spb.su Д.В. Иванько – науч. сотрудник, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: denis.ivanko11@gmail.com
Publisher: name: Издательство Радиотехника
Year: 2019

description: Постановка проблемы. Жесты в повседневной жизни играют очень важную роль, так как относятся к невербальному общению (языку тела). Кроме того, в настоящее время распознавание жестов все больше применяется в разнообразных интеллектуальных системах, к примеру, для человеко-машинного взаимодействия, виртуальной реальности.
Цель. Рассмотреть метод мультимодального распознавания как динамических, так и статических одноручных жестов русского жестового языка с помощью трехмерной сверточной LSTM-нейронной сети.
Результаты. Представлен набор данных в форматах RGB и карты глубины, который состоит из 48 одноручных жестов русского жестового языка. Набор данных получен с помощью датчика-дальномера Kinect v2 и состоит из записей 13 разных носителей русского жестового языка. Полученные результаты сравнивались с другими подходами распознавания жестов. Эксперимент по классификации показал большой потенциал нейронных сетей для этой задачи. Достигнута точность распознавания 74,07%, что является лучшим результатом по отношению к другим подходам решения данной проблемы.
Практическая значимость. Область востребованности системы автоматического распознавания элементов русского жестового языка способна охватить глобальные области применения.
title: Метод описания значения слова на основе ассоциативно-онтологического подхода
Creators: name: ., К.В. Ненаусников – аспирант, мл. науч. сотрудник, лаборатория автоматизации научных исследований, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: nenausnikovkv@iias.spb.su В.В. Александров – д.т.н., профессор, гл. науч. сотрудник, лаборатория автоматизации научных исследований, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: alexandr@iias.spb.su
Publisher: name: Издательство Радиотехника
Year: 2019

description: Постановка проблемы. В связи с многозначностью слов естественного языка определить значение конкретного слова можно, исходя из контекста, путем анализа его связей с окружающими словами. Существуют подходы, позволяющие решить задачу выявления значений слов текста с высокой точностью за счет ужесточения требований к объемам текстов анализируемых источников.
Цель. Разработать метод и алгоритм представления значений слова для небольших корпусов текстов на естественном языке.
Результаты. Использована методология ассоциативно-онтологического подхода к обработке текстов естественного языка. Предложен и апробирован новый метод автоматического выявления значений слов на основе ассоциативно-онтологического подхода. Метод позволяет автоматически выделять из предложенного набора документов описание объектов (предметов, фактов и т.д.) и общее описание каждого из значений по мере объединения значений, выделенных из текста, которое набирает центральный вес за счет расширения общеупотребимых слов, и поэтому содержит все больше возможных описаний. Таким образом, система имеет определенное конечное состояние даже при большом объеме входных данных.
Практическая значимость. Разработанный метод может быть применен как к малым, так и к большим корпусам текстов без предварительной подготовки (аннотирование корпусов, составление тезаурусов и т.д.).
title: Управление человеческими ресурсами для совместного решения задач на основе подходов к управлению компетенциями и геймификации
Creators: name: ., М.В. Петров – аспирант, СПб НИУ информационных технологий, механики и оптики; мл. науч. сотрудник, лаборатория интегрированных систем автоматизации, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: mikhail.petrov@iias.spb.su А.М. Кашевник – к.т.н., ст. науч. сотрудник, лаборатория интегрированных систем автоматизации, Санкт-Петербургский институт информатики и автоматизации РАН E-mail: alexey@iias.spb.su
Publisher: name: Издательство Радиотехника
Year: 2019

description: Постановка проблемы. В области управления человеческими ресурсами в последнее время часто применяется подход к геймификации. Данный подход позволяет повысить мотивированность, улучшить эффективность и производительность работников без значительных затрат со стороны компании. Сочетание подхода к геймификации и широко используемой технологии управления компетенциями, позволяющей эффективно использовать сильные стороны работников и организации, расширяет возможности обоих подходов, увеличивая мотивированность сотрудников и обеспечивая участие в проектах наиболее компетентных экспертов. Модели, описываемые в данной статье, используют упомянутые подходы для увеличения эффективности управления человеческими ресурсами при совместном решении задач.
Цель. Повысить эффективность управления человеческими ресурсами при совместном решении ими задач за счет разработки моделей на основе технологии управления компетенциями и подхода к геймификации.
Результаты. Описаны математическая и концептуальная модели системы управления человеческими ресурсами, используемые для автоматизированного распределения персонала организации для работы в проектах, охватывающие различные профессиональные компетенции. Применение данных моделей в системе управления компетенциями показало их эффективность и применимость.
Практическая значимость. Использование данных моделей позволило формализовать не только умения отдельных сотрудников организации, но и их достижения, в том числе совместные, и сильные стороны. Кроме того, используемый подход к геймификации позволит эффективно персонифицировано мотивировать сотрудников без существенных затрат для компании.
Dark matter within the minimal flavour violation ansatz
Creators: name: Lopez-Honorez, Laura
name: Merlo, Luca
Publisher: name: arXiv
Year: 2013
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: Minimal Flavour Violation hypothesis can provide an attractive framework for Dark Matter (DM). We consider scalar DM candidates carrying flavour quantum numbers and whose representation under the flavour group guarantees DM stability. They interact with the Standard Model fields through Higgs portal at renormalisable level and also to quarks through dimension-6 operators. We provide a systematic analysis of the viable parameter space for the DM fields, which are triplet of the flavour group, considering several DM-quark interactions. In this framework, we analyse in which cases the viable parameter space differs from Higgs portal models thanks to the underlying flavour structure. In contrast to minimal Higgs portal scenarios, we find that light DM in the GeV mass range as well as heavier candidates above Higgs resonance could be allowed by colliders, direct and indirect DM detection searches as well as flavour constraints. The large mass regime above the top mass could even be beyond the reach of future experiments such as Xenon 1T.
description: 11 pages, 2 figures; v2: references added, version published on Phys.Lett.B
Deeply Virtual Compton Scattering at a Proposed High-Luminosity Electron-Ion Collider
Creators: name: Aschenauer, Elke-Caroline
name: Fazio, Salvatore
name: Kumericki, Kresimir
name: Mueller, Dieter
Publisher: name: arXiv
Year: 2013
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: Several observables for the deeply virtual Compton scattering process have been simulated in the kinematic regime of a proposed Electron-Ion Collider to explore the possible impact of such measurements for the phenomenological access of generalized parton distributions. In particular, emphasis is given to the transverse distribution of sea quarks and gluons and how such measurements can provide information on the angular momentum sum rule. The exact lepton energy loss dependence for the unpolarized $t$-differential electroproduction cross section, needed for a Rosenbluth separation, is also reported.
Generalized Killing spinors on Einstein manifolds
Creators: name: Moroianu, Andrei
name: Semmelmann, Uwe
Publisher: name: arXiv
Year: 2013
Subjects: subject: Differential Geometry (math.DG)
subject: FOS: Mathematics
subject: 53C25, 53C27, 53C40, 83C05

description: We study generalized Killing spinors on compact Einstein manifolds with positive scalar curvature. This problem is related to the existence compact Einstein hypersurfaces in manifolds with parallel spinors, or equivalently, in Riemannian products of flat spaces, Calabi-Yau, hyperkaehler, G_2 and Spin(7) manifolds.
description: 17 pages; new version including the 2-dimensional case and several stylistical improvements