Hasil untuk "Semantics"

Shalom Lappin

Chris Lattner, M. Amini, Uday Bondhugula et al.

This work presents MLIR, a novel approach to building reusable and extensible compiler infrastructure. MLIR addresses software fragmentation, compilation for heterogeneous hardware, significantly reducing the cost of building domain specific compilers, and connecting existing compilers together. MLIR facilitates the design and implementation of code generators, translators and optimizers at different levels of abstraction and across application domains, hardware targets and execution environments. The contribution of this work includes (1) discussion of MLIR as a research artifact, built for extension and evolution, while identifying the challenges and opportunities posed by this novel design, semantics, optimization specification, system, and engineering. (2) evaluation of MLIR as a generalized infrastructure that reduces the cost of building compilers-describing diverse use-cases to show research and educational opportunities for future programming languages, compilers, execution environments, and computer architecture. The paper also presents the rationale for MLIR, its original design principles, structures and semantics.

E. Moggi

Abstract The λ-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with λ-terms. However, if one goes further and uses βη-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with total functions from values to values ) that may jeopardise the applicability of theoretical results. In this paper we introduce calculi, based on a categorical semantics for computations , that provide a correct basis for proving equivalence of programs for a wide range of notions of computation .

R. Carston

V. Evans, M. Green

N. Jones, C. K. Gomard, P. Sestoft

M. Gordon, T. Melham

J. Girard, P. Taylor, Y. Lafont

U. Weinreich

Lory Lemke

This paper argues that Gottlob Frege has two distinct views toward psychology. The first view is underappreciated. It consists in his dual claim that psychological and logical elements in thought are naturally intertwined and, furthermore, that his conceptual notation can be “scientifically justified” in terms of a psychological origin story. These claims are supported with evidence provided by an analysis of key elements of his logic in the Begriffsschrift, by a summary of the major psychological mechanisms presented in his first published defense of the Begriffsschrift: “On the Scientific Justification of a Conceptual Notation,” and by an appeal to textual evidence from his unpublished “Logic” (1879–1991). The second view is well known. It is his claim that there is a methodological imperative to isolate logic from psychological influences. This claim is developed in two ways: he proposes a contextualist semantics to reject any psychologistic dependence on ideas and also narrows the notion of content, with its reliance on ideas, to the notion of conceptual content which focuses on logical relations. Finally, it is argued that this narrowing provides the key elements of the framework for his criticisms of psychology in the Grundlagen.

Pedro I. Pesantes-Grados, Emma Cambillo-Moyano, Erasmo H. Colona-Vallejos et al.

In this study, we develop and analyze an extended SEIR-type compartmental model that incorporates vaccination and treatment to describe the dynamics of acute respiratory infection transmission. The model subdivides the infectious population into several symptomatic stages and an asymptomatic class, which allows the evaluation of control strategies across different levels of infection severity. The basic reproduction number <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi mathvariant="script">R</mi><mn>0</mn></msub></semantics></math></inline-formula> is analytically derived, and its sensitivity to vaccination and treatment rates is examined to assess the impact of public health interventions on epidemic control. Numerical simulations demonstrate that the joint implementation of vaccination and treatment can markedly reduce disease prevalence and lead to infection elimination when <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="script">R</mi><mn>0</mn></msub><mo><</mo><mn>1</mn></mrow></semantics></math></inline-formula>. The results emphasize the critical role of parameter interactions in determining disease persistence and show that combining both interventions produces stronger epidemiological effects than either one alone. Machine learning techniques, specifically Support Vector Machines (SVMs), are employed to classify epidemiological outcomes and support parameter estimation. The biological markers evaluated were not effective discriminants of infection status, underscoring the importance of integrating mechanistic modeling with data-driven approaches. This combined framework enhances the understanding of epidemic dynamics and improves the predictive capacity for decision-making in public health.

A. Baranov

The article discusses the phenomenon of a leading question as an object of forensic linguistic examination. It shows that the leading question (i) contains semantic information in the form of a proposition (propositional criterion), (ii) brings information within the field of a respondent’s view (relevance criterion), and (iii) reflects the version of the described events that is desirable for an inquirer (engagement criterion). Linguistic examination allows to conclude on the fulfillment of the propositional criterion and the criterion of relevance. The criterion of engagement refers to extralinguistic knowledge and can rarely be proven as the result of the corresponding discourse analysis by linguistic instruments only. The paper analyses the examples of leading questions’ functioning in real discourse including their use in interrogations at the investigative stage and in court hearings. It highlights those segments of the semantics of ‘yes/no-’ and ‘wh-questions’ that are most often used by experienced communicators toconvey their ideas on the most likely answer to the interlocutor. Related phenomena of investigative and judicial discourse are also discussed: tips and “augmented reality” situations.The phenomenon of the leading question should be considered as the interdisciplinary one, having not only linguistic, but also psychological and legal aspects. From the methodological point of view, linguistic examination allows to identify only the linguistic features of leading questions proper – presence of a proposition and relevance (introduction of information into the view field of an addressee). Engagement as a feature of the leading question lies beyond the scope of linguistic knowledge.

