Hasil untuk "Early Christian literature. Fathers of the Church, etc."

Parth Patne, Mahdi Taheri, Ali Mahani et al.

Spiking neural networks (SNNs) offer inherent energy efficiency due to their event-driven computation model, making them promising for edge AI deployment. However, their practical adoption is limited by the computational overhead of deep architectures and the absence of input-adaptive control. This work presents SPARQ, a unified framework that integrates spiking computation, quantization-aware training, and reinforcement learning-guided early exits for efficient and adaptive inference. Evaluations across MLP, LeNet, and AlexNet architectures demonstrated that the proposed Quantised Dynamic SNNs (QDSNN) consistently outperform conventional SNNs and QSNNs, achieving up to 5.15% higher accuracy over QSNNs, over 330 times lower system energy compared to baseline SNNs, and over 90 percent fewer synaptic operations across different datasets. These results validate SPARQ as a hardware-friendly, energy-efficient solution for real-time AI at the edge.

Alina Nowicka-Jeżowa

Mingyu Huang, Shasha Zhou, Yuxuan Chen et al.

We are living in an era of "big literature", where the volume of digital scientific publications is growing exponentially. While offering new opportunities, this also poses challenges for understanding literature landscapes, as traditional manual reviewing is no longer feasible. Recent large language models (LLMs) have shown strong capabilities for literature comprehension, yet they are incapable of offering "comprehensive, objective, open and transparent" views desired by systematic reviews due to their limited context windows and trust issues like hallucinations. Here we present LitChat, an end-to-end, interactive and conversational literature agent that augments LLM agents with data-driven discovery tools to facilitate literature exploration. LitChat automatically interprets user queries, retrieves relevant sources, constructs knowledge graphs, and employs diverse data-mining techniques to generate evidence-based insights addressing user needs. We illustrate the effectiveness of LitChat via a case study on AI4Health, highlighting its capacity to quickly navigate the users through large-scale literature landscape with data-based evidence that is otherwise infeasible with traditional means.

Piotr Wilk

Artykuł przedstawia, jakie tytuły Lucyfer z Cagliari stosuje wobec cesarza Konstancjusza II. Główna część pracy poprzedzona jest krótkim wstępem, który zawiera podstawowe informacje o Autorze i jego dziełach. W zasadniczej części opisano wybrane konteksty użycia poszczególnych grup tytułów oraz funkcje jakie one pełnią. Biskup stosował tytuły, aby wyrazić ironię, wykazać władcy błąd oraz nakłonić go do nawrócenia. Zestawiono też tytuły stosowane wobec monarchy z tytułami stosowanymi wobec innych osób oraz z tytułami, jakie używał Hilary z Poitiers wobec Konstancjusza II.

Giacomo Calore

W niniejszym artykule autor podejmuje problem tłumaczenia fragmentu z chalcedońskiego wyznania wiary na język polski, który znajduje się w Dokumentach Soborów Powszechnych. Autor przedstawia tezę, że nie odpowiada ono teologicznej myśli Ojców soborowych stojącej za tą częścią definicji. Celem artykułu jest uzasadnienie tej tezy oraz propozycja alternatywnego przekładu. Stosowana metoda jest złożona: po pierwsze, rekonstrukcja genezy fragmentu poprzez badanie kontekstu historycznego i filozoficzno-teologicznego jego powstania oraz analizę literacką; następnie, na podstawie wyników tych badań, analiza chrystologii Ojców zawartej w tym passusie, która pozwoli poddać w wątpliwość wyjściowe tłumaczenie. Artykuł został zatem podzielony w następujący sposób: analiza gramatyczna fragmentu; kontekst dalszy i bliższy powstania tekstu wyznania; analiza literacka; analiza teologiczna i przedstawienie nowego tłumaczenia. Oprócz tekstu wyznania, główne źródła, będące przedmiotem badań, to Epistula Altera ad Nestorium Cyryla Aleksandryjskiego i Tomus ad Flavianum papieża Leona. Wnioski badań, dobrze uwydatniają różnicę między heretykami a Ojcami Kościoła w posługiwaniu się starożytną filozofią dla wyrażenia wiary. Wykazują ponadto metafizyczne novumna temat pojęć osoby i natury wynikające z treści wyznania i ówczesnej patrystycznej refleksji, które stanowi zagadnienie nadal aktualne, a które przedyskutowane tłumaczenie niestety niejako przyćmiewa.

Sebastian Baltes, Paul Ralph

The goal of this chapter is to support teachers in holistically introducing graduate students to literature reviews, with a particular focus on secondary research. It provides an overview of the overall literature review process and the different types of literature review before diving into guidelines for selecting and conducting different types of literature review. The chapter also provides recommendations for evaluating the quality of existing literature reviews and concludes with a summary of our learning goals and how the chapter supports teachers in addressing them.

Mirosław J. Leszka

