cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Probabilistic Planning in the Graphplan Framework
Creators: name: Avrim  Blum
name: Langford, John C.
Publisher: name: Carnegie Mellon University
Year: 2012
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains. In this paper we explore the extent to which its representation can be used for probabilistic planning. In particular, we consider an MDP-style framework in which the state of the world is known but actions are probabilistic, and the objective is to produce a finite horizon contingent plan with highest probability of success within the horizon. We describe two extensions of Graphplan in this direction. The first, PGraphplan, produces an optimal contingent plan. It typically suffers a performance hit compared to Graphplan but still appears to be fast compared with other approaches to probabilistic planning problems. The second, TGraphplan, runs at essentially the same speed as Graphplan, but produces potentially sub-optimal policies: TGraphplan’s policy selects the first action on the highest probability trajectory from its current state to the goal. Ideally, we would like an optimal planner for probabilistic domains with the same speed that Graphplan would have if the domain were made deterministic. By comparing the speed and quality of these two planners to each other and to other existing planners, we are able to estimate how far off we are from our ideal. PGraphplan is based on a forward-chaining search, unlike the backward-chaining search of the standard Graphplan algorithm. Thus, one focus of this paper is exploring the extent to which Graphplan’s representation can be used to speed up forward search in addition to the backward search for which it was originally intended.
title: ADCO, Sixième cartulaire de Saint-Étienne de Dijon (1662), Cart. 30 (G 133), 441 folios, f. 162
Creators: name: de la Côte d'Or, Archives départementales
name: CG21/F.PETOT/2012
name: Archives Départementales De La Côte-D'Or
name: Petot, Frédéric
name: Petot, Frédérique
name: Projet CBMA
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2020
Subjects: subject: cartulaire
subject: LaMOP
subject: Corpus Burgundiae Medii Aevi
subject: Laboratoire de Médiévistique Occidentale de Paris
subject: Chartes de la Bourgogne du Moyen Âge

description: Sixième cartulaire de Saint-Étienne de Dijon (1662), Archives départementales de la Côte-d'Or, Cart. 30 (G 133), 441 folios, f. 162, Numérisation en mode image.
description: Relation: http://www.cbma-project.eu/
description: Bibliographic citation: Sixième cartulaire de Saint-Étienne de Dijon (1662), Archives départementales de la Côte-d'Or, Cart. 30 (G 133), 441 folios, f. 162, in Projet CBMA - Corpus Burgundiae Medii Aevi [Ressource en ligne], https://manuscrits.cbma-project.eu/
description: Provenance: abbaye Saint-Étienne de Dijon
description: Provenance: http://www.wikidata.org/entity/Q15945019
Randomness Certification from Multipartite Quantum Steering for Arbitrary Dimensional Systems
Creators: name: Li, Yi
name: Xiang, Yu
name: Yu, Xiao-Dong
name: Nguyen, H. Chau
name: Gühne, Otfried
name: He, Qiongyi
Publisher: name: arXiv
Year: 2023
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: Entanglement in bipartite systems has been applied for the generation of secure random numbers, which are playing an important role in cryptography or scientific numerical simulations. Here, we propose to use multipartite entanglement distributed between trusted and untrusted parties for generating randomness of arbitrary dimensional systems. We show that the distributed structure of several parties leads to additional protection against possible attacks by an eavesdropper, resulting in more secure randomness generated than in the corresponding bipartite scenario. Especially, randomness can be certified in the group of untrusted parties, even there is no randomness exists in either of them individually. We prove that the necessary and sufficient resource for quantum randomness in this scenario is multipartite quantum steering when two measurement settings are performed on the untrusted parties. However, the sufficiency no longer holds with more measurement settings. Finally, we apply our analysis to some experimentally realized states and show that more randomness can be extracted in comparison to the existing analysis.
description: 14 pages, 5 figures
Privtrans : automatically partitioning programs for privilege separation
Creators: name: Brumley, David
name: Song, Dawn
Publisher: name: Carnegie Mellon University
Year: 1998
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Abstract: "Privilege separation partitions a single program into two parts: a privileged program called the monitor and an unprivileged program called the slave. All trust and privileges are relegated to the monitor, which results in a smaller and more secure trust base. Previously the privilege separation procedure, i.e., partitioning one program into the monitor and slave, was done by hand [17,26]. We design techniques and develop a tool called Privtrans that allows us to automatically add privilege separation to source code, provided a few programmer annotations. Additionally, we propose optimization techniques that augment static analysis with dynamic information. Our optimization techniques reduce the number of expensive calls made by the slave to the monitor. We show Privtrans is effective by integrating privilege separation into several open-source applications."
Bambusananus Li & Xing 2011
Creators: name: Huang, Yihong
name: Tang, Liuhong
name: Huang, Yingying
name: Webb, Michael D.
name: Duan, Yani
Publisher: name: Zenodo
Year: 2025
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hemiptera
Cicadellidae
Bambusananus

