Hasil untuk "Bibliography"

S. Kooijman

J. Sowa

D. Goldberg

D. Gajski, N. Dutt, A. Wu et al.

Dylan Evans

A. Troelstra, H. Schwichtenberg

A. Smith, David G. Smith, B. Funnell

P. Flandrin

A. Barvinok

Chiara Esposito, Michael Heins, Stefan Waldmann

This paper establishes a functorial framework for convergence of Drinfeld's Universal Deformation Formula (UDF) on spaces of analytic vectors. This is accomplished by matching the order of the latter with an equicontinuity condition on the Drinfeld twist underlying the deformation. Throughout, we work with representations of finite-dimensional Lie algebras by continuous linear mappings on locally convex spaces. This allows us to establish not only convergence of the formal power series, but the continuity of the deformed bilinear mappings as well as the entire holomorphic dependence on the deformation parameter $\hbar$. Finally, we demonstrate the effectiveness of our theory by applying it to the explicit Drinfeld twists constructed by Giaquinto and Zhang, where we establish both the equicontinuity condition and determine the corresponding spaces of analytic vectors for concrete representations. Thereby we answer a question posed by Giaquinto and Zhang whether a strict version of their formal twists is possible in the positive.

János Barát, Zdeněk Dvořák, Penny Haxell et al.

Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by participants of the 33rd edition of the workshop which took place in Nový Smokovec, Slovakia during August 31st - September 5th, 2025 (see the workshop webpage https://candc.upjs.sk).

Prashant Batra

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum root-modulus we establish a simple, nearly optimal result.

Jorge Maestre Vidal, Marco Antonio Sotelo Monge, Luis Javier García Villalba

This paper introduces a malware detection system for smartphones based on studying the dynamic behavior of suspicious applications. The main goal is to prevent the installation of the malicious software on the victim systems. The approach focuses on identifying malware addressed against the Android platform. For that purpose, only the system calls performed during the boot process of the recently installed applications are studied. Thereby the amount of information to be considered is reduced, since only activities related with their initialization are taken into account. The proposal defines a pattern recognition system with three processing layers: monitoring, analysis and decision-making. First, in order to extract the sequences of system calls, the potentially compromised applications are executed on a safe and isolated environment. Then the analysis step generates the metrics required for decision-making. This level combines sequence alignment algorithms with bagging, which allow scoring the similarity between the extracted sequences considering their regions of greatest resemblance. At the decision-making stage, the Wilcoxon signed-rank test is implemented, which determines if the new software is labeled as legitimate or malicious. The proposal has been tested in different experiments that include an in-depth study of a particular use case, and the evaluation of its effectiveness when analyzing samples of well-known public datasets. Promising experimental results have been shown, hence demonstrating that the approach is a good complement to the strategies of the bibliography.

Joshua Cape

Varimax factor rotations, while popular among practitioners in psychology and statistics since being introduced by H. Kaiser, have historically been viewed with skepticism and suspicion by some theoreticians and mathematical statisticians. Now, work by K. Rohe and M. Zeng provides new, fundamental insight: varimax rotations provably perform statistical estimation in certain classes of latent variable models when paired with spectral-based matrix truncations for dimensionality reduction. We build on this newfound understanding of varimax rotations by developing further connections to network analysis and spectral methods rooted in entrywise matrix perturbation analysis. Concretely, this paper establishes the asymptotic multivariate normality of vectors in varimax-transformed Euclidean point clouds that represent low-dimensional node embeddings in certain latent space random graph models. We address related concepts including network sparsity, data denoising, and the role of matrix rank in latent variable parameterizations. Collectively, these findings, at the confluence of classical and contemporary multivariate analysis, reinforce methodology and inference procedures grounded in matrix factorization-based techniques. Numerical examples illustrate our findings and supplement our discussion.

Timothée Goubault de Brugière, Simon Martiel

We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count of entangling gates or the depth of entangling gates, and they can be adjusted to either maintain or loosen the ordering of rotations. We present benchmark results demonstrating a depth reduction of up to a factor of 4 compared to the current state-of-the-art heuristics for synthesizing Hamiltonian simulation circuits. We also show that these heuristics can be used to optimize generic quantum circuits by decomposing and resynthesizing them.

Fatiha Alabau-Boussouira

In part I of the rebuttal (see [2] to the article [1] entitled "Uniform stabilization for the Timoshenko beam by a locally distributed damping" published in 2003, in the journal Electronic Journal of Differential Equations, we prove that Lemma 3.6 and Theorem 3.1 are unproved due to major flaws (contradictory assumptions). We also show that Theorem 2.2 and its proofs of strong stability, and non uniform stability in the case of different speeds of propagation, contain several incorrect arguments and several gaps (including missing functional frames). In this part II, we give the precise missing functional frames, fill the gaps and correct several parts contained in the proof of Theorem 2.2 in [1]. We also complete a missing argument (see Remark 4.23 and Remark 3.2) in the proof of Theorem A in [5] used by [1]. For this we state and prove Proposition 4.4 (see also Proposition 4.6 for a general formulation in Banach spaces). We also give the correct formulations, and proofs of strong stability and non uniform stability (in case of different speeds of propagation) for Timoshenko beams.

ملوک السادات حسینی بهشتی, سهیلا خوئینی, الهام اسمعیل پونکی

هدف: این پژوهش با هدف تحلیل کتاب‌سنجی و شبکه هم‌نویسندگی و خوشه‌های موضوعی پژوهش‌های هستان‌شناسی در پایگاه اطلاعاتی اسکوپوس انجام شد.روش‌شناسی: پژوهش حاضر از نوع کاربردی است که با رویکرد علم‌سنجی و با روش‌های کتابخانه‌ای، تحلیل هم‌رخدادی واژگان و تکنیک تحلیل شبکه‌ای به انجام رسیده است. جامعه آماری پژوهش را تعداد 5226 مقاله علمی حوزه هستان‌شناسی تشکیل می‌دهند که از سال 1996 تا سال 2020  منتشر شده و در پایگاه اسکوپوس نمایه شده است. برای تحلیل داده‌ها به فراخور هدف از نرم‌افزارهای Excel، VOSviewer، Pajek و UCINet استفاده شد.                      یافته‌ها: یافته‌ها حاکی از آن است که بیشترین همکاری در تولید پژوهش‌های هستان‌شناسی توسط کشورهای چین، آمریکا و بریتانیا بوده است.  Rafael Valencia-Garciaو دانشگاه Zhejiang بیشترین تولیدات علمی را در بخش نویسندگان و دانشگاه‌ها به خود اختصاص داده‌اند. حوزه علوم کامپیوتر بیشترین سهم را در تولیدات علمی داشته است.                      نتیجه‌گیری: در مطالعه شبکه هم‌واژگانی حوزه هستان‌شناسی در پایگاه اسکوپوس 5 خوشه موضوعی شناسایی شد که خوشه وب معنایی بزرگ‌ترین خوشه است.

V. V. Zerkin, B. Pritychenko, J. Totans et al.

Current needs of nuclear science and technology include complete, well-documented, and easily verifiable nuclear data. The complete data records require supporting nuclear bibliography, presently stored in dedicated libraries, in addition, to actual data. Experimental nuclear reaction data (EXFOR) and Nuclear Science References (NSR) databases contain compilations based on primary (journals) and secondary (conference proceedings, theses, preprints, etc.) publications, and data received from authors via private communications. The secondary library materials and private communications often represent a bottleneck for nuclear data verification, compilation, evaluation, and dissemination activities. To address this issue, bibliographic materials were scanned into PDF (Portable Document Format) files and uploaded in a relational database. The traditional scope of nuclear databases that includes meta-data and numbers derived from data in specialized formats was broadened to accommodate the large volumes of original nuclear data publications. The complete PDF publication files were stored in a relational database as Binary Large OBjects (BLOB). This unique collection of nuclear data compilations and supporting publications generate many opportunities for machine learning applications.

Kenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau et al.

Gradualizing the Calculus of Inductive Constructions (CIC) involves dealing with subtle tensions between normalization, graduality, and conservativity with respect to CIC. Recently, GCIC has been proposed as a parametrized gradual type theory that admits three variants, each sacrificing one of these properties. For devising a gradual proof assistant based on CIC, normalization and conservativity with respect to CIC are key, but the tension with graduality needs to be addressed. Additionally, several challenges remain: (1) The presence of two wildcard terms at any type-the error and unknown terms-enables trivial proofs of any theorem, jeopardizing the use of a gradual type theory in a proof assistant; (2) Supporting general indexed inductive families, most prominently equality, is an open problem; (3) Theoretical accounts of gradual typing and graduality so far do not support handling type mismatches detected during reduction; (4) Precision and graduality are external notions not amenable to reasoning within a gradual type theory. All these issues manifest primally in CastCIC, the cast calculus used to define GCIC. In this work, we present an extension of CastCIC called GRIP. GRIP is a reasonably gradual type theory that addresses the issues above, featuring internal precision and general exception handling. GRIP features an impure (gradual) sort of types inhabited by errors and unknown terms, and a pure (non-gradual) sort of strict propositions for consistent reasoning about gradual terms. Internal precision supports reasoning about graduality within GRIP itself, for instance to characterize gradual exception-handling terms, and supports gradual subset types. We develop the metatheory of GRIP using a model formalized in Coq, and provide a prototype implementation of GRIP in Agda.

L. Kuhn, M. Shubat, P. Barmby

Cataloguing and classifying celestial objects is one of the fundamental activities of observational astrophysics. In this work, we compare the contents of two comprehensive databases, the NASA Extragalactic Database (NED) and Set of Identifications, Measurements and Bibliography for Astronomical Data (SIMBAD) in the vicinity of nearby galaxies. These two databases employ different classification schemes -- one flat and one hierarchical -- and our goal was to determine the compatibility of classifications for objects in common. Searching both databases for objects within the respective isophotal radius of each of the ~1300 individual galaxies in the Local Volume Galaxy sample, we found that on average, NED contains about ten times as many entries as SIMBAD and about two thirds of SIMBAD objects are matched by position to a NED object, at 5 arcsecond tolerance. These quantities do not depend strongly on the properties of the parent galaxies. We developed an algorithm to compare individual object classifications between the two databases and found that 88% of the classifications agree; we conclude that NED and SIMBAD contain consistent information for sources in common in the vicinity of nearby galaxies. Because many galaxies have numerous sources contained only in one of NED or SIMBAD, researchers seeking the most complete picture of an individual galaxy's contents are best served by using both databases.