Search

This paper analyzes two factoring algorithms, NFS (Number Field Sieve) and ECM (Elliptic Curve Method). The previous results only minimize their running times, however, we may need to minimize the storage size or running time with smaller success probability. We provide these trade-offs, L[s] (\(s\le 1/3\)) memory requires \(L[1-2s]\) running time for NFS, for example. This can be interpreted that NFS requires much more running time when reducing memory complexity.

Spatio-temporal data is one of the most important assets in the context of smart cities. Spatio-temporal big data comes from a variety of sensor devices, implies the state of urban operation, insight into the development trend. Due to the multidimensional characteristics and diverse analysis needs of spatial-temporal data, data analysis based on spatial-temporal data must take into account the large capacity, diversity and frequent changes of data. This makes spatial and temporal data analysis more difficult. In order to simplify the analysis of spatio-temporal data, a service-oriented intelligent framework is proposed. Firstly, the concept of spatio-temporal data service is introduced into the framework, and several common spatio-temporal data service models are defined. Then, a configurable scripting language was proposed to define the analytic application. We also developed a prototype tool to implement spatio-temporal data services on Hadoop. In order to prove the applicability of our method, we demonstrate the effectiveness of our work through a practical application-based study.

We try to describe in this paper how methods from extremal combinatorics play an important role in the development of parameterized algorithms, also sketching further venues how this influence could be even increased in order to obtain quick \(\mathcal {FPT}\) classification results. Conversely, we show how certain notions that have become of importance within parameterized algorithmics can be useful to keep in mind for combinatorialists. We hope that this account initiates fruitful future discussions between the different scientific sub-communities that usually comprise IWOCA and that make this event quite special.

Automated techniques for analysis and optimization of finite-precision computations have recently garnered significant interest. Most of these were, however, developed independently. As a consequence, reuse and combination of the techniques is challenging and much of the underlying building blocks have been re-implemented several times, including in our own tools. This paper presents a new framework, called Daisy, which provides in a single tool the main building blocks for accuracy analysis of floating-point and fixed-point computations which have emerged from recent related work. Together with its modular structure and optimization methods, Daisy allows developers to easily recombine, explore and develop new techniques. Daisy’s input language, a subset of Scala, and its limited dependencies make it furthermore user-friendly and portable.

Riemann’s mathematical papers contain many ideas that arise in physics, and some of them are motivated by problems from physics. In fact, it is not easy to separate Riemann’s ideas in mathematics from there in physics. Furthermore, Riemann’s philosophical ideas are often in the background of his work on science. The aim of this chapter is to give an overview of Riemann’s mathematical results based on physical reasoning or motivated by physics. We also elaborate on the relation with philosophy. While we discuss some of Riemann’s philosophical points of view, we review some ideas on the same subjects emitted by Riemann’s predecessors, and in particular Greek philosophers, mainly the pre-socratics and Aristotle.

Okumura proposed a candidate of post-quantum cryptosystem based on Diophantine equations of degree increasing type (DEC). Sizes of public keys in DEC are small, e.g., 1,200 bits for 128 bit security, and it is a strongly desired property in post-quantum erea.

International audience; We advocates here the use of (mathematical) logic for systems biology, as a unified framework well suited for both modeling the dynamic behaviour of biological systems, expressing properties of them, and verifying these properties. The potential candidate logics should have a traditional proof theoretic pedigree (including a sequent calculus presentation enjoying cut-elimination and focusing), and should come with (certified) proof tools. Beyond providing a reliable framework, this allows the adequate encodings of our biological systems. We present two candidate logics (two modal extensions of linear logic, called HyLL and SELL), along with biological examples. The examples we have considered so far are very simple ones-coming with completely formal (interactive) proofs in Coq. Future works includes using automatic provers, which would extend existing automatic provers for linear logic. This should enable us to specify and study more realistic examples in systems biology, biomedicine (diagnosis and prognosis), and eventually neuroscience.

The present study, which is a continuation of the previous paper, augments a recent work on the use of phylogenetic networks. We develop techniques to characterize the topology of various X-trees and binary trees of biological and phylogenetic interests. We have obtained the results for various k-level X-trees and phylogenetic networks with variants of Zagreb, Szeged, Padmakar-Ivan, Schultz and Atom Bond Connectivity topological indices.

In this short paper, we reduce the proof of the Leopoldt Conjecture to the proof of the fact that Iwasawa’s \(\mu \)-constant vanishes for all CM \(\mathbb {Z}_p\)-extensions, an assumption that will be proved in a separate paper.