description: Bambusananus Li & Xing, 2024
Bambusananus Li & Xing, 2024: 271
(Type species: Bambusananus furcatus Li & Xing, 2024).
Included species:
anhuiensis sp. nov.
bipunctatus (Li, 1999: 334).
bispinosus (Xing & Li, 2016: 269).
cuihuashanensis (Yang & Chen, 2013: 110).
furcatus Li & Xing, 2024: 271.
lii (McKamey & Hicks, 2007: 933).
maculipennis (Li & Wang, 1993: 54).
yangae (Xing & Chen, 2013: 599).
description: Published as part of Huang, Yihong, Tang, Liuhong, Huang, Yingying, Webb, Michael D. & Duan, Yani, 2025, Two new bamboo feeding leafhopper species of the subfamily Deltocephalinae (Hemiptera: Cicadellidae) from China, pp. 287-304 in Zootaxa 5588 (2) on pages 298-299, DOI: 10.11646/zootaxa.5588.2.5, http://zenodo.org/record/14896497
Column and row operator spaces over QSL_p-spaces and their use in abstract harmonic analysis
Creators: name: Neufang, Matthias
name: Runde, Volker
Publisher: name: arXiv
Year: 2007
Subjects: subject: Functional Analysis (math.FA)
subject: FOS: Mathematics
subject: 43A65 (Primary); 22D12, 43A30, 46H25, 46J99, 47L25, 47L50 (Secondary)

description: The notions of column and row operator space were extended by A. Lambert from Hilbert spaces to general Banach spaces. In this paper, we use column and row spaces over quotients of subspaces of general $L_p$-spaces to equip several Banach algebras occurring naturally in abstract harmonic analysis with canonical, yet not obvious operator space structures that turn them into completely bounded Banach algebras. We use these operator space structures to gain new insights on those algebras.
description: 21 pages; some nip 'n tuck
Entropy stable flux correction for hydrostatic reconstruction scheme for shallow water flows
Creators: name: Kivva, Sergii
Publisher: name: arXiv
Year: 2023
Subjects: subject: Numerical Analysis (math.NA)
subject: FOS: Mathematics
subject: 65M08, MSC 65M22, 76M12

description: First-order hydrostatic reconstruction (HR) schemes for shallow water equations are highly diffusive whereas high-order schemes can produce entropy-violating solutions. Our goal is to develop a flux correction with maximum antidiffusive fluxes to obtain entropy solutions of shallow water equations with variable bottom topography. For this purpose, we consider a hybrid explicit HR scheme whose flux is a convex combination of first-order Rusanov flux and high-order flux. The conditions under which the explicit first-order HR scheme for shallow water equations satisfies the fully discrete entropy inequality have been studied. The flux limiters for the hybrid scheme are calculated from a corresponding optimization problem. Constraints for the optimization problem consist of inequalities that are valid for the first-order HR scheme and applied to the hybrid scheme. We apply the discrete cell entropy inequality with the proper numerical entropy flux to single out a physically relevant solution to the shallow water equations. A nontrivial approximate solution of the optimization problem yields expressions to compute the required flux limiters. Numerical results of testing various HR schemes on different benchmarks are presented.
Intrinsic shape analysis in archaeology: A case study on ancient sundials
Creators: name: Hanik, Martin
name: Ducke, Benjamin
name: Hege, Hans-Christian
name: Fless, Friederike
name: von Tycowicz, Christoph
Publisher: name: arXiv
Year: 2023
Subjects: subject: Computer Vision and Pattern Recognition (cs.CV)
subject: Computers and Society (cs.CY)
subject: Differential Geometry (math.DG)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics
subject: J.2; I.5.1; G.3; I.3.5; I.4.7

description: This paper explores a novel mathematical approach to extract archaeological insights from ensembles of similar artifact shapes. We show that by considering all the shape information in a find collection, it is possible to identify shape patterns that would be difficult to discern by considering the artifacts individually or by classifying shapes into predefined archaeological types and analyzing the associated distinguishing characteristics. Recently, series of high-resolution digital representations of artifacts have become available, and we explore their potential on a set of 3D models of ancient Greek and Roman sundials, with the aim of providing alternatives to the traditional archaeological method of ``trend extraction by ordination'' (typology). In the proposed approach, each 3D shape is represented as a point in a shape space -- a high-dimensional, curved, non-Euclidean space. By performing regression in shape space, we find that for Roman sundials, the bend of the sundials' shadow-receiving surface changes with the location's latitude. This suggests that, apart from the inscribed hour lines, also a sundial's shape was adjusted to the place of installation. As an example of more advanced inference, we use the identified trend to infer the latitude at which a sundial, whose installation location is unknown, was placed. We also derive a novel method for differentiated morphological trend assertion, building upon and extending the theory of geometric statistics and shape analysis. Specifically, we present a regression-based method for statistical normalization of shapes that serves as a means of disentangling parameter-dependent effects (trends) and unexplained variability.
description: accepted for publication from the ACM Journal on Computing and Cultural Heritage
Evidence of a truncated spectrum in the angular correlation function of the cosmic microwave background
Creators: name: Melia, Fulvio
name: Lopez-Corredoira, Martin
Publisher: name: arXiv
Year: 2017
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: General Relativity and Quantum Cosmology (gr-qc)
subject: High Energy Physics - Phenomenology (hep-ph)
subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: The lack of large-angle correlations in the fluctuations of the cosmic microwave background (CMB) conflicts with predictions of slow-roll inflation. But though probabilities (< 0.24%) for the missing correlations disfavor the conventional picture at > 3 sigma, factors not associated with the model itself may be contributing to the tension. Here we aim to show that the absence of large-angle correlations is best explained with the introduction of a non-zero minimum wavenumber k_min for the fluctuation power spectrum P(k). We assume that quantum fluctuations were generated in the early Universe with a well-defined power spectrum P(k), though with a cutoff k_min not equal to 0. We then re-calculate the angular correlation function of the CMB and compare it with Planck observations. The Planck 2013 data rule out a zero k_min at a confidence level exceeding 8 sigma. Whereas purely slow-roll inflation would have stretched all fluctuations beyond the horizon, producing a P(k) with k_min=0---and therefore strong correlations at all angles---a k_min > 0 would signal the presence of a maximum wavelength at the time (t_dec) of decoupling. This argues against the basic inflationary paradigm---perhaps even suggesting non-inflationary alternatives---for the origin and growth of perturbations in the early Universe. In at least one competing cosmology, the R_h=ct universe, the inferred k_min corresponds to the gravitational radius at t_dec.
description: 5 pages, 3 figures. Accepted for publication in A&A
title: 01_2522
Creators: name: Wesley Baldwin, John
name: Baldwin, John W.
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2018
Subjects: subject: LaMOP
subject: Laboratoire de Médiévistique Occidentale de Paris