W latach 912-927 Mikołaj Mistyk, patriarcha Konstantynopola prowadził korespondencję z Symeonem, władca Bułgarii. Jej celem było nakłonienie Symeona do zakończenia działań wojennych i zawarcia pokoju z Bizancjum. By ten cel osiągnąć Mikołaj Mistyk imał się różnych metod i sięgał po różnorodne argumenty. Odwoływanie się patriarchy do umiaru i roztropności było jednym z środków wpłynięcia na  Symeona, by ten zaniechał działań militarnych, a podjął takie, które doprowadziłyby do zawarcia pokoju. Dla Mikołaja Mistyka podstawowym kryterium uznania Symeona za człowieka kierującego się w swoim życiu m.in. cnotami umiarkowania i roztropności było to, czy jego działania w sferze politycznej były zgodne z bizantyńskimi interesami.

Pol Heuschling, Christian Partmann, Christian Fidler

We present a novel method for including the impact of massive neutrinos in cold dark matter N-body simulations. Our approach is compatible with widely employed Newtonian N-body codes and relies on only three simple modifications. First, we use commonly employed backscaling initial conditions, based on the cold dark matter plus baryon power spectrum instead of the total matter power spectrum. Second, the accurate Hubble rate is employed in both the backscaling and the evolution of particles in the N-body code. Finally, we shift the final particle positions in a post-processing step to account for the integrated effect of neutrinos on the particles in the simulation. However, we show that the first two modifications already capture most of the relevant neutrino physics for a large range of observationally interesting redshifts and scales. The output of the simulations are the cold dark matter and baryon distributions and can be analysed using standard methods. All modifications are simple to implement and do not generate any computational overhead. By implementing our methods in the N-body codes GADGET and gevolution, we show that any state-of-the-art Newtonian N-body code can be utilised out of the box. Our method is also compatible with higher order Lagrangian perturbation theory initial conditions and accurate for combined neutrino masses of up to at least 0.3 eV. Being formulated in relativistic gauge theory, in addition to including the impact of massive neutrinos, our method further includes relativistic corrections relevant on the large scales for free.

Christian Majenz, Christian Schaffner, Mehrdad Tahmasbi

We study uncloneable quantum encryption schemes for classical messages as recently proposed by Broadbent and Lord. We focus on the information-theoretic setting and give several limitations on the structure and security of these schemes: Concretely, 1) We give an explicit cloning-indistinguishable attack that succeeds with probability $\frac12 + μ/16$ where $μ$ is related to the largest eigenvalue of the resulting quantum ciphertexts. 2) For a uniform message distribution, we partially characterize the scheme with the minimal success probability for cloning attacks. 3) Under natural symmetry conditions, we prove that the rank of the ciphertext density operators has to grow at least logarithmically in the number of messages to ensure uncloneable security. 4) The \emph{simultaneous} one-way-to-hiding (O2H) lemma is an important technique in recent works on uncloneable encryption and quantum copy protection. We give an explicit example which shatters the hope of reducing the multiplicative "security loss" constant in this lemma to below 9/8.

Stein Andreas Bethuelsen, Christian Hirsch, Christian Mönch

We prove an invariance principle for continuous-time random walks in a dynamically averaging environment on $\mathbb Z$. In the beginning, the conductances may fluctuate substantially, but we assume that as time proceeds, the fluctuations decrease according to a typical diffusive scaling and eventually approach constant unit conductances. The proof relies on a coupling with the standard continuous time simple random walk.

Norihiro Yamada

We prove consistency of intensional Martin-Löf type theory (MLTT) with formal Church's thesis (CT), which was open for at least fifteen years. The difficulty in proving the consistency is that a standard method of realizability à la Kleene does not work for the consistency, though it validates CT, as it does not model MLTT; specifically, the realizability does not validate MLTT's congruence rule on pi-types (known as the $ξ$-rule). We overcome this point and prove the consistency by novel realizability à la game semantics, which is based on the author's previous work.

H. I. M. Lichtenegger, K. G. Kislyakova, P. Odert et al.

The influence of the hydrogen hydrodynamic upper atmosphere escape, driven by the solar soft X-ray and extreme ultraviolet radiation (XUV) flux, on an expected magma ocean outgassed steam atmosphere of early Venus is studied. By assuming that the young Sun was either a weak or moderate active young G star, we estimated the water loss from a hydrogen dominated thermosphere due to the absorption of the solar XUV flux and the precipitation of solar wind produced energetic hydrogen atoms (ENAs). The production of ENAs and their interaction with the hydrodynamic extended upper atmosphere, including collision-related feedback processes, have been calculated by means of Monte Carlo models. ENAs that collide in the upper atmosphere deposit their energy and heat the surrounding gas mainly above the main XUV energy deposition layer. It is shown that precipitating ENAs modify the thermal structure of the upper atmosphere, but the enhancement of the thermal escape rates caused by these energetic hydrogen atoms is negligible. Our results also indicate that the majority of oxygen arising from dissociated H$_2$O molecules is left behind during the first 100 Myr. It is thus suggested that the main part of the remaining oxygen has been absorbed by crustal oxidation.