The Protecting Access to Medicare Act (PAMA) mandates clinical decision support mechanism (CDSM) consultation for all advanced imaging. There are a growing number of studies examining the association of CDSM use with imaging appropriateness, but a paucity of multicenter data. This observational study evaluates the association between changes in advanced imaging appropriateness scores with increasing provider exposure to CDSM. Each provider’s first 200 consecutive anonymized requisitions for advanced imaging (CT, MRI, ultrasound, nuclear medicine) using a single CDSM (CareSelect, Change Healthcare) between January 1, 2017 and December 31, 2019 were collected from 288 US institutions. Changes in imaging requisition proportions among four appropriateness categories (“usually appropriate” [green], “may be appropriate” [yellow], “usually not appropriate” [red], and unmapped [gray]) were evaluated in relation to the chronological order of the requisition for each provider and total provider exposure to CDSM using logistic regression fits and Wald tests. The number of providers and requisitions included was 244,158 and 7,345,437, respectively. For 10,123 providers with ≥ 200 requisitions (2,024,600 total requisitions), the fraction of green, yellow, and red requisitions among the last 10 requisitions changed by +3.0% (95% confidence interval +2.6% to +3.4%), −0.8% (95% CI −0.5% to −1.1%), and −3.0% (95% CI 3.3% to −2.7%) in comparison with the first 10, respectively. Providers with > 190 requisitions had 8.5% (95% CI 6.3% to 10.7%) more green requisitions, 2.3% (0.7% to 3.9%) fewer yellow requisitions, and 0.5% (95% CI −1.0% to 2.0%) fewer red (not statistically significant) requisitions relative to providers with ≤ 10 requisitions. Increasing provider exposure to CDSM is associated with improved appropriateness scores for advanced imaging requisitions.

In the paper, by virtue of the binomial inversion formula, a general formula of higher order derivatives for a ratio of two differentiable function, and other techniques, the authors compute several sums in terms of the beta function and its partial derivatives, polygamma functions, the Gauss hypergeometric function, and a determinant. These results generalize known ones in combinatorics. This preprint has been formally published as "Feng Qi and Chuan-Jun Huang, Computing sums in terms of beta, polygamma, and Gauss hypergeometric functions, Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales Serie A Matematicas, Vol. 114, Paper No. 191, 9 pages (2020); available online at https://doi.org/10.1007/s13398-020-00927-y."

We propose methods to estimate sufficient reductions in matrix-valued predictors for regression or classification. We assume that the first moment of the predictor matrix given the response can be decomposed into a row and column component via a Kronecker product structure. We obtain least squares and maximum likelihood estimates of the sufficient reductions in the matrix predictors, derive statistical properties of the resulting estimates and present fast computational algorithms with assured convergence. The performance of the proposed approaches in regression and classification is compared in simulations.We illustrate the methods on two examples, using longitudinally measured serum biomarker and neuroimaging data.