description: L'ensemble de ces notes ont été crée par John Baldwin lors d'une de ses premières périodes de résidence à Paris. Ces documents comprennent tous les magistri qu’il avait pu rencontrer dans ses sources. Aux XIIème et XIIIème siècles, les universités n'existant pas encore, le titre de magister s'il évoque certainement une compétence n'est pas rattaché de façon systématique au passage par les écoles. De surcroît, les magistris sont le plus souvent désignés par leur seul prénom. La lecture de ces données est donc difficile et suppose un long travail pour tenter d'identifier un individu auquel on pourrait rattacher plusieurs mentions. John Baldwin avait donc renoncé à utiliser ces données pour donner un prolongement à sa magnifique étude sur les gradués d'université et leur emploi par les Capétiens et les Plantagenêts. Néanmoins, il a conservé ces données et elles sont potentiellement très utile dans le cadre de Studium, comme le sont toutes les mentions dans les volumes des Fasti Ecclesiae Gallicanae de chanoines portant ce titre de magister sans autres précisions. L'ampleur des dépouillements rend ces données très utiles et nous devons une grande reconnaissance à John Baldwin pour avoir pris la peine de faire photocopier ses fiches et de nous les avoir transmises amicalement.
Les données ainsi que les images des fiches sont accessibles sur le site Internet à l'adresse suivante : http://studium-baldwin.lamop.fr/.
Les transcriptions des fiches ont été effectuées par des étudiants de Paris 1 Panthéon - Sorbonne mais elles n'ont pas été corrigées par la suite.
description: Relation: https://lamop.hypotheses.org/
Privately Releasing Conjunctions and the Statistical Query Barrier
Creators: name: Gupta, Anupam
name: Hardt, Moritz
name: Roth, Aaron
name: Ullman, Jonathan
Publisher: name: Carnegie Mellon University
Year: 1972
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Suppose we would like to know all answers to a set of statistical queries C on a data set up to small error, but we can only access the data itself using statistical queries. A trivial solution is to exhaustively ask all queries in C. Can we do any better? 1. We show that the number of statistical queries necessary and sufficient for this task is—up to polynomial factors—equal to the agnostic learning complexity of C in Kearns’ statistical query (SQ) model. This gives a complete answer to the question when running time is not a concern. 2. We then show that the problem can be solved efficiently (allowing arbitrary error on a small fraction of queries) whenever the answers to C can be described by a submodular function. This includes many natural concept classes, such as graph cuts and Boolean disjunctions and conjunctions. While interesting from a learning theoretic point of view, our main applications are in privacypreserving data analysis: Here, our second result leads to an algorithm that efficiently releases differentially private answers to all Boolean conjunctions with 1% average error. This presents significant progress on a key open problem in privacy-preserving data analysis. Our first result on the other hand gives unconditional lower bounds on any differentially private algorithm that admits a (potentially nonprivacy-preserving) implementation using only statistical queries. Not only our algorithms, but also most known private algorithms can be implemented using only statistical queries, and hence are constrained by these lower bounds. Our result therefore isolates the complexity of agnostic learning in the SQ-model as a new barrier in the design of differentially private algorithms.
Mesadorus Linnavuori 1955
Creators: name: Huang, Yihong
name: Tang, Liuhong
name: Huang, Yingying
name: Webb, Michael D.
name: Duan, Yani
Publisher: name: Zenodo
Year: 2025
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hemiptera
Cicadellidae
Mesadorus

description: Mesadorus Linnavuori, 1955
Mesadorus Linnavuori, 1955: 120
(Type species: Mesadorus undatus Linnavuori, 1955).
Included species:
undatus Linnavuori, 1955: 120; Metcalf, 1967: 932.
description: Published as part of Huang, Yihong, Tang, Liuhong, Huang, Yingying, Webb, Michael D. & Duan, Yani, 2025, Two new bamboo feeding leafhopper species of the subfamily Deltocephalinae (Hemiptera: Cicadellidae) from China, pp. 287-304 in Zootaxa 5588 (2) on page 300, DOI: 10.11646/zootaxa.5588.2.5, http://zenodo.org/record/14896497
Limit sets for modules over groups on CAT(0) spaces -- from the Euclidean to the hyperbolic
Creators: name: Bieri, Robert
name: Geoghegan, Ross
Publisher: name: arXiv
Year: 2013
Subjects: subject: Group Theory (math.GR)
subject: FOS: Mathematics
subject: 20F65 (Primary) 20E42, 14T05 (Secondary)