Zeki C. Seskir, Arsev U. Aydinoglu

In this study, we investigated the academic literature on quantum technologies (QT) using bibliometric tools. We used a set of 49,823 articles obtained from the Web of Science (WoS) database using a search query constructed through expert opinion. Analysis of this revealed that QT is deeply rooted in physics, and the majority of the articles are published in physics journals. Keyword analysis revealed that the literature could be clustered into three distinct sets, which are (i) quantum communication/cryptography, (ii) quantum computation, and (iii) physical realizations of quantum systems. We performed a burst analysis that showed the emergence and fading away of certain key concepts in the literature. This is followed by co-citation analysis on the highly cited articles provided by the WoS, using these we devised a set of core corpus of 34 publications. Comparing the most highly cited articles in this set with respect to the initial set we found that there is a clear difference in most cited subjects. Finally, we performed co-citation analyses on country and organization levels to find the central nodes in the literature. Overall, the analyses of the datasets allowed us to cluster the literature into three distinct sets, construct the core corpus of the academic literature in QT, and to identify the key players on country and organization levels, thus offering insight into the current state of the field. Search queries and access to figures are provided in the appendix.

Piotr Szczur

nie dotyczy

Mariusz Szram

nie dotyczy

Piotr Kochanek

nie dotyczy

Christian Kuehn, Christian Münch

Hysteresis operators appear in many applications such as elasto-plasticity and micromagnetics, and can be used for a wider class of systems, where rate-independent memory plays a role. A natural approximation for systems of evolution equations with hysteresis operators are fast-slow dynamical systems, which - in their used approximation form - do not involve any memory effects. Hence, viewing differential equations with hysteresis operators in the non-linearity as a limit of approximating fast-slow dynamics involves subtle limit procedures. In this paper, we give a proof of Netushil's "observation" that broad classes of planar fast-slow systems with a two-dimensional critical manifold are expected to yield generalized play operators in the singular limit. We provide two proofs of this "observation" based upon the fast-slow systems paradigm of decomposition into subsystems. One proof strategy employs suitable convergence in function spaces, while the second approach considers a geometric strategy via local linearization and patching adapted originally from problems in stochastic analysis. We also provide an illustration of our results in the context of oscillations in forced planar non-autonomous fast-slow systems. The study of this example also strongly suggests that new canard-type mechanisms can occur for two-dimensional critical manifolds in planar systems.

Wenlin Wang, Changyou Chen, Wenqi Wang et al.

We present Earliness-Aware Deep Convolutional Networks (EA-ConvNets), an end-to-end deep learning framework, for early classification of time series data. Unlike most existing methods for early classification of time series data, that are designed to solve this problem under the assumption of the availability of a good set of pre-defined (often hand-crafted) features, our framework can jointly perform feature learning (by learning a deep hierarchy of \emph{shapelets} capturing the salient characteristics in each time series), along with a dynamic truncation model to help our deep feature learning architecture focus on the early parts of each time series. Consequently, our framework is able to make highly reliable early predictions, outperforming various state-of-the-art methods for early time series classification, while also being competitive when compared to the state-of-the-art time series classification algorithms that work with \emph{fully observed} time series data. To the best of our knowledge, the proposed framework is the first to perform data-driven (deep) feature learning in the context of early classification of time series data. We perform a comprehensive set of experiments, on several benchmark data sets, which demonstrate that our method yields significantly better predictions than various state-of-the-art methods designed for early time series classification. In addition to obtaining high accuracies, our experiments also show that the learned deep shapelets based features are also highly interpretable and can help gain better understanding of the underlying characteristics of time series data.

Christian Bender, Christian Gaertner, Nikolaus Schweizer

We introduce a novel numerical approach for a class of stochastic dynamic programs which arise as discretizations of backward stochastic differential equations or semi-linear partial differential equations. Solving such dynamic programs numerically requires the approximation of nested conditional expectations, i.e., iterated integrals of previous approximations. Our approach allows us to compute and iteratively improve upper and lower bounds on the true solution starting from an arbitrary and possibly crude input approximation. We demonstrate the benefits of our approach in a high dimensional financial application.

Christian Avart, Bill Kay, Christian Reiher et al.

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type specified in advance. Examples of such graphs have been investigated in a great variety of contexts in the literature with particular attention being paid to their chromatic number. In recent joint work with Tomasz Łuczak, two of the authors embarked on a systematic study of the chromatic numbers of such type-graphs, formulated a general conjecture determining this number up to a multiplicative factor, and proved various results of this kind. In this article we fully prove this conjecture.