Miao Jiang, Honghui Chen

Chinese named entity recognition (NER) is a fundamental natural language processing (NLP) task that involves identifying and categorizing entities in text. It plays a crucial role in applications such as information extraction, machine translation, and question-answering systems, enhancing the efficiency and accuracy of text processing and language understanding. However, existing methods for Chinese NER face challenges due to the disruption of character-level semantics in traditional data augmentation, leading to misaligned entity labels and reduced prediction accuracy. Moreover, the reliance on English-centric fine-grained annotated datasets and the simplistic concatenation of label semantic embeddings with original samples limits their effectiveness, particularly in addressing class imbalances in low-resource scenarios. To address these issues, we propose a novel Chinese NER model, LGDA, which leverages Label-Guided Data Augmentation to mitigate entity label misalignment and sample distribution imbalances. The LGDA model consists of three key components: a data augmentation module, a label semantic fusion module, and an optimized loss function. It operates in two stages: (1) the enhancement of data with a masked entity generation model and (2) the integration of label annotations to refine entity recognition. By employing twin encoders and a cross-attention mechanism, the model fuses sample and label semantics, while the optimized loss function adapts to class imbalances. Extensive experiments on two public datasets, OntoNotes 4.0 (Chinese) and MSRA, demonstrate the effectiveness of LGDA, achieving significant performance improvements over baseline models. Notably, the data augmentation module proves particularly effective in few-shot settings.

Francisco Javier Luque-Hernández, Sergio Aquino-Britez, Josefa Díaz-Álvarez et al.

Evolutionary algorithms are extensively used to solve optimisation problems. However, it is important to consider and reduce their energy consumption, bearing in mind that programming languages also significantly affect energy efficiency. This research work compares the execution of four frameworks—ParadisEO (C++), ECJ (Java), DEAPand Inspyred (Python)—running on two different architectures: a laptop and a server. The study follows a design that combines three population sizes (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>2</mn><mn>6</mn></msup></semantics></math></inline-formula>, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>2</mn><mn>10</mn></msup></semantics></math></inline-formula>, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>2</mn><mn>14</mn></msup></semantics></math></inline-formula> individuals) and three crossover probabilities (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.01</mn></mrow></semantics></math></inline-formula>; <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.2</mn></mrow></semantics></math></inline-formula>; <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.8</mn></mrow></semantics></math></inline-formula>) applied to four benchmarks (OneMax, Sphere, Rosenbrock and Schwefel). This work makes a relevant methodological contribution by providing a consistent implementation of the metric <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>η</mi><mo>=</mo><mi>f</mi><mi>i</mi><mi>t</mi><mi>n</mi><mi>e</mi><mi>s</mi><mi>s</mi><mo>/</mo><mi>k</mi><mi>W</mi><mi>h</mi></mrow></semantics></math></inline-formula>. This metric has been systematically applied in four different frameworks, thereby setting up a standardized and replicable protocol for the evaluation of the energy efficiency of evolutionary algorithms. The CodeCarbon software was used to estimate energy consumption, which was measured using RAPL counters. This unified metric also indicates the algorithmic productivity. The experimental results show that the server speeds up the number of generations by a factor of approximately <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2.5</mn></mrow></semantics></math></inline-formula>, but the energy consumption increases four- to sevenfold. Therefore, on average, the energy efficiency of the laptop is five times higher. The results confirm the following conclusions: the computer power does not guarantee sustainability, and population size is a key factor in balancing quality and energy.

Noam Zilberstein, Daniele Gorla, Alexandra Silva

We develop a denotational model for probabilistic and concurrent imperative programs, a class of programs with standard control flow via conditionals and while-loops, as well as probabilistic actions and parallel composition. Whereas semantics for concurrent or randomized programs in isolation is well studied, their combination has not been thoroughly explored and presents unique challenges. The crux of the problem is that interactions between control flow, probabilistic actions, and concurrent execution cannot be captured by straightforward generalizations of prior work on pomsets and convex languages, prominent models for those effects, individually. Our model has good domain theoretic properties, important for semantics of unbounded loops. We also prove two adequacy theorems, showing that the model subsumes typical powerdomain semantics for concurrency and convex powerdomain semantics for probabilistic nondeterminism.