description: The observation that the 0-dimensional Geometric Invariant $Σ^{0}(G;A)$ of Bieri-Neumann-Strebel-Renz can be interpreted as a horospherical limit set opens a direct trail from Poincaré's limit set $Λ(Γ)$ of a discrete group $Γ$ of Möbius transformations (which contains the horospherical limit set of $Γ$) to the roots of tropical geometry (closely related to $Σ^{0}(G;A)$ when G is abelian). We explore this trail by introducing the horospherical limit set, $Σ(M;A)$, of a G-module A when G acts by isometries on a proper CAT(0) metric space M. This is a subset of the boundary at infinity of M. On the way we meet instances where $Σ(M;A)$ is the set of all conical limit points, the complement of a spherical building, the complement of the radial projection of a tropical variety, or (via the Bieri-Neumann-Strebel invariant) where it is closely related to the Thurston norm.
description: This is the final published version
Superluminal propagation along the brane in space with extra dimensions
Creators: name: Dai, De-Chang
name: Stojkovic, Dejan
Publisher: name: arXiv
Year: 2023
Subjects: subject: General Relativity and Quantum Cosmology (gr-qc)
subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: We demonstrate that a model with extra dimensions formulated in Csaki et al. (Phys Rev D 62, 045015), which fatefully reproduces Friedmann-Robertson-Walker (FRW) equations on the brane, allows for an apparent superluminal propagation of massless signals. Namely, a massive brane curves the spacetime and affects the trajectory of a signal in a way that allows a signal sent from the brane through the bulk to arrive (upon returning) to a distant point on the brane faster than the light can propagate along the brane. In particular, the signal sent along the brane suffers a greater gravitational time delay than the bulk signal due to the presence of matter on the brane. While the bulk signal never moves with the speed greater than the speed of light in its own locality, this effect still enables one to send signals faster than light from the brane observer's perspective. For example, this effect might be used to resolve the cosmological horizon problem. In addition, one of the striking observational signatures would be arrival of the same gravitational wave signal at two different times, where the first signals arrives before its electromagnetic counterpart. We used GW170104 gravitational wave event to impose a strong limit on the model with extra dimensions in question.
description: 6 pages, 8 figures,
Private and threshold set-intersection
Creators: name: Kissner, Lea
name: Song, Dawn
Publisher: name: Carnegie Mellon University
Year: 2001
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Abstract: "In this paper we consider the problem of privately computing the intersection of sets (set-intersection), as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection. Cardinality set-intersection is the problem of determining the size of the intersection set, without revealing the actual threshold set. In threshold set-intersection, only the elements which appear at least a threshold number t times in the players' private inputs are revealed. Over-threshold set-intersection is a variation on threshold set-intersection in which not only the threshold set is revealed, but also the number of times each element in the threshold set appeared in the private inputs. We propose protocols that are more efficient than those previously known for set-intersection in the malicious case, as well as new protocols for problems which had no previous solution that did not utilize general secure circuit computation: Set-intersection protocols for the case of: n = 2 malicious parties that do not utilize the cut-and-choose technique; n [> or =] 3 malicious parties, for which there was no previous efficient solution; and multisets, in which elements may appear more than once. Cardinality set-intersection protocols secure against n [> or =] 2 malicious parties and n [> or =] 3 honest-but-curious parties, for which there were no previous efficient solutions. Threshold set-intersection protocols for n [> or =] 2 honest-but-curious parties, for which there was no previous efficient solution. Over-threshold set-intersection protocols for the case of n [> or =] 2 honest-but-curious parties and the case of n [> or =] 2 malicious parties, for which there was no previous efficient solution. Fair protocols for all problems (when fairness in decryption is enforced). Protocols which are secure against even n-1 dishonest colluding parties."
Privacy-Sensitive VM Retrospection
Creators: name: Richter, Wolfgang
name: Ammons, Glenn
name: Harkes, Jan
name: Goode, Adam
name: Nilton  Bila
name: Vasanth  Bala
name: Mahadev  Satyanarayanan
Publisher: name: Carnegie Mellon University
Year: 1994
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: The success of cloud computing leads to large, centralized collections of virtual machine (VM) images. The ability to retrospect (examine the historical state of) these images at a high semantic level can be valuable in many aspects of IT management such as debugging and troubleshooting, software quality control, legal establishment of data or code provenance, and cyber forensics such as malware tracking and licensing violations. In this paper, we explore the privacy implications of VM retrospection. We argue that retrospection will worsen current concerns about privacy in cloud computing. We develop privacysensitive requirements for the design of a retrospection mechanism, and then show how they can be met in a functional prototype.
Nakaharanus Ishihara 1953
Creators: name: Huang, Yihong
name: Tang, Liuhong
name: Huang, Yingying
name: Webb, Michael D.
name: Duan, Yani
Publisher: name: Zenodo
Year: 2025
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hemiptera
Cicadellidae
Nakaharanus