We study the stability with respect to a broad class of perturbations of gapped ground state phases of quantum spin systems defined by frustration-free Hamiltonians. The core result of this work is a proof using the Bravyi-Hastings-Michalakis (BHM) strategy that under a condition of Local Topological Quantum Order, the bulk gap is stable under perturbations that decay at long distances faster than a stretched exponential. Compared to previous work we expand the class of frustration-free quantum spin models that can be handled to include models with more general boundary conditions, and models with discrete symmetry breaking. Detailed estimates allow us to formulate sufficient conditions for the validity of positive lower bounds for the gap that are uniform in the system size and that are explicit to some degree. We provide a survey of the BHM strategy following the approach of Michalakis and Zwolak, with alterations introduced to accommodate more general than just periodic boundary conditions and more general lattices. We express the fundamental condition known as LTQO by means of the notion of indistinguishability radius, which we introduce. Using the uniform finite-volume results we then proceed to study the thermodynamic limit. We first study the case of a unique limiting ground state and then also consider models with spontaneous breaking of a discrete symmetry. In the latter case, LTQO cannot hold for all local observables. However, for perturbations that preserve the symmetry, we show stability of the gap and the structure of the broken symmetry phases. We prove that the GNS Hamiltonian associated with each pure state has a non-zero spectral gap above the ground state., Turned off `showkeys' :) and minor edits

We show that the space $\mathcal{S}'(\Gamma)$ of Laplace transformable distributions, where $\Gamma \subseteq \mathbb{R}^d$ is a non-empty convex open set, is an ultrabornological (PLS)-space. Moreover, we determine an explicit topological predual of $\mathcal{S}'(\Gamma)$., Comment: 10 pages

The objective of this short paper is to present discrete functional analysis tools for proving the convergence of numerical schemes, mainly for elliptic and parabolic equations (Stefan problem and incompressible and compressible Navier–Stokes equations, for instance). The main part of these results are given in some papers coauthored with several coworkers.

This short paper proposes two novel methodologies for analyzing scientific applications in distributed environments, using workload requirements. The first explores the impact of features such as problem size and programming language, over different computational architectures. The second explores the impact of mapping virtual cluster resources on the performance of parallel applications.

An algorithm we have introduced has a great effect on quantifier elimination of a first order formula containing many equalities. When the parametric ideal generated by the underlying equalities is not radical, however, our algorithm tends to produce an unnecessarily complicated formula. In this short paper, we show a result concerning Hermitian quadratic forms. It enables us to improve our algorithm so that we can get a simple formula without any radical computation.

The conventional wastewater treatment processes aim to remove pathogens and priority pollutants in terms of chemical and physical characteristics such as chemical oxygen demand (COD), biological oxygen demand (BOD) and total suspended solids (TSS). Some of the technologies are used for reduction of nutrients such as the phycoremediation process which has high efficiency for the reduction of total nitrogen and phosphorus from the wastewater. Unfortunately, these techniques have no contribution to the removal of XOCs. The greywater with XOCs should be subjected to an advanced treatment process to remove xenobiotic organic compounds (XOCs) before the final disposal into the environment. The current treatment by the oxidation processes is insufficient and expensive as well as have many of toxic by-products. This gap offered the investigators greater opportunities to explore effective and eco-friendly alternative technologies for XOCs degradation in greywater. Moreover, many of the fungi from the peat soil especially that belong to white rot fungi have higher enzymatic activities and produce a lot of oxidative enzymes such as laccase, lignin and manganese peroxidases. These enzymes are the main factor in the bioremediation process of the pollutants in the contaminated environment such as wastewater. Among different types of the oxidative enzymes from the fungi, the peroxidase and laccase have high importance in the biodegradation of XOCs. The current chapter discusses the potential of fungi as an alternative green technology for the degradation of XOCs from the greywater.

In the present communication nanocellulose was prepared from agricultural waste sugarcane bagasse and used for the removal of cationic dye methylene blue . Nanocellulose was prepared using bleaching treatment of agricultural waste followed by acid hydrolysis . SEM, TEM and TGA techniques were used to characterize prepared nanocellulose particles. Adsorption studies were optimized using simple batch experiments. Maximum sorption efficiency obtained for the removal of methylene blue using nanocellulose is 35 mg/g. The adsorption process fitted well for both Langmuir and freundlich isotherms. Regeneration studies signify that nanocellulose can be used successively up to 6 cycles of adsorption/desorption.

The origins of the alternating Schwarz method lie in the difficulty to prove the Dirichlet principle. This principle was evoked by Riemann in the proof of what is now the well known Riemann Mapping Theorem. We tell in this short paper the story of this exciting journey through the world of research mathematicians, up to the first computational Schwarz methods.

We address the problem of security of cyber-physical systems where some sensors may be malicious. We consider a multiple-input, multiple-output stochastic linear dynamical system controlled over a network of communication and computational nodes which contains (i) a controller that computes the inputs to be applied to the physical plant, (ii) actuators that apply these inputs to the plant, and (iii) sensors which measure the outputs of the plant. Some of these sensors, however, may be malicious. The malicious sensors do not report the true measurements to the controller. Rather, they report false measurements that they fabricate, possibly strategically, so as to achieve any objective that they may have, such as destabilizing the closed-loop system or increasing its running cost. Recently, it was shown that under certain conditions, an approach of “dynamic watermarking” can secure such a stochastic linear dynamical system in the sense that either the presence of malicious sensors in the system is detected, or the malicious sensors are constrained to adding a distortion that can only be of zero power to the noise already entering the system. The first contribution of this paper is to generalize this result to partially observed MIMO systems with both process and observation noises, a model which encompasses some of the previous models for which dynamic watermarking was established to guarantee security. This result, similar to the prior ones, is shown to hold when the controller subjects the reported sequence of measurements to two particular tests of veracity. The second contribution of this paper is in showing, via counterexamples, that both of these tests are needed in order to secure the control system in the sense that if any one of these two tests of sensor veracity is dropped, then the above guarantee does not hold. Finally, a survey of recent results in Dynamic Watermarking is presented, along with a laboratory demonstration in securing a prototypical intelligent transportation system. The proposed approach has several potential applications, including in smart grids, automated transportation, and process control.

For many algorithmic problems on graphs of treewidth t , a standard dynamic programming approach gives an algorithm with time and space complexity 2O(t)⋅nO(1) . It turns out that when one considers the more restrictive parameter treedepth, it is often the case that a variation of this technique can be used to reduce the space complexity to polynomial, while retaining time complexity of the form 2O(d)⋅nO(1) , where d is the treedepth. This transfer of methodology is, however, far from automatic. For instance, for problems with connectivity constraints, standard dynamic programming techniques give algorithms with time and space complexity 2O(tlogt)⋅nO(1) on graphs of treewidth t , but it is not clear how to convert them into time-efficient polynomial space algorithms for graphs of low treedepth. Cygan et al. (FOCS’11) introduced the Cut&Count technique and showed that a certain class of problems with connectivity constraints can be solved in time and space complexity 2O(t)⋅nO(1) . Recently, Hegerfeld and Kratsch (STACS’20) showed that, for some of those problems, the Cut&Count technique can be also applied in the setting of treedepth, and it gives algorithms with running time 2O(d)⋅nO(1) and polynomial space usage. However, a number of important problems eluded such a treatment, with the most prominent examples being Hamiltonian Cycle and Longest Path. In this paper we clarify the situation by showing that Hamiltonian Cycle, Hamiltonian Path, Long Cycle, Long Path, and Min Cycle Cover all admit 5d⋅nO(1) -time and polynomial space algorithms on graphs of treedepth d . The algorithms are randomized Monte Carlo with only false negatives.

The paper provides a practical guide on initialization of the recursive mixture-based clustering of non-negative data. For modeling the non-negative data, mixtures of uniform, exponential, gamma and other distributions can be used. Initialization is known to be an important task for a start of the mixture estimation algorithm. Within the considered recursive approach, the key point of initialization is a choice of initial statistics of the involved prior distributions. The paper describes several initialization techniques for the mentioned types of components that can be beneficial primarily from a practical point of view.

Over the past several decades, accessibility has been increasingly pervading a vast range of fields, producing a large number of new ideas, theories, and innovations that have already proven to be quite fruitful. A closer look at how accessibility has entered and developed in various research fields shows that said fields have experienced fundamental changes: a shift from particularist accounts to a universalist account of access, a shift from maker-centred to user-centred approaches, and a shift from reactive to proactive approaches. Through these processes, accessibility has birthed new areas within those fields, that have been gradually converging to constitute the wider field of accessibility studies. The nature and position of accessibility studies has now become a central topic. This ongoing progression of conceptual clarification may bear some misunderstanding and misinterpretations along the way. In the paper, I first briefly review the principal traits of the process of formation of accessibility studies; then address some possible misconceptions; and finally, introduce a first, very general sketch of poietic design, a method proper to accessibility studies.

In the current globalisation framework where electronic transactions and data sharing is a common activity, cyber-risks analysis, protection and avoidance have become a key aspect which must be book and prioritised on the business agenda in companies. Nevertheless, this issue is difficult to analyse given the dimension of the problem and the company units and individuals and infrastructures which are involved. In consequence, cyber-insurance is considered as the appropriate mean to avoid financial losses caused by information technologies infrastructures and procedures security breaches. This paper analyses and describes how costumers and their cyber-risks should be assessed by an insurance company in order to establish the company status and implement the required actions to fix the issue. This work describes the three phases required to complete a full cyber-risk assessment and the risks evaluation. Furthermore, the paper highlights the resources that the insurer should keep in its road-map to implement the risk assessment and, thus, to determine the company insurability, and the requirements to reach such condition. After the risk analysis completion at the customer’s premises, it must be evaluated subsequently at all levels. Among other factors, this evaluation is based on 63 question criteria. In the risk assessment criteria weights are not uniformly distributed and weighting is applied according to the relevance. In particular, criteria that should receive a special attention are referred to as showstoppers.

Kottakkaran Sooppy Nisar, Feng Qi, Gauhar Rahman, Shahid Mubeen, and Muhammad Arshad, Some inequalities involving the extended gamma function and the Kummer confluent hypergeometric $k$-function, Journal of Inequalities and Applications 2018, Paper No. 135, 12 pages; available online at https://doi.org/10.1186/s13660-018-1717-8.; International audience; In the paper, the authors present some inequalities involving the extended gamma function and the Kummer confluent hypergeometric $k$-function via some classical inequalities such as the Chebychev inequality for synchronous (or asynchronous, respectively) mappings, give a new proof of the log-convexity of the extended gamma function by using the H\"older inequality, and introduce a Tur\'an type mean inequality for the Kummer confluent $k$-hypergeometric function.

With the advent of manycore systems, shared memory parallelisation has gained importance in high performance computing. Once a code is decomposed into tasks or parallel regions, it becomes crucial to identify reasonable grain sizes, i.e. minimum problem sizes per task that make the algorithm expose a high concurrency at low overhead. Many papers do not detail what reasonable task sizes are, and consider their findings craftsmanship not worth discussion. We have implemented an autotuning algorithm, a machine learning approach, for a project developing a hyperbolic equation system solver. Autotuning here is important as the grid and task workload are multifaceted and change frequently during runtime. In this paper, we summarise our lessons learned. We infer tweaks and idioms for general autotuning algorithms and we clarify that such a approach does not free users completely from grain size awareness.

Operations Research Proceedings 2017 : Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6-8, 2017 International Conference on Operations Research, GOR 2017, Berlin, Germany, 6 Sep 2017 - 8 Sep 2017; Cham : Springer International Publishing, Operations Research Proceedings 729-735 (2018). doi:10.1007/978-3-319-89920-6_97, Published by Springer International Publishing, Cham

The general concept, called the formal framework of P systems provides a representation to study and analyze different variants of P systems. In this paper, two well-known models, P colonies and P systems with multi-stable catalysts are considered. We show that the obtained representations are identical, thus both models can be related using a bi-simulation. This fact opens new approaches for studying both P colonies and catalytic P systems.

Manufacturers need be proactive, innovative and operationally efficient to succeed in the current business environment. The transition toward sustainable manufacturing requires new approaches in the design, manufacture and use of products and services. These approaches need to take into account the network of stakeholders who influence and can be influenced by the sustainability of the product in the course of its life cycle. This paper presents results of a case study that used and tested methods and tools developed for creating a sustainable business model for a manufacturing company. The main research questions addressed here are: how to develop a sustainable business model; and how to explicitly illustrate to potential customers the life cycle costs of different solutions.

We consider a restless multi-armed bandit (RMAB) in which each arm can be in one of two states, say 0 or 1. Playing an arm generates a unit reward with a probability that depends on the state of the arm. The belief about the state of the arm can be calculated using a Bayesian update after every play. This RMAB has been designed for use in recommendation systems where the user’s preferences depend on the history of recommendations. In this paper we analyse the RMAB by first studying single armed bandit. We show that it is Whittle-indexable and obtain a closed form expression for the Whittle index. For a RMAB to be useful in practice, we need to be able to learn the parameters of the arms. We present Thompson sampling scheme, that learns the parameters of the arms and also illustrate its performance numerically.

In the present paper, we consider the nonparametric regression model with random design based on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\mathbf{X}_\mathrm{t},\mathbf{Y}_\mathrm{t})_{\mathrm{t}\ge 0}$$\end{document}(Xt,Yt)t≥0 a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {R}^{d}\times \mathbb {R}^{q}$$\end{document}Rd×Rq-valued strictly stationary and ergodic continuous time process, where the regression function is given by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\mathbf{x},\psi ) = \mathbb {E}(\psi (\mathbf{Y}) \mid \mathbf{X} = \mathbf{x}))$$\end{document}m(x,ψ)=E(ψ(Y)∣X=x)), for a measurable function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi : \mathbb {R}^{q} \rightarrow \mathbb {R}$$\end{document}ψ:Rq→R. We focus on the estimation of the location \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Theta }}$$\end{document}Θ (mode) of a unique maximum of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\cdot , \psi )$$\end{document}m(·,ψ) by the location \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \widehat{{\varvec{\Theta }}}_\mathrm{T}$$\end{document}Θ^T of a maximum of the Nadaraya–Watson kernel estimator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\widehat{m}_\mathrm{T}(\cdot , \psi )$$\end{document}m^T(·,ψ) for the curve \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\cdot , \psi )$$\end{document}m(·,ψ). Within this context, we obtain the consistency with rate and the asymptotic normality results for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \widehat{{\varvec{\Theta }}}_\mathrm{T}$$\end{document}Θ^T under mild local smoothness assumptions on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\cdot , \psi )$$\end{document}m(·,ψ) and the design density \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f(\cdot )$$\end{document}f(·) of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{X}$$\end{document}X. Beyond ergodicity, any other assumption is imposed on the data. This paper extends the scope of some previous results established under the mixing condition. The usefulness of our results will be illustrated in the construction of confidence regions.

In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation.

Patient information leaflets (PILs) differ across regulatory jurisdictions—its form and structure are dependent on the regulations it conforms to. Yet, physical or paper-based documents remain to be the most prevalent way of delivering important information to patients. As technology continues to enhance our daily activities, patients are increasingly utilizing digital platforms to facilitate access to relevant product information, hence questioning the continuous viability of physical PILs. This paper aims to present the growing importance of transitioning from print to screen via dynamic electronic product information, as a way of expanding access and utility of patient information. It provides considerations or reflection points for regulators when adopting digital platforms to ensure that stakeholders, especially patients, receive trusted and real-time information on available and approved medicinal products. We underscore these with examples and case studies from countries and businesses that have adopted or are transitioning to such platforms.

In this paper we extend the definition of a multiset by allowing elements to have multiplicities from an arbitrary totally ordered Abelian group instead of only using natural numbers. We consider P systems with such generalized multisets and give well-founded notations for the applicability of rules and for different derivation modes. These new definitions raise challenging mathematical questions and we propose several solutions yielding models sometimes having quite unexpected behavior. Another interesting application of our results is the possibility to consider complex objects and to manipulate them directly in a P system instead of their numerical encodings.

A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels is the label of another vertex of the graph. Most papers on sum graphs consider combinatorial questions like the minimum number of isolated vertices that need to be added to a given graph to make it a sum graph. In this paper, we initiate the study of sum graphs from the viewpoint of computational complexity. Note that every n-vertex sum graph can be represented by a sorted list of n positive integers where edge queries can be answered in \(\mathscr {O}(\log n)\) time. Thus, limiting the size of the vertex labels upper-bounds the space complexity of storing the graph.

In this paper, we study the problem of computing the \(\mathcal {L}_{\infty }\)-norm of finite-dimensional linear time-invariant systems. This problem is first reduced to the computation of the maximal x-projection of the real solutions \((x, \, y)\) of a bivariate polynomial system \({\varSigma = \,}\{P,\frac{\partial P}{\partial y}\}\), with \(P\, \in \mathbb {Z}[x,y]\). Then, we use standard computer algebra methods to solve the problem. In this paper, we alternatively study a method based on rational univariate representations, a method based on root separation, and finally a method first based on the sign variation of the leading coefficients of the signed subresultant sequence and then based on the identification of an isolating interval for the maximal x-projection of the real solutions of \(\varSigma \).

Assignment flows are a general class of dynamical models for context dependent data classification on graphs. These flows evolve on the product manifold of probability simplices, called assignment manifold, and are governed by a system of coupled replicator equations. In this paper, we adopt the general viewpoint of Lagrangian mechanics on manifolds and show that assignment flows satisfy the Euler-Lagrange equations associated with an action functional. Besides providing a novel interpretation of assignment flows, our result rectifies the analogous statement of a recent paper devoted to uncoupled replicator equations evolving on a single simplex, and generalizes it to coupled replicator equations and assignment flows.

Life course research has been dominated by methods and models that focus on the description of life course patterns and on the causal patterns between agency- and structure-related variables on the one hand and, on the other hand, outcomes in later life. Little attention has been paid to modelling the driving force, the mechanism, that generates the chain of successive events and stages of the life course: the sequences of individual decisions pertaining to all facets of the life course. This paper presents the minimal requirements that models should satisfy in order to be considered as life course generating models. The paper then proposes Hidden Markov Models as one of the main building blocks of life course generating models and discusses a few applications of these models in the domains of family formation, school-to-work transition and their interaction.

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by Hasemann, Hirvonen, Rybicki and Suomela (2016) that for every real $\alpha>1$ and integer $\Delta$, a fractional coloring of total weight at most $\alpha(\Delta+1)$ can be obtained deterministically in a single round in graphs of maximum degree $\Delta$, in the LOCAL model of computation. However, a major issue of this result is that the output of each vertex has unbounded size. Here we prove that even if we impose the more realistic assumption that the output of each vertex has constant size, we can find fractional colorings of total weight arbitrarily close to known tight bounds for the fractional chromatic number in several cases of interest. More precisely, we show that for any fixed $\epsilon > 0$ and $\Delta$, a fractional coloring of total weight at most $\Delta+\epsilon$ can be found in $O(\log^*n)$ rounds in graphs of maximum degree $\Delta$ with no $K_{\Delta+1}$, while finding a fractional coloring of total weight at most $\Delta$ in this case requires $\Omega(\log \log n)$ rounds for randomized algorithms and $\Omega( \log n)$ rounds for deterministic algorithms. We also show how to obtain fractional colorings of total weight at most $2+\epsilon$ in grids of any fixed dimension, for any $\epsilon>0$, in $O(\log^*n)$ rounds. Finally, we prove that in sparse graphs of large girth from any proper minor-closed family we can find a fractional coloring of total weight at most $2+\epsilon$, for any $\epsilon>0$, in $O(\log n)$ rounds., Comment: 16 pages, 2 figures. Full version of a paper accepted at SIROCCO 2021

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Grobner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate the solving degree of a system, focusing on systems arising within public-key cryptography. In particular, we show that it is upper bounded by, and often equal to, the Castelnuovo-Mumford regularity of the ideal generated by the homogenization of the equations of the system, or by the equations themselves in case they are homogeneous. We discuss the underlying commutative algebra and clarify under which assumptions the commonly used results hold. In particular, we discuss the assumption of being in generic coordinates (often required for bounds obtained following this type of approach) and prove that systems that contain the field equations or their fake Weil descent are in generic coordinates. We also compare the notion of solving degree with that of degree of regularity, which is commonly used in the literature. We complement the paper with some examples of bounds obtained following the strategy that we describe.

It has been shown recently that many non-convex objective/loss functions in machine learning are known to be strict saddle. This means that finding a second-order stationary point (i.e., approximate local minimum) and thus escaping saddle points are sufficient for such functions to obtain a classifier with good generalization performance. Existing algorithms for escaping saddle points, however, all fail to take into consideration a critical issue in their designs, that is, the protection of sensitive information in the training set. Models learned by such algorithms can often implicitly memorize the details of sensitive information, and thus offer opportunities for malicious parties to infer it from the learned models. In this paper, we investigate the problem of privately escaping saddle points and finding a second-order stationary point of the empirical risk of non-convex loss function. Previous result on this problem is mainly of theoretical importance and has several issues (e.g., high sample complexity and non-scalable) which hinder its applicability, especially, in big data. To deal with these issues, we propose in this paper a new method called Differentially Private Trust Region, and show that it outputs a second-order stationary point with high probability and less sample complexity, compared to the existing one. Moreover, we also provide a stochastic version of our method (along with some theoretical guarantees) to make it faster and more scalable. Experiments on benchmark datasets suggest that our methods are indeed more efficient and practical than the previous one.

The internet of medical things (IoMT) is a relatively new territory for the internet of things (IoT) platforms where we can obtain a significant amount of potential benefits with the combination of cognitive computing. Effective utilization of the healthcare data is the critical factor in achieving such potential, which can be a significant challenge as the medical data is extraordinarily heterogeneous and spread across different devices with different degrees of importance and authority. To address this issue, in this paper, we introduce a cognitive internet of medical things architecture with a use case of early sepsis detection using electronic health records. We discuss the various aspects of IoMT architecture. Based on the discussion, we posit that the proposed architecture could improve the overall performance and usability in the IoMT platforms in particular for different IoMT based services and applications. The use of an RNN-LSTM network for early prediction of sepsis according to Sepsis-3 criteria is evaluated with the empirical investigation using six different time window sizes. The best result is obtained from a model using a four-hour window with the assumption that data is missing-not-at-random. It is observed that when learning from heterogeneous sequences of sparse medical data for early prediction of sepsis, the size of the time window has a considerable impact on predictive performance.

Paper presented at International Symposium on Ubiquitous Networking, UNet 2021, Virtual Event, May 19–22, 2021; International audience; In this paper, we consider the problem of link adaptation (rate allocation) of Orthogonal Multiple Access Multiple Relay Channel (OMAMRC) using the Multi-Armed Bandit (MAB) online learning framework. The cooperative system is composed of a transmission phase where sources transmit in a round robin manner, and a retransmission phase where a scheduled node sends redundancies. We assume that we have no knowledge of the Channel State Information (CSI) nor of the Channel Distributed Information (CDI). Accordingly, rate allocation must be learned online following a sequential learning algorithm. We adapt to one variant of the MAB framework algorithms, the Upper Confidence Bound (UCB) family, and specifically the UCB1 algorithm. The UCB1 algorithm achieves a logarithmic regret uniformly over time, without any preliminary knowledge about the reward distributions. Due to the exponential growth of the number of arms, following the multiple sources included in the rate allocation, the UCB1 algorithm features a complexity problem. Thus, we propose a sequential UCB1 (SUCB1) algorithm which solves the complexity issue, and outperforms the UCB1 algorithm.

For a hypergraph H, define its intersection spectrum I(H) as the set of all intersection sizes \(|E\cap F|\) of distinct edges \(E,F\in E(H)\). In their seminal paper from 1973 which introduced the local lemma, Erdős and Lovasz asked: how large must the intersection spectrum of a k-uniform 3-chromatic intersecting hypergraph be? They showed that such a hypergraph must have at least three intersection sizes, and conjectured that the size of the intersection spectrum tends to infinity with k. Despite the problem being reiterated several times over the years by Erdős and other researchers, the lower bound of three intersection sizes has remarkably withstood any improvement until now. In this paper, we prove the Erdős–Lovasz conjecture in a strong form by showing that there are at least \(k^{1/2-o(1)}\) intersection sizes. In this extended abstract we sketch a simpler argument which gives slightly weaker bound of \(k^{1/3-o(1)}.\) Our proof consists of a delicate interplay between Ramsey type arguments and a density increment approach.

In this paper, we give an overview of selected statistical models to draw (statistically significant) conclusions from data. This is particularly important to prove theoretical/physical models. For this reason, we initially describe classical modeling approaches in geostatistics and spatial econometrics. Moreover, we show how large spatial and spatiotemporal data can be modeled by these approaches. Therefore, we sketch selected suitable methods and their computational implementation. Thus, the paper should give a general guideline to analyze big geospatial data, where “big data” refers to the total number of spatially dependent observations, and to draw conclusions from these data. Finally, we compare two of these approaches by applying them to an empirical data set. To be precise, we model the particulate matter concentration (PM2.5) in Colorado.

In the United States, we have not yet reached the point where unedited numerators and denominators for death rates or probabilities are of satisfactory quality for measuring the mortality of centenarians. Ignoring this reality can lead to an estimation of extreme-age mortality which is unacceptable, as is the case for the NCHS’ Data Brief no. 233. Even the better-quality data from the Medicare health insurance program are beset by problems of (1) unreported or unrecorded deaths and (2) date of birth misstatement. On the other hand, there are steps that can be taken to improve the quality of the underlying data, so that the threshold age at which a mathematical model replaces actual data and closes out the life table is pushed further out.The paper begins with a description of the unacceptable results published in Data Brief no. 233 and a critical examination of their sources. The main part of the paper presents some steps to improve the quality of the Medicare enrollment counts. By rearranging the historical series on Medicare enrollment by cohort, it is possible to eliminate unreported and unrecorded deaths. A simple model is then introduced to deal with date of birth misstatement.

International audience; In this paper, we present an optimization for parsing with Lexicalized Tree-Adjoining Grammar which takes inspiration from previous work on polarity based grammar abstraction (Bonfante et al., 2004). We illustrate the impact of this optimization on two benchmarks and we relate our approach to the more general optimization framework proposed for Interaction Grammars by (Bonfante et al., 2009) and (Morey et al., 2011).

The utilization of games and its components in software building training isn’t new. In reality, their usage in Software development training is found to look into papers for numerous decades. Be that as it may, there is little data about the real reception of these methodologies in games designing and development training in terms of software building. Consequently, the objective of this paper is to research the utilization of game’s components in programming designing instruction, in the viewpoint of teachers. To accomplish this objective, this examination proposes and breaks down the aftereffects of a study replied by numerous product designing teachers. We test the members by welcoming multiple instructors from settled colleges and instructive organizations of various districts. The first objective of the review is to gather data relates to the utilization of important games and rich gamification in the student classrooms, and the second objective is to comprehend information territories and the pre-owned game-related techniques. The outcomes show that the more significant part of the educators knows about these instructive methodologies, the games were embraced by various members. Games that are generally played to cover “Programming Process” & “Task Management.” The utmost utilized game apparatuses are Points scoring, Quizzes solving, and meet challenges. The outcomes additionally reveal that the fundamental explanations behind not embracing the assets are the absence of information, lack of data about essential games for encouraging programming designing, and the absence of time to design and remember these methodologies for the classes At long last, results show a definite propensity towards the future appropriation of these game-related methodologies by the product developing teachers.