Pawel Pawlowski

\textbf{T-BAT} logic is a formal system designed to express the notion of informal provability. This type of provability is closely related to mathematical practice and is quite often contrasted with formal provability, understood as a formal derivation in an appropriate formal system. \textbf{T-BAT} is a non-deterministic four-valued logic. The logical values in \textbf{T-BAT} semantics convey not only the information whether a given formula is true but also about its provability status. The primary aim of our paper is to study the proposed four-valued non-deterministic semantics. We look into the intricacies of the interactions between various weakenings and strengthenings of the semantics with axioms that they induce. We prove the completeness of all the logics that are definable in this semantics by transforming truth values into specific expressions formulated within the object language of the semantics. Additionally, we utilize Kripke semantics to examine these axioms from a modal perspective by providing a frame condition that they induce. The secondary aim of this paper is to provide an intuitive axiomatization of \textbf{T-BAT} logic.

Vasile Pop, Alexandru Negrescu

It is well known that in <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="double-struck">C</mi><mo>[</mo><mi>X</mi><mo>]</mo></mrow></semantics></math></inline-formula>, the product of two polynomials is equal to the product of their greatest common divisor and their least common multiple. In a recent paper, we proved a similar relation between the ranks of matrix polynomials. More precisely, the sum of the ranks of two matrix polynomials is equal to the sum of the rank of the greatest common divisor of the polynomials applied to the respective matrix and the rank of the least common multiple of the polynomials applied to the respective matrix. In this paper, we present three new proofs for this result. In addition to these, we present two more applications.

Mircea Sofonea, Domingo A. Tarzia

Here, we consider a stationary inclusion in a real Hilbert space <i>X</i>, governed by a set of constraints <i>K</i>, a nonlinear operator <i>A</i>, and an element <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>∈</mo><mi>X</mi></mrow></semantics></math></inline-formula>. Under appropriate assumptions on the data, the inclusion has a unique solution, denoted by <i>u</i>. We state and prove a covergence criterion, i.e., we provide necessary and sufficient conditions on a sequence <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>{</mo><msub><mi>u</mi><mi>n</mi></msub><mo>}</mo><mo>⊂</mo><mi>X</mi></mrow></semantics></math></inline-formula>, which guarantee its convergence to the solution <i>u</i>. We then present several applications that provide the continuous dependence of the solution with respect to the data <i>K</i>, <i>A</i> and <i>f</i> on the one hand, and the convergence of an associate penalty problem on the other hand. We use these abstract results in the study of a frictional contact problem with elastic materials that, in a weak formulation, leads to a stationary inclusion for the deformation field. Finally, we apply the abstract penalty method in the analysis of two nonlinear elastic constitutive laws.

Rengcong Liu, Jiang Guo, Yibo Li

Segmented plane mirrors constitute a crucial component in the self-aligned detection process for large-aperture space optical imaging systems. Surface shape errors inherent in segmented plane mirrors primarily manifest as tilt errors and piston errors between sub-mirrors. While the detection and adjustment techniques for tilt errors are well-established, addressing piston errors poses a more formidable challenge. This study introduces a novel approach to achieve long-range, high-precision, and efficient co-phase detection of segmented plane mirrors by proposing a segmented plane mirror shape detection method based on grazing incidence interferometry. This method serves to broaden the detection range of piston errors, mitigate the issue of the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>2</mn><mi>π</mi></mrow></semantics></math></inline-formula> ambiguity resulting from piston errors in co-phase detection, and extend the detection capabilities of the interferometer. By manipulating the incident angle of the interferometer, both rough and precise adjustments of the segmented plane mirrors can be effectively executed.

Zhengyu Zhang, Ruisi He, Mi Yang et al.

Recently, deep learning enabled semantic communications have been developed to understand transmission content from semantic level, which realize effective and accurate information transfer. Aiming to the vision of sixth generation (6G) networks, wireless devices are expected to have native perception and intelligent capabilities, which associate wireless channel with surrounding environments from physical propagation dimension to semantic information dimension. Inspired by these, we aim to provide a new paradigm on wireless channel from semantic level. A channel semantic model and its characterization framework are proposed in this paper. Specifically, a channel semantic model composes of status semantics, behavior semantics and event semantics. Based on actual channel measurement at 28 GHz, as well as multi-mode data, example results of channel semantic characterization are provided and analyzed, which exhibits reasonable and interpretable semantic information.