description: Nakaharanus Ishihara, 1953
Nakaharanus Ishihara, 1953: 192
(Type species: Eutettix nakaharae Matsumura, 1914).
Included species:
bimaculatus Li, 1988: 63.
lii Wei & Xing, 2019: 168.
maculosus Kuoh, 1986: 197.
sagittarius Kwon & Lee, 1979: 56; Wei & Xing, 2019: 172.
description: Published as part of Huang, Yihong, Tang, Liuhong, Huang, Yingying, Webb, Michael D. & Duan, Yani, 2025, Two new bamboo feeding leafhopper species of the subfamily Deltocephalinae (Hemiptera: Cicadellidae) from China, pp. 287-304 in Zootaxa 5588 (2) on page 300, DOI: 10.11646/zootaxa.5588.2.5, http://zenodo.org/record/14896497
Cosmophysical aspects of relativistic nuclear fragmentation
Creators: name: Zaitsev, A. A.
name: Marimuthu, N.
name: Artemenkov, D. A.
name: Zarubin, P. I.
name: Peresadko, N. G.
name: Rusakova, V. V.
Publisher: name: arXiv
Year: 2023
Subjects: subject: Nuclear Experiment (nucl-ex)
subject: FOS: Physical sciences

description: The status of the study of multiple fragmentation of 950 MeV per nucleon Kr nuclei in a nuclear track emulsion aimed at determining the contributions of 2$α$ decays of $^{8}$Be, the Hoyle 3$α$ state, and the search for a 4$α$ particle condensate state, is presented. In events with the production of few relativistic fragments of He and H, the possibility of estimating the multiplicity of neutrons in the fragmentation cone of a projectile nucleus is studied. For the planar component of neutron transverse momenta estimated from the angles of observed secondary stars, the Rayleigh distribution parameter was 35 $\pm$ 7 MeV/$c$. The importance of such events for the interpretation of cosmophysical observations is noted.
description: The work was presented at the conference ISCRA2023 (https://indico.nevod.mephi.ru/event/9/). To be publeshed in journal Physics of Atomic Nuclei
Neomacednus Xing & Li 2011
Creators: name: Huang, Yihong
name: Tang, Liuhong
name: Huang, Yingying
name: Webb, Michael D.
name: Duan, Yani
Publisher: name: Zenodo
Year: 2025
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hemiptera
Cicadellidae
Neomacednus

description: Neomacednus Xing & Li, 2011
Neomacednus Xing & Li, 2011: 53
(Type species: Macednus marginatus Emeljanov, 1962).
Included species:
marginatus (Emeljanov, 1962: 165); Xing & Li, 2011: 54.
description: Published as part of Huang, Yihong, Tang, Liuhong, Huang, Yingying, Webb, Michael D. & Duan, Yani, 2025, Two new bamboo feeding leafhopper species of the subfamily Deltocephalinae (Hemiptera: Cicadellidae) from China, pp. 287-304 in Zootaxa 5588 (2) on page 300, DOI: 10.11646/zootaxa.5588.2.5, http://zenodo.org/record/14896497
Computer Model of a "Sense of Humour". I. General Algorithm
Creators: name: Suslov, I. M.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Neurons and Cognition (q-bio.NC)
subject: Artificial Intelligence (cs.AI)
subject: FOS: Biological sciences
subject: FOS: Computer and information sciences

description: A computer model of a "sense of humour" is proposed. The humorous effect is interpreted as a specific malfunction in the course of information processing due to the need for the rapid deletion of the false version transmitted into consciousness. The biological function of a sense of humour consists in speeding up the bringing of information into consciousness and in fuller use of the resources of the brain.
description: 10 pages, 3 figures included; continuation of this series to appear
Privacy-Preserving Public Information for Sequential Games
Creators: name: Avrim  Blum
name: Morgenstern, Jamie
name: Sharma, Ankit
name: Smith, Adam
Publisher: name: Carnegie Mellon University
Year: 1972
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: In settings with incomplete information, players can find it difficult to coordinate to find states with good social welfare. For instance, one of the main reasons behind the recent financial crisis was found to be the lack of market transparency, which made it difficult for financial firms to accurately measure the risks and returns of their investments. Although regulators may have access to firms' investment decisions, directly reporting all firms' actions raises confiden- tiality concerns for both individuals and institutions. The natural question, therefore, is whether it is possible for the regulatory agencies to publish some information that, on one hand, helps the financial firms understand the risks of their investments better, and, at the same time, preserves the privacy of their investment decisions. More generally, when can the publication of privacy-preserving information about the state of the game improve overall outcomes such as social welfare? In this paper, we explore this question in a sequential resource-sharing game where the value gained by a player on choosing a resource depends on the number of other players who have chosen that resource in the past. Without any knowledge of the actions of the past players, the social welfare attained in this game can be arbitrarily bad. We show, however, that it is possible for the players to achieve good social welfare with the help of privacy-preserving, publicly-announced information. We model the behavior of players in this imperfect information setting in two ways -- greedy and undominated strategic behaviours, and we prove guarantees about the social welfare that certain kinds of privacy-preserving information can help attain. To achieve the social welfare guarantees, we design a counter with improved privacy guarantees under continual observation. In addition to the resource-sharing game, we study the main question for other games including sequential versions of the cut, machine-scheduling and cost-sharing games, and games where the value attained by a player on a particular action is not only a function of the actions of the past players but also of the actions of the future players.
Finite Blaschke Products and Decomposition
Creators: name: Uçar, Sümeyra
name: Özgür, Nihal Yilmaz
Publisher: name: arXiv
Year: 2017
Subjects: subject: Complex Variables (math.CV)
subject: FOS: Mathematics
subject: Primary 30J10, Secondary 30D05

description: Let $B(z)$ be a finite Blaschke product of degree $n$. We consider the problem when a finite Blaschke product can be written as a composition of two nontrivial Blaschke products of lower degree related to the condition $% B\circ M=B$ where $M$ is a Möbius transformation from the unit disk onto itself.
description: 16 pages, 1 Figure
Imaginary phonon modes and phonon-mediated superconductivity in Y2C3
Creators: name: Nepal, Niraj K.
name: Canfield, Paul C.
name: Wang, Lin-Lin
Publisher: name: arXiv
Year: 2023
Subjects: subject: Superconductivity (cond-mat.supr-con)
subject: Materials Science (cond-mat.mtrl-sci)
subject: FOS: Physical sciences

description: For Y$_2$C$_3$ with a superconducting critical temperature (T$_c$) $\sim$18 K, zone-center imaginary optical phonon modes have been found for the high-symmetry $I$-$43d$ structure due to C dimer wobbling motion and electronic instability from a flat band near Fermi energy. After lattice distortion to the more stable lowest symmetry $P1$ structure, these stabilized low-energy phonon modes with a mixed C and Y character carry a strong electron-phonon coupling to give arise to the observed sizable T$_c$. Our work shows that compounds with the calculated dynamical instability should not be simply excluded in high-throughput search for new phonon-mediated superconductors. Moreover, we have studied the phase stability of the $I$-$43d$ structure by calculating the enthalpy of different structural motifs of binary compounds containing group IV elements at the 2:3 composition and also exploring the energy landscapes via $ab$ $initio$ molecular dynamics near and out of the $I$-$43d$ structure. Our results show that the $I$-$43d$ type structures with C dimers are preferred in the low to medium pressure range. Because of the wobbling motion of the C dimers, there are many local energy minimums with degenerated energies. Thus, the ensemble average of many $I$-$43d$-distorted structures with C dimer wobbling motion at finite temperature still gives an overall $I$-$43d$ structure.
description: 6 pages, 9 figures and 1 table
Hamulotettix Dai & Zhang 2011
Creators: name: Huang, Yihong
name: Tang, Liuhong
name: Huang, Yingying
name: Webb, Michael D.
name: Duan, Yani
Publisher: name: Zenodo
Year: 2025
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hemiptera
Cicadellidae
Hamulotettix

description: Hamulotettix Dai & Zhang, 2011
Hamulotettix Dai & Zhang, 2011: 63
(Type species: Hamulotettix ungulatus Dai & Zhang, 2011).
Included species:
ungulatus Dai & Zhang, 2011: 64.
description: Published as part of Huang, Yihong, Tang, Liuhong, Huang, Yingying, Webb, Michael D. & Duan, Yani, 2025, Two new bamboo feeding leafhopper species of the subfamily Deltocephalinae (Hemiptera: Cicadellidae) from China, pp. 287-304 in Zootaxa 5588 (2) on page 299, DOI: 10.11646/zootaxa.5588.2.5, http://zenodo.org/record/14896497
Priority Pricing in Queues with a Continuous Distribution of Customer Valuations (CMU-CS-13-109)
Creators: name: Doroudi, Sherwin
name: Akan, Mustafa
name: Harchol-Balter, Mor
name: Karp, Jeremy
name: Borgs, Christian
name: Chayes, Jennifer
Publisher: name: Carnegie Mellon University
Year: 2004
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: We consider a service provider facing a continuum of delay-sensitive strategic customers. The service provider maximizes revenue by charging customers for the privilege of joining an M/G/1 queue and assigning them service priorities. Each customer has a valuation for the service, with a waiting cost per unit time that is proportional to their valuation; customer types are drawn from a continuous distribution and are unobservable to the service provider. We illustrate how to find revenue-maximizing incentive-compatible priority pricing menus, where the firm charges higher prices for higher queueing priority. We show that our proposed priority pricing scheme is optimal across all incentive-compatible pricing policies whenever the customer valuation distribution is regular. We compute the resulting price menus and priority allocations in closed form when customer valuations are drawn from Exponential, Uniform, or Pareto distributions. We find revenues in closed form for the special case of the M/M/1 queue, and compute revenues in the more general setting numerically. We compare our priority pricing scheme to the best fixed pricing scheme, as well as an idealized pricing scheme where customers always reveal their valuation. We observe the impact of service requirement variability on revenue and prices. We also illustrate how to create the optimal discrete priority pricing menu when the service provider is restricted to offering a finite number of priority classes.
Improving constraints on primordial non-Gaussianity using neural network based reconstruction
Creators: name: Flöss, Thomas
name: Meerburg, P. Daniel
Publisher: name: arXiv
Year: 2023
Subjects: subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: FOS: Physical sciences

description: We study the use of U-Nets in reconstructing the linear dark matter density field and its consequences for constraining cosmological parameters, in particular primordial non-Gaussianity. Our network is able to reconstruct the initial conditions of redshift $z=0$ density fields from N-body simulations with $90\%$ accuracy out to $k \leq 0.4$ h/Mpc, competitive with state-of-the-art reconstruction algorithms at a fraction of the computational cost. We study the information content of the reconstructed $z=0$ density field with a Fisher analysis using the QUIJOTE simulation suite, including non-Gaussian initial conditions. Combining the pre- and post-reconstructed power spectrum and bispectrum data up to $k_{\rm max} = 0.52$ h/Mpc, we find significant improvements on all parameters. Most notably, we find a factor $3.65$ (local), $3.54$ (equilateral) and $2.90$ (orthogonal) improvement on the marginalized errors of $f_{\rm NL}$ as compared to only using the pre-reconstructed data. We show that these improvements can be attributed to a combination of reduced data covariance and parameter degeneracy. The results constitute an important step towards more optimal inference of primordial non-Gaussianity from non-linear scales.
description: 22 pages, 8 figures, 3 tables, codes available at https://github.com/tsfloss/URecon and https://github.com/tsfloss/DensityFieldTools. v2 matches version accepted for JCAP
Frequencies of flare occurrence: Interaction Between convection and coronal loops
Creators: name: Mullan, D. J.
name: Paudel, R. R.
Publisher: name: arXiv
Year: 2018
Subjects: subject: Solar and Stellar Astrophysics (astro-ph.SR)
subject: FOS: Physical sciences

description: Observations of solar and stellar flares have revealed the presence of power law dependences between the flare energy and the time interval between flares. Various models have been proposed to explain these dependences, and to explain the numerical value of the power law indices. Here, we propose a model in which convective flows in granules force the foot-points of coronal magnetic loops, which are frozen-in to photospheric gas, to undergo a random walk. In certain conditions, this can lead to a twist in the loop, which drives the loop unstable if the twist exceeds a critical value. The possibility that a solar flare is caused by such a twist-induced instability in a loop has been in the literature for decades. Here, we quantify the process in an approximate way with a view to replicating the power-law index. We find that, for relatively small flares, the random walk twisting model leads to a rather steep power law slope which agrees very well with the index derived from a sample of 56,000+ solar X-ray flares reported by the GOES satellites. For relatively large flares, we find that the slope of the power law is shallower. The empirical power law slopes reported for flare stars also have a range which overlaps with the slopes obtained here. We suggest that in the coolest stars, a significant change in slope should occur when the frozen-flux assumption breaks down due to low electrical conductivity.
description: 29 pages, 3 figures, Accepted for publication in ApJ
Slime Mould Memristors
Creators: name: Gale, Ella
name: Adamatzky, Andrew
name: Costello, Ben de Lacy
Publisher: name: arXiv
Year: 2013
Subjects: subject: Emerging Technologies (cs.ET)
subject: Other Condensed Matter (cond-mat.other)
subject: Biological Physics (physics.bio-ph)
subject: FOS: Computer and information sciences
subject: FOS: Physical sciences
subject: B.6.1; C.1.3; C.1.m; J.3; J.2
subject: 92Cxx, 68Uxx, 92Fxx, 94Cxx

description: In laboratory experiments we demonstrate that protoplasmic tubes of acellular slime mould \emph{Physarum polycephalum} show current versus voltage profiles consistent with memristive systems and that the effect is due to the living protoplasm of the mould. This complements previous findings on memristive properties of other living systems (human skin and blood) and contributes to development of self-growing bio-electronic circuits. Distinctive asymmetric $V$-$I$ curves which were occasionally observed when the internal current is on the same order as the driven current, are well-modelled by the concept of active memristors.
description: 14 pages, 6 figures
Deep Learning for Survival Analysis: A Review
Creators: name: Wiegrebe, Simon
name: Kopper, Philipp
name: Sonabend, Raphael
name: Bischl, Bernd
name: Bender, Andreas
Publisher: name: arXiv
Year: 2023
Subjects: subject: Machine Learning (stat.ML)
subject: Machine Learning (cs.LG)
subject: FOS: Computer and information sciences

description: The influx of deep learning (DL) techniques into the field of survival analysis in recent years has led to substantial methodological progress; for instance, learning from unstructured or high-dimensional data such as images, text or omics data. In this work, we conduct a comprehensive systematic review of DL-based methods for time-to-event analysis, characterizing them according to both survival- and DL-related attributes. In summary, the reviewed methods often address only a small subset of tasks relevant to time-to-event data - e.g., single-risk right-censored data - and neglect to incorporate more complex settings. Our findings are summarized in an editable, open-source, interactive table: https://survival-org.github.io/DL4Survival. As this research area is advancing rapidly, we encourage community contribution in order to keep this database up to date.
description: 29 pages, 7 figures, 2 tables, 1 interactive table
Ca3(Ru1-xCrx)2O7: A new paradigm for spin valves
Creators: name: Cao, G.
name: Durairaj, V.
name: Chikara, S.
name: DeLong, L. E.
name: Schlottmann, P.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Strongly Correlated Electrons (cond-mat.str-el)
subject: FOS: Physical sciences

description: The spin valve effect is a quantum phenomenon so far only realized in multilayer thin films or heterostructures. Here we report a strong spin valve effect existing in bulk single crystals of Ca3(Ru1-xCrx)2O7 having an anisotropic, bilayered crystal structure. This discovery opens new avenues to understand the underlying physics of spin valves, and fully realize its potential in practical devices.
description: 5 figures. to be published in Physical Review Letters
Testing the Hadronuclear Origin of PeV Neutrinos Observed with IceCube
Creators: name: Murase, Kohta
name: Ahlers, Markus
name: Lacki, Brian C.
Publisher: name: arXiv
Year: 2013
Subjects: subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: Cosmology and Nongalactic Astrophysics (astro-ph.CO)
subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: We consider implications of the IceCube excess for hadronuclear (pp) scenarios of neutrino sources such as galaxy clusters/groups and star-forming galaxies. Since the observed neutrino flux is comparable to the diffuse gamma-ray background flux obtained by Fermi, we place new, strong upper limits on the source spectral index, Γ<2.1-2.2. In addition, the new IceCube data imply that these sources contribute at least 30%-40% of the diffuse gamma-ray background in the 100 GeV range and even ~100% for softer spectra. Our results, which are insensitive to details of the pp source models, are one of the first strong examples of the multimessenger approach combining the measured neutrino and gamma-ray fluxes. The pp origin of the IceCube excess can further be tested by constraining Γ with sub-PeV neutrino observations, by unveiling the sub-TeV diffuse gamma-ray background and by observing such pp sources with TeV gamma-ray detectors. We also discuss specific pp source models with a multi-PeV neutrino break/cutoff, which are consistent with the current IceCube data.
description: 5 pages, 3 figures, replaced to match the published version
Priority Mechanisms for OLTP and Transactional Web Applications
Creators: name: McWherter, David T.
name: Schroeder, Bianca
name: Ailamaki, Anastassia
name: Harchol-Balter, Mor
Publisher: name: Carnegie Mellon University
Year: 1989
Subjects: subject: 89999 Information and Computing Sciences not elsewhere classified
subject: FOS: Computer and information sciences

description: Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of these applications is the performance bottleneck. Given the limited resources available to the database, transaction execution times can vary wildly as they compete and wait for critical resources. As the competitor is "only a click away", valuable (high-priority) users must be ensured consistently good performance via QoS and transaction prioritization. This paper analyzes and proposes prioritization for transactional workloads in traditional database systems (DBMS). This work first performs a detailed bottleneck analysis of resource usage by transactional workloads on commercial and noncommercial DBMS (IBM DB2, Post-greSQL, Shore) under a range of configurations. Second, this work implements and evaluates the performance of several preemptive and nonpreemptive DBMS prioritization policies in PostgreSQL and Shore. The primary contributions of this work include (i) understanding the bottleneck resources in transactional DBMS workloads and (ii) a demonstration that prioritization in traditional DBMS can provide 2x-5x improvement for high-priority transactions using simple scheduling policies, without expense to low-priority transactions.
Computer Model of a "Sense of Humour". II. Realization in Neural Networks
Creators: name: Suslov, I. M.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Neurons and Cognition (q-bio.NC)
subject: Artificial Intelligence (cs.AI)
subject: FOS: Biological sciences
subject: FOS: Computer and information sciences

description: The computer realization of a "sense of humour" requires the creation of an algorithm for solving the "linguistic problem", i.e. the problem of recognizing a continuous sequence of polysemantic images. Such algorithm may be realized in the Hopfield model of a neural network after its proper modification.
description: 13 pages, 5 figures included; continuation of this series to appear
Anatomy of the AGN in NGC 5548 IX. Photoionized emission features in the soft X-ray spectra
Creators: name: Mao, Junjie
name: Kaastra, J. S.
name: Mehdipour, M.
name: Gu, Liyi
name: Costantini, E.
name: Kriss, G. A.
name: Bianchi, S.
name: Branduardi-Raymont, G.
name: Behar, E.
name: Di Gesu, L.
name: Ponti, G.
name: Petrucci, P. -O.
name: Ebrero, J.
Publisher: name: arXiv
Year: 2017
Subjects: subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: FOS: Physical sciences

description: The X-ray narrow emission line region (NELR) of the archetypal Seyfert 1 galaxy NGC\,5548 has been interpreted as a single-phase photoionized plasma that is absorbed by some of the warm absorber components. This scenario requires those overlaying warm absorber components to have larger distance (to the central engine) than the X-ray NELR, which is not fully consistent with the distance estimates found in the literature. Therefore, we reanalyze the high-resolution spectra obtained in 2013--2014 with the Reflection Grating Spectrometer (RGS) aboard \textit{XMM}-Newton to provide an alternative interpretation of the X-ray narrow emission features. We find that the X-ray narrow emission features in NGC\,5548 can be described by a two-phase photoionized plasma with different ionization parameters ($\log ξ=1.3$ and $0.1$) and kinematics ($v_{\rm out}=-50$ and $-400~{\rm km~s^{-1}}$), and no further absorption by the warm absorber components. The X-ray and optical NELR might be the same multi-phase photoionized plasma. Both X-ray and optical NELR have comparable distances, asymmetric line profiles, and the underlying photoionized plasma is turbulent and compact in size. The X-ray NELR is not the counterpart of the UV/X-ray absorber outside the line of sight because their distances and kinematics are not consistent. In addition, X-ray broad emission features that we find in the spectrum can be accounted for by a third photoionized emission component. The RGS spectrum obtained in 2016 is analyzed as well, where the luminosity of most prominent emission lines (the \ion{O}{vii} forbidden line and \ion{O}{viii} Ly$α$ line) are the same (at a 1 $σ$ confidence level) as in 2013--2014.
description: accepted for publication in A&A